Tree-based group key agreement

ACM Transactions on Information and System Security

Volumn 7, Issue 1, 2004, Pages 60-96

  Kim, Yongdae ^a,d   Perrig, Adrian ^b   Tsudik, Gene ^c  

^a UNIVERSITY OF MINNESOTA   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d University of Minnesota   (United States)

Author keywords

Communication complexity; Cryptographic protocols; Group communication; Group key agreement; Security

Indexed keywords

COMMUNICATION COMPLEXITY; CRYPTOGRAPHIC PROTOCOLS; GROUP COMMUNICATION; GROUP KEY AGREEMENTS; SECURITY; TREE-BASED GROUP DIFFLE-HELLMAN (TGDH);

COMPUTATIONAL COMPLEXITY; CONTRACTS; DATA COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; ENERGY EFFICIENCY; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY;

COMPUTER SUPPORTED COOPERATIVE WORK;

EID: 3142512728     PISSN: 10949224     EISSN: None     Source Type: Journal    
DOI: 10.1145/984334.984337     Document Type: Article

References (38)

1. ACMCCS98. 1998. Fifth ACM Conference on Computer and Communications Security. ACM Press.
2. AMIR, Y. 1995. Replication Using Group Communication Over a Partitioned Network. Ph.D. Thesis, Institute of Computer Science, The Hebrew University of Jerusalem.
3. AMIR, Y., ATENIESE, G., HASSE, D., KIM, Y., NITA-ROTARU, C., SCHLOSSNAGLE, T., SCHULTZ, J., STANTON, J., AND TSUDIK, G. 2000. Secure group communication in asynchronous networks with failures: Integration and experiments. In ICDCS 2000.
4. AMIS, Y. AND STANTON, J. 1998. The Spread Wide Area Group Communication System. Technical Report 98-4, Johns Hopkins University Department of Computer Science.
5. ASOKAN, N. AND GINZBOORG, P. 1999. Key-agreement in ad-hoc networks. In Nordsec'99.
6. ASOKAN, N., SHOUP, V., AND WAIDNER, M. 2000. Optimistic fair exchange of digital signatures. IEEE Journal on Selected Area in Communications 18, 4, 593-610.
7. ATENIESE, G., STEINER, M., AND TSUDIK, G. 1998. Authenticated group key agreement and friends. In Fifth ACM Conference on Computer and Communications Security. ACM Press.
8. BECKER, C. AND WILLE, U. 1998. Communication complexity of group key distribution. In Fifth ACM Conference on Computer and Communications Security. ACM Press.
9. BELLARE, M. AND ROGAWAY, P. 1993. Random oracles are practical: A paradigm for designing efficient protocols. In First ACM Conference on Computer and Communications Security.
10. BONEH, D. 1998. The decision Diffie-Hellman problem. In Third Algorithmic Number Theory Symposium, 48-63.
11. BONEH, D. 1999. Twenty years of attacks on the RSA cryptosystem. Notices of the American Mathematical Society (AMS) 46, 2, 203-213.
12. BRESSON, E., CHEVASSUT, O., AND POINTCHEVAL, D. 2001a. Provably authenticated group Diffie-Hellman key exchange - The dynamic case. In Advances in Cryptology - ASIACRYPT'2001.
13. BRESSON, E., CHEVASSUT, O., POINTCHEVAL, D., AND QUISQUATER, J.-J. 2001b. Provably authenticated group Diffie-Hellman key exchange. In Eighth ACM Conference on Computer and Communications Security. ACM Press.
14. BURMESTER, M. AND DESMEDT, Y. 1995. A secure and efficient conference key distribution system. In Advances in Cryptology - EUROCRYPT'94, 275-286 (final version of the Proceedings).
15. CARONNI, G., WALDVOGEL, M., SUN, D., WEILER, N., AND PLATTNER, B. 1999. The VersaKey framework: Versatile group key management. IEEE Journal on Selected Areas in Communications.
16. CHAUM, D. 1991. Zero-knowledge undeniable signatures. In Advances in Cryptology - EUROCRYPT'90, 458-464.
17. DONDETI, L., MUKHERJEE, S., AND SAMAL, A., 2000. Disec: A distributed framework for scalable secure many-to-many communication. In Proceedings of The Fifth IEEE Symposium on Computers and Communications (ISCC 2000).
18. FEKETE, A., LYNCH, N., AND SHVARTSMAN, A. 1997. Specifying and using a pardonable group communication service. In ACM PODC'97, 53-62.
19. INGEMARSSON, I., TANG, D. T., AND WONG, C. K. 1982. A conference key distribution system. IEEE Transactions on Information Theory 28, 5.
20. KIM, Y., MAZZOCHI, D., AND TSUDIK, G. 2003. Admission control in collaborative groups. In Second IEEE International Symposium on Network Computing and Applications (NCA-03).
21. KIM, Y., PERRIG, A., AND TSUDIK, G. 2000. Simple and fault-tolerant key agreement for dynamic collaborative groups. In Seventh ACM Conference on Computer and Communications Security. ACM Press, 235-244.
22. KIM, Y., PERRIG, A. AND TSUDIK, G. 2001. Communication-efficient group key agreement. In Information Systems Security, Proceedings of the Seventeenth International Information Security Conference IFIP SEC'01.
23. KURNIO, H., SAFAVI-NAINI, R., SUSILO, W., AND WANG, H. 2000. Key management for secure multicast with dynamic constrollers. In Information Security and Privacy, Fifth Australasian Conference, ACISP00.
24. LENSTRA, A. K. AND VERHEUL, E. R. n.d. Selecting cryptographic key sizes. Available at http://www.cryptosavvy.com/.
25. McGREW, D. A. AND SHERMAN, A. T. n.d. Key establishment in large dynamic groups using one-way function trees. Manuscript.
26. MOSER, L., AMIR, Y., MELLIAR-SMITH, P., AND AGARWAL, D. 1994. Extended virtual synchrony. In ICDCS'94, 56-65.
27. OPENSSL PROJECT TEAM. 2001. Openssl.
28. PERRIG, A. 1999. Efficient collaborative key management protocols for secure autonomous group communication. In International Workshop on Cryptographic Techniques and E-Commerce (CrypTEC '99).
29. RODEH, O., BIRMAN, K., AND DOLEV, D. 2000. Optimized rekey for group communication systems. In NDSS2000, 37-48.
30. SHOUP, V. 1997. Lower bounds for discrete logarithms and related problems. In Advances in Cryptology - EUROCRYPT'97, 256-266.
31. SHOUP, V. 2000. Using hash functions as a hedge against chosen ciphertext attacks. In Advances in Cryptology - EUROCRYPT'2000, 275-288.
32. STEER, D., STRAWCZYNSKI, L., DIFFIE, W., AND WIENER, M. 1988. A secure audio teleconference system. In Advances in Cryptology - CRYPTO'88, 520-528.
33. STEINER, M., TSUDIK, G., AND WAIDNER, M. 2000. Key agreement in dynamic peer groups. IEEE Transactions on Parallel and Distributed Systems.
34. TZENG, W.-G. AND TZENG, Z.-J. 2000. Round-efficient conference-key agreement protocols with provable security. In Advances in Cryptology - ASIACRYPT'2000.
35. WALLNER, D., HARDER, E., AND AGEE, R. 1997. Key Management for Multicast: Issues and Architecture. Internet-Draft draft-wallner-key-arch-00.txt.
36. WONG, C., GOUDA, M., AND LAM, S. 1998. Secure group communications using key graphs. In Proceedings of the ACM SIGCOMM'98 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, 68-79. Appeared in ACM SIGCOMM Computer Communication Review 28, 4 (Oct. 1998).
37. WONG, C., GOUDA, M., AND LAM, S. 1998. Secure group communications using key graphs. In Proceedings of the ACM SIGCOMM'98 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, 68-79. Appeared in ACM SIGCOMM Computer Communication Review 28, 4 (Oct. 1998).
38. WONG, C., GOUDA, M., AND LAM, S. 2000. Secure group communications using key graphs. IEEE/ACM Transactions on Networking 8, 1, 16-30.