Guessing secrecy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7412 LNCS, Issue , 2012, Pages 1-13

  Alimomeni, Mohsen ^a   Safavi Naini, Reihaneh ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

Guessing secrecy; imperfect randomness; Information theoretic security; perfect secrecy; randomness

Indexed keywords

GUESSING SECRECY; IMPERFECT RANDOMNESS; INFORMATION-THEORETIC SECURITY; PERFECT SECRECY; RANDOMNESS;

CRYPTOGRAPHY; INFORMATION THEORY; RANDOM PROCESSES;

SECURITY OF DATA;

EID: 84865014320     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32284-6_1     Document Type: Conference Paper

References (19)

1. Shannon, C.: Communication theory of secrecy systems. Bell System Technical Journal 28, 656-715 (1949)
2. Wyner, A.D.: The wire-tap channel. Bell Syst. Tech. J. 54(8), 1355-1367 (1975)
3. Maurer, U.M.: Conditionally-perfect secrecy and a provably-secure randomized cipher. J. Cryptol. 5(1), 53-66 (1992)
4. McInnes, J.L., Pinkas, B.: On the Impossibility of Private Key Cryptography with Weakly Random Keys. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 421-435. Springer, Heidelberg (1991)
5. Dodis, Y., Spencer, J.: On the (non)universality of the one-time pad. In: Proceedings of the 43rd Symposium on Foundations of Computer Science, FOCS 2002, pp. 376-388. IEEE Computer Society, Washington, DC (2002)
6. Dodis, Y., Ong, S.J., Prabhakaran, M., Sahai, A.: On the (im)possibility of cryptography with imperfect randomness. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 196-205. IEEE Computer Society, Washington, DC (2004)
7. Bosley, C., Dodis, Y.: Does Privacy Require True Randomness? In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 1-20. Springer, Heidelberg (2007)
8. Russell, A., Wang, H.: How to Fool an Unbounded Adversary with a Short Key. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 133-148. Springer, Heidelberg (2002)
9. Dodis, Y., Smith, A.: Entropic Security and the Encryption of High Entropy Messages. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 556-577. Springer, Heidelberg (2005)
10. Cachin, C., Maurer, U.M.: Unconditional Security against Memory-Bounded Adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 292-306. Springer, Heidelberg (1997)
11. Aumann, Y., Rabin, M.O.: Information Theoretically Secure Communication in the Limited Storage Space Model. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 65-79. Springer, Heidelberg (1999)
12. Ding, Y.Z., Rabin, M.O.: Hyper-Encryption and Everlasting Security. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 1-26. Springer, Heidelberg (2002)
13. Shannon, C.: A mathematical theory of communication. Bell System Technical Journal 27, 379-423 (1948)
14. Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley Series in Telecommunications. John Wiley & Sons, Inc. (1991)
15. Cachin, C., Maurer, U.: Entropy measures and unconditional security in cryptography (1997)
16. Massey, J.L.: Guessing and entropy. In: Proceedings of the 1994 IEEE International Symposium on Information Theory, p. 204 (1994)
17. Zuckerman, D.: General weak random sources. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, SFCS 1990, vol. 2, pp. 534-543. IEEE Computer Society, Washington, DC (1990)
18. Csiszar, I., Korner, J.: Broadcast channels with confidential messages. IEEE Transactions on Information Theory 24(3), 339-348 (1978)
19. Katz, J., Lindell, Y.: Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series). Chapman & Hall/CRC (2007)