Distributed key generation for the internet

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2009, Pages 119-128

  Kate, Aniket ^a   Goldberg, Ian ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BYZANTINE AGREEMENT; DISTRIBUTED KEY GENERATION; PRACTICAL SYSTEMS; PROACTIVE SECURITY; RANDOMIZED PROTOCOLS; VERIFIABLE SECRET SHARING SCHEME;

COMPUTER SCIENCE; DISTRIBUTED COMPUTER SYSTEMS; INTERNET; MODEL STRUCTURES; PUBLIC KEY CRYPTOGRAPHY; TECHNICAL PRESENTATIONS;

INTERNET PROTOCOLS;

EID: 70350216066     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2009.21     Document Type: Conference Paper

References (29)

1. T. P. Pedersen, "Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing," in Advances in Cryptology - CRYPTO'91, 1991, pp. 129-140.
2. A. Shamir, "How to Share a Secret," Commun. ACM, vol. 22, no. 11, pp. 612-613, 1979.
3. G. R. Blakley, "Safeguarding Cryptographic Keys," in the National Computer Conference, 1979, pp. 313-317.
4. M. Naor, B. Pinkas, and O. Reingold, "Distributed Pseudo-random Functions and KDCs," in Advances in Cryptology - EUROCRYPT'99, 1999, pp. 327-346.
5. Y. G. Desmedt, "Threshold Cryptography," European Transactions on Telecommunications, vol. 5, no. 4, 1994.
6. D. Boneh and M. K. Franklin, "Identity-Based Encryption from the Weil Pairing," in Advances in Cryptology - CRYPTO'01, 2001, pp. 213-229.
7. C. Cachin, K. Kursawe, and V. Shoup, "Random Oracles in Constantipole: Practical Asynchronous Byzantine Agreement Using Cryptography," in PODC'00, 2000, pp. 123-132.
8. J. B. Nielsen, "A Threshold Pseudorandom Function Construction and Its Applications," in Advances in Cryptology - CRYPTO'02, 2002, pp. 401-416.
9. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, "Secure Distributed Key Generation for Discrete-Log Based Cryptosystems," Journal of Cryptology, vol. 20, no. 1, pp. 51-83, 2007.
10. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, "Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults," in FOCS'85, 1985, pp. 383-395.
11. P. Feldman, "A Practical Scheme for Non-interactive Verifiable Secret Sharing," in FOCS'87, 1987, pp. 427-437.
12. R. Ostrovsky and M. Yung, "How to Withstand Mobile Virus Attacks (Ext. Abstract)," in PODC'91, 1991, pp. 51-59.
13. A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung, "Proactive Secret Sharing Or: How to Cope With Perpetual Leakage," in Advances in Cryptology - CRYPTO'95, 1995, pp. 339-352.
14. R. Canetti and T. Rabin, "Fast asynchronous byzantine agreement with optimal resilience," in STOC'93, 1993, pp. 42-51.
15. I. Abraham, D. Dolev, and J. Y. Halpern, "An Almost-surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience," in PODC'08, 2008, pp. 405-414.
16. A. Patra, A. Choudhary, and C. P. Rangan, "Efficient Asynchronous Verifiable Secret Sharing and Byzantine Agreement with Optimal Resilience," Cryptology ePrint: 2008/424, 2008.
17. C. Cachin, K. Kursawe, A.Lysyanskaya, and R. Strobl, "Asynchronous Verifiable Secret Sharing and Proactive Cryptosystems," in CCS'02, 2002, pp. 88-97.
18. L. Zhou, F. B. Schneider, and R. van Renesse, "APSS: Proactive Secret Sharing in Asynchronous Systems," ACM Trans. Inf. Syst. Secur., vol. 8, no. 3, pp. 259-286, 2005.
19. D. A. Schultz, B. Liskov, and M. Liskov, "Mobile Proactive Secret Sharing," in PODC'08, 2008, p. 458, (Extended Draft).
20. G. Bracha, "An Asynchronous [(n-1)/3]-Resilient Consensus Protocol," in PODC'84, 1984, pp. 154-162.
21. C. Dwork, N. A. Lynch, and L. J. Stockmeyer, "Consensus in the Presence of Partial Synchrony," Journal of ACM, vol. 35, no. 2, pp. 288-323, 1988.
22. M. J. Fischer, N. A. Lynch, and M. Paterson, "Impossibility of Distributed Consensus with One Faulty Process," Journal of ACM, vol. 32, no. 2, pp. 374-382, 1985.
23. M. Castro and B. Liskov, "Practical Byzantine Fault Tolerance and Proactive Recovery," ACM Trans. Comput. Syst., vol. 20, no. 4, pp. 398-461, 2002.
24. M. Backes and C. Cachin, "Reliable Broadcast in a Computational Hybrid Model with Byzantine Faults, Crashes, and Recoveries," in DSN'03, 2003, pp. 37-46.
25. A. Kate and I. Goldberg, "Distributed Key Generation for the Internet," University of Waterloo, Tech. Rep., http://www.cacr.math. uwaterloo.ca/techreports/2008/cacr2008-25.pdf.
26. M. Ben-Or, R. Canetti, and O. Goldreich, "Asynchronous Secure Computation," in STOC'93, 1993, pp. 52-61.
27. C. Cachin, K. Kursawe, F. Petzold, and V. Shoup, "Secure and Efficient Asynchronous Broadcast Protocols," in Advances in Cryptology - CRYPTO'01, 2001, pp. 524-541.
28. M. Backes, C. Cachin, and R. Strobl, "Proactive Secure Message Transmission in Asynchronous Networks," in PODC'03, 2003, pp. 223-232.
29. V. Hadzilacos and S. Toueg, "Fault-tolerant Broadcasts and Related Problems," in Distributed systems (2nd Ed.). ACM Press, 1993, pp. 97-145.