Round-efficient conference key agreement protocols with provable security

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1976, Issue , 2000, Pages 614-627

  Tzeng, Wen Guey ^a   Tzeng, Zhi Jia ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANCE; SECURITY OF DATA;

CONFERENCE KEY AGREEMENT; CONFERENCE KEY PROTOCOLS; INTERACTIVE PROOF SYSTEM; MALICIOUS PARTICIPANT; PASSIVE ADVERSARY; RANDOM ORACLE MODEL; SECRET COMMUNICATIONS; SECURITY CAPABILITY;

CRYPTOGRAPHY;

EID: 84937394156     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44448-3_47     Document Type: Conference Paper

References (30)

1. M. Bellare, P. Rogaway, “Random oracles are practical: a paradigm for designing efficient protocols”, Proceedings of the First ACM Conference on Computer and Communications Security, pp.62-73, 1993.
2. M. Ben-Or, S. Goldwasser, A. Wigderson, “Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation”, Proceedings of the 20th ACM Symposium on the Theory of Computing, pp.1-10, 1988.
3. S. Berkovits, “How to Broadcast a Secret”, Proceedings of Advances in Cryptology-Eurocrypt’91, Lecture Notes in Computer Science 547, Springer-Verlag, pp.535-541, 1991.
4. R. Blom, “An Optimal Class of Symmetric Key Generation Systems”, Proceedings of Advances in Cryptology-Eurocrypt’84, Lecture Notes in Computer Science 196, Springer-Verlag, pp.335-338, 1984.
5. C. Blundo, A.D. Santis, A. Herzberg, S. Kutten, U. Vaccaro, M. Yung, “Perfectly-Secure Key Distribution for Dynamic Conferences”, Proceedings of Advances in Cryptology-Crypto’92, Lecture Notes in Computer Science 740, Springer-Verlag, pp.471-486, 1992.
6. D. Boneh, R. Venkatesan, “Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Problems”, Proceedings of Advances in Cryptology-Crypto’96, Lecture Notes in Computer Science 1109, Springer-Verlag, pp.129-142, 1996.
7. M. Burmester, Y. Desmedt, “A Secure and Efficient Conference Key Distribution System”, Proceedings of Advances in Cryptology-Eurocrypt’94, Lecture Notes in Computer Science 950, Springer-Verlag, pp.275-286, 1994.
8. R. Canetti, O. Goldreich, S. Halevi, “The Random Oracle Methodology Revisited”, Proceedings of the 30th STOC, pp.209-218, 1998.
9. C.C. Chang, C.H. Lin, “How to Converse Securely in a Conference”, Proceedings of IEEE 30th Annual International Carnahan Conference, pp.42-45, 1996.
10. C.C. Chang, T.C. Wu, C.P. Chen, “The Design of a Conference Key Distribution System”, Proceedings of Advances in Cryptology-Auscrypt’92, Lecture Notes in Computer Science 718, Springer-Verlag, pp.459-466, 1992.
11. D. Chaum, T.P. Pedersen, “Wallet DataBases with Observers”, Proceedings of Advances in Cryptography-Crypto’92, pp.90-105, 1992.
12. Y. Desmedt, V. Viswandathan, “Unconditionally secure dynamic conference distribution”, IEEE International Symposium on Information Theory 98, pp.383, 1998.
13. W. Diffie, P.C. van Oorschot, M.J. Weiner, “Authentication and Authenticated Key Exchanges”, Design, Codes and Cryptography Vol. 2, pp.107-125, 1992.
14. U. Feige, A. Fiat, A. Shamir, “Zero-Knowledge Proof of Identity”, Journal of Cryptology Vol. 1, pp.77-94, 1988.
15. O. Goldreich, H. Krawczyk, “On the Composition of Zero-Knowledge Proof Systems”, ICALP 90, Lecture Notes in Computer Science 443, pp.268-282, Springer-Verlag, 1990.
16. T. Hwang, J.L. Chen, “Identity-Based Conference Key Broadcast Systems”, Proceedings of IEE Computers and Digital Techniques, Vol. 141, No. 1, pp.57-60, 1994.
17. I. Ingemarsson, D.T. Tang, C.K. Wong, “A Conference Key Distribution System”, IEEE Transactions on Information Theory, Vol. IT-28, No. 5, pp.714-720, 1982.
18. B. Klein, M. Otten, T. Beth, “Conference Key Distribution Protocols in Distributed Systems”, Proceedings of Codes and Ciphers-Cryptography and Coding IV, IMA, pp.225-242, 1995.
19. K. Koyama, “Secure Conference Key Distribution Schemes for Conspiracy Attack”, Proceedings of Advances in Cryptology-Eurocrypt’92, Lecture Notes in Computer Science 658, Springer-Verlag, pp.449-453, 1992.
20. K. Koyama, K. Ohta, “Identity-Based Conference Key Distribution Systems”, Proceedings of Advances in Cryptology-Crypto’87, Lecture Notes in Computer Science 293, Springer-Verlag, pp.175-184, 1987.
21. K. Koyama, K. Ohta, “Security of Improved Identity-Based Conference Key Distributioin Systems”, Proceedings of Advances in Cryptology-Eurocrypt’88, Lecture Notes in Computer Science 330, Springer-Verlag, pp.11-19, 1988.
22. T. Matsumoto, H. Imai, “On the Key Predistribution System: A Practical Solution to the Key Distribution Problem”, Proceedings of Advances in Cryptology-’87, Lecture Notes in Computer Science 293, Springer-Verlag, pp.185-193, 1987.
23. D. Pointcheval, J. Stern.”Security proofs for signatue schemes”, Proceedings of Advances in Cryptology-Eurocrypt’96, Lecture Notes in Computer Science 1070, Springer-Verlag, pp.387-398, 1996.
24. R.A. Rueppel, P.C. Van Oorschot, “Modern Key Agreement Techniques”, Computer Communications, 1994.
25. A. Shimbo, S.I. Kawamura, “Cryptanalysis of Several Conference Key Distribution Schemes”, Proceedings of Advances in Cryptology-Asiacrypt’91, Lecture Notes in Computer Science 739, Springer-Verlag, pp.265-276, 1991.
26. V. Shoup, “Lower Bounds for Discrete Logarithms and Related Problems”, Proceedings of Advances in Cryptology-Eurocrypt’97, Lecture Notes in Computer Science 1233, Springer-Verlag, pp.256-266, 1997.
27. D.G. Steer, L. Strawczynski, W. Diffie, M. Wiener, “A Secure Audio Teleconference System”, Proceedings of Advances in Cryptology-Crypto’88, Lecture Notes in Computer Science 409, Springer-Verlag, pp.520-528, 1988.
28. W.G. Tzeng, “A Practical and Secure Fault-tolerant Conference-key Agreement Protocol”, Proceedings of Public Key Cryptography-PKC 2000, Lecture Notes in Computer Science 1751, Springer-Verlag, pp.1-13, 2000.
29. T.C. Wu, “Conference Key Distribution System with User Anonymity Based on Algebraic Approach”, Proceedings of IEE Computers and Digital Techniques, Vol. 144, No 2, pp.145-148, 1997.
30. Y. Yacobi, “Attack on the Koyama-Ohta Identity Based Key Distribution Scheme”, Proceedings of Advances in Cryptology-Crypto’87, Lecture Notes in Computer Science 293, Springer-Verlag, pp429-433, 1987.