ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
New constructions for multicast re-keying schemes using perfect hash families
Full text PdfPdf (385 KB)
Source Conference on Computer and Communications Security archive
Proceedings of the 7th ACM conference on Computer and communications security table of contents
Athens, Greece
Pages: 228 - 234  
Year of Publication: 2000
ISBN:1-58113-203-4
Authors
Rei Safavi-Naini  School of Information Technology and Computer Science, University of Wollongong, Wollongong 2522, Australia
Huaxiong Wang  School of Information Technology and Computer Science, University of Wollongong, Wollongong 2522, Australia
Sponsors
Greek Com Soc : Greek Computer Society
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Athens U of Econ & Business : Athens University of Economics and Business
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 21,   Citation Count: 6
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/352600.352637
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Michel Abdalla , Yuval Shavitt , Avishai Wool, Towards Making Broadcast Encryption Practical, Proceedings of the Third International Conference on Financial Cryptography, p.140-157, February 01, 1999
 
2
N Alon, Explicit construction of exponential sized families of K-independent sets, Discrete Mathematics, v.58 n.2, p.191-193, Feb. 1986  [doi>10.1016/0012-365X(86)90161-5]
 
3
M. Atici, S. S. Magliveras, D. R. Stinson and W.D. Wei. Some Recursive Constructions for Perfect Hash Families, Journal of Combinatorial Designs, 4 (1996), 353-363.
 
4
Carlo Blundo , Luiz A. Frota Mattos , Douglas R. Stinson, Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution, Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology, p.387-400, August 18-22, 1996
 
5
E. F. Brickell. A problem in broadcast encryption, presented at5th Vermont Summer Workshop on Combinatorics and Graph Theory, 1991.
 
6
R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor and B. Pinkas. Multicast Security: A Taxonomy and Some E~cient Constructions. INFOCOM '99, 1999, 708-716.
 
7
R. Canetti, T. Malkin and K. Nissim. E~cient Communication-Storage Tradeo~s for Multicast Encryption. Advances in Cryptology { EUROCRYPT '99, Lecture Notes in Computer Science, 1592 (1999), 459-474.
 
8
I. Chang, R. Engel, D. Kandlur, D. Pendarakis and D. Saha. Key Management for Secure Internet Multicast Using Boolean Function Minimisation Techniques. INFOCOM '99, 1999, 689-698.
 
9
Zbigniew J. Czech , George Havas , Bohdan S. Majewski, Perfect hashing, Theoretical Computer Science, v.182 n.1-2, p.1-143, Aug. 1997  [doi>10.1016/S0304-3975(96)00146-6]
 
10
M. Luby and J. Staddon. Combinatorial Bounds for Broadcast Encryption. Advances in Cryptology { EUROCRYPT '93,, Lecture Notes in Computer Science, 1403 (1998), 512-526.
 
11
Amos Fiat , Moni Naor, Broadcast encryption, Proceedings of the 13th annual international cryptology conference on Advances in cryptology, p.480-491, January 1994, Santa Barbara, California, United States
 
12
R. Kumar, S. Rajagopalan and A. Sahai. Coding
 
1
Michel Abdalla , Yuval Shavitt , Avishai Wool, Towards Making Broadcast Encryption Practical, Proceedings of the Third International Conference on Financial Cryptography, p.140-157, February 01, 1999
 
2
N Alon, Explicit construction of exponential sized families of K-independent sets, Discrete Mathematics, v.58 n.2, p.191-193, Feb. 1986  [doi>10.1016/0012-365X(86)90161-5]
 
3
M. Atici, S. S. Magliveras, D. R. Stinson and W.D. Wei. Some Recursive Constructions for Perfect Hash Families, Journal of Combinatorial Designs, 4 (1996), 353-363.
 
4
Carlo Blundo , Luiz A. Frota Mattos , Douglas R. Stinson, Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution, Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology, p.387-400, August 18-22, 1996
 
5
E. F. Brickell. A problem in broadcast encryption, presented at5th Vermont Summer Workshop on Combinatorics and Graph Theory, 1991.
 
6
R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor and B. Pinkas. Multicast Security: A Taxonomy and Some E~cient Constructions. INFOCOM '99, 1999, 708-716.
 
7
R. Canetti, T. Malkin and K. Nissim. E~cient Communication-Storage Tradeo~s for Multicast Encryption. Advances in Cryptology { EUROCRYPT '99, Lecture Notes in Computer Science, 1592 (1999), 459-474.
 
8
I. Chang, R. Engel, D. Kandlur, D. Pendarakis and D. Saha. Key Management for Secure Internet Multicast Using Boolean Function Minimisation Techniques. INFOCOM '99, 1999, 689-698.
 
9
Zbigniew J. Czech , George Havas , Bohdan S. Majewski, Perfect hashing, Theoretical Computer Science, v.182 n.1-2, p.1-143, Aug. 1997  [doi>10.1016/S0304-3975(96)00146-6]
 
10
M. Luby and J. Staddon. Combinatorial Bounds for Broadcast Encryption. Advances in Cryptology { EUROCRYPT '93,, Lecture Notes in Computer Science, 1403 (1998), 512-526.
 
11
Amos Fiat , Moni Naor, Broadcast encryption, Proceedings of the 13th annual international cryptology conference on Advances in cryptology, p.480-491, January 1994, Santa Barbara, California, United States
 
12
Ravi Kumar , Sridhar Rajagopalan , Amit Sahai, Coding Constructions for Blacklisting Problems without Computational Assumptions, Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology, p.609-623, August 15-19, 1999
 
13
D. A. McGrew and A. T. Sherman. Key Establishment in Large Dynamic Groups Using One-Way Function Trees. Manuscript, 1998.
 
14
Doug R. Stinson, On Some Methods for Unconditionally Secure Key Distributionand Broadcast Encryption, Designs, Codes and Cryptography, v.12 n.3, p.215-243, Nov. 1997  [doi>10.1023/A:1008268610932]
 
15
Doug R. Stinson , Tran Van Trung, Some New Results on Key Distribution Patterns and BroadcastEncryption, Designs, Codes and Cryptography, v.14 n.3, p.261-279, Sept. 1998  [doi>10.1023/A:1008209004667]
 
16
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.
 
17
Huaxiong Wang , Chaoping Xing, Explicit constructions of perfect hash families from algebraic curves over finite fields, Journal of Combinatorial Theory Series A, v.93 n.1, p.112-124, Jan. 2001  [doi>10.1006/jcta.2000.3068]
18
Chung Kei Wong , Mohamed Gouda , Simon S. Lam, Secure group communications using key graphs, Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication, p.68-79, August 31-September 04, 1998, Vancouver, British Columbia, Canada

CITED BY  6
Roberto Di Pietro , Luigi V. Mancini , Sushil Jajodia, Efficient and secure keys management for wireless mobile communications, Proceedings of the second ACM international workshop on Principles of mobile computing, October 30-31, 2002, Toulouse, France
Donggang Liu , Peng Ning , Kun Sun, Efficient self-healing group key distribution with revocation capability, Proceedings of the 10th ACM conference on Computer and communications security, October 27-30, 2003, Washington D.C., USA
Carlo Blundo , Paolo D’arco , Alfredo De Santis , Massimiliano Listo, Design of Self-Healing Key Distribution Schemes, Designs, Codes and Cryptography, v.32 n.1-3, p.15-44, May-July 2004
Fagen Li , Xiangjun Xin , Yupu Hu, Indentity-based broadcast signcryption, Computer Standards & Interfaces, v.30 n.1-2, p.89-94, January, 2008
Stelvio Cimato , Antonella Cresti , Paolo D'Arco, A unified model for unconditionally secure key distribution, Journal of Computer Security, v.14 n.1, p.45-64, January 2006
Daniele Micciancio , Saurabh Panjwani, Optimal communication complexity of generic multicast key distribution, IEEE/ACM Transactions on Networking (TON), v.16 n.4, p.803-813, August 2008

INDEX TERMS

Primary Classification:
  K. Computing Milieux
  K.6 MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.0 General
          Subjects: Security and protection (e.g., firewalls)

  E. Data
  E.3 DATA ENCRYPTION

  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.7 Database Administration
          Subjects: Security, integrity, and protection
  H.5 INFORMATION INTERFACES AND PRESENTATION (I.7)
      H.5.3 Group and Organization Interfaces
          Subjects: Collaborative computing


General Terms:
Design, Management, Measurement, Performance, Reliability, Security, Standardization, Theory


Keywords:
broadcast encryption, perfect hash family, secure multicasting

Collaborative Colleagues:
Rei Safavi-Naini: colleagues
Huaxiong Wang: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player