Computational and information-theoretic soundness and completeness of formal encryption

Proceedings of the Computer Security Foundations Workshop

Volumn , Issue , 2005, Pages 170-184

  Adäo, Pedro ^a   Bana, Gergei ^b   Scedrov, Andre ^b  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; INFORMATION ANALYSIS; INFORMATION THEORY; PROBABILISTIC LOGICS;

ABADI-ROGAWAY LOGIC; CRYPTOGRAPHIC EXPRESSION; SYMMETRIC ENCRYPTION;

CRYPTOGRAPHY;

EID: 28144460109     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. M. Abadi and J. Jürjens. Formal eavesdropping and its computational interpretation. In Proc. 4th International Symposium on Theoretical Aspects of Computer Software (TACS), volume 2215 of LNCS, pages 82-94, Sendai, Japan, 2001. Springer.
2. M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology, 15(2):103-127, 2002. Preliminary version presented at IFIP TCS 2000.
3. M. Backes, B. Pfitzmann, and M. Waidner. A composable cryptographic library with nested operations. In Proc. 10th ACM Conference on Computer and Communications Security (CCS), pages 220-230, Washington D.C., USA, 2003. ACM Press. Full version available at IACR ePrint Archive, Report 2003/015, January 2003.
4. G. Bana. Soundness and Completeness of Formal Logics of Symmetric Encryption. PhD thesis, University of Pennsylvania, 2004. Available at www.math.upenn.edu/~bana/banaphdthesis.pdf. Also available at IACR ePrint Archive.
5. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pages 136-145, Las Vegas, NV, USA, 2001. IEEE Computer Society. Full version available at IACR ePrint Archive, Report 2000/067.
6. V. Cortier and B. Warinschi. Computationally sound, automated proofs for security protocols. In Proc. 14th European Symposium on Programming (ESOP), volume 3444 of LNCS, pages 157-171, Edinburgh, UK, 2005. Springer.
7. D. Dolev and A. C. Yao. On the security of public-key protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983. Preliminary version presented at FOCS'81.
8. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and Systems Sciences, 28(2):270-299, 1984. Preliminary version presented at STOC'82.
9. J.Herzog. Computational Soundness for Standard Assumptions of Formal Cryptography. PhD thesis, Massachussets Institute of Technology, 2004. Available at http://theory.lcs.mit.edu/~jherzog/papers/herzog-phd.pdf.
10. J. Herzog, M. Liskov, and S. Micali. Plaintext awareness via key registration. In Advances in Cryptology - CRYPTO 2003, volume 2729 of LNCS, pages 548-564, Santa Barbara, CA, USA, 2003. Springer.
11. O. Horvitz and V. Gligor. Weak key authenticity and the computational completeness of formal encryption. In Advances in Cryptology - CRYPTO 2003, volume 2729 of LNCS, pages 530-547, Santa Barbara, CA, USA, 2003. Springer.
12. R. Janvier, Y. Lakhnech, and L. Mazaré. Completing the picture: Soundness of formal encryption in the presence of active adversaries. In Proc. 14th European Symposium on Programming (ESOP), volume 3444 of LNCS, pages 172-185, Edinburgh, UK, 2005. Springer.
13. P. Laud. Encryption cycles and two views of cryptography. In Proc. 7th Nordic Workshop on Secure IT Systems, number 31, pages 85-100, Karlstad, Sweden, 2002. Karlstad University Studies.
14. P. Laud and R. Corin. Sound computational interpretation of formal encryption with composed keys. In Proc. 6th International Conference on Information Security and Cryptology (ICISC), volume 2971 of LNCS, pages 55-66, Seoul, Korea, 2003. Springer.
15. P. Lincoln, J. Mitchell, M. Mitchell, and A. Scedrov. A probabilistic polynomial-time framework for protocol analysis. In Proc. 5th ACM Conference on Computer and Communications Security (CCS), pages 112-121, San Francisco, CA, USA, 1998. ACM Press.
16. U. Maurer. Indistinguishability of random systems. In Advances in Cryptology - EUROCRYPT 2002, volume 2332 of LNCS, pages 110-132, Amsterdam, The Netherlands, 2002. Springer.
17. D. Micciancio and S. Panjwani. Adaptive security of symbolic encryption. In Proc. 2nd Theory of Cryptography Conference (TCC), volume 3378 of LNCS, pages 169-187, Cambridge, MA, USA, 2005. Springer.
18. D. Micciancio and B. Warinschi. Completeness theorems for the Abadi-Rogaway logic of encrypted expressions. Journal of Computer Security, 12(1):99-130, 2004. Preliminary version presented at WITS'02.
19. D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proc. 1st Theory of Cryptography Conference (TCC), volume 2951 of LNCS, pages 133-151, Cambridge, MA, USA, 2004. Springer.
20. B. Warinschi. A computational analysis of the Needham-Schroeder protocol. In Proc. 16th IEEE Computer Security Foundations Workshop (CSFW), pages 248-262, Pacific Grove, CA, USA, 2003. IEEE Computer Society.
21. A. C. Yao. Theory and applications of trapdoor functions. In 23rd IEEE Symposium on Foundations of Computer Science (FOCS), pages 80-91, Chicago, IL, USA, 1982. IEEE Computer Society.