Success Exponent of Wiretapper: A Tradeoff between Secrecy and Reliability
@article{Chan2008SuccessEO, title={Success Exponent of Wiretapper: A Tradeoff between Secrecy and Reliability}, author={Chung Chan}, journal={ArXiv}, year={2008}, volume={abs/0805.3605} }
Equivocation rate has been widely used as an information-theoretic measure of security after Shannon[10]. It simplifies problems by removing the effect of atypical behavior from the system. In [9], however, Merhav and Arikan considered the alternative of using guessing exponent to analyze the Shannon's cipher system. Because guessing exponent captures the atypical behavior, the strongest expressible notion of secrecy requires the more stringent condition that the size of the key, instead of its… CONTINUE READING
Figures and Topics from this paper
4 Citations
Exact Correct-Decoding Exponent of the Wiretap Channel Decoder
- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2014
- 3
- PDF
Secrecy Rate Region of the Broadcast Channel with an Eavesdropper
- Computer Science, Mathematics
- ArXiv
- 2009
- 15
- PDF
Secure broadcasting : The secrecy rate region
- Computer Science
- 2008 46th Annual Allerton Conference on Communication, Control, and Computing
- 2008
- 40
- PDF
References
SHOWING 1-10 OF 23 REFERENCES
The Shannon cipher system with a guessing wiretapper
- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 1999
- 72
- PDF
Guessing and entropy
- Mathematics
- Proceedings of 1994 IEEE International Symposium on Information Theory
- 1994
- 453
- PDF
Broadcast channels with confidential messages
- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 1978
- 3,021
- PDF
Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)
- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 1979
- 83
A mathematical theory of communication
- Mathematics, Computer Science
- Bell Syst. Tech. J.
- 1948
- 30,418
- Highly Influential
- PDF
Universally attainable error exponents for broadcast channels with degraded message sets
- Computer Science
- IEEE Trans. Inf. Theory
- 1980
- 58