Task-structured probabilistic I/O automata

Proceedings - Eighth International Workshop on Discrete Event Systems, WODES 2006

Volumn , Issue , 2006, Pages 207-214

  Canetti, Ran ^a,c   Cheung, Ling ^b   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 Dept of Economics and Thomas Jefferson Program in Public Policy at 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

COMPUTER SIMULATION; CRYPTOGRAPHY; EQUIVALENCE CLASSES; INPUT OUTPUT PROGRAMS; PROBABILISTIC LOGICS; PROBABILITY;

CRYPTOGRAPHIC PROTOCOL ANALYSIS; PROBABILISTIC I/O AUTOMATA (PIOA);

FINITE AUTOMATA;

EID: 34250771232     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WODES.2006.1678432     Document Type: Conference Paper

References (28)

1. J. Aspnes and M. Herlihy. Fast randomized consensus using shared memory. Journal of Algorithms, 11(3):441-461, 1990.
2. J. Aspnes. Randomized protocols for asynchronous consensus. Distributed Computing, 16(2-3):165-175, 2003.
3. M. Ben-Or. Another advantage of free choice: completely asynchronous agreement protocols. In Proc. 2nd ACM Symposium on Principles of Distributed Computing, pages 27-30, Montreal, Quebec, Canada, August 1983.
4. R. Canetti. Universally composable security: a new paradigm for cryptographic protocols. In Proc. 42nd IEEE Symposium on Foundations of Computing, pages 136-145, 2001.
5. 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 MIT-LCS-TR-1001a, MIT CSAIL, 2005.
6. 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-023, MIT CSAIL, 2006.
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 MIT-CSAIL-TR-2006-019, MIT CSAIL, 2006.
8. L. Cheung and M. Hendriks. Causal dependencies in parallel composition of stochastic processes. Technical Report ICIS-R05020, Institute for Computing and Information Sciences, University of Nijmegen, 2005.
9. T.D. Chandra. Polylog randomized wait-free consensus. In Proc. 15th ACM Symposium on Principles of Distributed Computing, pages 166-175, 1996.
10. L. Cheung, N. Lynch, R. Segala, and F. Vaandrager. Switched PIOA: Parallel composition via distributed scheduling. To appear in TCS, Special Issue on FMCO 2004.
11. L. de Alfaro. The verification of probabilistic systems under memoryless partial-information policies is hard. In Proc. PROBMIV 99, pages 19-32, 1999.
12. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proc. 19th ACM Symposium on Theory of Computing (STOC), pages 218-229, 1987.
13. O. Goldreich. Foundations of Cryptography: Basic Tools, volume I. Cambridge University Press, 2001.
14. L.P. Kaelbling, M.L. Littman, and A.R. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101:99-134, 1998.
15. P. Lincoln, J.C. Mitchell, M. Mitchell, and A. Scedrov. A probabilistic poly-time framework for protocol analysis. In ACM Conference on Computer and Communications Security, pages 112-121, 1998.
16. N.A. Lynch, I. Saias, and R. Segala. Proving time bounds for randomized distributed algorithms. In Proc. 13th ACM Symposium on the Principles of Distributed Computing, pages 314-323, 1994.
17. N.A. Lynch, R. Segala, and F.W. Vaandrager. Compositionality for probabilistic automata. In Proc. 14th International Conference on Concurrency Theory (CONCUR 2003), volume 2761 of LNCS, pages 208-221. Springer-Verlag, 2003.
18. N.A. Lynch and M.R. Turtle. An introduction to input/output automata. CWI Quarterly, 2(3):219-246, September 1989.
19. P. Mateus, J.C. Mitchell, and A. Scedrov. Composition of cryptographic protocols in a probabilistic polynomial-time process calculus. In Proc. 14th International Conference on Concurrency Theory (CONCUR 2003), pages 323-345, 2003.
20. A. Pogosyants, R. Segala, and N.A. Lynch. Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. Distributed Computing, 13(3):155-186, 2000.
21. M.L. Puterman. Markov Decision Process - Discrete Stochastic Dynamic Programming. John Wiley & Sons, Inc., New York, NY, 1994.
22. B. Pfitzman and M. Waidner. Composition and integrity preservation of secure reactive systems. In Proc. 7th ACM Conference on Computer and Communications Security (CCS 2000), pages 245-254, 2000.
23. B. Pfitzman and M. Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In Proc. IEEE Symposium on Research in Security and Privacy, pages 184-200, 2001.
24. M. Rabin. The choice coordination problem. Acta Informatica, 17:121-134, 1982.
25. A. Sokolova and E.P. de Vink. Probabilistic automata: system types, parallel composition and comparison. In Validation of Stochastic Systems, volume 2925 of LNCS, pages 1-43. Springer-Verlag, 2004.
26. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, June 1995. Available as Technical Report MIT/LCS/TR-676.
27. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.
28. M.I.A. Stoelinga and F.W. Vaandrager. Root contention in IEEE 1394. In Proc. 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems, volume 1601 of LNCS, pages 53-74. Springer-Verlag, 1999.