Abstract
A conference key protocol allows a group of participants to establish a secret communication (conference) key so that all their communications thereafter are protected by the key. In this paper we consider the distributed conference key (conference key agreement) protocol. We present two round-efficient conference key agreement protocols, which achieve the optimum in terms of the number of rounds. Our protocols are secure against both passive and active adversaries under the random oracle model. They release no useful information to passive adversaries and achieve fault tolerance against any coalition of malicious participants. We achieve the optimal round by transferring an interactive proof system to a non-interactive version, while preserving its security capability.
Research supported in part by the National Science Council grant NSC-89-2213-E-009-180 and by the Ministry of Education grant 89-E-FA04-1-4, Taiwan, ROC.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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.
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.
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.
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.
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.
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.
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.
R. Canetti, O. Goldreich, S. Halevi, “The Random Oracle Methodology Revisited”, Proceedings of the 30th STOC, pp.209–218, 1998.
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.
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.
D. Chaum, T.P. Pedersen, “Wallet DataBases with Observers”, Proceedings of Advances in Cryptography-Crypto’92, pp.90–105, 1992.
Y. Desmedt, V. Viswandathan, “Unconditionally secure dynamic conference distribution”, IEEE International Symposium on Information Theory 98, pp.383, 1998.
W. Diffie, P.C. van Oorschot, M.J. Weiner, “Authentication and Authenticated Key Exchanges”, Design, Codes and Cryptography Vol. 2, pp.107–125, 1992.
U. Feige, A. Fiat, A. Shamir, “Zero-Knowledge Proof of Identity”, Journal of Cryptology Vol. 1, pp.77–94, 1988.
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.
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.
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.
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.
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.
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.
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.
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.
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.
R.A. Rueppel, P.C. Van Oorschot, “Modern Key Agreement Techniques”, Computer Communications, 1994.
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.
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.
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.
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.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tzeng, WG., Tzeng, ZJ. (2000). Round-Efficient Conference Key Agreement Protocols with Provable Security. In: Okamoto, T. (eds) Advances in Cryptology — ASIACRYPT 2000. ASIACRYPT 2000. Lecture Notes in Computer Science, vol 1976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44448-3_47
Download citation
DOI: https://doi.org/10.1007/3-540-44448-3_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41404-9
Online ISBN: 978-3-540-44448-0
eBook Packages: Springer Book Archive