Coding Theorems for the Shannon Cipher System With a Guessing Wiretapper and Correlated Source Outputs
From MaRDI portal
Publication:3604566
DOI10.1109/TIT.2008.921707zbMATH Open1305.94022OpenAlexW2070485658WikidataQ121088628 ScholiaQ121088628MaRDI QIDQ3604566FDOQ3604566
Authors:
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2008.921707
Recommendations
- Coding theorems for Shannon's cipher system with correlated source outputs, and common information
- A large-deviations notion of perfect secrecy
- The Shannon cipher system with a guessing wiretapper
- A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers (Corresp.)
- On the shannon cipher system with a capacity-limited key-distribution channel
Cited In (5)
- On secret sharing communication systems with two or three channels
- The Shannon cipher system with a guessing wiretapper
- Coding theorem for secret sharing communication systems with two noisy channels
- A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers (Corresp.)
- On the shannon cipher system with a capacity-limited key-distribution channel
This page was built for publication: Coding Theorems for the Shannon Cipher System With a Guessing Wiretapper and Correlated Source Outputs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604566)