Coding Theorems for the Shannon Cipher System With a Guessing Wiretapper and Correlated Source Outputs

DOI10.1109/TIT.2008.921707MaRDI QIDQ3604566zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

perfect secrecycorrelated sourcescoding theoremguessing wiretapperShannon cipher system

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Cryptography (94A60)

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)