Non-interactive auction scheme with strong privacy

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

Volumn 2587, Issue , 2003, Pages 407-420

  Peng, Kun ^a   Boyd, Colin ^a   Dawson, Ed ^a   Viswanathan, Kapali ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35248844566     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36552-4_28     Document Type: Article

References (15)

1. Masayuki Abe and Koutarou Suzuki. M+1-st price auction using homomorphic encryption. In Public Key Cryptology 2002, pages 115-124, Berlin, 2002. Springer-Verlag. Lecture Notes in Computer Science Volume 2288.
2. Colin Boyd and Wenbo Mao. Security issues for electronic auctions. Technical report, 2000. available at www.hpl.hl.com/techreports/2000/HP-2000-90.html.
3. D. Chaum and T. P. Pedersen. Wallet databases with observers. In Ernest F. Brickell, editor, Advances in Cryptology - Crypto '92, pages 89-105, Berlin, 1992. Springer-Verlag. Lecture Notes in Computer Science Volume 740.
4. Koji Chida, Kunio Kobayashi, and Hikaru Morita. Efficient sealed-bid auctions for massive numbers of bidders with lump comparison. In Information Security, 4th International Conference, ISC 2001, pages 408-419, Berlin, 2001. Springer-Verlag. Lecture Notes in Computer Science Volume 2200.
5. H Kikuchi, Michael Harkavy, and J D Tygar. Multi-round anonymous auction. In Proceedings of the First IEEE Workshop on Dependable and Real-Time E-Commerce Systems, pages 62-69, June 1998.
6. Hiroaki Kikuchi. (m+1)st-price auction. In The Fifth International Conference on Financial Cryptography 2001, pages 291-298, Berlin, February 2001. Springer-Verlag. Lecture Notes in Computer Science Volume 2339.
7. Hiroaki Kikuchi, Shinji Hotta, Kensuke Abe, and Shohachiro Nakanishi. Distributed auction servers resolving winner and winning bid without revealing privacy of bids. In proc. of International Workshop on Next Generation Internet (NGITA2000), IEEE, pages 307-312, July 2000.
8. David Naccache and Jacques Stern. A new public key cryptosystem based on higher residues. In ACM Computer Science Conference 1998, pages 160-174, 1998.
9. Kazumasa Omote and Atsuko Miyaji. A second-price sealed-bid auction with the discriminant of the p-th root. In Financial Cryptography 2002, Berlin, 2002. Springer-Verlag.
10. P Paillier. Public key cryptosystem based on composite degree residuosity classes. In Eurocrypt'99, pages 223-238, Berlin, 1999. Springer-Verlag. Lecture Notes in Computer Science Volume 1592.
11. K Sako. An auction scheme which hides the bids of losers. In Public Key Cryptology 2000, pages 422-432, Berlin, 2000. Springer-Verlag. Lecture Notes in Computer Science Volume 1880.
12. Kouichi Sakurai and S Miyazaki. A bulletin-board based digital auction scheme with bidding down strategy -towards anonymous electronic bidding without anonymous channels nor trusted centers. In Proc. International Workshop on Cryptographic Techniques and E-Commerce, pages 180-187, Hong Kong, 1999. City University of Hong Kong Press.
13. Koutarou Suzuki, Kunio Kobayashi, and Hikaru Morita. Efficient sealed-bid auction using hash chain. In International Conference on Information Security and Cryptology 2000, pages 183-191, Berlin, 2000. Springer-Verlag. Lecture Notes in Computer Science 2015.
14. Kapali Viswanathan, Colin Boyd, and Ed Dawson. A three phased schema for sealed bid auction system design. In Information Security and Privacy, 5th Australasian Conference, ACISP'2000, pages 412-426, Berlin, 2000. Springer-Verlag. Lecture Notes in Computer Science 1841.
15. Yuji Watanabe and Hideki Imai. Reducing the round complexity of a sealed-bid auction protocol with an off-line ttp. In STOC 2000, pages 80-86. ACM, 2000.