Ashish Choudhury
ABSTRACT
In this work, we present an almost-surely terminating asynchronous Byzantine agreement (ABA) protocol for n parties. Our protocol requires expected time and is secure against a computationally-unbounded malicious (Byzantine) adversary, characterized by a non-threshold adversary structure , which enumerates all possible subsets of potentially corrupt parties. Our protocol has optimal resilience where satisfies the condition; i.e. union of no three subsets from covers all the n parties. To the best of our knowledge, this is the first almost-surely terminating ABA protocol with condition. Previously, almost-surely terminating ABA protocol is known with non-optimal resilience where satisfies the condition; i.e. union of no four subsets from covers all the n parties. To design our protocol, we present a shunning asynchronous verifiable secret-sharing (SAVSS) scheme with condition, which is of independent interest.
- I. Abraham, D. Dolev, and J. Y. Halpern. 2008. An Almost-surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience. In PODC. ACM, 405–414.Google Scholar
- I. Abraham, D. Dolev, and G. Stern. 2020. Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience. In PODC. ACM, 139–148.Google Scholar
- A. Appan, A. Chandramouli, and A. Choudhury. 2022. Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees. In PODC. ACM, 92–102.Google Scholar
- Hagit Attiya and Jennifer Welch. 2004. Distributed Computing: Fundamentals, Simulations, and Advanced Topics. Vol. 19. John Wiley & Sons.Google ScholarCross Ref
- L. Bangalore, A. Choudhury, and A. Patra. 2020. The Power of Shunning: Efficient Asynchronous Byzantine Agreement Revisited. J. ACM 67, 3 (2020), 14:1–14:59.Google ScholarDigital Library
- Z. Beerliová-Trubíniováand M. Hirt. 2007. Simple and Efficient Perfectly-Secure Asynchronous MPC. In ASIACRYPT(LNCS, Vol. 4833). Springer Verlag, 376–392.Google Scholar
- M. Ben-Or. 1983. Another Advantage of Free Choice (Extended Abstract): Completely Asynchronous Agreement Protocols. In PODC. ACM, 27–30.Google Scholar
- M. Ben-Or, R. Canetti, and O. Goldreich. 1993. Asynchronous Secure Computation. In STOC. ACM, 52–61.Google Scholar
- M. Ben-Or, S. Goldwasser, and A. Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In STOC. ACM, 1–10.Google Scholar
- M. Ben-Or, B. Kelmer, and T. Rabin. 1994. Asynchronous Secure Computations with Optimal Resilience (Extended Abstract). In PODC. ACM, 183–192.Google Scholar
- E. Blum, J. Katz, and J. Loss. 2019. Synchronous Consensus with Optimal Asynchronous Fallback Guarantees. In TCC(LNCS, Vol. 11891). Springer, 131–150.Google Scholar
- G. Bracha. 1984. An Asynchronous [(n-1)/3]-Resilient Consensus Protocol. In PODC. ACM, 154–162.Google Scholar
- R. Canetti. 1995. Studies in Secure Multiparty Computation and Applications. Ph. D. Dissertation. Weizmann Institute, Israel.Google Scholar
- R. Canetti and T. Rabin. 1993. Fast Asynchronous Byzantine Agreement with Optimal Resilience. In STOC. 42–51.Google Scholar
- B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. 1985. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In FOCS. IEEE, 383–395.Google Scholar
- A. Choudhury. 2020. Improving the Efficiency of Optimally-Resilient Statistically-Secure Asynchronous Multi-party Computation. In INDOCRYPT(LNCS, Vol. 12578). Springer, 810–831.Google Scholar
- A. Choudhury. 2022. Almost-Surely Terminating Asynchronous Byzantine Agreement Against General Adversaries with Optimal Resilience. Cryptology ePrint Archive, Paper 2022/917.Google Scholar
- A. Choudhury and N. Pappu. 2020. Perfectly-Secure Asynchronous MPC for General Adversaries. In INDOCRYPT(LNCS, Vol. 12578). Springer, 786–809.Google Scholar
- A. Choudhury and A. Patra. 2017. An Efficient Framework for Unconditionally Secure Multiparty Computation. IEEE Trans. Information Theory 63, 1 (2017), 428–468.Google ScholarDigital Library
- R. Cramer, I. Damgård, and U. M. Maurer. 2000. General Secure Multi-party Computation from any Linear Secret-Sharing Scheme. In EUROCRYPT(LNCS, Vol. 1807). Springer Verlag, 316–334.Google ScholarCross Ref
- Paul Feldman and Silvio Micali. 1988. Optimal Algorithms for Byzantine Agreement. In STOC. ACM, 148–161.Google Scholar
- M. J. Fischer, N. A. Lynch, and M. Paterson. 1985. Impossibility of Distributed Consensus with One Faulty Process. J. ACM 32, 2 (1985), 374–382.Google ScholarDigital Library
- Matthias Fitzi. 2002. Generalized Communication and Security Models in Byzantine Agreement. Ph. D. Dissertation.Google Scholar
- M. Fitzi and U. M. Maurer. 1998. Efficient Byzantine Agreement Secure Against General Adversaries. In DISC(LNCS, Vol. 1499). Springer, 134–148.Google Scholar
- J. A. Garay and A. Kiayias. 2020. SoK: A Consensus Taxonomy in the Blockchain Era. In CT-RSA(LNCS, Vol. 12006). Springer, 284–318.Google Scholar
- Martin Hirt. 2001. Multi-Party Computation: Efficient Protocols, General Adversaries, and Voting. Ph. D. Dissertation. ETH Zurich.Google Scholar
- Martin Hirt and Ueli Maurer. 1997. Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation. In PODC. ACM, 25–34.Google Scholar
- M. Hirt and U. Maurer. 2000. Player Simulation and General Adversary Structures in Perfect Multiparty Computation. Journal of Cryptology 13, 1 (2000), 31–60.Google ScholarDigital Library
- K. Kursawe. 2001. Distributed Trust. Ph. D. Dissertation. Saarland University.Google Scholar
- K. Kursawe and F. C. Freiling. 2005. Byzantine Fault Tolerance on General Hybrid Adversary Structures. Technical Report, RWTH Aachen.Google Scholar
- Nancy A Lynch. 1996. Distributed algorithms. Morgan Kaufmann.Google Scholar
- R. Shostak M. Pease and L. Lamport. 1980. Reaching Agreement in the Presence of Faults. Journal of the ACM (JACM) 27, 2 (1980), 228–234.Google ScholarDigital Library
- U. M. Maurer. 2002. Secure Multi-party Computation Made Simple. In SCN(LNCS, Vol. 2576). Springer, 14–28.Google Scholar
- A. Patra, A. Choudhury, and C. Pandu Rangan. 2014. Asynchronous Byzantine Agreement with Optimal Resilience. Distributed Computing 27, 2 (2014), 111–146.Google ScholarDigital Library
- A. Patra, A. Choudhury, and C. Pandu Rangan. 2015. Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation. J. Cryptology 28, 1 (2015), 49–109.Google ScholarDigital Library
- M. O. Rabin. 1983. Randomized Byzantine Generals. In FOCS. IEEE, 403–409.Google Scholar
- T. Rabin and M. Ben-Or. 1989. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract). In STOC. ACM, 73–85.Google Scholar
- C. Wang. 2015. Asynchronous Byzantine Agreement with Optimal Resilience and Linear Complexity. CoRR abs/1507.06165(2015).Google Scholar
Index Terms
- Almost-Surely Terminating Asynchronous Byzantine Agreement Against General Adversaries with Optimal Resilience ✱
Recommendations
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited
PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed ComputingThe problem of Byzantine Agreement (BA) is of interest to both distributed computing and cryptography community. Following well-known results from the distributed computing literature, BA problem in the asynchronous network setting encounters inevitable ...
Asynchronous Byzantine Agreement with optimal resilience
We present an efficient, optimally-resilient Asynchronous Byzantine Agreement (ABA) protocol involving $$n = 3t+1$$n=3t+1 parties over a completely asynchronous network, tolerating a computationally unbounded Byzantine adversary, capable of corrupting ...
Simple and efficient asynchronous byzantine agreement with optimal resilience
PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computingConsider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power actively controls at most t = ([n/3] − 1) out of n parties in Byzantine ...
Comments