Common Randomness in Information Theory and Cryptography—Part I: Secret Sharing

Abstract

As the first part of a study of problems involving common randomness at distant locations, information—theoretic models of secret sharing, i.e., of generating a common random key at two terminals, without letting an eavesdropper obtain information about this key, is 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 also for other models. © 1993, IEEE. All rights reserved.