Asynchronous group key exchange with failures

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 23, Issue , 2004, Pages 357-366

  Cachin, Christian ^a   Strobl, Reto ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

Group Communication; Group Key Exchange; Provable Security; Universal Composability

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY; INTERNET; NETWORK PROTOCOLS; SERVERS; TELECOMMUNICATION TRAFFIC;

GROUP COMMUNICATION; GROUP KEY EXCHANGE; PROVABLE SECURITY; UNIVERSAL COMPOSABILITY;

COMMUNICATION SYSTEMS;

EID: 10444250988     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1011767.1011820     Document Type: Conference Paper

References (28)

1. Y. Amir, Y. Kim, C. Nita-Rotaru, J. Schultz, J. Stanton, and G. Tsudik, "Secure group communication using robust contributory key agreement," in IEEE Transaction on Parallel and Distributed Systems, to appear, 2004.
2. Y. Amir, Y. Kim, C. Nita-Rotaru, J. Schultz, J. Stanton, and G. Tsudik, "Exploring robustness in group key agreement," in Proc. 21st IEEE International Conference on Distributed Computing Systems, pp. 399-409, 2001.
3. G. Ateniese, M. Steiner, and G. Tsudik, "New multiparty authentication services and key agreement protocols," Journal of Selected Areas in Communications IEEE, vol. 18, no. 4, pp. 1-13, 2000.
4. H. Attiya and J. Welch, Distributed Computing: Fundamentals, Simulations, and Advanced Topics. McGraw-Hill, 1998.
5. M. Bellare, D. Pointcheval, and P. Rogaway, "Authenticated key exchange secure against dictionary attacks," in Advances in Cryptology: Eurocrypt '00, 2000.
6. C. Boyd, "On key agreement and conference key agreement," in Proc. 2nd Australasian Conference on Information Security and Privacy (ACISP), 1997.
7. E. Bresson, O. Chevassut, D. Pointcheval, and J. Quisquater, "Provably authenticated group Diffie-Hellman key exchange," in Proc. 8th ACM Conference on Computer and Communication Secuirty (CCS), 2001.
8. M. Burmester and Y. Desmedt, "A secure and efficient conference key distribution system," in Advances in Cryptology: Eurocrypt '94, 1994.
9. C. Cachin, K. Kursawe, F. Petzold, and V. Shoup, "Secure and efficient asynchronous broadcast protocols (extended abstract)," in Advances in Cryptology: Crypto '01, 2001.
10. C. Cachin, K. Kursawe, and V. Shoup, "Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography," in Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC), pp. 123-132, 2000.
11. R. Canetti, U. Feige, O. Goldreich, and M. Naor, "Adaptively secure computation," in Proc. 28th Symposium on Theory of Computing (STOC), pp. 639-648, 1996.
12. R. Canetti, "Universally composable security: A new paradigm for cryptographic protocols," in Proc. 42nd IEEE Symposium on Foundations of Computer Science (FOCS), 2001.
13. R. Canetti and T. Rabin, "Fast asynchronous Byzantine agreement with optimal resilience," in Proc. 25th Annual ACM Symposium on Theory of Computing (STOC), pp. 42-51, 1993.
14. T. D. Chandra and S. Toueg, "Unreliable failure detectors for reliable distributed systems," Journal of the ACM, vol. 46, no. 4, pp. 685-722, 1996.
15. G. Chockler, I. Keidar, and R. Vitenberg, "Group communication specifications: A comprehensive study," ACM Computing Surveys, vol. 4, pp. 427-469, December 2001.
16. O. Goldreich, S. Goldwasser, and S. Micali, "How to construct random functions," Journal of the ACM, vol. 33, pp. 792-807, Oct. 1986.
17. S. Goldwasser and S. Micali, "Probabilistic encryption," Journal of Computer and System Sciences, vol. 28, pp. 270-299, 1984.
18. S. Goldwasser, S. Micali, and C. Rackoff, "The knowledge complexity of interactive proof-systems," SIAM Journal of Computing, vol. 18, pp. 186-208, Feb. 1989.
19. I. Ingemarasson, D. Tang, and C. Wong, "A conference key distribution system," IEEE Transactions on Information Theory, vol. 28, no. 5, pp. 714-720, 1982.
20. M. Just and S. Vaudenay, "Authenticated multi-party key agreement," in Advances in Cryptology: Asiacrypt '96, 1996.
21. J. Katz and M. Yung, "Scalable protocols for authenticated group key exchange," in Advances in Cryptology: Crypto '03, 2003.
22. J. Nielsen, "A threshold pseudorandom function construction and its applicatoins," in Advances in Cryptology: Crypto '02, 2002.
23. B. Pfitzmann and M. Waidner, "A model for asynchronous reactive systems and its application to secure message transmission," in Proc. 22nd IEEE Symposium on Security & Privacy, pp. 184-200, 2001.
24. O. Rodeh, K. P. Birman, and D. Dolev, "A study of group rekeying," Technical Report TR2000-1791, Cornell University Computer Science, March 2000.
25. A. Shamir, "How to share a secret," Communications of the ACM, vol. 22, pp. 612-613, Nov. 1979.
26. M. Steiner, G. Tsudik, and M. Waidner, "Key agrement in dynamic peer groups," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 8, pp. 769-780, 2000.
27. M. Steiner, Secure Group Key Agreement. PhD thesis, Naturwissenschaftlich- Technische Fakultät der Universität des Saarlandes, Saarbrücken, March 2002.
28. W. Tzeng, "A practical and secure fault-tolerant conference key agreement protocol," in Proc. Third International Workshop on Practice and Theory in Public Key Cryptography (PKC), 2000.