Almost independence of random variables and capacity of a secrecy channel

zbMATH Open0901.94022MaRDI QIDQ1389262FDOQ1389262

Authors: Imre Csiszár 

Publication date: 8 July 1998

Published in: Problems of Information Transmission (Search for Journal in Brave)

Recommendations

• Common randomness in information theory and cryptography. I. Secret sharing
• Common randomness in information theory and cryptography. II. CR capacity
• Secrecy results for compound wiretap channels

zbMATH Keywords

cooperative secret key generationsecure transmission

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (16)

• Over-the-Air computation for distributed machine learning and consensus in large wireless networks
• Mosaics of combinatorial designs for information-theoretic security
• On inequalities between mutual information and variation
• Randomness and Dependencies Extraction via Polarization, With Applications to Slepian–Wolf Coding and Secrecy
• Strong secrecy for multiple access channels
• A lower bound on the share size of leakage-resilient secret-sharing schemes
• An independence relation for sets of secrets
• Concise and tight security analysis of the Bennett–Brassard 1984 protocol with finite key lengths
• The Sender-Excited Secret Key Agreement Model: Capacity, Reliability, and Secrecy Exponents
• Generalization of a Pinsker problem
• Semantic security for quantum wiretap channels
• Separability and the detection of hidden channels
• Common Randomness and Secret Key Capacities of Two-Way Channels
• Secrecy results for compound wiretap channels
• Distillation of secret-key from a class of compound memoryless quantum sources
• Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources

This page was built for publication: Almost independence of random variables and capacity of a secrecy channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389262)