Reaching consensus for asynchronous distributed key generation
Authors: 
Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, Alin TomescuAuthors Info & Claims
Abstract
We give a protocol for Asynchronous Distributed Key Generation (A-DKG) that is optimally resilient (can withstand faulty parties), has a constant expected number of rounds, has expected communication complexity, and assumes only the existence of a PKI. Prior to our work, the best A-DKG protocols required expected number of rounds, and expected communication. Our A-DKG protocol relies on several building blocks that are of independent interest. We define and design a Proposal Election (PE) protocol that allows parties to retrospectively agree on a valid proposal after enough proposals have been sent from different parties. With constant probability the elected proposal was proposed by a nonfaulty party. In building our PE protocol, we design a Verifiable Gather protocol which allows parties to communicate which proposals they have and have not seen in a verifiable manner. The final building block to our A-DKG is a Validated Asynchronous Byzantine Agreement (VABA) protocol. We use our PE protocol to construct a VABA protocol that does not require leaders or an asynchronous DKG setup. Our VABA protocol can be used more generally when it is not possible to use threshold signatures.
References
[1]
Kokoris Kogias, E., Malkhi, D., Spiegelman, A.: Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. CCS’20, pp. 1751–1767. Association for Computing Machinery, New York, NY, USA (2020).
[2]
Syta, E., Jovanovic, P., Kokoris-Kogias, E., Gailly, N., Gasser, L., Khoffi, I., Fischer, M.J., Ford, B.: Scalable bias-resistant distributed randomness. In: 38th IEEE Symposium on Security and Privacy (2017)
[3]
Abraham, I., Malkhi, D., Spiegelman, A.: Asymptotically optimal validated asynchronous byzantine agreement. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp. 337–346. ACM, New York, NY, USA (2019).
[4]
Kokoris-Kogias, E., Alp, E.C., Gasser, L., Jovanovic, P., Syta, E., Ford, B.: CALYPSO: Private Data Management for Decentralized Ledgers. Cryptology ePrint Archive, Report 2018/209. To appear in VLDB 2021 (2018)
[5]
Kate, A., Huang, Y., Goldberg, I.: Distributed Key Generation in the Wild. Cryptology ePrint Archive, Report 2012/377. https://eprint.iacr.org/2012/377 (2012)
[6]
Feldman, P.N.: Optimal algorithms for byzantine agreement. Ph.D. thesis, Massachusetts Institute of Technology (1988)
[7]
Canetti, R., Rabin, T.: Fast asynchronous byzantine agreement with optimal resilience. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing. STOC ’93, pp. 42–51. Association for Computing Machinery, New York, NY, USA (1993).
[8]
Abraham, I., Amit, Y., Dolev, D.: Optimal resilience asynchronous approximate agreement. In: Proceedings of the 8th International Conference on Principles of Distributed Systems. OPODIS’04, pp. 229–239. Springer, Berlin (2004).
[9]
Gurkan, K., Jovanovic, P., Maller, M., Meiklejohn, S., Stern, G., Tomescu, A.: Aggregatable Distributed Key Generation. Cryptology ePrint Archive, Report 2021/005. https://eprint.iacr.org/2021/005 (2021)
[10]
Cachin C, Kursawe K, Petzold F, and Shoup V Kilian J Secure and efficient asynchronous broadcast protocols Advances in Cryptology—CRYPTO 2001 2001 Berlin Springer 524-541
[11]
Feldman P and Micali S An optimal probabilistic protocol for synchronous byzantine agreement SIAM J. Comput. 1997 26 4 873-933
[12]
Backes M, Datta A, and Kate A Dawson E Asynchronous computational VSS with reduced communication complexity Topics in Cryptology—CT-RSA 2013 2013 Berlin Springer 259-276
[13]
Dolev, D., Reischuk, R.: Bounds on information exchange for Byzantine Agreement. In: Proceedings of the First ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing - PODC ’82, pp. 132–140. ACM Press, New York, NY, USA (1982).
[14]
Bracha, G.: An asynchronous [(n - 1)/3]-resilient consensus protocol. In: Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, pp. 154–162. Association for Computing Machinery, New York, NY, USA (1984).
[15]
Cachin, C., Tessaro, S.: Asynchronous verifiable information dispersal. In: Distributed Computing. 19th International Conference, DISC 2005, Cracow, Poland, September 26–29, 2005, Proceedings, pp. 503–504. Springer, Berlin (2005)
[16]
Bracha G Asynchronous byzantine agreement protocols Inf. Comput. 1987 75 2 130-143
[17]
Cachin C, Kursawe K, and Shoup V Random oracles in constantinople: practical asynchronous Byzantine agreement using cryptography J. Cryptol. 2005 18 3 219-246
[18]
Cachin, C., Kursawe, K., Lysyanskaya, A., Strobl, R.: Asynchronous verifiable secret sharing and proactive cryptosystems. In: Proceedings of the 9th ACM Conference on Computer and Communications Security. CCS ’02, pp. 88–97. Association for Computing Machinery, New York, NY, USA (2002).
[19]
Zhou L, Schneider FB, and Van Renesse R APSS: proactive secret sharing in asynchronous systems ACM Trans. Inf. Syst. Secur. 2005 8 3 259-286
[20]
Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., Abraham, I.: Hotstuff: Bft consensus with linearity and responsiveness. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. PODC ’19, pp. 347–356. Association for Computing Machinery, New York, NY, USA (2019).
[21]
Lu, Y., Lu, Z., Tang, Q., Wang, G.: Dumbo-mvba: Optimal multi-valued validated asynchronous byzantine agreement, revisited. In: Proceedings of the 39th Symposium on Principles of Distributed Computing. PODC ’20, pp. 129–138. Association for Computing Machinery, New York, NY, USA (2020).
[22]
Abraham, I., Stern, G.: Information theoretic hotstuff. In: OPODIS. LIPIcs, vol. 184, pp. 11–11116. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany (2020)
[23]
Fischer MJ, Lynch NA, and Paterson MS Impossibility of distributed consensus with one faulty process J. ACM 1985 32 2 374-382
[24]
Ben-Or, M.: Another advantage of free choice (extended abstract): completely asynchronous agreement protocols. In: Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing. PODC ’83, pp. 27–30. Association for Computing Machinery, New York, NY, USA (1983).
[25]
Patra, A., Choudhary, A., Pandu Rangan, C.: Simple and efficient asynchronous byzantine agreement with optimal resilience. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing. PODC ’09, pp. 92–101. Association for Computing Machinery, New York, NY, USA (2009).
[26]
Abraham, I., Dolev, D., Halpern, J.Y.: An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience. In: Proceedings of the Twenty-Seventh ACM Symposium on Principles of Distributed Computing. PODC ’08, pp. 405–414. Association for Computing Machinery, New York, NY, USA (2008).
[27]
Bangalore, L., Choudhury, A., Patra, A.: Almost-surely terminating asynchronous byzantine agreement revisited. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. PODC ’18, pp. 295–304. Association for Computing Machinery, New York, NY, USA (2018).
[28]
Katz, J., Koo, C.: On expected constant-round protocols for byzantine agreement. Electron. Colloquium Comput. Complex. 13(028) (2006)
[29]
Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing. STOC ’93, pp. 52–61. Association for Computing Machinery, New York, NY, USA (1993).
[30]
Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience (extended abstract). In: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing. PODC ’94, pp. 183–192. Association for Computing Machinery, New York, NY, USA (1994).
[31]
Beerliová-Trubíniová, Z., Hirt, M.: Simple and efficient perfectly-secure asynchronous mpc. In: Proceedings of the Advances in Crypotology 13th International Conference on Theory and Application of Cryptology and Information Security. ASIACRYPT’07, pp. 376–392. Springer, Berlin (2007)
[32]
Hirt M, Nielsen JB, and Przydatek B Aceto L, Halldorsson MM, and Ingolfsdottir A Asynchronous multi-party computation with quadratic communication Automata, Languages and Programming—ICALP 2008. Lecture Notes in Computer Science 2008 Berlin Springer 473-485
[33]
Choudhury, A., Patra, A.: Optimally resilient asynchronous mpc with linear communication complexity. In: Proceedings of the 2015 International Conference on Distributed Computing and Networking. ICDCN ’15. Association for Computing Machinery, New York, NY, USA (2015).
[34]
Gagol, A., Lesniak, D., Straszak, D., Swietek, M.: Aleph: Efficient Atomic Broadcast in Asynchronous Networks with Byzantine Nodes (2019)
[35]
Das, S., Xiang, Z., Ren, L.: Asynchronous data dissemination and its applications. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 2705–2721 (2021)
[36]
Gao, Y., Lu, Y., Lu, Z., Tang, Q., Xu, J., Zhang, Z.: Efficient Asynchronous Byzantine Agreement without Private Setups (2021). arXiv:2106.07831
[37]
Das, S., Yurek, T., Xiang, Z., Miller, A., Kokoris-Kogias, L., Ren, L.: Practical Asynchronous Distributed Key Generation. Cryptology ePrint Archive, Paper 2021/1591. https://eprint.iacr.org/2021/1591 (2021)
Recommendations
Reaching Consensus for Asynchronous Distributed Key Generation
PODC'21: Proceedings of the 2021 ACM Symposium on Principles of Distributed ComputingWe give a protocol for Asynchronous Distributed Key Generation (A-DKG) that is optimally resilient (can withstand f < n over 3 faulty parties), has a constant expected number of rounds, has Õ (n3) expected communication complexity, and assumes only the ...
Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.
CCS '20: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications SecurityIn this paper, we present the first Asynchronous Distributed Key Generation (ADKG) algorithm which is also the first distributed key generation algorithm that can generate cryptographic keys with a dual (f,2f+1)-threshold (where f is the number of ...
Asynchronous MPC with a strict honest majority using non-equivocation
PODC '14: Proceedings of the 2014 ACM symposium on Principles of distributed computingMultiparty computation (MPC) among n parties can tolerate up to t < n/2 active corruptions in a synchronous communication setting; however, in an asynchronous communication setting, the resiliency bound decreases to only t < n/3 active corruptions. We ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
© The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022. Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 08 September 2022
Accepted: 15 August 2022
Received: 15 November 2021
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 25 Nov 2024
Other Metrics
Citations
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in