Byzantine set-union consensus using efficient set reconciliation
نویسندگان
چکیده
منابع مشابه
Set reconciliation using rational polynomials
In various distributed systems, it may happen that parties need to find a union of their data sets. This may happen in database synchronisation, shared file systems and during the use of gossip protocols. Generic approaches have been using interactive protocols where they also share common records. This approach leads to communication complexity being dependant of the size of sets and is clearl...
متن کاملSet-Consensus using Set-Valued Observers
This paper addresses the problem of reaching consensus when the position measurements are corrupted by noise and taken at different time instants. Two different scenarios are considered, namely: when the sensor function is performed on a group of nodes and sent to those nodes at the same time; and a second case where the transmission is unicast but neighboring nodes receive the message due to t...
متن کاملEfficient Synchronous Byzantine Consensus
We present new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The celebrated PBFT state machine replication protocol tolerates f Byzantine faults in an asynchronous setting using 3f +1 replicas, and has since been studied or deployed by numerous works. In this work, we improve the Byzantine fault tolerance threshold to n =...
متن کاملSet Consensus Using Arbitrary Objects
In the (N; k)-consensus task, each process in a group starts with a private input value, communicates with the others by applying operations to shared objects, and then halts after choosing a private output value. Each process is required to choose some process's input value, and the set of values chosen should have size at most k. This problem, rst proposed by Chaudhuri in 1990, has been exten...
متن کاملUnion-Intersecting Set Systems
Three intersection theorems are proved. First, we determine the size of the largest set system, where the system of the pairwise unions is l-intersecting. Then we investigate set systems where the union of any s sets intersect the union of any t sets. The maximal size of such a set system is determined exactly if s + t ≤ 4, and asymptotically if s + t ≥ 5. Finally, we exactly determine the maxi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Information Security
سال: 2017
ISSN: 2510-523X
DOI: 10.1186/s13635-017-0066-3