A secure re-keying scheme with key recovery property

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

Volumn 2384, Issue , 2002, Pages 40-55

  Kurnio, Hartono ^a   Safavi Naini, Rei ^a   Wang, Huaxiong ^b  

^a UNIVERSITY OF WOLLONGONG   (Australia)

^b MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

MULTICASTING; SECURITY OF DATA;

BACKWARD SECRECY; FORWARD SECRECY; GROUP MEMBERSHIPS; HIGHER EFFICIENCY; LOGICAL KEY HIERARCHY; MULTICAST GROUPS; MULTIPLE USER; ONE WAY HASH CHAIN;

CRYPTOGRAPHY;

EID: 84930043991     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45450-0_4     Document Type: Conference Paper

References (26)

1. M. Abdalla, Y. Shavitt and A. Wool. Towards Making Broadcast Encryption Practical. Financial Cryptography’99, Lecture Notes in Computer Science 1648, pages 140-152, 1999.
2. J. Anzai, N. Matsuzaki and T. Matsumoto. A Quick Group Key Distribution Scheme with “Entity Revocation”. Advances in Cryptology – ASIACRYPT’99, Lecture Notes in Computer Science 1716, pages 333-347, 1999.
3. C. Blundo and A. Cresti. Space Requirements for Broadcast Encryption. Advances in Cryptology – EUROCRYPT’94, Lecture Notes in Computer Science 950, pages 287-298, 1994.
4. C. Blundo, L. A. Frota Mattos and D. Stinson. Trade-offs Between Communication and Storage in Unconditionally Secure Systems for Broadcast Encryption and Interactive Key Distribution. Advances in Cryptology – CRYPTO’96, Lecture Notes in Computer Science 1109, pages 387-400, 1996.
5. J. W. Byers, M. Luby, M. Mitzenmacher and A. Rege. A Digital Fountain Approach to Reliable Distribution of Bulk Data. Proceedings of the ACM SIGCOMM’98, 1998.
6. R. Canetti, J. Garay, G. Itkis, D. Mic ciancio, M. Naor and B. Pinkas. Issues in Multicast Security: A Taxonomy and Efficient Constructions. Proceedings of INFOCOM’99, pages 708-716, 1999.
7. R. Canetti, T. Malkin and K. Nissim. Efficient Communication-Storage Tradeoffs for Multicast Encryption. Advances in Cryptology – EUROCRYPT’99, Lecture Notes in Computer Science 1592, pages 459-474, 1999.
8. I. Chang, R. Engel, D. Kandlur, D. Pendarakis and D. Saha. Key Management for Secure Internet Multicast Using Boolean Function Minimization Techniques. Proceedings of INFOCOM’99, pages 689-698, 1999.
9. A. Fiat and M. Naor. Broadcast Encryption. Advances in Cryptology – CRYPTO’93, Lecture Notes in Computer Science 773, pages 480-491, 1994.
10. FIPS 180-1. Secure Hash Standard. NIST, US Department of Commerce, Washington D.C., April 1995.
11. R. Kumar, S. Rajagopalan and A. Sahai. Coding Constructions for Blacklisting Problems Without Computational Assumptions. Advances in Cryptology – CRYPTO’99, Lecture Notes in Computer Science 1666, pages 609-623, 1999.
12. H. Kurnio, R. Safavi-Naini and H. Wang. Efficient Revocation Schemes for Secure Multicast. Information Security and Cryptology – ICISC 2001, Lecture Notes in Computer Science 2288, pages 160-177, 2002.
13. M. Luby and J. Staddon. Combinatorial Bounds for Broadcast Encryption. Advances in Cryptology – EUROCRYPT’98, Lecture Notes in Computer Science 1403, pages 512-526, 1998.
14. D. A. Mc Grew and A. T. Sherman. Key Establishment in Large Dynamic Groups Using One-Way Function Trees. Manuscript, 1998.
15. D. Naor, M. Naor and J. Lotspiech. Revocation and Tracing Schemes for Stateless Receivers. Advances in Cryptology – CRYPTO 2001, Lecture Notes in Computer Science 2139, pages 41-62, 2001.
16. M. Naor and B. Pinkas. Efficient Trace and Revoke Schemes. Financial Cryptography 2000, Lecture Notes in Computer Science 1962, pages 1-20, 2001.
17. A. Perrig, D. Song and J. D. Tygar. ELK, a New Protocol for Efficient Large- Group Key Distribution. IEEE Symposium on Security and Privacy 2001, pages 247-262, 2001.
18. M. O. Rabin. The Information Dispersal Algorithm and Its Applications. Sequences: Combinatorics, Compression, Security and Transmission, pages 406-419, 1990.
19. R. Rivest. The MD5Message Digest Algorithm. RFC 1321, April 1992.
20. R. Safavi-Naini and H. Wang. New Constructions for Multicast Re-keying Schemes Using Perfect Hash Families. 7th ACM Conference on Computer and Communication Security, ACM Press, pages 228-234, 2000.
21. A. Shamir. How to Share a Secret. Communications of the ACM 22, pages 612-613, 1979.
22. D. R. Stinson and T. van Trung. Some New Results on Key Distribution Patterns and Broadcast Encryption. Designs, Codes and Cryptography 15, pages 261-279, 1998.
23. D. M. Wallner, E. J. Harder and R. C. Agee. Key Management for Multicast: Issues and Architectures. Internet Draft (draft-wallner-key-arch-01.txt), ftp://ftp.ietf.org/internet-drafts/draft-wallner-key-arch-01.txt.
24. C. K. Wong, M. Gouda and S. S. Lam. Secure Group Communication Using Key Graphs. Proceedings of SIGCOMM’98, pages 68-79, 1998.
25. C. K. Wong and S. S. Lam. Keystone: A Group Key Management Service. International Conference on Telecommunications, ICT 2000, 2000.
26. Y. Zheng, J. Pieprzyk and J. Seberry. HAVAL - A One-Way Hashing Algorithm with Variable Length of Output. Advances in Cryptology – AUSCRYPT’92, Lecture Notes in Computer Science 718, pages 83-104, 1993.