Stand-alone and setup-free verifiably committed signatures

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

Volumn 3960 LNCS, Issue , 2006, Pages 159-173

  Zhu, Huafei ^a   Bao, Feng ^a  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

Author keywords

Off line fair exchange; Setup free; Stand alone property; Verifiably committed signature

Indexed keywords

COMPUTER CRIME; CRYPTOGRAPHY; PROBLEM SOLVING; SECURITY OF DATA; VIRTUAL REALITY; AUTHENTICATION; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

OFF LINE FAIR EXCHANGE; SETUP FREE; STAND ALONE PROPERTY; VERIFIABLY COMMITTED SIGNATURE;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; CRYPTOGRAPHY;

CHOSEN MESSAGE ATTACKS; FAIR EXCHANGE; NOVEL CONSTRUCTION; SETUP-FREE; SIGNATURE SCHEME; STAND -ALONE; VERIFIABLY COMMITTED SIGNATURES; VERIFIABLY ENCRYPTED SIGNATURES;

EID: 33745676808     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11605805_11     Document Type: Conference Paper

References (29)

1. N. Asokan, M. Schunter, M. Waidner: Optimistic Protocols for Fair Exchange. ACM Conference on Computer and Communications Security 1997: 7 - 17.
2. N. Asokan, V. Shoup, M. Waidner: Optimistic Fair Exchange of Digital Signatures (Extended Abstract). EUROCRYPT 1998: 591-606.
3. Feng Bao: An Efficient Verifiable Encryption Scheme for Encryption of Discrete Logarithms. CARDIS 1998: 213-220.
4. F. Bao, R. Deng, and W. Mao, Efficient and practical fair exchange protocols with off-line TTP, IEEE Symposium on Security and Privacy, IEEE Computer Society Press, 1998, page 77-85.
5. Fabrice Boudot: Efficient Proofs that a Committed Number Lies in an Interval. Proc. of EUROCRYPT 2000: 431-444, Springer Verlag.
6. Joan Boyar, David Chaum, Ivan Damgård, Torben P. Pedersen: Convertible Undeniable Signatures. CRYPTO 1990: 189-205
7. A. Boldyreva. Efficient threshold signatures, multisignatures and blind signatures based on the Gap Diffie Helman group signature scheme. PKC 2003, LNCS 2567.
8. Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest: A Fair Protocol for Signing Contracts (Extended Abstract). ICALP 1985: 43-52.
9. Dan Boneh, Craig Gentry, Ben Lynn, Hovav Shacham: Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. EUROCRYPT 2003: 416-432
10. C. Boyd, E. Foo: Off-Line Fair Payment Protocols Using Convertible Signatures. ASIACRYPT 1998: 271-285
11. Jan Camenisch, Victor Shoup: Practical Verifiable Encryption and Decryption of Discrete Logarithms. CRYPTO 2003: 126-144
12. R. Cramer and V. Shoup. Signature scheme based on the Strong RAS assumption. 6th ACM Conference on Computer and Communication Security, Singapore, ACM Press, November 1999.
13. Ivan Damgärd: Practical and Provably Secure Release of a Secret and Exchange of Signatures. EUROCRYPT 1993: 200-217
14. Ivan Damgärd, Mads Jurik: Client/Server Tradeoffs for Online Elections. Proc. of Public Key Cryptography 2002: 125-140. Springer Verlag.
15. Ivan Damgärd, Eiichiro Fujisaki: A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order. Proc. of ASIACRYPT 2002: 125 - 142, Springer Verlag.
16. Y.Dodis, L. Reyzin. Breaking and Repairing Optimistic Fair Exchange from PODC 2003, ACM Workshop on Digital Rights Management (DRM), October 2003.
17. Juan A. Garay, Markus Jakobsson, Philip D. MacKenzie: Abuse-Free Optimistic Contract Signing. CRYPTO 1999: 449-466
18. Shafi Goldwasser, Silvio Micali, Ronald L. Rivest: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput. 17(2): 281-308 (1988).
19. E. Fujisaki, T. Okamoto. Statistically zero knowledge protocols to prove modular polynomial relations. Crypto'97. 16-30, 1997.
20. E. Fujisaki, T. Okamoto. Statistical zero-knowledge protocols to prove modular polynomial relations. Crypto'97, LNCS 1294, Springer-verlag, 1997.
21. S. Goldwasser, S. Micali, R. Rivest: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput. 17(2): 281-308, 1988.
22. L, Guillou, J. Quisquater. A practical zero-knowledge protocol fitted to security microprocessors minimizing both transmission and memory. Eurocrypt'88, 123-128, 1988.
23. Wenbo Mao: Verifiable Escrowed Signature. ACISP 1997: 240-248
24. S. Micali: Simple and fast optimistic protocols for fair electronic exchange. PODC 2003; 12-19.
25. Pascal Paillier: Public-Key CryptoSystems Based on Composite Degree Residuosity Classes. Proc. of EUROCRYPT 1999: 223-238, Springer Verlag.
26. J. Park, P.Chong, H. Siegel: Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures. PODC 2003: 172-181
27. T. Pedersett. Non-interactive and information-theoretic secure verifiable secret sharing. Proc of CRYPTO91, Springer LNCS 576, page 129-140.
28. Markus Stadier: Publicly Verifiable Secret Sharing. EUROCRYPT 1996: 190-199
29. Huafei Zhti: Constructing Committed Signatures from Strong-RSA Assumption in the Standard Complexity Model. Public Key Cryptography 2004: 101-114