Analysis of probabilistic contract signing

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

Volumn 2629, Issue , 2003, Pages 81-96

  Norman, Gethin ^a   Shmatikov, Vitaly ^b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK SECURITY;

ATTACK STRATEGIES; FAIRNESS GUARANTEE; HIGH PROBABILITY; PROBABILISTIC CONTRACTS; PROBABILISTIC MODELING; PROBABILISTIC SECURITIES;

MODEL CHECKING;

EID: 35248866592     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40981-6_9     Document Type: Article

References (31)

1. A. Aldini and R. Gorrieri. Security analysis of a probabilistic non-repudiation protocol. In Proc. PAPM/PROBMIV'02, volume 2399 of LNCS, pages 17-36. Springer-Verlag, 2002.
2. R. Alur and T. Henzinger. Reactive modules. Formal Methods in System Design, 15:7-48, 1999.
3. N. Asokan, M. Schunter, and M. Waidner. Optimistic protocols for fair exchange. In Proc. 4th ACM Conference on Computer and Communications Security, pages 7-17, 1997.
4. N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. IEEE Selected Areas in Communications, 18(4):593-610, 2000.
5. C. Baier and M. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11 (3):125-155, 1998.
6. M. Ben-Or, O. Goldreich, S. Micali, and R. Rivest. A fair protocol for signing contracts. IEEE Transactions on Information Theory, 36(1):40-46, 1990.
7. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Proc. Foundations of Software Technology and Theoretical Computer Science, volume 1026 of LNCS, pages 499-513. Springer-Verlag, 1995.
8. D. Boneh and M. Naor. Timed commitments. In Proc. CRYPTO'00, volume 1880 of LNCS, pages 236-254. Springer-Verlag, 2000.
9. L. Buttyán and J.-P. Hubaux. Toward a formal model of fair exchange - a game theoretic approach. Technical Report SSC/1999/39, Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland, 1999.
10. L. Buttyán, J.-P. Hubaux, and S. Čapkun. A formal analysis of Syverson's rational exchange protocol. In Proc. 15th IEEE Computer Security Foundations Workshop, pages 193-205, 2002.
11. R. Chadha, M. Kanovich, and A. Scedrov. Inductive methods and contract-signing protocols. In Proc. 8th ACM Conference on Computer and Communications Security, pages 176-185, 2001.
12. I. Damgård. Practical and provably secure release of a secret and exchange of signatures. J. Cryptology, 8(4):201-222, 1995.
13. C. Derman. Finite-State Markovian Decision Processes. New York: Academic Press, 1970.
14. D. Dolev and A. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983.
15. S. Even. A protocol for signing contracts. Technical Report 231, Computer Science Dept., Technion, Israel, 1982.
16. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28(6):637-647, 1985.
17. S. Even and Y. Yacobi. Relations among public key signature schemes. Technical Report 175, Computer Science Dept., Technion, Israel, 1980.
18. J. Garay, M. Jakobsson, and P. MacKenzie. Abuse-free optimistic contract signing. In Proc. CRYPTO'99, volume 1666 of LNCS, pages 449-466. Springer-Verlag, 1999.
19. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. J. ACM, 33(4):792-807, 1986.
20. J. Gray. Toward a mathematical foundation for information flow security. J. Computer Security, 1(3):255-294, 1992.
21. H. Hansson and B. Jonsson. A logic for reasoning about time and probability. Formal Aspects of Computing, 6(5):512-535, 1994.
22. S. Kremer and J.-F. Raskin. A game-based verification of non-repudiation and fair exchange protocols. In Proc. CONCUR'01, volume 2154 of LNCS, pages 551-565. Springer-Verlag, 2001.
23. S. Kremer and J.-F. Raskin. Game analysis of abuse-free contract signing. In Proc. 15th IEEE Computer Security Foundations Workshop, pages 206-220, 2002.
24. M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic, symbolic model checker. In Proc. TOOLS'02, volume 2324 of LNCS, pages 200-204. Springer-Verlag, 2002.
25. P. Lincoln, J. Mitchell, M. Mitchell, and A. Scedrov. Probabilistic polynomial-time equivalence and security analysis. In Proc. World Congress on Formal Methods, volume 1708 of LNCS, pages 776-793. Springer-Verlag, 1999.
26. O. Markowitch and Y. Roggeman. Probabilistic non-repudiation without trusted third party. In Proc. 2nd Conference on Security in Communication Networks, 1999.
27. S. Micali. Certified e-mail with invisible post offices. Presented at RSA Security Conference, 1997.
28. PRISM web page. http://www.cs.bham.ac.uk/~dxp/prism/.
29. V. Shmatikov and J. Mitchell. Finite-state analysis of two contract signing protocols. Theoretical Computer Science, 283(2):419-450, 2002.
30. P. Syverson and J. Gray. The epistemic representation of information flow security in probabilistic systems. In Proc. 8th IEEE Computer Security Foundations Workshop, pages 152-166, 1995.
31. D. Volpano and G. Smith. Probabilistic non-interference in a concurrent language. In Proc. 11th IEEE Computer Security Foundations Workshop, pages 34-43, 1998.