Common Randomness and Secret Key Capacities of Two-Way Channels
From MaRDI portal
Recommendations
- Common randomness in information theory and cryptography. II. CR capacity
- The common randomness capacity of a pair of independent discrete memoryless channels
- Common randomness in information theory and cryptography. I. Secret sharing
- Common Information and Secret Key Capacity
- Almost independence of random variables and capacity of a secrecy channel
- Communication-rounds tradeoffs for common randomness and secret key generation
- Secret Key Agreement: General Capacity and Second-Order Asymptotics
- The common randomness capacity of a network of discrete memoryless channels
- Private vs. common random bits in communication complexity
- Optimal Communication Rates and Combinatorial Properties for Common Randomness Generation
Cited in
(6)- Secret key establishment over noisy channels
- The common randomness capacity of a pair of independent discrete memoryless channels
- Common randomness in information theory and cryptography. II. CR capacity
- Common randomness and secret key generation with a helper
- Communication-rounds tradeoffs for common randomness and secret key generation
- Message transmission and key establishment: conditions for equality of weak and strong capacities
This page was built for publication: Common Randomness and Secret Key Capacities of Two-Way Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3002104)