Practical secrecy-preserving, verifiably correct and trustworthy auctions

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2006, Pages 70-81

  Parkes, D C ^a   Rabin, M O ^a   Shieber, S M ^a   Thorpe, C A ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTING NETWORKS; ENCRYPTED BIDS; TRUSTWORTHY AUCTIONS;

COMPUTATIONAL METHODS; CRYPTOGRAPHY; DATA PRIVACY; PERSONAL COMPUTERS; WEB SERVICES;

ELECTRONIC COMMERCE;

EID: 34547358748     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1151454.1151478     Document Type: Conference Paper

References (37)

1. M. Abe and K. Suzuki. M+1-st price auction using homomorphic encryption. In Proc. Public Key Cryptography, 2002.
2. V. Afualo and J. McMillan. Auctions of rights to public property. In P. Newman, editor, The New Palgrave Dictionary of Economics and the Law. Palgrave Macmillan, 2004.
3. O. Baudron and J. Stern. Non-interactive private auctions. In Proc. Financial Cryptography, 2001.
4. P. G. Bradford, S. Park, and M. H. Rothkopf. Protocol completion incentive problems in cryptographic Vickrey auctions. Technical Report RRR 3-2004, Rutgers Center for Operations Research (RUTCOR), 2004.
5. F. Brandt. How to obtain full privacy in auctions. Technical report, Carnegie Mellon University, 2005.
6. F. Brandt and T. Sandholm. (Im)possibility of unconditionally privacy-preserving auctions. In Proc. 3rd Int. Conf. on Autonomous Agents and Multi-Agent Systems, pages 810-817, 2004.
7. M. Burmester, E. Magkos, and V. Chrissikopoulos. Uncoercible e-bidding games. Electronic Commerce Research, 4:113-125, 2004.
8. I. Damgård and M. Jurik. A generalisation, a simplification and some applications of Paillier's probabilistic public-key system. In Proc. Public Key Cryptography 01, 2001.
9. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Information Theory, IT-31(4):469-472, 1985.
10. W. J. Elmaghraby. Pricing and auctions in emarketplaces. In Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era. Kluwer Academic Publishers, Norwell, MA, 2004.
11. M. K. Franklin and M. K. Reiter. The design and implementation of a secure auction server. IEEE Transactions on Software Engineering, 22(5):302-312, 1986.
12. D. Giry and P. Bulens. Cryptographic key length recommendation, http://www.key-length.com, 2006.
13. M. Harkavy, J. D. Tygar, and H. Kikuchi. Electronic auctions with private bids. In Proc. Third USENIX Workshop on Electronic Commerce, pages 61-74, 1998.
14. H. Kikuchi. (m+1)st price auction protocol. In Proc. Financial Cryptography, 2001.
15. V. Krishna. Auction Theory. Academic Press, 2002.
16. M. Kumar and S. I. Feldman. Internet auctions. In Proc. 3rd USENIX Workshop on Electronic Commerce, 1998.
17. LiDIA-Group. LiDIA - a library for computational number theory. TU Darmstadt, 2001.
18. H. Lipmaa, N. Asokan, and V. Niemi. Secure Vickrey auctions without threshold trust. In Proc. 6th International Conference on Financial Cryptography (FC 2002), pages 87-101, 2002.
19. D. Lucking-Reiley. Vickrey auctions in practice: From nineteenth century philately to twenty-first century e-commerce. J. of Economic Perspectives, 14:182-192, 2000.
20. J. McMillan. Selling spectrum rights. Journal of Economic Perspectives, 8:145-162, 1994.
21. P. Milgrom. Putting Auction Theory to Work. Cambridge University Press, 2004.
22. M. Naor, B. Pinkas, and R. Sumner. Privacy preserving auctions and mechanism design. In Proc. First ACM Conf. on Elec. Commerce, pages 129-139, 1999.
23. National Institute of Standards and Technology. Secure hash signature standard. http://carc.nist.gov/publications/fips/fips180-2/fips180- 2withchangenotice.pdf, 2002. FIPS PUB 180-2.
24. P. Paillier. Cryptographie à Clé Publique Basée sur la Résiduosité de Degré Composite. PhD thesis, École Nationale Supérieure des Télécommunications, 1999.
25. P. Paillier. Public-key cryptosystems based on composite residuosity classes. In Proc. EUROCRYPT '99, pages 223-239, 1999.
26. M. O. Rabin. Digitalized signatures. In Foundations of Secure Computing, pages 155-166. Academic Press, New York, 1978.
27. M. O. Rabin. Digitalized signatures and public-key functions as intractable as factorization. Technical Report MIT/LCS/TR-212, MIT Laboratory for Computer Science, 1979.
28. V. Rijmen and P. S. L. M. Barreto. The Whirlpool hash function. http://paginas.terra.com.br/informatica/paulobarreto/WhirlpoolPage.html.
29. R. L. Rivest, A. Shamir, and L. M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Technical Report MIT/LCS/TM-82, MIT Laboratory for Computer Science, 1977.
30. R. L. Rivest, A. Shamir, and D. A. Wagner. Time-lock puzzles and timed release crypto. Technical Report MIT/LCS/TR-684, MIT, 1996.
31. M. H. Rothkopf, T. J. Teisberg, and E. P. Kahn. Why are Vickrey auctions rare? Journal of Political Economy, 98:94-109, 1990.
32. T. Sandholm, D. Levine, M. Concordia, P. Martyn, R. Hughes, J. Jacobes, and D. Begg. Changing the game in strategic sourcing at Procter & Gamble: Expressive competition enabled by optimization. Interfaces, 36(1):55-68, 2006.
33. S. W. Smith. Trusted Computing Platforms: Design and Applications, Springer, New York, 2005.
34. S. G. Stubblebine and P. F. Syverson. Fair on-line auctions without special trusted parties. In Proc. of Financial Cryptography, 1999.
35. K. Suzuki and M. Yokoo. Secure generalized Vickrey auction using homomorphic encryption. In Proc. Financial Cryptography, 2003.
36. B. L. Xiaofeng Chen, Kwangjo Kim. Receipt-free electronic auction schemes using homomorphic encryption. In ICISC, 2003.
37. M. Yokoo and K. Suzuki. Secure multi-agent dynamic programming based on homomorphic encryption and its application to combinatorial auctions. In Proc. First Int. Conf. on Autonomous Agents and Multiagent Systems, 2002.