Logics for reasoning about cryptographic constructions

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 372-383

  Impagliazzo, Russell ^a   Kapron, Bruce M ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; DIGITAL ARITHMETIC; LOGIC PROGRAMMING; MATHEMATICAL MODELS; AUTHENTICATION; COMPUTER PROGRAMMING; COMPUTER SCIENCE; PROFESSIONAL ASPECTS; SECURITY OF DATA;

CRYPTOGRAPHIC PROTOCOLS; PSEUDORANDOM GENERATION;

COMPUTER SCIENCE; CRYPTOGRAPHY;

CRYPTOGRAPHIC PROTOCOLS; FIRST SYSTEMS; LOGIC; LOGICAL SYSTEM; PROGRAMMING PROFESSION;

EID: 0345412676     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. M. Abadi and A. Gordon. A calculus for cryptographic protocols: the spi calculus. Information and Computation, 148(1):1-70, 1999.
2. M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology, 2001. To appear.
3. M. Backes, B. Pfitzmann, and M. Waidner. A universally composable cryptographic library. IACR preprint, available at http://eprint.iacr.org/2003/015/.
4. M. Bellare. Practice-oriented provable-security. In E. Okamoto, G. Davida, and M. Mambo, editors, Proceedings of the 1st International Workshop on Information Security (ISW 97), volume 1396 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
5. M. Blum. Coin flipping by telephone: a protocol for solving impossible problems. In Proceedings of the 24th IEEE Spring Computer Conference, COMPCON, pages 133-137, 1982.
6. R. Boppana and R. Hirschfeld. Pseudo-random generators and complexity classes. In S. Micali, editor, Advances in Computer Research, volume 5, pages 1-26. JAI Press, 1989.
7. M. Burrows, M. Abadi, and R. Needham. A logic of authentication. Proceedings of the Royal Society of London A, 426:233-271, 1989.
8. S. Buss. Bounded Arithmetic. Bibliopolis, Naples, 1986.
9. R. Canetti. Universally composable security: a new paradigm for cryptographic protocols. In Proceedings of the 42nd IEEE Symposium on Foundations of Computing, 136-145, 2001. Full version available at http://eprint.iacr.org/2000/067.
10. A. Cobham. The intrinsic computational difficulty of functions. In A. Bar Hillel, editor, Proceedings of the International Conference on Logic, Methodology and Philosophy, pages 24-30. North Holland, 1965.
11. S. Cook. Feasibly constructive proofs and the propositional calculus. In Proceedings of the 7th Annual ACM Symposium on the Theory of Computing, pages 83-97, 1975.
12. D. Dolev and A. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, IT-29(12):198-208, 1983.
13. O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 25-32, 1989.
14. H. Keisler. Elementary Calculus: An Approach Using Infinitesimals. Prindle, Weber & Schmidt, Boston, MA, second edition, 1986.
15. 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, pages 112-121, 1998.
16. D. Micciancio and B. Warinschi. Completeness theorems for the abadi-rogaway logic of encrypted expressions. Journal of Computer Security, 2003.
17. J. Mitchell, A. Ramanthan, A. Scedrov, and V. Teague. A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report). Electronic Notes in Theoretical Computer Science, 47:1-31, 2001.
18. M. Naor. Bit commitment using pseudo-randomness. Journal of Cryptology, 4:151-158, 1991.
19. R. Parikh. Existence and feasibility in arithmetic. Journal of Symbolic Logic, 36(3):494-508, 1971.
20. P. Ryan and S. Schneider. The Modelling and Analysis of Security Protocols: the CSP Approach. Pearson Education Ltd., Harlow, England, 2001.
21. R. Smullyan. Theory of Formal Systems, volume 47 of Annals of Mathematical Studies. Princeton University Press, Princeton, NJ, 1961.
22. A. Wilkie. Modèles non standard de l'arithmétique, et complexité algorithmique. In J. Ressayre and A. Wilkie, editors, Modèles Non Standard en l'Arithmétique et Théorie des Ensembles, pages 1-45. Publications Mathématiques de l'Université Paris VII, 1985.
23. A. Yao. Theory and applications of trapdoor functions (extended abstract). In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pages 80-91, 1982.