A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
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
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Abuse-Free Multi-party Contract Signing
Proceedings of the 13th International Symposium on Distributed Computing
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Optimistic Asynchronous Multi-party Contract Signing with Reduced Number of Rounds
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Efficient Optimistic N-Party Contract Signing Protocol
ISC '01 Proceedings of the 4th International Conference on Information Security
Multi-party concurrent signatures
ISC'06 Proceedings of the 9th international conference on Information Security
A topological condition for solving fair exchange in byzantine environments
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
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
Gracefully degrading fair exchange with security modules
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Fairness electronic payment protocol
International Journal of Grid and Utility Computing
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
A cryptographic model for branching time security properties: the case of contract signing protocols
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
| Hi-index | 0.00 |
We present the first optimistic n-party contract signing protocol for asynchronous networks that tolerates up to n - 1 dishonest signatories and terminates in the minimum number of rounds (O(n)). We also show how to make this protocol abuse-free by using standard cryptographic primitives (digital signatures, public-key encryption) only. Previous solutions required O(n2) rounds of communication, and non-standard cryptographic primitives for abuse freeness.