A randomized protocol for signing contracts
Communications of the ACM
Value exchange systems enabling security and unobservability
Computers and Security
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Fair exchange with a semi-trusted third party (extended abstract)
Proceedings of the 4th ACM conference on Computer and communications security
Optimistic protocols for fair exchange
Proceedings of the 4th ACM conference on Computer and communications security
Optimal efficiency of optimistic contract signing
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
ACM Transactions on Computer Systems (TOCS)
Database Systems Concepts
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
A protocol for signing contracts
ACM SIGACT News - A special issue on cryptography
NetBill security and transaction protocol
WOEC'95 Proceedings of the 1st conference on USENIX Workshop on Electronic Commerce - Volume 1
Designated verifier proofs and their applications
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Round-Optimal and Abuse Free Optimistic Multi-party Contract Signing
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Optimistic Asynchronous Multi-party Contract Signing with Reduced Number of Rounds
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The dark side of threshold cryptography
FC'02 Proceedings of the 6th international conference on Financial cryptography
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
Attacking an asynchronous multi-party contract signing protocol
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Game-based verification of multi-party contract signing protocols
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Gracefully degrading fair exchange with security modules
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Selective approaches for solving weak games
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Verifiable agreement: limits of non-repudiation in mobile peer-to-peer ad hoc networks
ESAS'06 Proceedings of the Third European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Game-based verification of contract signing protocols with minimal messages
Innovations in Systems and Software Engineering
Fairness in non-repudiation protocols
STM'11 Proceedings of the 7th international conference on Security and Trust Management
| Hi-index | 0.00 |
In the contract-signing problem, participants wish to sign a contract m in such a way that either all participants obtain each others' signatures, or nobody does. A contract-signing protocol is optimistic if it relies on a trusted third party, but only uses it when participants misbehave (e.g., try to cheat, or simply crash). We construct an efficient general multi-party optimistic contract-singing protocol. The protocol is also abuse-free, meaning that at no point can a participant prove to others that he is capable of choosing whether to validate or invalidate the contract. This is the first abuse-free optimistic contract-signing protocol that has been developed for n 3 parties. We also show a linear lower bound on the number of rounds of any n-party optimistic contract-signing protocol.