A note on the set systems used for broadcast encryption

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 470-471

  Kumar, Ravi ^a   Russell, Alexander ^b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b University of Connecticut   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; POLYNOMIALS; PROBABILITY; SERVERS; THEOREM PROVING;

BROADCAST ENCRYPTION; EXCLUSIVE SET SYSTEM; HAMMING DISTANCE;

SET THEORY;

EID: 0038077520     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. Amos Fiat and Moni Naor. Broadcast encryption. CRYPTO, Vol. 773 of Springer LNCS, pp. 480-491, 1993.
2. Eli Gafni, Jessica Staddon, and Yiqun Lisa Yin. Efficient methods for integrating traceability and broadcast encryption. CRYPTO, Vol. 1666 of Springer LNCS, pp. 372-387, 1999.
3. Jeff Lotspiech, Dalit Naor, and Moni Naor. Revocation and tracing schemes for stateless receivers. CRYPTO, Vol. 1880 of Springer LNCS, pp. 41-62, 2000.
4. Sriram V. Pemmaraju. Equitable colorings extend Chernoff-Hoeffding bounds. Proc. 12th Annual ACM-SIAM Symposium on Discrete algorithms, pp. 924-925, 2001.