Rohit Chadha John C. Mitchell Andre Scedrov Vitaly Shmatikov University of...  Home/Search
Context
Related
| upenn.edu/pub/pape...ss_optimjlap.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: upenn.edu/~scedro...recent_papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A contract signing protocol lets two parties exchange digital signatures on a preagreed text. Optimistic contract signing protocols enable the signers to do so without invoking a trusted third party. However, an adjudicating third party remains available should one or both signers seek timely resolution. We analyze optimistic contract signing protocols using a game-theoretic approach and prove a fundamental impossibility result: in any fair, optimistic, timely protocol, an optimistic player... (Update)
Active bibliography (related documents): More All
1.2: Analysis of Probabilistic Contract Signing - Norman, Shmatikov (2002) (Correct)
1.0: Contract Signing, Optimism, and Advantage - Chadha, Mitchell, Scedrov.. (Correct)
0.5: Fair Exchange - Pagnia, Vogt, Gärtner (2001) (Correct)
Similar documents based on text: More All
0.3: Analysis of Abuse-Free Contract Signing - Shmatikov, Mitchell (2000) (Correct)
0.3: Analysis of a Fair Exchange Protocol - Shmatikov, Mitchell (1999) (Correct)
0.2: Finite-State Analysis of Two Contract Signing Protocols - Shmatikov, Mitchell (2001) (Correct)
BibTeX entry: (Update)
@misc{ john-contract,
author = "Rohit Chadha John",
title = "Contract Signing, Optimism, and Advantage",
url = "citeseer.ist.psu.edu/722899.html" }
Citations (may not include all citations):739 Impossibility of distributed consensus with one faulty proce.. (context) - Fischer, Lynch et al. - 1985
604 Reasoning about Knowledge (context) - Fagin, Halpern et al. - 1995
404 A calculus for cryptographic protocols: the spicalculus - Abadi, Gordon - 1999
254 Theoretical Computer Science (context) - Berry, Boudol et al. - 1992
194 Knowledge and Belief (context) - Hintikka - 1962
131 Optimistic fair exchange of digital signatures - Asokan, Shoup et al. - 2000
104 A meta-notation for protocol analysis - Cervesato, Durgin et al. - 1999
100 Optimistic protocols for fair exchange - Asokan, Schunter et al. - 1997
99 Foundations of Cryptography: Basic Tools (context) - Goldreich - 2001
97 the security of public-key protocols (context) - Dolev, Yao - 1981
90 Strand spaces: Why is a security protocol correct (context) - Thayer, abrega et al. - 1998
80 A semantic model for authentication protocols - Woo, Lam - 1993
78 A fair non-repudiation protocol - Zhou, Gollmann - 1996
60 Asynchronous protocols for optimistic fair exchange - Asokan, Shoup et al. - 1998
42 Abuse-free optimistic contract signing - Garay, Jakobsson et al. - 1999
36 RSA-based undeniable signatures - Gennaro, Rabin et al. - 2000
33 Advances in Cryptology - Proceedings of CRYPTO (context) - Boyar, Chaum et al. - 1990
30 IEEE Transactions on Information Theory (context) - Ben-Or, Goldreich et al. - 1990
28 Inductive methods and contract signing protocols - Chadha, Kanovich et al. - 2001
24 Game analysis of abuse-free contract signing - Kremer, Raskin - 2002
19 line fair payment protocols using convertible signatures (context) - Boyd, Foo - 1998
17 the impossibility of fair exchange without a trusted third p.. - Pagnia, Gaertner - 1999
13 Optimistic fair exchange with transparent signature recovery - Markowitch, Saeednia - 2001
11 Designated veri er proofs and their applications (context) - Jakobsson, Sako et al. - 1996
9 Relations among public key signature schemes (context) - Even, Yacobi - 1980
7 Analysis of security protocols - Durgin, Mitchell - 1999
6 Computing by multiset transformation (context) - Banatre, Le Metayer - 1993
5 Modeling adversaries in a logic for security protocol analys.. - Pucella, Halpern - 2002
4 Timed commitments and applications (context) - Boneh, Naor - 2000
4 A comparison between strand spaces and multiset rewriting fo.. - Cervesato, Durgin et al. - 2002
3 Toward a formal model of fair exchange | a game theoretic ap.. (context) - Butty, Hubaux - 1999
3 Practical and provably secure release of a secret and exchan.. (context) - Damg - 1995
3 A game-based veri cation of non-repudiation and fair exchang.. (context) - Kremer, Raskin - 2001
Documents on the same site (http://www.cis.upenn.edu/~scedrov/recent_papers.html): More
The Undecidability of Second Order Multiplicative Linear Logic - Yves Lafont (1996) (Correct)
Phase Semantics for Light Linear Logic - Kanovich, Okada, Scedrov (1997) (Correct)
Optimization Complexity of Linear Logic Proof Games - Lincoln, Mitchell, Scedrov (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC