Time-bounded task-PIQAs: A framework for analyzing security protocols

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

Volumn 4167 LNCS, Issue , 2006, Pages 238-253

  Canetti, Ran ^a,c   Cheung, Ling ^b,c   Kaynar, Dilsun ^c   Liskov, Moses ^d   Lynch, Nancy ^c   Pereira, Olivier ^e   Segala, Roberto ^f  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d The College of William and Mary   (United States)

^e UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^f UNIVERSITY OF VERONA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; NETWORK PROTOCOLS; PROBABILITY; SCHEDULING;

COMPUTATIONAL CRYPTOGRAPHY; SECURITY PROTOCOLS; TIME-BOUNDED COMPUTATION;

SECURITY OF DATA;

EID: 33845213035     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11864219_17     Document Type: Conference Paper

References (22)

1. [BCT04] G. Barthe, J. Cerderquist, and S. Tarento. A machine-checked formalization of the generic model and the random oracle model. In Automated Reasoning: Second International Joint Conference (IJCAR), 2004.
2. [Bla05] B. Blanchet. A computationally sound mechanized prover for security protocols. Cryptology ePrint Archive, Report 2005/401, 2005. http://eprint.iacr.org/.
3. [BPW04] M. Backes, B. Pfitzmann, and M. Waidner. Secure asynchronous reactive systems. Cryptology ePrint Archive, Report 2004/082, 2004. http://eprint.iacr.org/.
4. [BR04] M. Bellare and P. Rogaway. The game-playing technique and its application to triple encryption. Cryptology ePrint Archive, Report 2004/331, 2004. http://eprint.iacr.org/.
5. [Can01] R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proceedings of the 42nd Annual Conference on Foundations of Computer Science (FOCS), 2001. Full version available at http://eprint.iacr.org/2000/067.
6. +06a] R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch, O. Pereira, and R. Segala. Task-structured probabilistic I/O automata. In Proceedings of the 8th International Workshop on Discrete Event Systems (WODES), Ann Arbor, Michigan, July 2006.
7. +06b] R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch, O. Pereira, and R. Segala. Task-structured probabilistic I/O automata. Technical Report MIT-CSAIL-TR-2006-XXX, CSAIL, MIT, Cambridge, MA, 2006.
8. +06c] R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch, O. Pereira, and R. Segala. Using task-structured probabilistic I/O automata to analyze an oblivious transfer protocol. Technical Report MIT-CSAIL-TR-2006-047, CSAIL, MIT, Cambridge, MA, June 2006.
9. [DY83] D. Dolev and A.C. Yao. On the security of public-key protocols. IEEE Transactions on Information Theory, 2(29):198-208, 1983.
10. [EGL85] S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. CACM, 28(6):637-647, 1985.
11. [GMR89] S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1):186-208, 1989.
12. [GMW87] O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proceedings of the 19th Symposium on Theory of Computing (STOC), pages 218-229, 1987.
13. [Gol01] O. Goldreich. Foundations of Cryptography, volume I Basic Tools. Cambridge Universirty Press, 2001.
14. [Hal05] S. Halevi. A plausible approach to computer-aided cryptographic proofs. Cryptology ePrint Archive, Report 2005/181, 2005. http://eprint.iacr. org/.
15. [LMMS98] P.D. Lincoln, J.C. 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 (CCS-5), pages 112-121, 1998.
16. [MMS03] P. Mateus, J.C. Mitchell, and A. Scedrov. Composition of cryptographic protocols in a probabilistic polynomial-time calculus. In Proceedings of the 14th International Conference on Concurrency Theory (CONCUR), volume 2761 of LNCS, pages 327-349, 2003.
17. [PW00] B. Pfitzmann and M. Waidner. Composition and integrity preservation of secure reactive systems. In 7th ACM Conference on Computer and Communications Security, pages 245-254, 2000.
18. [PW01] B. Pfitzmann and M. Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In IEEE Symposium on Security and Privacy, pages 184-200, 2001.
19. [RMST04] A. Ramanathan, J.C. Mitchell, A. Scedrov, and V. Teague. Probabilistic bisimulation and equivalence for security analysis of network protocols. In Proceedings of Foundations of Sotware Science and Computation Structires (FOSSACS), volume 2987 of LNCS, pages 468-483, 2004.
20. [Seg95] Roberto Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Department of Electrical Engineering and Computer Science, MIT, May 1995. Also, MIT/LCS/TR-676.
21. [Sho04] V. Shoup. Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004/332, 2004. http://eprint.iacr.org/.
22. [SL95] Roberto Segala and Nancy Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, August 1995.