Distributed keyless secret sharing over noiseless channels

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2007, Pages 44-48

  Luh, William ^a   Kundur, Deepa ^a  

^a Texas A and M University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHIC KEYS; SECRET SHARING PROBLEM; TRADEOFFS;

ACOUSTIC NOISE; CHANNEL CAPACITY; PUBLIC KEY CRYPTOGRAPHY;

SECURITY OF DATA;

EID: 39349083408     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2007.16     Document Type: Conference Paper

References (7)

1. A. Shamir. How to share a secret. In Communications of the ACM 22, number 11, pages 612-613, November 1979.
2. E. D. Karnin, J. W. Greene, and M. E. Hellman. On secret sharing systems. IEEE Trans. on Information Theory, 29(1):35-41, January 1983.
3. L. H. Ozarow and A. D. Wyner. Wire-tap channel II. AT & T Bell Laboratories Technical Journal, 63(10):2135-2157, 1984.
4. Y. Luo, C. Mitrpant, and A. J. Han Vinck. Some new characters on the wire-tap channel of type II. IEEE Trans. on Information Theory, 51(3):1222-1229, March 2005.
5. T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley & Sons, New York, 2nd edition, 1991.
6. K. Bhattad and K. R. Narayanan. Weakly secure network coding. In Workshop on Network Coding, Theory, and Applications (NETCOD), pages 63-68, Riva Del Garda, Italy, April 2005.
7. T. Ho, R. Koetter, M. Médard, M. Effros, J. Shi, and D. Karger. A random linear network coding approach to multicast. IEEE Trans. on Information Theory, 52(10):4413-4430, October 2006.