Optimising sd and lsd in presence of non-uniform probabilities of revocation

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

Volumn 4883 LNCS, Issue , 2009, Pages 46-64

  D'Arco, Paolo ^a   De Santis, Alfredo ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCAST ENCRYPTION; BROADCAST ENCRYPTION SCHEMES; CAMPBELL; CHARACTERISATION; CODEWORD LENGTH; CODING PROBLEMS; CODING THEORY; KEY ASSIGNMENT; KEY STORAGE; LAYERED SUBSET DIFFERENCE; NON-UNIFORM PROBABILITY; NONUNIFORM; OPTIMALITY CRITERIA; SELECTION PROBLEMS; SOURCE-CODING; STATELESS RECEIVER; SUBSET DIFFERENCE METHODS; SUITABLE SOLUTIONS;

BINARY TREES; COMPUTER PROGRAMMING; CRYPTOGRAPHY; DIFFUSERS (OPTICAL); INFORMATION THEORY; NETWORK SECURITY;

PROBABILITY;

EID: 70549098091     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10230-1_4     Document Type: Conference Paper

References (24)

1. Baer, M.: Source coding for campbell's penalties. IEEE Transactions on Information Theory 52(10), 4380-4393 (2006)
2. Berkovits, S.: How to broadcast a secret. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 535-541. Springer, Heidelberg (1991)
3. Campbell, L.L.: Definition of entropy by means of a coding problem. Zeitschrift fur Wahrscheinlichkeitstheorie und wandte Gebiete 6, 113-118 (1966)
4. Chang, I., Engel, R., Kandlur, D., Pendarakis, D., Saha, D.: Key management for secure internet multicast using boolean function minimization techniques. In: Proceedings of IEEE INFOCOMM 1999, vol. 2, pp. 689-698 (1999)
5. Canetti, R., Garay, J., Itkis, G., Micciancio, D., Naor, M., Pinkas, B.: Multicast security: A taxonomy and some efficient constructions. In: Proceedings of INFOCOMM 1999, pp. 708-716 (1999)
6. Canetti, R., Malkin, T., Nissim, K.: Efficient communication-storage tradeoffs for multicast encryption. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 459-474. Springer, Heidelberg (1999)
7. Cover, T., Thomas, J.: Elements of Information Theory. Wiley, Chichester (1991)
8. Caronni, G., Waldvogel, M., Sun, D., Plattner, B.: Efficient security for large and dynamic multicast groups. In: IEEE 7th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE 1998) (1998)
9. Erdos, P., Frankl, P., Furedi, Z.: Families of finite subsets in which no set is covered by the union of r others. Israel Journal of Mathematics (51), 75-89 (1985)
10. Fiat, A., Naor, M.: Broadcast encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 480-491. Springer, Heidelberg (1994)
11. Goodrich, M.T., Sun, J.Z., Tamassia, R.: Efficient tree-based revocation in groups of low-state devices. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 511-527. Springer, Heidelberg (2004)
12. Hwang, Y.H., Lee, P.J.: Efficient broadcast encryption scheme with log-key storage. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol. 4107, pp. 281-295. Springer, Heidelberg (2006)
13. Hwang, J.Y., Lee, D.H., Lim, J.: Generic transformation for scalable broadcast encryption schemes. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 276-292. Springer, Heidelberg (2005)
14. Halevy, D., Shamir, A.: The LSD broadcast encryption scheme. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 47-60. Springer, Heidelberg (2002)
15. Jho, N., Hwang, J.Y., Cheon, J.H., Kim, M., Lee, D.H., Yoo, E.S.: One-way chain based broadcast encryption schemes. In: Cramer, R. (ed.) EURO-CRYPT 2005. LNCS, vol. 3494, pp. 559-574. Springer, Heidelberg (2005)
16. Larmore, L.L., Hirschberg, D.S.: A fast algorithm for optimal lengthlimited Huffman codes. Journal of Association for Computing Machinery 37(2), 464-473 (1990)
17. Micciancio, D., Panjwani, S.: Optimal communication complexity of generic multicast key distribution. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 153-170. Springer, Heidelberg (2004)
18. Naor, D., Naor, M., Lotspiech, J.: Revocation and tracing schemes for stateless receivers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 41-62. Springer, Heidelberg (2001), Full version, http://www.wisdom.weizmann.ac. il/~naor/
19. Poovendran, R., Baras, J.S.: An information theoretic analysis of rooted-tree based secure multicast key distribution schemes. IEEE Transactions on Information Theory 47(7), 2824-2834 (2001);
20. Preliminary version In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, p. 624. Springer, Heidelberg (1999)
21. Sherman, A.T., McGrew, D.A.: Key establishment in large dynamic groups using one-way function trees. IEEE Transactions on Software Engineering 29(5), 444-458 (2003)
22. Snoeyink, J., Suri, S., Varghese, G.: A lower bound for multicast key distribution. In: Proceedings of IEEE INFOCOMM 2001, pp. 422-431 (2001)
23. Wong, C., Gouda, M., Lam, S.: Secure group communications using key graphs. In: Proceedings ACM SIGCOMM 1998. ACM, New York (1998)
24. Wallner, D., Hardler, E., Agee, R.: Key management for multicast: Issues and architectures. RFC 2627, National Security Agency (June 1999)