COMMON RANDOMNESS IN INFORMATION-THEORY AND CRYPTOGRAPHY .1. SECRET SHARING
COMMON RANDOMNESS IN INFORMATION-THEORY AND CRYPTOGRAPHY .1. SECRET SHARING
复制标题
DOI：
10.1109/18.243431
复制
发表时间：
1993-07-01
影响因子：
2.5
通讯作者：
CSISZAR, I
中科院分区：
文献类型：
--
作者：
AHLSWEDE, R;CSISZAR, I
作为涉及远程位置的公共随机性问题研究的第一部分，考虑秘密共享的信息论模型，即在两个终端产生公共随机密钥，而不让窃听者获得关于该密钥的信息。定义了密钥容量的概念。对于几种模型，得到了密钥容量的单字母公式，对于其他模型，也得到了密钥容量的界。
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.