Optimistic fair exchange in a multi-user setting

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

Volumn 4450 LNCS, Issue , 2007, Pages 118-133

  Dodis, Yevgeniy ^a   Lee, Pil Joong ^b   Yum, Dae Hyun ^b  

^a POLYTECHNIC UNIVERSITY   (United States)

^b Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; MATHEMATICAL MODELS; NUMERICAL METHODS; USER INTERFACES;

GENERIC CONSTRUCTION; MULTI-USER SECURITY; MULTI-USER SETTING; OPTIMISTIC FAIR EXCHANGE;

PUBLIC KEY CRYPTOGRAPHY;

EID: 38049080574     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71677-8_9     Document Type: Conference Paper

References (32)

1. N. Asokan, M. Schunter, and M. Waidner. Optimistic protocols for fair exchange. ACM CCS, pages 7-17. ACM, 1997.
2. N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures (extended abstract). EUROCRYPT 1998, pages 591-606, 1998.
3. 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.
4. M. Bellare, A. Boldyreva, and S. Micali. Public-key encryption in a multi-user setting: Security proofs and improvements. EUROCRYPT 2000, pages 259-274.
5. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. ACM CCS, pages 62-73, 1993.
6. A. Boldyreva. Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. PKC 2003, pages 31-46, 2003.
7. D. Boneh, X. Boyen, and H. Shacham. Short group signatures. CRYPTO 2004, pages 41-55, 2004.
8. D. Boneh, C. Gentry, B. Lynn, and H. Shacham. Aggregate and verifiably encrypted signatures from bilinear maps. EUROCRYPT 2003, pages 416-432, 2003.
9. J. Camenisch and I. Damgård. Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes. ASI-ACRYPT 2000, pages 331-345, 2000.
10. J. Camenisch and A. Lysyanskaya. A signature scheme with efficient protocols. In SCN 2002, pages 268-289, 2002.
11. J. Camenisch and A. Lysyanskaya. Signature schemes and anonymous credentials from bilinear maps. CRYPTO 2004, pages 56-72, 2004.
12. R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. CRYPTO 1994, pages 174-187, 1994.
13. Y. Dodis, P.J. Lee, and D.H. Yum. Optimistic fair exchagne in a multi-user setting. IACR ePrint Archive, http://eprint.iacr.org/, 2007.
14. Y. Dodis and L. Reyzin. Breaking and repairing optimistic fair exchange from PODC 2003. 2003 ACM Workshop on Digital Rights Management, pages 47-54.
15. U. Feige and A. Shamir. Zero knowledge proofs of knowledge in two rounds. CRYPTO 1989, pages 526-544, 1989.
16. U. Feige and A. Shamir. Witness indistinguishable and witness hiding protocols. the 22nd STOC, pages 416-426. ACM, 1990.
17. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. CRYPTO 1986, pages 186-194, 1986.
18. S. D. Galbraith, J. Malone-Lee, and N. P. Smart. Public key signatures in the multi-user setting. Inf. Process. Lett., 83(5):263-266, 2002.
19. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J. ACM, 38(3):691-729, 1991.
20. S. Goldwasser and S. Micali. Probabilistic encryption. J. Comput. Syst. Sci., 28(2):270-299, 1984.
21. S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput., 17(2):281-308, 1988.
22. L. C. Guillou and J.-J. Quisquater. A "paradoxical" indentity-based signature scheme resulting from zero-knowledge. CRYPTO 1988, pages 216-231, 1988.
23. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications, the 21st STOC, pages 33-43. ACM, 1989.
24. J. M. Park, E. K. P. Chong, and H. J. Siegel. Constructing fair-exchange protocols for e-commerce via distributed computation of RSA signatures. PODC 2003, pages 172-181. ACM, 2003.
25. R. Pass. On deniability in the common reference string and random oracle model. CRYPTO 2003, pages 316-337, 2003.
26. D. Pointcheval and J. Stern. Security proofs for signature schemes. EUROCRYPT 1996, pages 387-398, 1996.
27. C. Rackoff and D. R. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. CRYPTO 1991, pages 433-444, 1991.
28. J. Rompel. One-way functions are necessary and sufficient for secure signatures. the 22nd STOC, pages 387-394. ACM, 1990.
29. A. Sahai. Non-malleable non-interactive zero knowledge and adaptive chosenciphertext security. the 40th FOCS, pages 543-553. IEEE, 1999.
30. A. D. Santis and G. Persiano. Zero-knowledge proofs of knowledge without interaction. the 33rd FOCS, pages 427-436. IEEE, 1992.
31. C.-P. Schnorr. Efficient identification and signatures for smart cards. CRYPTO 1989, pages 239-252, 1989.
32. H. Zhu and F. Bao. Stand-alone and setup-free verifiably committed signatures. CT-RSA 2006, pages 159-173, 2006.