Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Foundations in signal processing, communications and networking

Common Randomness in Information Theory and Cryptography CR Capacity

Rudolf Ahlswede

Published Jan 1, 2021• 0 citations
Publisher
DOI
10.1007/978-3-030-65072-8_15

Related papers

The Role of Common Randomness in Information Theory and Cryptography: Secrecy Constraints

Rudolf Ahlswede

Foundations in signal processing, communications and networking•Jan 1, 2021•0 citations

Common Randomness and Secret Key Capacities of Two-Way Channels

Hadi Ahmadi, Reihaneh Safavi–Naini

Lecture notes in computer science•Jan 1, 2011•4 citations

Common randomness in information theory and cryptography. II. CR capacity

Rudolf Ahlswede, Imre Csiszár

For pt.I see ibid., vol.39, p.1121, 1993. The common randomness (CR) capacity of a two-terminal model is defined as the maximum rate of common randomness that the terminals can generate using resources specified by the given model. We determine CR capacity for several models, including those whose statistics depend on unknown parameters. The CR capacity is shown to be achievable robustly, by common randomness of nearly uniform distribution no matter what the unknown parameters are. Our CR capacity results are relevant for the problem of identification capacity, and also yield a new result on the regular (transmission) capacity of arbitrarily varying channels with feedback.

IEEE Transactions on Information Theory•Jan 1, 1998•256 citations

Common randomness and secret key generation with a helper

I.A CSISZAR, P. Narayan

Ahlswede-Csiszar (1993) and Csiszar (see Problemy Peredacii Informatsii, 1996) have addressed problems of determining the common randomness (CR) capacity and the secret key (SK) capacity for a variety of models as they arise in information theory and cryptography. We study problems of common randomness and secret key generation by a pair of terminals called the "users" with help from a third terminal, called the "helper". Noiseless one-way communication from the helper to the users as also from one user to the other, subject to rate constraints, is permitted over public channels. A situation involving a wiretapper is also considered.

IEEE International Symposium on Information Theory (ISIT)•Nov 22, 2002•12 citations

Cryptographic Constructions of Randomness Resources

Grégory Demay

•Jan 1, 2016•0 citations

Repurposing Physical Layer Secret Keys: A Novel Paradigm for Common Randomness Generation

Prashanth K. H. Sheshagiri, Juan Alberto Cabrera, Frank H. P. Fitzek

Identification is a new paradigm introduced for goal-oriented communication that verifies the semantics of the intended message rather than just transmitting the message bits, which is traditionally done in classical communication systems. One of the key techniques to improve randomized identification capacity is by introducing Common Randomness (CR). Physical Layer Secret Key (PLSK) is one such CR generation technique, where terminals generate secret keys based on changes in channel reciprocity between the wireless terminals and are mainly used for PHY layer encryption. However, the traditional way of evaluating PLSK techniques through bit discrepancies, bit generation rate, and entropy is not sufficient for evaluating their usefulness for identification. This paper proposes three key novel information theory paradigms that can be used alongside other mentioned parameters to evaluate key PLSK techniques for their usefulness in identification, i.e., CR rate, CR capacity, and cost function, followed by a supporting implementation using Software Defined Radio (SDR)s.

IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•1 citation
For pt.I see ibid., vol.39, p.1121, 1993. The common randomness (CR) capacity of a two-terminal model is defined as the maximum rate of common randomness that the terminals can generate using resources specified by the given model. We determine CR capacity for several models, including those whose statistics depend on unknown parameters. The CR capacity is shown to be achievable robustly, by common randomness of nearly uniform distribution no matter what the unknown parameters are. Our CR capacity results are relevant for the problem of identification capacity, and also yield a new result on the regular (transmission) capacity of arbitrarily varying channels with feedback.
Ahlswede-Csiszar (1993) and Csiszar (see Problemy Peredacii Informatsii, 1996) have addressed problems of determining the common randomness (CR) capacity and the secret key (SK) capacity for a variety of models as they arise in information theory and cryptography. We study problems of common randomness and secret key generation by a pair of terminals called the "users" with help from a third terminal, called the "helper". Noiseless one-way communication from the helper to the users as also from one user to the other, subject to rate constraints, is permitted over public channels. A situation involving a wiretapper is also considered.
Identification is a new paradigm introduced for goal-oriented communication that verifies the semantics of the intended message rather than just transmitting the message bits, which is traditionally done in classical communication systems. One of the key techniques to improve randomized identification capacity is by introducing Common Randomness (CR). Physical Layer Secret Key (PLSK) is one such CR generation technique, where terminals generate secret keys based on changes in channel reciprocity between the wireless terminals and are mainly used for PHY layer encryption. However, the traditional way of evaluating PLSK techniques through bit discrepancies, bit generation rate, and entropy is not sufficient for evaluating their usefulness for identification. This paper proposes three key novel information theory paradigms that can be used alongside other mentioned parameters to evaluate key PLSK techniques for their usefulness in identification, i.e., CR rate, CR capacity, and cost function, followed by a supporting implementation using Software Defined Radio (SDR)s.