This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Computational Security of a Distributed Key Distribution Scheme
August 2008 (vol. 57 no. 8)
pp. 1087-1097
Vanesa Daza, Universitat Rovira i Virgili, Tarragona
Javier Herranz, CSIC, Spanish National Research Council , Bellaterra
Germán Sáez, Universitat Politecnica de Catalunya, Barcelona
In a distributed key distribution scheme, a set of servers help a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some servers and some users has no information about the key of a non-corrupted group. In this work we formalize the security analysis of one of such schemes \\cite{DHPS02}, which was not considered in the original proposal. We prove the scheme secure in the random oracle model, assuming that the Decisional Diffie-Hellman problem is hard to solve. We also detail a possible modification of that scheme and the one in \\cite{NPR99}, which allows to prove the security of the schemes without assuming that a specific hash function behaves as a random oracle. As usual, this improvement in the security of the schemes is at the cost of an efficiency loss.

[1] M. Bellare, D. Pointcheval, and P. Rogaway, “Authenticated Key Exchange Secure against Dictionary Attacks,” Proc. Int'l Conf. Theory and Application of Cryptographic Techniques, pp. 139-155, 2000.
[2] M. Bellare and P. Rogaway, “Random Oracles Are Practical: A Paradigm for Designing Efficient Protocols,” Proc. First ACM Conf. Computer and Comm. Security, pp. 62-73, 1993.
[3] G.R. Blakley, “Safeguarding Cryptographic Keys,” Proc. Nat'l Computer Conf., Am. Federation of Information, Processing Societies, pp. 313-317, 1979.
[4] C. Blundo, P. D'Arco, V. Daza, and C. Padró, “Bounds and Constructions for Unconditionally Secure Distributed Key Distribution Schemes for General Access Structures,” Theoretical Computer Science, vol. 320, pp. 269-291, 2004.
[5] E. Bresson and D. Catalano, “Constant Round Authenticated Group Key Agreement via Distributed Computation,” Proc. Seventh Int'l Workshop Practice and Theory in Public Key Cryptography, vol. 2947, pp. 115-129, 2004.
[6] E.F. Brickell, “Some Ideal Secret Sharing Schemes,” J. Combinatorial Math. and Combinatorial Computing, vol. 9, pp. 105-113, 1989.
[7] M. Burmester and Y.G. Desmedt, “A Secure and Efficient Conference Key Distribution System,” Proc. Int'l Conf. Theory and Application of Cryptographic Techniques, vol. 950, pp. 275-286, 1994.
[8] J. Camenisch, “Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem,” PhD thesis, ETH Zurich, Diss. ETH No. 12520, 1998.
[9] B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, “Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults,” Proc. 26th IEEE Symp. Foundations of Computer Science, pp.383-395, 1985.
[10] P. D'Arco and D.R. Stinson, “On Unconditionally Secure Robust Distributed Key Distribution Centers,” Proc. Eighth Int'l Conf. Theory and Application of Cryptology and Information Security, pp.346-363, 2002.
[11] V. Daza, J. Herranz, C. Padró, and G. Sáez, “A Distributed and Computationally Secure Key Distribution Scheme,” Proc. Fifth Information Security Conf., pp. 342-356, 2002.
[12] V. Daza, J. Herranz, and G. Sáez, “Constructing General Dynamic Group Key Distribution Schemes with Decentralized User Join,” Proc. Eighth Australasian Conf. Information Security and Privacy, pp.464-475, 2003.
[13] V. Daza, J. Herranz, and G. Sáez, “Protocols Useful on the Internet from Distributed Signature Schemes,” Int'l J. Information Security, vol. 3, no. 2, pp. 61-69, 2004.
[14] W. Diffie and M.E. Hellman, “New Directions in Cryptography,” IEEE Trans. Information Theory, vol. 22, no. 6, pp. 644-654, 1976.
[15] P. Feldman, “A Practical Scheme for Non-Interactive Verifiable Secret Sharing,” Proc. 28th IEEE Symp. Foundations of Computer Science, pp. 427-437, 1987.
[16] A. Fiat and A. Shamir, “How to Prove Yourself: Practical Solutions of Identification and Signature Problems,” Proc. Advances in Cryptology, pp. 186-194, 1986.
[17] T. ElGamal, “A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms,” IEEE Trans. Information Theory, vol. 31, pp. 469-472, 1985.
[18] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, “Robust Threshold DSS Signatures,” Proc. Int'l Conf. Theory and Application of Cryptographic Techniques, pp. 354-371, 1996.
[19] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, “Secure Distributed Key Generation for Discrete-Log Based Cryptosystems,” Proc. Int'l Conf. Theory and Application of Cryptographic Techniques, vol. 1592, pp. 295-310, 1999.
[20] S. Goldwasser and S. Micali, “Probabilistic Encryption,” J.Computer and System Sciences, vol. 28, pp. 270-299, 1984.
[21] A. Hevia and D. Micciancio, “Simultaneous Broadcast Revisited,” Proc. 24th Ann. ACM Symp. Principles of Distributed Computing, pp.324-333, 2005.
[22] J. Katz and M. Yung, “Scalable Protocols for Authenticated Group Key Exchange,” Proc. Advances in Cryptology, pp. 110-125, 2003.
[23] H. Kurnio, R. Safavi-Naini, and H. Wang, “A Group Key Distribution Scheme with Decentralised User Join,” Proc. Third Conf. Security in Comm. Networks, pp. 146-163, 2002.
[24] M. Naor, B. Pinkas, and O. Reingold, “Distributed Pseudo-Random Functions and KDCs,” Proc. Int'l Conf. Theory and Application of Cryptographic Techniques, pp. 327-346, 1999.
[25] R.M. Needham and M.D. Schroeder, “Using Encryption for Authentication in Large Networks of Computers,” Comm. ACM, vol. 21, pp. 993-999, 1978.
[26] T.P. Pedersen, “Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing,” Proc. Advances in Cryptology, pp. 129-140, 1991.
[27] D. Pointcheval and J. Stern, “Security Arguments for Digital Signatures and Blind Signatures,” J. Cryptology, vol. 13, no. 3, pp.361-396, 2000.
[28] C.P. Schnorr, “Efficient Signature Generation by Smart Cards,” J.Cryptology, vol. 4, pp. 161-174, 1991.
[29] A. Shamir, “How to Share a Secret,” Comm. ACM, vol. 22, pp. 612-613, 1979.
[30] G.J. Simmons, W. Jackson, and K. Martin, “The Geometry of Secret Sharing Schemes,” Bull. ICA, vol. 1, pp. 71-88, 1991.

Index Terms:
Public key cryptosystems, Cryptographic controls
Citation:
Vanesa Daza, Javier Herranz, Germán Sáez, "On the Computational Security of a Distributed Key Distribution Scheme," IEEE Transactions on Computers, vol. 57, no. 8, pp. 1087-1097, Aug. 2008, doi:10.1109/TC.2008.50
Usage of this product signifies your acceptance of the Terms of Use.