Filters








12,191 Hits in 3.8 sec

Which Broadcast Abstraction Captures k-Set Agreement? [article]

Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal
2017 arXiv   pre-print
Considering wait-free systems, this article addresses and answers the following question: which is the communication abstraction that "captures" k-set agreement?  ...  To this end, it introduces a new broadcast communication abstraction, called k-BO-Broadcast, which restricts the disagreement on the local deliveries of the messages that have been broadcast (1-BO-Broadcast  ...  In this sense, k-BO-Broadcast is the abstraction communication which captures the essence of (repeated) k-set agreement.  ... 
arXiv:1705.04835v1 fatcat:5ml52uelwbcufgktmhvewzzdti

Which Broadcast Abstraction Captures k-Set Agreement? *

Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal
unpublished
Considering wait-free systems, this article addresses and answers the following question: which is the communication abstraction that "captures" k-set agreement?  ...  To this end, it introduces a new broadcast communication abstraction, called k-BO-Broadcast, which restricts the disagreement on the local deliveries of the messages that have been broadcast (1-BO-Broadcast  ...  ; mem1 i [i] is initialized to an empty set. 27:10 Which Broadcast Abstraction Captures k-Set Agreement?  ... 
fatcat:to7h744ngje2tepcjaaf3msxju

Byzantine Agreement with a Rational Adversary [chapter]

Adam Groce, Jonathan Katz, Aishwarya Thiruvengadam, Vassilis Zikas
2012 Lecture Notes in Computer Science  
Here we apply this model for the first time to the problem of Byzantine agreement (BA) and the closely related problem of broadcast, for natural classes of utilities.  ...  Introduction The problem of Byzantine agreement (BA) was introduced by Lamport, Shostak, and Pease [15] as an abstraction of their earlier work on distributed computation among fallible processors [  ...  (This is a tight bound, since it matches the possibility result from the malicious setting, which of course also applies in any rational setting.)  ... 
doi:10.1007/978-3-642-31585-5_50 fatcat:xxd5hrnqjfci3ijgkew7zq7aae

Reconfigurable Lattice Agreement and Applications

Petr Kuznetsov, Thibault Rieutord, Sara Tucci-Piergiovanni, Michael Wagner
2020 International Conference on Principles of Distributed Systems  
We observe that this agreement is naturally captured via a lattice partial order on the system states.  ...  Here A and B are countable sets called the inputs and outputs. Z is a countable set of abstract object states, z 0 ∈ Z being the initial state of the object.  ...  31:16 Reconfigurable Lattice Agreement and Applications Objects with "well-structured" its lattices can be implemented very efficiently.  ... 
doi:10.4230/lipics.opodis.2019.31 dblp:conf/opodis/KuznetsovRP19 fatcat:4sflycd5ircaxfjvhqadgcy4om

A Connectivity Model for Agreement in Dynamic Systems [chapter]

Carlos Gómez-Calzado, Arnaud Casteigts, Alberto Lafuente, Mikel Larrea
2015 Lecture Notes in Computer Science  
The consensus problem is a fundamental paradigm in distributed systems, because it captures the difficulty to solve other agreement problems.  ...  Specifically, it is not well established how to define an appropriate set of assumptions for consensus in dynamic distributed systems.  ...  We then specify a version of the Terminating Reliable Broadcast problem (TRB) for ∆-components, which we relate to the ability of solving agreement at component level.  ... 
doi:10.1007/978-3-662-48096-0_26 fatcat:jmciveziyjdoplc7h5fgr6aemu

Reconfigurable Lattice Agreement and Applications [article]

Petr Kuznetsov, Thibault Rieutord, Sara Tucci-Piergiovanni
2020 arXiv   pre-print
We observe that this agreement is naturally captured via a lattice partial order on the system states.  ...  We propose an asynchronous implementation of reconfigurable lattice agreement that implies elegant reconfigurable versions of a large class of lattice abstract data types, such as max-registers and conflict  ...  The Safe Agreement Abstraction Another popular shared-memory abstraction is safe agreement [10] . It is defined through a single operation proposepvq, v P V (we assume that V is totally ordered).  ... 
arXiv:1910.09264v2 fatcat:2bd35clhl5dj7o4s2eroud2cdi

Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems [chapter]

Michel Raynal, Julien Stainer
2013 Lecture Notes in Computer Science  
To this end, it first defines the (s, k)-SSA problem which captures jointly both problems: each process proposes a value, executes s simultaneous instances of the k-set agreement problem, and has to decide  ...  underlying k-set agreement instance.  ...  The Abstraction alpha k Historical perspective The abstraction alpha k originates from a similar abstraction (called alpha) introduced in [13] (see also [21] ) to capture the safety property of the  ... 
doi:10.1007/978-3-319-03578-9_25 fatcat:rwcs3i6zifax3hbrk3bhxrin7i

Validated Asynchronous Byzantine Agreement with Optimal Resilience and Asymptotically Optimal Time and Word Communication [article]

Ittai Abraham, Dahlia Malkhi, Alexander Spiegelman
2018 arXiv   pre-print
Validated (multi-valued) Asynchronous Byzantine Agreement is a key building block in constructing Atomic Broadcast and fault-tolerant state machine replication in the asynchronous setting.  ...  We provide a new protocol for Validated Asynchronous Byzantine Agreement.  ...  A simplified version of the agreement problem is the binary agreement problem in which the inputs of the parties are restricted to the set {0, 1}.  ... 
arXiv:1811.01332v1 fatcat:6aer543eeng25ofkscy2zaitoi

Secure agreement protocols

Michael K. Reiter
1994 Proceedings of the 2nd ACM Conference on Computer and communications security - CCS '94  
Reliable and atomic group multicast have been proposed as fundamental communication paradigms to support secure distributed computing in systems in which processes may behave maliciously.  ...  We capture this semantic in four properties: Integrity, Agreement, Validity-l, and Validity-2.  ...  Each p E Vz maintains a set of counters (cT}~~~v~, each initially zero, and a set commitd of messages, which is initially empty.  ... 
doi:10.1145/191177.191194 dblp:conf/ccs/Reiter94 fatcat:xvvw6k6b4vhxhjbgec7uldhpvi

Efficient Asynchronous Byzantine Agreement without Private Setups [article]

Yingzi Gao, Yuan Lu, Zhenliang Lu, Qiang Tang, Jing Xu, Zhenfeng Zhang
2021 arXiv   pre-print
At the core of our design, we give a systematic treatment of reasonably fair common randomness: - We construct a reasonably fair common coin (Canetti and Rabin, STOC' 1993) in the asynchronous setting  ...  constant running time. - Along the way, we improve an important building block, asynchronous verifiable secret sharing by presenting a private-setup free implementation costing only O(λ n^2) bits in the PKI setting  ...  Reliable broadcast (RBC) is a protocol running among a set of n parties in which there is a party called sender whose aim is to broadcast a value to all the other parties.  ... 
arXiv:2106.07831v1 fatcat:bnj2m4ycsvf4naswp27cbkox34

On the hardness of failure-sensitive agreement problems

Rachid Guerraoui
2001 Information Processing Letters  
In [1],[3] and [6], respectively, it was stated that the weakest failure detector for any of non-blocking atomic commit, terminating reliable broadcast and leader election, is the Perfect failure detector  ...  We consider an asynchronous computation model augmented with the failure detector abstraction [1, 2] .  ...  In the terminating reliable broadcast (TRB) problem, a distinguished sender process, noted p i , is supposed to broadcast a message m from a set M of possible messages: we note sender(m) = p i .  ... 
doi:10.1016/s0020-0190(00)00171-x fatcat:vozl4lbegrafhduayk5sf4kehy

Secure Multi-Party Computation without Agreement

Shafi Goldwasser, Yehuda Lindell
2005 Journal of Cryptology  
This is because these protocols strongly rely on the extensive use of a broadcast channel, which is in turn realized using authenticated Byzantine agreement.  ...  This result puts into question any usage of authenticated Byzantine agreement in a setting where many executions take place.  ...  Denote the message received from P k by x j k . Then, P j outputs (broadcast, P i , x j ) if and only if for every k, it holds that x j k = x j (i.e., x j = x j 1 = · · · = x j n ).  ... 
doi:10.1007/s00145-005-0319-z fatcat:i2narlrnsjahplxte6po2wo4by

Intrusion-Tolerant Broadcast and Agreement Abstractions in the Presence of Byzantine Processes

Achour Mostefaoui, Michel Raynal
2016 IEEE Transactions on Parallel and Distributed Systems  
These abstractions are broadcast abstractions (namely, no-duplicity broadcast, reliable broadcast, and validated broadcast), and agreement abstraction (namely, consensus).  ...  While no-duplicity broadcast and reliable broadcast are well-known one-to-all communication abstractions, validated broadcast is a new all-to-all communication abstraction designed to address agreement  ...  of a VB-broadcast instance can be obtained from two instances the RB-broadcast abstraction. 2 Content of the paper: Byzantine-tolerant agreement abstraction The most important agreement abstraction  ... 
doi:10.1109/tpds.2015.2427797 fatcat:jr25i6wzsvaclo7xrb7cwvd7ci

Probabilistic Indistinguishability and the Quality of Validity in Byzantine Agreement [article]

Guy Goren, Yoram Moses, Alexander Spiegelman
2021 arXiv   pre-print
We generalize the notion of indistinguishability, the most useful tool in deterministic lower bounds, to apply to a probabilistic setting.  ...  We use the new notion to prove a lower bound on the probability at which it can be guaranteed that honest parties will not decide on a possibly bogus value.  ...  , and ϕ k is either a local step or a message delivery for every k > 0.  ... 
arXiv:2011.04719v2 fatcat:6s5y2eitojdsrlidfamqcmxvwa

Group secret key agreement over state-dependent wireless broadcast channels

M. Jafari Siavoshani, S. Mishra, S. N. Diggavi, C. Fragouli
2011 2011 IEEE International Symposium on Information Theory Proceedings  
We consider a group of m trusted nodes that aim to create a shared secret key K, using a state-dependent wireless broadcast channel that exists from one of the honest nodes to the rest of the nodes including  ...  For this setup, we develop an information-theoretically secure secret key agreement protocol.  ...  To this end, we use a nested message set, degraded channel wiretap code based on the broadcast approach of [9] to develop a key-agreement protocol for the noisy broadcast problem.  ... 
doi:10.1109/isit.2011.6033895 dblp:conf/isit/SiavoshaniMDF11 fatcat:cddgahiyfrdo3ogunfjxgkhoaq
« Previous Showing results 1 — 15 out of 12,191 results