Common randomness in information theory and cryptography. I. Secret sharing
Rudolf Ahlswede, Imre Csiszár · IEEE Transactions on Information Theory · 1993
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 models.>