Optimistic fair exchange based on publicly verifiable secret sharing

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

Volumn 3108, Issue , 2004, Pages 74-85

  Avoine, Gildas ^a   Vaudenay, Serge ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

FAIR-EXCHANGE PROTOCOLS; IN NETWORKS; OPTIMISTIC FAIR EXCHANGES; PUBLICLY VERIFIABLE SECRET SHARING; TRUSTED THIRD PARTIES; VERIFIABLE SECRET SHARING SCHEME;

SECURITY OF DATA;

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

References (15)

1. N. Asokan, Matthias Schunter, and Michael Waidner. Optimistic protocols for fair exchange. In Proceedings of 4th ACM Conference on Computer and Communications Security, pages 7-17, Zurich, Switzerland, April 1997. ACM Press.
2. N. Asokan, Victor Shoup, and Michael Waidner. Asynchronous protocols for optimistic fair exchange. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 86-99, Oakland, California, USA, May 1998. IEEE Computer Society Press.
3. Gildas Avoine and Serge Vaudenay. Fair exchange with guardian angels. In Kijoon Chae and Moti Yung, editors, The 4th International Workshop on Information Security Applications - WISA 2003, volume 2908 of Lecture Notes in Computer Science, pages 188-202, Jeju Island, Korea, August 2003. Springer-Verlag.
4. George Robert Blakley. Safeguarding cryptographic keys. In National Computer Conference, volume 48 of American Federation of Information, pages 313-317, 1979.
5. Ernest F. Brickell, David Chaum, Ivan B. Damgård, and Jeroen van de Graaf. Gradual and verifiable release of a secret. In Carl Pomerance, editor, Advances in Cryptology - CRYPTO'87, volume 293 of Lecture Notes in Computer Science, pages 156-166, Santa Barbara, CA, USA, August 1988. IACR, Springer-Verlag.
6. Benny Chor, Shafi Goldwasser, Silvio Micali, and Baruch Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. In Proceedings of the 26th IEEE Annual Symposium on Foundations of Computer Science - FOCS'85, pages 383- 395, Portland, OR, USA, October 1985. IEEE.
7. Richard Cleve. Controlled gradual disclosure schemes for random bits and their applications. In Gilles Brassard, editor, Advances in Cryptology - CRYPTO'89, volume 435 of Lecture Notes in Computer Science, pages 573-588, Santa Barbara, California, USA, August 1990. IACR, Springer-Verlag.
8. Taher El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4):469-472, July 1985.
9. Shimon Even and Yacov Yacobi. Relations amoung public key signature systems. Technical Report 175, Computer Science Department, Technicon, Haifa, Israel, 1980.
10. Eiichiro Fujisaki and Tatsuaki Okamoto. A practical and provably secure scheme for publicly veriable secret sharing and its applications. In Nyberg Kaisa, editor, Advances in Cryptology - EUROCRYPT'98, volume 1403 of Lecture Notes in Computer Science, pages 32-46, Helsinki, Finland, May-June 1998. IACR, Springer-Verlag.
11. Olivier Markowitch and Shahrokh Saeednia. Optimistic fair exchange with transparent signature recovery. In Financial Cryptography - FC'01, Lecture Notes in Computer Science, Cayman Islands, February 2001. IFCA, Springer-Verlag.
12. Berry Schoenmakers. A simple publicly verifiable secret sharing scheme and its application to electronic voting. In Michael Wiener, editor, Advances in Cryptology - CRYPTO'99, volume 1666 of Lecture Notes in Computer Science, pages 148-164, Santa Barbara, California, USA, August 1999. IACR, Springer-Verlag.
13. Adi Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, November 1979.
14. Markus Stadler. Publicly verifiable secret sharing. In Ueli Maurer, editor, Advances in Cryptology - EUROCRYPT'96, volume 1070 of Lecture Notes in Computer Science, pages 190-199, Saragossa, Spain, May 1996. IACR, Springer-Verlag.
15. Holger Vogt. Asynchronous optimistic fair exchange based on revocable items. In Rebecca N. Wright, editor, Financial Cryptography - FC'03, volume 2742 of Lecture Notes in Computer Science, Le Gosier, Guadeloupe, French West Indies, January 2003. IFCA, Springer-Verlag.