Common randomness in information theory and cryptography. I. Secret sharing
- 1 July 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 39 (4) , 1121-1132
- https://doi.org/10.1109/18.243431
Abstract
As the first part of a study of problems involving common randomness at distance locations, information-theoretic models of secret sharing (generating a common random key at two terminals, without letting an eavesdropper obtain information about this key) are considered. The concept of key-capacity is defined. Single-letter formulas of key-capacity are obtained for several models, and bounds to key-capacity are derived for other modelsKeywords
This publication has 2 references indexed in Scilit:
- Two proofs of Pinsker's conjecture concerning arbitrarily varying channelsIEEE Transactions on Information Theory, 1991
- Channel capacities for list codesJournal of Applied Probability, 1973