Completeness theorems for the Abadi-Rogaway language of encrypted expressions

Journal of Computer Security

Volumn 12, Issue 1 SPEC. ISS., 2004, Pages 99-129

  Micciancio, Daniele ^a   Warinschi, Bogdan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; FORMAL LOGIC; NETWORK PROTOCOLS; PROBABILITY DISTRIBUTIONS; THEOREM PROVING;

COMPLEX PROTOCOLS; CONTROL FLOW;

SECURITY OF DATA;

EID: 0344875571     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/jcs-2004-12105     Document Type: Conference Paper

References (14)

1. M. Abadi and J. Jürgens, Formal eavesdropping and its computational interpretation, in: Proceedings of the Fourth International Symposium on Theoretical Aspects of Computer Software, Volume 2215 of LNCS, N. Kobayashi and B. Pierce, eds, Sendai, Japan, Springer-Verlag, 2001, pp. 82-94.
2. M. Abadi and P. Rogaway, Reconciling two views of cryptography (the computational soundness of formal encryption), Journal of Cryptology 15(2) (2002), 103-127.
3. J. An and M. Bellare, Does encryption with redundancy provide authenticity? in: Advances in Cryptology - EUROCRYPT 2001, Volume 2045 of LNCS, Berlin, Germany, Springer-Verlag, 2001, pp. 512-528.
4. M. Bellare, A. Desai, D. Pointcheval and P. Rogaway, Relations among notions of security for public-key encryption schemes, in: Advances in Cryptology - CRYPTO 1998, Volume 1462 of LNCS, Springer-Verlag, 1998, pp. 26-45.
5. M. Bellare and C. Namprempre, Authenticated encryption: relations among notions and analysis of the generic composition paradigm, in: Advances in Cryptology -ASIACRYPT, Volume 1976 of LNCS, Springer-Verlag, 2000, pp. 531-545.
6. V. Gligor and P. Donescu, Fast encryption and authentication: XCBC encryption and XECB authentication modes, in: Fast Software Encryption, Volume 2355 of LNCS, Springer-Verlag, 2001, pp. 92-108.
7. O. Goldreich, Foundations of Cryptography: Basic Tools, Cambridge University Press, 2001.
8. S. Goldwasser and S. Micali, Probabilistic encryption, Journal of Computer and System Science 28 (1984), 270-299.
9. J. Guttman, F.J. Thayer and L. Zuck, The faithfulness of abstract encryption, in: Proceedings of the 8th ACM Conference on Computer and Communication Security, 2001.
10. C. Jutla, Encryption modes with almost free message integrity, in: Advances in Cryptology - EUROCRYPT 2001, Volume 2045 of LNCS, B. Pfitzmann, ed., Springer-Verlag, 2001.
11. H. Krawczyk, The order of encryption and authentication for protecting communication, in: Advances in Cryptology - CRYPTO 2001, Volume 2139 of LNCS, Berlin, Germany, Springer-Verlag, 2001.
12. P. Lincoln, J. Mitchell, M. Mitchell and A. Scedrov, A probabilistic poly-time framework for protocol analysis, in: Proceedings of the 5th ACM Conference on Computer and Communications Security, 1998, pp. 112-121.
13. B. Pfitzmann, M. Schunter and M. Waidner, Cryptographic security of reactive systems, in: Electronic Notes in Theoretical Computer Science, Volume 32, 2000.
14. P. Rogaway, M. Bellare, J. Black and T. Krovetz, OCB: A block-cipher mode of operation for efficient authenticated encryption, in: Proceedings of the 8th ACM Conference on Computer and Communication security, ACM Press, 2001, pp. 196-205.