Brief Announcement: Byzantine Geoconsensus

We define and investigate the consensus problem for a set of N processes embedded on the d-dimensional plane, \(d\ge 2\), which we call the geoconsensus problem. The processes have unique coordinates and can communicate with each other through oral messages. In contrast to the literature where processes are individually considered Byzantine, it is considered that all processes covered by a finite-size convex fault area F are Byzantine and there may be one or more processes in a fault area. Similarly as in the literature where correct processes do not know which processes are Byzantine, it is assumed that the fault area location is not known to the correct processes.

[1]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[2]  Songtao Guo,et al.  G-PBFT: A Location-based and Scalable Consensus Protocol for IoT-Blockchain Applications , 2020, 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS).

[3]  John M. Rushby,et al.  Bus Architectures for Safety-Critical Embedded Systems , 2001, EMSOFT.

[4]  Miguel Castro,et al.  Farsite: federated, available, and reliable storage for an incompletely trusted environment , 2002, OPSR.

[5]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[6]  Mariana Raykova,et al.  RapidChain: Scaling Blockchain via Full Sharding , 2018, CCS.

[7]  Gaetano Borriello,et al.  Location Systems for Ubiquitous Computing , 2001, Computer.

[8]  Chiu-Yuen Koo,et al.  Broadcast in radio networks tolerating byzantine adversarial behavior , 2004, PODC '04.

[9]  Miguel Correia,et al.  Byzantine Fault-Tolerant Consensus in Wireless Ad Hoc Networks , 2013, IEEE Transactions on Mobile Computing.

[10]  Michael K. Reiter,et al.  Fault-scalable Byzantine fault-tolerant services , 2005, SOSP '05.

[11]  Deborah Estrin,et al.  Self-configuring localization systems: Design and Experimental Evaluation , 2004, TECS.

[12]  Marko Vukolic,et al.  A Byzantine Fault-Tolerant Ordering Service for the Hyperledger Fabric Blockchain Platform , 2018, DSN.

[13]  Elaine Shi,et al.  The Honey Badger of BFT Protocols , 2016, CCS.

[14]  Andrzej Pelc,et al.  Broadcasting with locally bounded Byzantine faults , 2005, Inf. Process. Lett..

[15]  Lewis Tseng,et al.  Iterative approximate byzantine consensus in arbitrary directed graphs , 2012, PODC '12.

[16]  Miguel Castro,et al.  Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.

[17]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[18]  Michael K. Reiter,et al.  Fault-scalable Byzantine fault-tolerant services , 2005, SOSP '05.

[19]  Ronald Cramer,et al.  A Secure and Optimally Efficient Multi-Authority Election Scheme ( 1 ) , 2000 .

[20]  Miguel Castro,et al.  BASE: Using abstraction to improve fault tolerance , 2003, TOCS.