Breaking and repairing optimistic fair exchange from PODC 2003

DRM 2003: Proceedings of the Third ACM Workshop on Digital Rights Management

Volumn , Issue , 2003, Pages 47-54

  Dodis, Yevgeniy ^a   Reyzin, Leonid ^b  

^a POLYTECHNIC UNIVERSITY   (United States)

^b BOSTON UNIVERSITY   (United States)

Author keywords

Digital signatures; Fair exchange; Multisignatures; Verifiably committed signatures; Verifiably encrypted signatures

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CRYPTOGRAPHY; ELECTRONIC COMMERCE; ELECTRONICS ENGINEERING; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SECURITY OF DATA; SET THEORY; SIMULATORS; TELECOMMUNICATION NETWORKS; THEOREM PROVING;

FAIR EXCHANGE; MULTISIGNATURES; VERIFIABLY COMMITTED SIGNATURES; VERIFIABLY ENCRYPTED SIGNATURES;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 4544253137     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/947380.947387     Document Type: Conference Paper

References (22)

1. N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. In K. Nyberg, editor, Advances in Cryptology - EUROCRYPT 98, volume 1403 of Lecture Notes in Computer Science, pages 591-606. Springer-Verlag, May 31-June 4 1998.
2. N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communication, 18(4):593-610, 2000.
3. G. Ateniese. Efficient verifiable encryption (and fair exchange) of digital signatures. In G. Tsudik, editor, Sixth ACM Conference on Computer and Communication Security, pages 138-146. ACM, Nov. 1999.
4. F. Bao, R. Deng, and W. Mao. Efficient and practical fair exchange protocols with off-line TTP. In Proceedings of the IEEE Symposium on Security and Privacy, pages 77-85, 1998.
5. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proceedings of the 1st ACM Conference on Computer and Communication Security, pages 62-73, November 1993. Revised version available from http://www-cse.ucsd.edu/users/mihir/.
6. A. Boldyreva. Efficient threshold signatures, multisignatures and blind signatures based on the Gap-Diffie-Hellman-group signature scheme. In Desmedt [14].
7. D. Boneh and M. Franklin. Identity based encryption from the weil pairing. In J. Kilian, editor, Advances in Cryptology - CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 213-229. Springer-Verlag, 19-23 Aug. 2001.
8. D. Boneh, C. Gentry, B. Lynn, and H. Shacham. Aggregate and verifiably encrypted signatures from bilinear maps. In E. Biham, editor, Advances in Cryptology - EUROCRYPT 2003, Lecture Notes in Computer Science, pages 416-432. Springer-Verlag, 4 May-8 May 2003.
9. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the weil pairing. In C. Boyd, editor, Advances in Cryptology - ASIACRYPT 2001, volume 2248 of Lecture Notes in Computer Science, pages 514-532, Gold Coast, Australia, 9-13 Dec. 2001. Springer-Verlag.
10. J. Camenisch and I. B. Damgård. Verifiable encryption, group encryption, and their applications to group signatures and signature sharing schemes. In T. Okamoto, editor, Advances in Cryptology - ASIACRYPT 2000, volume 1976 of Lecture Notes in Computer Science, pages 331-345, Kyoto, Japan, 3-7 Dec. 2000. Springer-Verlag.
11. J. Camenisch and A. Lysyanskaya. Signature schemes with efficient protocols. In Conference on Security in Communication Networks (SCN), 2002.
12. D. Chaum. Designated confirmer signatures. In A. De Santis, editor, Advances in Cryptology - EUROCRYPT 94, volume 950 of Lecture Notes in Computer Science, pages 86-91. Springer-Verlag, 1995, 9-12 May 1994.
13. J.-S. Coron and D. Naccache. Boneh et al's k-element aggregate extraction assumption is equivalent to the Diffie-Hellman assumption. In C. Laih, editor, Advances in Cryptology - ASIACRYPT-2003, Taipei, Taiwan, Nov 30 - Dec 4, 2003. Springer-Verlag.
14. Y. Desmedt, editor. 6th International Workshop on Practice and Theory in Public Key Cryptosystems - PKC 2003, volume 2567 of Lecture Notes in Computer Science. Springer-Verlag, Jan. 2003.
15. Y. Dodis. Efficient construction of (distributed) verifiable random functions. In Desmedt [14].
16. C. Gentry and A. Silverberg. Hierarchical id-based cryptography. In Y. Zheng, editor, Advances in Cryptology - ASIACRYPT-2002, volume 2501 of Lecture Notes in Computer Science, Queenstown, New Zealand, 1-5 Dec. 2002. Springer-Verlag.
17. A. Joux. A one-round protocol for tripartite Diffie-Hellman. In ANTS-IV Conference, volume 1838 of Lecture Notes in Computer Science, pages 385-394. Spring-Verlag, 2000.
18. A. Joux and K. Nguyen. Separating decision Diffie-Hellman from Diffie-Hellman in cryptographic groups. IACR E-print Archive. Available from http://eprint.iacr.org/2001/003/, 2001.
19. N. Koblitz. A Course in Number Theory and Cryptography (second edition). Springer Verlag, New York, NY, 1994.
20. A. Lysyanskaya. Unique signatures and verifiable random functions from the DH-DDH separation. In M. Yung, editor, Advances in Cryptology - CRYPTO 2002, Lecture Notes in Computer Science. Springer-Verlag, 18-22 Aug. 2002.
21. S. Micali, K. Ohta, and L. Reyzin. Accountable-subgroup multisignatures. In Eighth ACM Conference on Computer and Communication Security, pages 245-254. ACM, Nov. 5-8 2001.
22. J. M. Park, E. Chong, H. Siegel, and I. Ray. Constructing fair exchange protocols for E-commerce via distributed computation of RSA signatures. In 22-th Annual ACM Symp. on Principles of Distributed Computing, pages 172-181, 13-16 July 2003.