A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Filters
Reliable Broadcast with Respect to Topology Knowledge
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
To the best of our knowledge this is the first optimal algorithm for Reliable Broadcast in generic topology ad hoc networks against general adversaries. ...
We examine the problem under the locally bounded adversary model of Koo (2004) and the general adversary model of Hirt and Maurer (1997) and explore the tradeoff between the level of topology knowledge ...
This line of work has yielded results on Broadcast against a general adversary in complete networks [4] but, to the best of our knowledge, the case of Broadcast against general adversaries in incomplete ...
doi:10.1007/978-3-662-45174-8_8
fatcat:mu43bnhnxnf23lhqfskbf6qcgu
Reliable broadcast with respect to topology knowledge
2016
Distributed computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
To the best of our knowledge this is the first optimal algorithm for Reliable Broadcast in generic topology ad hoc networks against general adversaries. ...
We examine the problem under the locally bounded adversary model of Koo (2004) and the general adversary model of Hirt and Maurer (1997) and explore the tradeoff between the level of topology knowledge ...
This line of work has yielded results on Broadcast against a general adversary in complete networks [4] but, to the best of our knowledge, the case of Broadcast against general adversaries in incomplete ...
doi:10.1007/s00446-016-0279-6
fatcat:zcgrj45w7bfyboovk75h23ensm
Validated Asynchronous Byzantine Agreement with Optimal Resilience and Asymptotically Optimal Time and Word Communication
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The best previous result of Cachin et al. from 2001 solves Validated Byzantine Agreement with optimal resilience and O(1) expected time but with O(n^3) expected word communication. ...
Our protocol can withstand the optimal number f<n/3 of Byzantine failures and reaches agreement in the asymptotically optimal expected O(1) running time. ...
VABA with Optimal Resilience and Asymptotically Optimal time and Communication In this section we give a protocol for asynchronous Byzantine agreement, secure against an adaptive adversary that controls ...
arXiv:1811.01332v1
fatcat:6aer543eeng25ofkscy2zaitoi
The Internet of Things: Secure Distributed Inference
2018
IEEE Signal Processing Magazine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2018 pre-print arXiv:1806.09199v1 fatcat:qgja67osmvgyjas4mb2wzalope
Adversaries may hijack devices and compromise their data. As a result, reactive countermeasures, such as intrusion detection and resilient analytics, become vital components of security. ...
The integrity and trustworthiness of data and data analytics are increasingly important concerns in IoT applications. ...
This method may not identify which sensors have been attacked but nevertheless provides resilience against adversarial devices and ensures that the remaining sensors successfully estimate global pollutant ...
doi:10.1109/msp.2018.2842097
fatcat:ws7ss5vc6nbj3fi2lbk4lgyjdi
Efficient Secure Multi-party Computation
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The proposed techniques are generic and apply to other protocols for robust distributed computations. ...
In this protocol, the number of invocations of the broadcast primitive is independent of the size of the circuit to be computed. ...
Protocols with optimal resilience (i.e., t < n/3) were proposed in [FY92] and in [GRR98] . ...
doi:10.1007/3-540-44448-3_12
fatcat:6cnw5u2bd5fhrg4v6wyicyy3u4
Event-Triggered Resilient Average Consensus with Adversary Detection in the Presence of Byzantine Agents
2021
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We analyze the conditions for such a fully distributed algorithm to succeed in the f-local adversarial model. ...
INDEX TERMS Multi-agent networks, resilient consensus, adversary detection, event-triggered, Byzantine agents. ...
Recent remarkable advances made in resilient consensus include a novel definition of network robustness, termed r-robustness, which facilitates purely local interaction rules against adversarial nodes ...
doi:10.1109/access.2021.3108639
fatcat:rbupfwpqvng67ojieom6aesbve
Optimal Clock Synchronization with Signatures
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
So far, it is only known that clock pulses of skew d can be generated with (trivially optimal) resilience of ⌈ n/2⌉-1 (PODC '19), improving over the tight bound of ⌈ n/3⌉-1 holding without signatures for ...
Cryptographic signatures can be used to increase the resilience of distributed systems against adversarial attacks, by increasing the number of faulty parties that can be tolerated. ...
Adversary and Executions. The adversary is in full control of message delays and hardware clocks within the bounds specified by the model. ...
arXiv:2203.02553v1
fatcat:allmmb5twvadrnb4kuzzlno7ju
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We consider evaluating an n-party randomized function and show that if f can be computed by a circuit of size c, then O(cn 2 κ) is an upper bound for active security with optimal resilience t < n/2 and ...
We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. ...
Acknowledgments We would like to thank Ivan Damgård, Serge Fehr and Matthias Fitzi for many fruitful discussions, and the anonymous referees for their helpful comments. ...
doi:10.1007/11593447_5
fatcat:gxihtxac7zbtpfzxied5eayc7y
Resilient asymptotic consensus in asynchronous robust networks
2012
2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The asynchronous consensus algorithm studied here uses local strategies to ensure resilience against the adversary nodes. The class of topologies studied are those that are robust. ...
In this paper, we study the problem of reaching consensus asymptotically in the presence of adversary nodes whenever the network is asynchronous under a local broadcast model of communication. ...
On the other hand, a local bound on the number of faulty nodes has been considered in fault-tolerant broadcasting [22] - [24] and consensus [24] , [25] , where it is assumed that at most F of any ...
doi:10.1109/allerton.2012.6483432
dblp:conf/allerton/LeBlancK12
fatcat:6byfcq3lofcelo6ifwe52pzqla
The do-all problem in broadcast networks
2001
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing - PODC '01
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It is proved to be optimal if the number of faults is the only restriction on the adversary. ...
Finally we consider the question if randomization helps for the channel without collision detection against weaker adversaries. ...
Now it could happen that if we wanted to optimize our solutions against weaker adversaries then part O(p. min{f, t}) in the performance bound could be decreased. ...
doi:10.1145/383962.384000
dblp:conf/podc/ChlebusKL01
fatcat:m74s2zy4xzdlpmfsqbfla33yja
Broadcast CONGEST Algorithms against Adversarial Edges
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Since the influential work of [Pease, Shostak and Lamport, JACM'80], broadcast algorithms against plentiful adversarial models have been studied in both theory and practice for over more than four decades ...
For expander graphs with minimum degree of Ω(t^2log n), there is an improved broadcast algorithm with O(t log ^2 n) rounds against t adversarial edges. ...
We are very grateful to David Peleg and Eylon Yogev for many useful discussions. ...
arXiv:2004.06436v4
fatcat:bvferw2nlranjfqwekcupl3p2a
A Survey on Fault-tolerance in Distributed Optimization and Machine Learning
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
With the rapid expansion of the scale of distributed systems, resilient distributed algorithms for optimization are needed, in order to mitigate system failures, communication issues, or even malicious ...
The robustness of distributed optimization is an emerging field of study, motivated by various applications of distributed optimization including distributed machine learning, distributed sensing, and ...
Based on resilient consensus with trusted agents [2] , research shows that trusted agents in the system can be crucial against adversarial agents [4, 34, 126] . ...
arXiv:2106.08545v2
fatcat:g6fys4icrbbr5k3bd3ycylaptu
Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP
2020
International Symposium on Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
King and Saia were the first to break the quadratic word complexity bound for Byzantine Agreement in synchronous systems against an adaptive adversary, and Algorand broke this bound with near-optimal resilience ...
Our algorithms work against a delayed-adaptive adversary, which cannot perform after-the-fact removals but has full control of Byzantine processes and full information about communication in earlier rounds ...
[13] were the first to use a shared coin to solve BA with O(n 2 ) communication and optimal resilience. Mostefaoui et al. ...
doi:10.4230/lipics.disc.2020.25
dblp:conf/wdag/CohenKS20
fatcat:vsonx35wcbfuhfxrizsbbpxviu
Computational Verifiable Secret Sharing Revisited
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We present the first two-round VSS scheme for n ≥ 2t+1 and lower-bound the result tightly by proving the impossibility of oneround computational VSS for t ≥ 2 or n ≤ 3t. ...
Interestingly, for the optimal resiliency conditions, the least possible round complexity in the known computational VSS schemes is identical to that in the (statistical or perfect) unconditional setting ...
We thank Jonathan Katz and our anonymous reviewers for their comments and suggestions on an earlier draft. ...
doi:10.1007/978-3-642-25385-0_32
fatcat:oiqswlvckjaungjgjgov4sxx6y
Trading correctness for privacy in unconditional multi-party computation
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In the active case, every function can be computed securely if and only if ta < n/3; when a broadcast channel is available, then this bound is ta < n/2. These bounds are tight. ...
We further show that the bound t < n/2 for passive corruption holds even if the adversary is additionally allowed to make the passively corrupted players fail. ...
Acknowledgments We would like to thank Ran Canetti for sending us early versions of [Can97, Can98] and David Chaum, Ronald Cramer, Ivan Damgård, Rosario Gennaro, Tal Rabin, Markus Stadler, and Michael ...
doi:10.1007/bfb0055724
fatcat:x7kmzt7xdfdijeymfgn65bfbca
« Previous
Showing results 1 — 15 out of 2,602 results