Constructing Fair-Exchange Protocols for E-commerce Via Distributed Computation of RSA Signatures

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 22, Issue , 2003, Pages 172-181

  Park, Jung Min ^a   Chong, Edwin K P ^b   Siegel, Howard Jay ^b  

^a PURDUE UNIVERSITY   (United States)

^b Engineering Research Center and Hydraulics Laboratory   (United States)

Author keywords

e commerce; Fair exchange protocols; Multisignatures; RSA signatures; Zero knowledge proofs

Indexed keywords

ALGORITHMS; CODES (STANDARDS); COMPUTATIONAL METHODS; CRYPTOGRAPHY; DISTRIBUTED COMPUTER SYSTEMS; ELECTRONIC MAIL; INTERNET; NETWORK PROTOCOLS; RELIABILITY; SECURITY OF DATA;

FAIR EXCHANGE PROTOCOLS; MULTISIGNATURES; RSA SIGNATURES; ZERO-KNOWLEDGE PROOFS;

ELECTRONIC COMMERCE;

EID: 1142305223     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/872035.872060     Document Type: Conference Paper

References (31)

1. M. Abadi, N. Glew, B. Horne, and B. Pinkas. Certified email with a light on-line trusted third party: design and implementation. In International World Wide Web Conference Proceedings, pages 387-395, May 1991.
2. N. Asokan. Fairness in Electronic Commerce. Department of Computer Science, University of Waterloo, 1998.
3. N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. In Advances in Cryptology - EUROCRYPT '98, pages 591-606, 1998.
4. N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communications, 18(4):593-610, 2000.
5. G. Ateniese. Efficient verifiable encryption (and fair exchange) of digital signatures. In Proceedings of ACM Conference on Computer and Communications Security, pages 138-146, November 1999.
6. G. Ateniese and C. Nita-Rotaru. Stateless-recipient certified e-mail system based on verifiable encryption. In Proceedings of RSA 2002, February 2002.
7. A. Bahreman and J. D. Tygar. Certified electronic mail. In Proceedings of Symposium on Network and Distributed Systems Security, pages 3-19, February 1994.
8. F. Bao, R. Deng, and W. Mao. Efficient and practical fair exchange protocols with off-line TTP. In Proceedings of IEEE Symposium on Security and Privacy, pages 77-85, May 1998.
9. M. Bellare and R. Sandhu, The security of practical two-party RSA signature schemes. unpublished manuscript, 2001, available at http://www.cs.ucsd.edu/users/mihir/papers/splitkey.html.
10. M. Blum. How to exchange (secret) keys. ACM Transactions on Computer Systems, 1(2):175-193, 1983.
11. J. Boyar, D. Chaum, and I. Damgard. Convertible undeniable signatures. In Advances in Cryptology - CRYPTO '90, pages 189-205, 1990.
12. C. Boyd. Digital multisignatures. Cryptography and Coding, pages 241-246, 1989.
13. C. Boyd and E. Foo. Off-line fair payment protocols using convertible signatures. In Advances in Cryptology - ASIACRYPT '98, 1998.
14. J. Camenisch and I. Damgard. Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes. In Advances in Cryptology - ASIACRYPT '00, pages 331-345, 2000.
15. J. Camenisch and M. Michels. Proving in zero-knowledge that a number is the product of two safe primes. In Advances in Cryptology - EUROCRYPT '99, pages 106-121, 2000.
16. D. Chaum, J. H. Evertse, and J. van der Graaf. An improved protocol for demonstrating possession of a discrete logarithm and some generalizations. In Advances in Cryptology - EUROCRYPT '87, pages 127-141, 1987.
17. L. Chen. Efficient fair exchange with verifiable confirmation of signatures. In Advances in Cryptology - ASIACRYPT '98, pages 286-299, 1998.
18. B. Cox, J. D. Tygar, and M. Sirbu. Netbill security and transaction protocol. In Proceedings of 1st USENIX Workshop on Electronic Commerce, pages 77-88, July 1995.
19. I. Damgard and T. Pedersen. New convertible undeniable signature schemes. In Advances in Cryptology - EUROCRYPT '96, pages 372-386, 1996.
20. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4):469-472, 1985.
21. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28(6):637-647, 1985.
22. R. Gennaro, H. Krawczyk, and T. Rabin. RSA-based undeniable signatures. In Advances in Cryptology - CRYPTO '97, pages 132-149, 1997.
23. L. Harn. Group-oriented (t, n) threshold digital signature scheme and digital multisignature. IEE Proceedings - Computers and Digital Techniques, 141(5):307-313, 1994.
24. N. Koblitz. A Course in Number Theory and Cryptography. Springer-Verlag, New York, New York, 1987.
25. P. MacKenzie and M. K. Reiter. Networked cryptographic devices resilient to capture. In Proceedings of IEEE Symposium on Security and Privacy, pages 12-25, May 2001.
26. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, Boca Raton, Florida, 1996.
27. S. Micali, K. Ohta, and L. Reyzin. Accountable-subgroup multisignatures. In Proceedings of ACM Conference on Computer and Communications Security, pages 245-254, November 2001.
28. M. Michels and M. Stadler. Efficient convertible undeniable signature schemes. In Proceedings of Annual Workshop on Selected Areas in Cryptography (SAC '97), pages 231-243, August 1997.
29. I. Ray and I. Ray. Fair exchange in e-commerce. ACM SIGecom Exchange, 3(2):9-17, May 2002.
30. R. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM, 21(2):120-126, 1978.
31. J. Zhou and D. Gollmann. A fair non-repudiation protocol. In Proceedings of IEEE Symposium on Security and Privacy, pages 55-61, May 1996.