Analysis of probabilistic contract signing

Journal of Computer Security

Volumn 14, Issue 6, 2006, Pages 561-589

  Norman, Gethin ^a   Shmatikov, Vitaly ^b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b University of Texas at Austin   (United States)

Author keywords

Contract signing; Probabilistic model checking; Security protocols

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER CRIME; NETWORK PROTOCOLS; SECURITY OF DATA; STRATEGIC PLANNING;

CONTRACT SIGNING; PROBABILISTIC MODEL CHECKING; SECURITY PROTOCOLS;

PROBABILISTIC LOGICS;

EID: 33845202577     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/JCS-2006-14604     Document Type: Article

References (34)

1. A. Aldini and R. Gorrieri, Security analysis of a probabilistic non-repudiation protocol, in: Proc. Second Joint Int. Workshop on Process Algebm and Probabilistic Methods, Performance Modeling and Verification (PAPM/PROBMIV), H. Hermanns and R. Segala, eds, Volume 2399 of LNCS, Springer, 2002, pp. 17-36.
2. R. Alur and T. Henzinger, Reactive modules, Formal Methods in System Design 15 (1999), 7-48.
3. N. Asokan, M. Schunter and M. Waidner, Optimistic protocols for fair exchange, in: Proc. 4th ACM Conference on Computer and Communications Security, 1997, pp. 7-17.
4. N. Asokan, V. Shoup and M. Waidner, Optimistic fair exchange of digital signatures, IEEE Selected Areas in Communications 18(4) (2000), 593-610.
5. C. Baier and M. Kwiatkowska, Model checking for a probabilistic branching time logic with fairness, Distributed Computing 11(3) (1998), 125-155.
6. M. Ben-Or, O. Goldreich, S. Micali and R. Rivest, A fair protocol for signing contracts, IEEE Transactions on Information Theory 36(1) (1990), 40-46.
7. A. Bianco and L. De Alfaro, Model checking of probabilistic and nondeterministic systems, in: Proc. Foundations of Software Technology and Theoretical Computer Science. (FST/TCS), P. Thiagarajan, ed., Volume 1026 of LNCS, Springer, 1995, pp. 499-513.
8. D. Boneh and M. Naor, Timed commitments, in: Proc. 20th Annual Int. Cryptology Conference on Advances in Cryptology (CRYPTO), C. Linnhoff-Popien and H. Hegering, eds, Volume 1880 of LNCS, Springer, 2000, pp. 236-254.
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, 2002, pp. 193-205.
11. R. Chadha, M. Kanovich and A. Scedrov, Inductive methods and contract-signing protocols, in: Proc. 8th ACM Conference on Computer and Communications Security, 2001, pp. 176-185.
12. I. Damgård, Practical and provably secure release of a secret and exchange of signatures, J. Cryptology 8(4) (1995), 201-222.
13. C. Derman, Finite-State Markovian Decision Processes, Academic Press, New York, 1970.
14. D. Dolev and A. Yao, On the security of public key protocols, IEEE Transactions on Information Theory 29(2) (1983), 198-208.
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) (1985), 637-647.
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, M. Wiener, ed., Volume 1666 of LNCS, Springer, 1999, pp. 449-466.
19. O. Goldreich, S. Goldwasser and S. Micali, How to construct random functions, J. ACM 33(4) (1986), 792-807.
20. J. Gray, Toward a mathematical foundation for information flow security, J. Computer Security 1(3) (1992), 255-294.
21. H. Hansson and B. Jonsson, A logic for reasoning about time and probability, Formal Aspects of Computing 6(5) (1994), 512-535.
22. A. Hinton, M. Kwiatkowska, G. Norman and D. Parker, PRISM: A tool for automatic verification of probabilistic systems, in: Proc. 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'06), H. Hermanns and J. Palsberg, eds, Volume 3920 of LNCS, Springer, 2006, pp. 441-444.
23. S. Kremer and J.-F. Raskin, A game-based verification of non-repudiation and fair exchange protocols, in: Proc. CONCUR'01, K. Larsen and M. Nielsen, eds, Volume 2154 of LNCS, Springer, 2001, pp. 551-565.
24. S. Kremer and J.-F. Raskin, Game analysis of abuse-free contract signing, in: Proc. 15th IEEE Computer Security Foundations Workshop, 2002, pp. 206-220.
25. P. Lincoln, J. Mitchell, M. Mitchell and A. Scedrov, Probabilistic polynomial-time equivalence and security analysis, in: Proc. World Congress on Formal Methods, J. Wing, J. Woodcock and J. Davies, eds, Volume 1708 of LNCS, Springer, 1999, pp. 776-793.
26. O. Markowitch and Y. Roggeman, Probabilistic non-repudiation without trusted third party, in: Proc. 2nd Conference on Security in Communication Networks (SCN 99), G. Persiano, ed., 1999.
27. S. Micali, Certified e-mail with invisible post offices, Presented at RSA Security Conference, 1997.
28. G. Norman and V. Shmatikov, Analysis of probabilistic contract signing, in: Proc. 1st International Conference on Formal Aspects of Security (FASec '02), A. Abdallah, P. Ryan and S. Schneider, eds, Volume 2629 of LNCS, Springer, 2003, pp. 119-128.
29. PRISM web page, http://www.cs.bham.ac.uk/~dxp/prism/.
30. M. Rabin, Transaction protection by beacons, J. Computer and System Sciences 27(2) (1983), 256-267.
31. J. Rutten, M. Kwiatkowska, G. Norman and D. Parker, Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems, P. Panangaden and F. van Breugel, eds, Volume 23 of CRM Monograph Series, American Mathematical Society, 2004.
32. V. Shmatikov and J. Mitchell, Finite-state analysis of two contract signing protocols, Theoretical Computer Science 283(2) (2002), 419-450.
33. P. Syverson and J. Gray, The epistemic representation of information flow security in probabilistic systems, in: Proc. 8th IEEE Computer Security Foundations Workshop, 1995, pp. 152-166.
34. D. Volpano and G. Smith, Probabilistic non-interference in a concurrent language, in: Proc. 11th IEEE Computer Security Foundations Workshop, 1998, pp. 34-43.