IEEE Transactions on Information Theory · 2000 · 328 citations · 7 references
EngineeringCommunicationComputer ScienceCryptographyDigital CommunicationInformation TheoryChannel CapacityChannel CodingInformation-theoretic CryptographyInformation-theoretic SecurityChannelsCryptographic CapacityInformation-theoretic Secrecy CapacityKey GenerationRandomness GenerationSecrecy CapacitySecret Key GenerationWiretap Channels
We consider the generation of common randomness (CR), secret or not secret, by two user terminals with aid from a "helper" terminal. Each terminal observes a different component of a discrete memoryless multiple source. The helper aids the users by transmitting information to them over a noiseless public channel subject to a rate constraint. Furthermore, one of the users is allowed to transmit to the other user over a public channel under a similar rate constraint. We study the maximum rate of CR which can be thus generated, including under additional secrecy conditions when it must be concealed from a wiretapper. Lower bounds for the corresponding capacities are provided, and single-letter capacity formulas are obtained for several special cases of interest.
7
Generalized privacy amplification
C. H. Bennett, Gilles Brassard, Claude Crépeau et al. · IEEE Transactions on Information Theory · 1995 · 1.4K citations