An Online public auction protocol protecting bidder privacy

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

Volumn 1841, Issue , 2000, Pages 427-442

  Nguyen, Khanh Quoc ^a   Traoré, Jacques ^b  

^a UNIVERSITY OF WESTERN SYDNEY   (Australia)

^b ORANGE LABS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK SECURITY;

AUCTION PROTOCOLS; BINDING GROUPS; ELECTRONIC ENVIRONMENTS; ELECTRONIC WORLD; INTERNET ECONOMY; USER PRIVACY;

DATA PRIVACY;

EID: 23044518297     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10718964_35     Document Type: Conference Paper

References (18)

1. M. Abe and E. Fujisaki. How to date blind signatures. In Advances in Cryptology-ASIACRYPT’96, pages 244-251. LNCS vol. 1163, Springer-Verlag, 1996.
2. N. Asokan. Fairness in Electronic Commerce. PhD thesis, University of Waterloo, Waterloo, Ontario, Canada, 1998.
3. C. Cachin. Efficient private bidding and auctions with an oblivious third party. In Proceedings of 6th ACM Conference in Computer and Communications Security. ACM Press, 1999.
4. J. Camenisch. Efficient and generalized group signatures. In Advances in Cryptology-EUROCRYPT’97, pages 410-424. LNCS vol. 1233, Springer-Verlag, 1997.
5. J. Camenisch and M. Michels. A group signature scheme based on an rsa-variant. Technical Report RS-98-27, BRICS, 1998. a preliminary version of this paper appeared in Advances in Cryptology-ASIACRYPT’98.
6. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In Advances in Cryptology-CRYPTO’97, pages 410-424. LNCS vol. 1296, SpringerVerlag, 1997.
7. Jan Camenisch and Markus Michels. Separability and efficiency for generic group signature schemes. In Advances in Cryptology-CRYPTO’99, pages 106-121. LNCS vol., Springer-Verlag, 1999.
8. A. Chan, Y. Frankel, and Y. Tsiounis. Easy come-easy go divisible cash. In Advances in Cryptology-Eurocrypt ‘98, pages 561-575. LNCS vol. 1403, SpringerVerlag, 1998.
9. D. Chaum and E. van Heyst. Group signatures. In Advances in Cryptology-EUROCRYPT’91, pages 256-265. LNCS vol. 547, Springer-Verlag, 1991.
10. L. Chen and T.P. Pedersen. New group signature schemes. In Advances in Cryptology-EUROCRYPT’94, pages 171-181. LNCS vol. 950, Springer-Verlag, 1995.
11. M. Franklin and M. Reiter. Verifiable signature sharing. In Advances in Cryptology-Eurocrypt ‘95, pages 50-63. LNCS vol. 921, Springer-Verlag, 1995.
12. M. Franklin and M. Reiter. The design and implementation of a secure auction service. IEEE Transactions on Software Engineering, 22(5):302-312, 1996.
13. M. Harkavy, D. Tygar, and H. Kikuchi. Electronic auctions with private bids. In Proceedings of 3rd USENIX Workshop on Electronic Commerce. Boston, 1998.
14. M. Kumar and S. Feldman. Internet auctions. In Proceedings of 3rd USENIX Workshop on Electronic Commerce. Boston, 1998.
15. Tri Van Le, Khanh Quoc Nguyen, and Vijay Varadharajan. How to prove that a committed number is prime. In Advances in Cryptology-Asiacrypt 99, pages 208-218. LNCS vol. 1716, Springer-Verlag, 1999.
16. T. Mullen and M. Wellman. The auction manager: Market middleware for large-scale electronic commerce. In Proceedings of3rd USENIX Workshop on Electronic Commerce. Boston, 1998.
17. T.P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Advances in Cryptology-CRYPTO 91, pages 129-140. LNCS vol. 576, Springer-Verlag, 1992.
18. Jacques Traore. Group signatures and their relevance to privacy-protecting off-line electronic cash systems. In Information Security and Privacy (ACISP’99), pages 228-243. LNCS vol. 1587, Springer-Verlag, 1999.