Weak key authenticity and the computational completeness of formal encryption

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

Volumn 2729, Issue , 2003, Pages 530-547

  Horvitz, Omer ^a   Gligor, Virgil ^b  

^a University of Maryland ^*  (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

Authentication; Completeness; Cryptography; Encryption; Formal Reasoning; Weak Key Authenticity

Indexed keywords

AUTHENTICATION; FORMAL LANGUAGES; FORMAL METHODS; SECURITY OF DATA; SEMANTICS;

COMPLETENESS; COMPUTATIONAL COMPLETENESS; COMPUTATIONAL SEMANTICS; ENCRYPTION SCHEMES; FORMAL ENCRYPTION; FORMAL REASONING; SYMMETRIC ENCRYPTION; WEAK KEY;

CRYPTOGRAPHY;

EID: 24144446250     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45146-4_31     Document Type: Article

References (15)

1. M. Abadi, J. Jurgens. Formal Eavesdropping and its Computational Interpretation. In Proc. of the Fourth International Symposium on Theoretical Aspects of Computer Software (TAGS 2001), 2001.
2. M. Abadi, P. Rogaway. Reconciling Two Views of Cryptography (the computational soundness of formal encryption). In Journal of Cryptology, vol. 15, no. 2, pp. 103-128.
3. (also in Proc. of the First IFIP International Conference on. Theoretical Computer Science, LNCS vol. 1872, pp. 3-22, Springer Verlag, Berlin, August 2000.)
4. M. Bellare, A. Boldyreva, A. Desai, D. Pointcheval. Key-Privacy in Public-Key Encryption. In Advances in Cryptology - ASIACRYPT 2001, LNCS vol. 2248,pp. 566-582, Springer Verlag, 2001.
5. M. Bellare, A. Desai, E. Jokipii, P. Rogaway. A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS 97), 1997.
6. M. Bellare, C. Namprempre. Authenticated Encryption: Relations Among Notions and Analysis of the Generic Composition Paradigm. In Advances in Cryptology - ASIACRYPT 2000, LNCS vol. 1976, pp. 541-545, Springer Verlag, 2000.
7. O. Goldreich, S. Goldwasser, S. Micali. How to Construct Random Functions. In Journal of the ACM, vol. 33, no. 4, pp. 792-807, 1986.
8. S. Goldwasser, S. Micali. Probabilistic Encryption. In Journal of Computer and System Sciences, 28:270-299, April 1984.
9. O. Horvitz, V. Gligor. Weak Key Authenticity and the Computational Completeness of Formal Encryption. Full version available at http://www.cs.umd.edu/∼horvitz, http://www.ee.umd.edu/∼gligor
10. J. Katz, M. Yung. Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation. In Proceedings of the 7th International Workshop on Fast Software Encryption (FSE 2000), LNCS vol. 1978, pp. 284-299, Springer Verlag, 2000.
11. J. W. Lloyd. Foundations of Logic Programming. Second Edition, Springer-Verlag, 1987, section 1.5.
12. J. L. Lassez, V. L. Nguyen, E. A. Sonenberg. Fixpoint Theorems and Semantics: a Folk Tale. In Information Processing Letters, vol. 14, no. 3, 1982, pp. 112-116.
13. D. Micciancio, B. Warinschi. Completeness Theorems for the Abadi-Rogaway Language of Encrypted Expressions. In Journal of Computer Security (to appear).
14. Also in Proceedings of the Workshop on Issues in the Theory of Security, 2002.
15. A. Tarski. A Lattice-theoretical Fixpoint Theorem and its Applications. In Pacific Journal of Mathematics, vol. 5, pp.285-309, 1955.