
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
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. 10871097, August, 2008.  
BibTex  x  
@article{ 10.1109/TC.2008.50, author = {Vanesa Daza and Javier Herranz and Germán Sáez}, title = {On the Computational Security of a Distributed Key Distribution Scheme}, journal ={IEEE Transactions on Computers}, volume = {57}, number = {8}, issn = {00189340}, year = {2008}, pages = {10871097}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2008.50}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  On the Computational Security of a Distributed Key Distribution Scheme IS  8 SN  00189340 SP1087 EP1097 EPD  10871097 A1  Vanesa Daza, A1  Javier Herranz, A1  Germán Sáez, PY  2008 KW  Public key cryptosystems KW  Cryptographic controls VL  57 JA  IEEE Transactions on Computers ER   
[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. 139155, 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. 6273, 1993.
[3] G.R. Blakley, “Safeguarding Cryptographic Keys,” Proc. Nat'l Computer Conf., Am. Federation of Information, Processing Societies, pp. 313317, 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. 269291, 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. 115129, 2004.
[6] E.F. Brickell, “Some Ideal Secret Sharing Schemes,” J. Combinatorial Math. and Combinatorial Computing, vol. 9, pp. 105113, 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. 275286, 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.383395, 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.346363, 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. 342356, 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.464475, 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. 6169, 2004.
[14] W. Diffie and M.E. Hellman, “New Directions in Cryptography,” IEEE Trans. Information Theory, vol. 22, no. 6, pp. 644654, 1976.
[15] P. Feldman, “A Practical Scheme for NonInteractive Verifiable Secret Sharing,” Proc. 28th IEEE Symp. Foundations of Computer Science, pp. 427437, 1987.
[16] A. Fiat and A. Shamir, “How to Prove Yourself: Practical Solutions of Identification and Signature Problems,” Proc. Advances in Cryptology, pp. 186194, 1986.
[17] T. ElGamal, “A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms,” IEEE Trans. Information Theory, vol. 31, pp. 469472, 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. 354371, 1996.
[19] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, “Secure Distributed Key Generation for DiscreteLog Based Cryptosystems,” Proc. Int'l Conf. Theory and Application of Cryptographic Techniques, vol. 1592, pp. 295310, 1999.
[20] S. Goldwasser and S. Micali, “Probabilistic Encryption,” J.Computer and System Sciences, vol. 28, pp. 270299, 1984.
[21] A. Hevia and D. Micciancio, “Simultaneous Broadcast Revisited,” Proc. 24th Ann. ACM Symp. Principles of Distributed Computing, pp.324333, 2005.
[22] J. Katz and M. Yung, “Scalable Protocols for Authenticated Group Key Exchange,” Proc. Advances in Cryptology, pp. 110125, 2003.
[23] H. Kurnio, R. SafaviNaini, and H. Wang, “A Group Key Distribution Scheme with Decentralised User Join,” Proc. Third Conf. Security in Comm. Networks, pp. 146163, 2002.
[24] M. Naor, B. Pinkas, and O. Reingold, “Distributed PseudoRandom Functions and KDCs,” Proc. Int'l Conf. Theory and Application of Cryptographic Techniques, pp. 327346, 1999.
[25] R.M. Needham and M.D. Schroeder, “Using Encryption for Authentication in Large Networks of Computers,” Comm. ACM, vol. 21, pp. 993999, 1978.
[26] T.P. Pedersen, “NonInteractive and InformationTheoretic Secure Verifiable Secret Sharing,” Proc. Advances in Cryptology, pp. 129140, 1991.
[27] D. Pointcheval and J. Stern, “Security Arguments for Digital Signatures and Blind Signatures,” J. Cryptology, vol. 13, no. 3, pp.361396, 2000.
[28] C.P. Schnorr, “Efficient Signature Generation by Smart Cards,” J.Cryptology, vol. 4, pp. 161174, 1991.
[29] A. Shamir, “How to Share a Secret,” Comm. ACM, vol. 22, pp. 612613, 1979.
[30] G.J. Simmons, W. Jackson, and K. Martin, “The Geometry of Secret Sharing Schemes,” Bull. ICA, vol. 1, pp. 7188, 1991.