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
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,
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,
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
| Hi-index | 0.00 |
Optimistic asynchronous multi-party contract signing protocols have received attention in recent years as a compromise between efficient protocols and protocols avoiding a third party as a bottleneck of security. "Optimistic" roughly means: in case all participants are honest and receive the messages from the other participants as expected, the third party is not involved at all. The best solutions known so far terminate within t + 2 rounds in the optimistic case, for any fixed set of n signatories and allowing up to t n dishonest signatories. The protocols presented here achieve a major improvement compared to the state of the art: The number of rounds R is reduced from O(t) to O(1) for all n ≥ 2t + 1, and for n t + 1, R grows remarkably slowly compared with numbers of rounds in O(t): If t ≅ k/k+1 n then R ≅ 2k.