Approximated computationally bounded simulation relations for probabilistic automata

Proceedings - IEEE Computer Security Foundations Symposium

Volumn , Issue , 2007, Pages 140-154

  Segala, Roberto ^a   Turrini, Andrea ^a  

^a UNIVERSITY OF VERONA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; POLYNOMIALS; SET THEORY; THEOREM PROVING;

COMPUTATION LENGTHS; CORRECTNESS PROOFS; SEMI-FORMAL ARGUMENTS;

AUTOMATA THEORY;

EID: 35048868422     PISSN: 19401434     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSF.2007.8     Document Type: Conference Paper

References (26)

1. M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). In IFIP TCS, volume 2000 of Lecture Notes in Computer Science, pages 3-22. Springer Berlin Heidelberg, 2000.
2. M. Backes, B. Pfitzmann, and M. Waidner. A universally composable cryptographic library. Cryptology ePrint Archive, Report 2003/015, 2003.
3. M. Bellare and P. Rogaway. Entity authentication and key distribution. In CRYPTO '93: Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology, pages 232-249. Springer Verlag New York, Inc, 1994.
4. B. Blanchet. A computationally sound mechanized prover for security protocols. Cryptology ePrint Archive, Report 2005/401, 2005.
5. B. Blanchet and D. Pointcheval. Automated security proofs with sequences of games. Cryptology ePrint Archive, Report 2006/069, 2006.
6. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In The 42nd Annual Symposium on Foundations of Computer Science, pages 136-145, 2001.
7. R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch, O. Pereira, and R. Segala. Using Probabilistic I/O Automata to analyze an oblivious transfer protocol. Technical Report 2005/452, Cryptology ePrint Archive, 2005.
8. R. Canetti, L. Cheung, D. Kaynar, M. Liskov, N. Lynch, O. Pereira, and R. Segala. Time-bounded task-PIOAs: A framework for analyzing security protocols. In 20th International Symposium on Distributed Computing (DISC 2006), volume 4167 of Lecture Notes in Computer Science, pages 238-253. Springer Berlin Heidelberg, 2006.
9. D. Dolev and A. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 2(29), 1983.
10. O. Goldreich. Foundations of Cryptography: Volume 1, Basic Tools. Cambridge University Press, 2001.
11. O. Goldreich. Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press, 2004.
12. R. Janvier, Y. Lakhnech, and L. Mazare. Completing the picture: Soundness of formal encryption in the presence of active adversaries. Technical Report TR-2004-19, Verimag, 2005.
13. P. Lincoln, J. C. Mitchell, M. Mitchell, and A. Scedrov. Probabilistic polynomial-time equivalence and security analysis. In FM '99: Proceedings of the World Congress on Formal Methods in the Development of Computing Systems-Volume I, volume 1708 of Lecture Notes in Computer Science, pages 776-793. Springer Berlin Heidelberg, 1999.
14. N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
15. N. A. Lynch and M. R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In PODC '87: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pages 137-151. ACM Press, 1987.
16. D. Micciancio and B. Warinschi. Completeness theorems for the Abadi-Rogaway logic of encrypted expressions. Journal of Computer Security, 12(1):99-129, 2004.
17. R. Milner. Communication and Concurrency. Prentice-Hall International, Englewood Cleiffs, 1989.
18. J. C. Mitchell, A. Ramanathan, A. Scedrov, and V. Teague. A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols. Theoretical Computer Science, 353(1):118-164, 2006.
19. S. Mitra and N. Lynch. Approximate simulations for task-structured Probabilistic I/O Automata. In LICS Workshop on Probabilistic Automata and Logics (PAuL06), 2006.
20. B. Pfitzmann and M. Waidner. Composition and integrity preservation of secure reactive systems. In CCS '00: Proceedings of the 7th ACM Conference on Computer and Communications Security, pages 245-254. ACM Press, 2000.
21. B. Pfitzmann and M. Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In SP '01: Proceedings of the 2001 IEEE Symposium on Security and Privacy, pages 184-200. IEEE Computer Society, 2001.
22. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Department of Electrical Engineering and Computer Science, MIT, 1995. Also appears as technical report MIT/LCS/TR-676.
23. R. Segala. Probability and nondeterminism in operational models of concurrency. In CONCUR 2006 - Concurrency Theory, volume 4137 of Lecture Notes in Computer Science, pages 64-78. Springer Berlin Heidelberg, 2006.
24. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.
25. V. Shoup. A tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004/332, 2004.
26. A. Sokolova and E. P. de Vink. Probabilistic automata: System types, parallel composition and comparison. In Validation of Stochastic Systems: A Guide to Current Research, volume 2925 of Lecture Notes in Computer Science, pages 1-43. Springer Verlag Heidelberg, 2004.