On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption
暂无分享,去创建一个
[1] Kurt Mehlhorn,et al. On the program size of perfect and universal hash functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[2] Adi Shamir,et al. How to share a secret , 1979, CACM.
[3] Douglas R. Stinson,et al. Cryptography: Theory and Practice , 1995 .
[4] Douglas R. Stinson,et al. Multiple Key Distribution Maintaining User Anonymity via Broadcast Channels , 1995, J. Comput. Secur..
[5] Tsutomu Matsumoto. Incidence Structures for Key Sharing (Extended Abstract) , 1994, ASIACRYPT.
[6] Alfredo De Santis,et al. Randomness in Distribution Protocols , 1996, Inf. Comput..
[7] Joel Friedman,et al. On the bit extraction problem , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[8] Douglas R. Stinson,et al. Three characterizations of non-binary correlation-immune and resilient functions , 1995, Des. Codes Cryptogr..
[9] Christine M. O'Keefe. Applications of finite geometries to information security , 1993, Australas. J Comb..
[10] Evangelos Kranakis,et al. On key distribution via true broadcasting , 1994, CCS '94.
[11] Shimshon Berkovits,et al. How To Broadcast A Secret , 1991, EUROCRYPT.
[12] Oded Goldreich,et al. The bit extraction problem or t-resilient functions , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[13] Dominic J. A. Welsh,et al. Codes and cryptography , 1988 .
[14] Rolf Blom,et al. An Optimal Class of Symmetric Key Generation Systems , 1985, EUROCRYPT.
[15] Alexander Barg,et al. A Broadcast Key Distribution Scheme Based on Block Designs , 1995, IMACC.
[16] Moti Yung,et al. Perfectly Secure Key Distribution for Dynamic Conferences , 1998, Inf. Comput..
[17] Gilles Brassard,et al. Privacy Amplification by Public Discussion , 1988, SIAM J. Comput..
[18] Silvio Micali,et al. Secret-key agreement without public-key , 1994, CRYPTO 1994.
[19] Douglas R. Stinson,et al. An explication of secret sharing schemes , 1992, Des. Codes Cryptogr..
[20] Carlo Blundo,et al. Space Requirements for Broadcast Encryption , 1994, EUROCRYPT.
[21] Amos Beimel,et al. Universally ideal secret-sharing schemes , 1994, IEEE Trans. Inf. Theory.
[22] Amos Fiat,et al. Broadcast Encryption , 1993, CRYPTO.
[23] Ernest F. Brickell,et al. Some Ideal Secret Sharing Schemes , 1990, EUROCRYPT.
[24] Amos Beimel,et al. Communication in key distribution schemes , 1996, IEEE Trans. Inf. Theory.
[25] Douglas R. Stinson,et al. Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds , 1996, SIAM J. Discret. Math..
[26] Kaoru Kurosawa,et al. Security of the Center in Key Distribution Schemes , 1994, ASIACRYPT.
[27] P. Cameron. Combinatorics: Topics, Techniques, Algorithms , 1995 .
[28] Kathleen A. S. Quinn. Some constructions for key distribution patterns , 1994, Des. Codes Cryptogr..
[29] Hanfried Lenz,et al. Design theory , 1985 .
[30] Douglas R. Stinson,et al. Bounds for Resilient Functions and Orthogonal Arrays , 1994, CRYPTO.
[31] Douglas R. Stinson,et al. Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution , 1996, CRYPTO.
[32] Douglas R Stinson,et al. Some recursive constructions for perfect hash families , 1996 .
[33] Amos Beimel,et al. Interaction in Key Distribution Schemes (Extended Abstract) , 1993, CRYPTO.
[34] Tsutomu Matsumoto,et al. Incidence structures for key sharing , 1995 .
[35] K. Gopalakrishnan. A study of correlation-immune, resilient and related cryptographic functions , 1994 .
[36] J. Komlos,et al. On the Size of Separating Systems and Families of Perfect Hash Functions , 1984 .