On Secret Sharing Systems

IEEE Transactions on Information Theory

Volumn 29, Issue 1, 1983, Pages 35-41

  Karnin, Ehud D ^a   Greene, Jonathan W ^a   Hellman, Martin E ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYTOGRAPHY;

EID: 0020543282     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1983.1056621     Document Type: Article

References (8)

1. G. R. Blakley, “Safeguarding cryptographic keys,” in Proc. Amer. Fed. Inform. Proc. Soc. 1979 NCC, vol. 48, pp. 313-317, June 1979.
2. A. Shamir, “How to share a secret,” in Comm. Assoc. Compul. Mach., vol. 22, no. 11, pp. 612-613, Nov. 1979.
3. A. Carleial and M. E. Hellman, “A note on Wyner's wiretap channel,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 387-390, May 1977.
4. R. Kahn, “Privacy in multiuser information theory,” Ph.D. dissertation, Dept. Electrical Engineering, Stanford University, Stanford, CA, 1979.
5. E. R. Berlekamp, R. J. McEliece, and H. C. A. van Tilborg, “On the inherent intractability of certain coding schemes,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 384-386, May 1978.
6. R. C. Singleton, “Maximum distance q-nary codes,” IEEE Trans. Inform. Theory, vol. IT-10, pp. 116-118, April 1964.
7. R. J. McEliece, “The theory of information and coding,” in The Encyclopedia of Mathematics and its Applications, vol. 3. Reading, MA: Addison-Wesley, 1977.
8. W. Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 644-654, Nov. 1976.