Efficient implementation of relative bid privacy in sealed-bid auction

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

Volumn 2908, Issue , 2004, Pages 244-256

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

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

BID PRIVACY; EFFICIENT IMPLEMENTATION; HIGH-EFFICIENCY; MIX NETWORKS; SEALED-BID AUCTIONS;

SECURITY OF DATA;

EID: 35048879165     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24591-9_19     Document Type: Article

References (31)

1. M Abe. Mix-networks on permutation net-works. In Asiacrypt 98, pages 258-273, Berlin, 1999. Springer-Verlag. Lecture Notes in Computer Science 1716.
2. Masayuki Abe and Fumitaka Hoshino. Remarks on mix-network based on permutation networks. In Public Key Cryptography 2001, pages 317-324, Berlin, 2001. Springer-Verlag. Lecture Notes in Computer Science 1992.
3. 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.
4. Dan Boneh and Philippe Colle. Almost entirely correct mixing with applications to voting. In Proceedings of the 9th ACM conference on Computer and communications security, pages 68-77, 2002.
5. Felix Brandt. Cryptographic protocols for secure second-price auctions. 2001. Available at http://wwwbrauer.in.tum.de/brandtf/papers/cia2001.pdf.
6. D Chaum. Untraceable electronic mail, return address and digital pseudonym. In Communications of the ACM, 24(2), pages 84-88, 1981.
7. 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.
8. Matthew K Franklin and Michael K Reiter. The design and implementation of a secure auction service. In IEEE Transactions on Software Enginerring, volume 5, pages 302-312, May 1996.
9. Jun Furukawa and Kazue Sako. An efficient scheme for proving a shuffle. In CRYPTO2001, volume 2139 of Lecture Notes in Computer Science, pages 368-387. Springer, 2001.
10. Philippe Golle, Sheng Zhong, Dan Boneh, Markus Jakobsson, and Ari Juels. Optimistic mixing for exit-polls. In ASIACRYPT 2002, pages 451-465, Berlin, 2002. Springer-Verlag. Lecture Notes in Computer Science Volume 1592.
11. Jens Groth. A verifiable secret shuffle of homomorphic encryptions. In Public Key Cryptography 2003, pages 145-160, Berlin, 2003. Springer-Verlag. Lecture Notes in Computer Science Volume 2567.
12. Markus Jakobsson, Ari Juels, and Ronald L. Rivest. Making mix nets robust for electronic voting by randomizsed partial checking. In Proceedings of the 11th USENIX Security Symposium, San Francisco, CA, USA, August 5-9, 2002, pages 339-353. USENIX, 2002.
13. Ari Juels and Markus Jakobsson. An optimally robust hybrid mix network. In Proc. of the 20th annual ACM Symposium on Principles of Distributed Computation, pages 284-292. ACM, 2001.
14. 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.
15. 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.
16. 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.
17. H Lipmaa, N Asokan, and V Niemi. Secure vickrey auctions without thresh-old trust. In Proceedings of the 6th Annual Conference on Financial Cryptography, 2002, Berlin, 2002. Springer-Verlag.
18. Yi Mu and Vijay Varadharajan. An internet anonymous auction scheme. In International Conference on Information Security and Cryptology 2000, pages 171-182, Berlin, 2000. Springer-Verlag. Lecture Notes in Computer Science Volume 2015.
19. Moni Naor, Benny Pinkas, and Reuben Sumner. Privacy perserving auctions and mechanism design. 1999. Available from http://www.tml.hut.fi/helger/crypto/ link/protocols/auctions.html.
20. C. Andrew Neff. A verifiable secret shuffle and its application to e-voting. In ACM Conference on Computer and Communications Security 2001, pages 116-125, 2001.
21. W Ogata, K Kurosawa, K Sako, and K Takatani. Fault tolerant anonymous channel. In Proc. of International Conference on Information and Communication Security 1997, pages 440-444, Berlin, 2000. Springer-Verlag. Lecture Notes in Computer Science Volume 1334.
22. Miyako Ohkubo and Masayuki Abe. A length-invariant hybrid mix. In ASIACRYPT 2000, pages 178-191, Berlin, 2000. Springer-Verlag. Lecture Notes in Computer Science Volume 1976.
23. 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.
24. C. Park, K. Itoh, and K. Kurosawa. Efficient anonymous channel and all/nothing election scheme. In Tor Helleseth, editor, Advances in Cryptology - EuroCrypt '93, pages 248-259, Berlin, 1993. Springer-Verlag. Lecture Notes in Computer Science Volume 765.
25. Torben P. Pedersen. Distributed provers with applications to undeniable signatures. In EUROCRYPT 91, pages 221-242, Berlin, 1991. Springer-Verlag. Lecture Notes in Computer Science Volume 547.
26. 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.
27. K. Sako and J. Kilian. Receipt-free mix-type voting scheme-a practical solution to the implementation of a voting booth. In EUROCRYPT '95, pages 393-403, Berlin, 1995. Springer-Verlag. Lecture Notes in Computer Science Volume 921.
28. 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.
29. 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.
30. 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.
31. 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.