A large-deviations notion of perfect secrecy

IEEE Transactions on Information Theory

Volumn 49, Issue 2, 2003, Pages 506-508

  Merhav, Neri ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Cryptanalysis; Cryptography; Shannon cipher system

Indexed keywords

CODES (SYMBOLS); COMPUTATION THEORY; PROBABILITY; SET THEORY;

CRYPTANALYSIS;

CRYPTOGRAPHY;

EID: 0037321619     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.807301     Document Type: Article

References (6)

1. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
2. M. E. Hellman, "An extension of the Shannon theory approach to cryptography," IEEE Trans. Inform. Theory, vol. IT-23, pp. 289-294, May 1977.
3. J. L. Massey, "An introduction to contemporary cryptology," Proc. IEEE, vol. 26, pp. 533-549, May 1988.
4. U. M. Maurer, "Conditionally-perfect-secrecy and a provably-secure randomized cipher," J. Cryptol., vol. 5, pp. 53-66, 1992.
5. C. E. Shannon, "Communication theory of secrecy systems," Bell Syst. Tech. J., vol. 28, no. 3, pp. 565-715, Oct. 1949.
6. H. Yamamoto, "Rate-distortion theory for the Shannon cipher system," IEEE Trans. Inform. Theory, vol. 43, pp. 827-835, May 1997.