Revocation and Tracing Schemes for Stateless Receivers
暂无分享,去创建一个
[1] Mohamed G. Gouda,et al. Secure group communications using key graphs , 2000, TNET.
[2] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[3] George Havas,et al. Perfect Hashing , 1997, Theor. Comput. Sci..
[4] Moni Naor,et al. Digital signets: self-enforcing protection of digital information (preliminary version) , 1996, STOC '96.
[5] Amos Fiat,et al. Broadcast Encryption , 1993, CRYPTO.
[6] Moni Naor,et al. Multicast security: a taxonomy and some efficient constructions , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).
[7] Douglas R. Stinson,et al. Key Preassigned Traceability Schemes for Broadcast Encryption , 1998, Selected Areas in Cryptography.
[8] Alan T. Sherman,et al. Key Establishment in Large Dynamic Groups Using One-Way Function Trees , 2003, IEEE Trans. Software Eng..
[9] Clifford C. Cocks. An Identity Based Encryption Scheme Based on Quadratic Residues , 2001, IMACC.
[10] Moni Naor. String Matching with Preprocessing of Text and Pattern , 1991, ICALP.
[11] Dan Boneh,et al. Collusion-Secure Fingerprinting for Digital Data , 1998, IEEE Trans. Inf. Theory.
[12] Rosario Gennaro,et al. Securing Threshold Cryptosystems against Chosen Ciphertext Attack , 1998, EUROCRYPT.
[13] Rosario Gennaro,et al. Securing Threshold Cryptosystems against Chosen Ciphertext Attack , 1998, Journal of Cryptology.
[14] J. Ian Munro,et al. Membership in Constant Time and Almost-Minimum Space , 1999, SIAM J. Comput..
[15] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[16] Eyal Kushilevitz,et al. Exposure-Resilient Functions and All-or-Nothing Transforms , 2000, EUROCRYPT.
[17] Eli Upfal,et al. Computing with Noisy Information , 1994, SIAM J. Comput..
[18] Ronald Cramer,et al. A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack , 1998, CRYPTO.
[19] Amos Fiat,et al. Dynamic Traitor Training , 1999, CRYPTO.
[20] J. van Leeuwen,et al. Theoretical Computer Science , 2003, Lecture Notes in Computer Science.
[21] P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .
[22] Moni Naor,et al. Nonmalleable Cryptography , 2000, SIAM Rev..
[23] Ran Canetti,et al. Efficient Communication-Storage Tradeoffs for Multicast Encryption , 1999, EUROCRYPT.
[24] H. L. Abbott,et al. Intersection Theorems for Systems of Sets , 1972, J. Comb. Theory, Ser. A.
[25] Avishai Wool,et al. Long-Lived Broadcast Encryption , 2000, CRYPTO.
[26] Jessica Staddon,et al. Efficient Methods for Integrating Traceability and Broadcast Encryption , 1999, CRYPTO.
[27] Mihir Bellare,et al. Relations among Notions of Security for Public-Key Encryption Schemes , 1998, IACR Cryptol. ePrint Arch..
[28] T ShermanAlan,et al. Key Establishment in Large Dynamic Groups Using One-Way Function Trees , 2003 .
[29] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[30] Amit Sahai,et al. Coding Constructions for Blacklisting Problems without Computational Assumptions , 1999, CRYPTO.
[31] Mohamed G. Gouda,et al. Secure group communications using key graphs , 1998, SIGCOMM '98.
[32] Ronald L. Rivest,et al. All-or-Nothing Encryption and the Package Transform , 1997, FSE.
[33] Moni Naor,et al. Threshold Traitor Tracing , 1998, CRYPTO.
[34] Matthew K. Franklin,et al. An Efficient Public Key Traitor Tracing Scheme , 1999, CRYPTO.
[35] Reihaneh Safavi-Naini,et al. Sequential Traitor Tracing , 2000, CRYPTO.
[36] Amos Fiat,et al. Dynamic Traitor Tracing , 2001, Journal of Cryptology.
[37] Moni Naor,et al. Distributed Pseudo-random Functions and KDCs , 1999, EUROCRYPT.
[38] Jirí Sgall,et al. Efficient dynamic traitor tracing , 2000, SODA '00.
[39] Jessica Staddon,et al. Combinatorial Bounds for Broadcast Encryption , 1998, EUROCRYPT.
[40] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[41] Amos Fiat,et al. Tracing traitors , 2000, IEEE Trans. Inf. Theory.
[42] Eric J. Harder,et al. Key Management for Multicast: Issues and Architectures , 1999, RFC.
[43] Nathalie Weiler,et al. The VersaKey framework: versatile group key management , 1999, IEEE J. Sel. Areas Commun..
[44] Tsutomu Matsumoto,et al. A Quick Group Key Distribution Scheme with "Entity Revocation" , 1999, ASIACRYPT.
[45] Douglas R. Stinson,et al. Advances in Cryptology — CRYPTO’ 93 , 2001, Lecture Notes in Computer Science.
[46] Tatsuaki Okamoto,et al. Secure Integration of Asymmetric and Symmetric Encryption Schemes , 1999, CRYPTO.
[47] Mihir Bellare,et al. A concrete security treatment of symmet-ric encryption: Analysis of the DES modes of operation , 1997, FOCS 1997.
[48] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[49] Birgit Pfitzmann,et al. Trials of Traced Traitors , 1996, Information Hiding.
[50] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[51] Mihir Bellare,et al. A concrete security treatment of symmetric encryption , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[52] Adi Shamir,et al. The LSD Broadcast Encryption Scheme , 2002, CRYPTO.