Analysis and improvement of Micali's fair contract signing protocol

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3108, Issue , 2004, Pages 176-187

  Bao, Feng ^a   Wang, Guilin ^a   Zhou, Jianying ^a   Zhu, Huafei ^a  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

CONTRACT SIGNING; CONTRACT-SIGNING PROTOCOLS; DILEMMA SITUATION; EXCHANGE PROTOCOLS; TRUSTED PARTY; US PATENTS;

SECURITY OF DATA;

EID: 35048881612     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27800-9_16     Document Type: Article

References (19)

1. N. Asokan, V. Shoup, and M. Waidner. Asynchronous protocols for optimistic fair exchange. 1998 IEEE Symposium on Security and Privacy, pages 86-99, 1998.
2. B. Baum-Waidner. Optimistic asynchronous multi-party contract signing with reduced number of rounds. ICALP'01, LNCS 2076, pages 898-911, Springer, 2001.
3. M. Bellare and P. Rogaway. Optimal asymmetric encryption - How to encrypt with RSA. Eurocrypt'94, LNCS 950, pages 92-111, Springer, 1994.
4. M. Ben-Or, O. Goldreich, S. Micali, and R. L. Rivest. A fair protocol for signing contracts. IEEE Transactions on Information Theory, 36(1): 40-46, 1990.
5. R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. Crypto'98, LNCS 1462, pages 13-25, Springer, 1998.
6. I. B. Damgård. Practical and provably secure release of a secret and exchange of signatures. Journal of Cryptology, 8(4): 201-222, 1995.
7. D. Dolev, D. Dwork, and N. Naor. Non-meallleable cryptography. 1992 IEEE Symposium on Foundations of Computer Science, 1992.
8. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28(6):637-647, 1985.
9. S. Even and Y. Yacobi. Relations among public key signature schemes. Technical Report 175, Computer Science Dept., Technion, Israel, 1980.
10. J. L. Ferrer-Gomila, M. Payeras-Capella, and L. Huguet-Rotger. Efficient optimistic n-party contract signing protocol 2001 Information Security Conference, LNCS 2200, pages 394-407, Springer, 2001.
11. E. Rujisaki, T. Okamoto, D. Pointcheval, and J. Stern. RSA-OAEP is secure under the RSA assumption. Crypto'01, LNCS 2139, pages 260-274, Springer, 2001.
12. J. Garay, M. Jakobsson, and P. MacKenzie. Abuse-free optimistic contract signing. Crypto'99, LNCS 1666, pages 449-466, Sprnger, 1999.
13. J. Garay and P. MacKenzie. Abuse-free multi-party contract signing. 1999 International Symposium on Distributed Computing, LNCS 1693, pages 151-165, Springer, 1999.
14. O. Goldreich. A simple protocol for signing contracts. Crypto'83, pages 133-136, Plenum Press, 1984.
15. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attack. SIAM Journal of Computing, 17(2):281-308, 1988.
16. S. Micali. Simultaneous electronic transactions. US Patent No. 5666420, September 1997.
17. S. Micali. Simple and fast optimistic protocols for fair electronic exchange. 2003 ACM Symposium on Principles of Distributed Computing, pages 12-19, 2003.
18. B. Pfitzmann, M. Schunter, and M. Waidner. Optimal efficiency of optimistic contract signing. 1998 ACM Symposium on Principles of Distributed Computing, pages 113-122, 1998.
19. V. Shoup. OAEP reconsidered. Journal of Cryptology, 15(4): 223-249, 2002.