{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:51:43Z","timestamp":1750308703533,"version":"3.41.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2004,7,1]],"date-time":"2004-07-01T00:00:00Z","timestamp":1088640000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGecom Exch."],"published-print":{"date-parts":[[2004,7]]},"abstract":"<jats:p>Many different types of auctions can be applied to determine selling prices, each of them fulfilling different properties. Among them, Vickrey auctions are specially interesting due to the fact that they disallow strategic behaviors of the bidders. In fact, the dominant strategy for each bidder consists in bidding his reserve price. However, somebody has to collect all the bids, so that bids are not kept private. In this paper we present a method to overcome this problem. That is, we present a way to implement Vickrey auctions preserving the privacy of all the bidders.<\/jats:p>","DOI":"10.1145\/1120694.1120696","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Improving privacy in Vickrey auctions"],"prefix":"10.1145","volume":"5","author":[{"given":"Natalia","family":"L\u00f3pez","sequence":"first","affiliation":[{"name":"Dept. Sistemas Inform\u00e1ticos y Programaci\u00f3n, Universidad Complutense de Madrid, Madrid, Spain"}]},{"given":"Manuel","family":"N\u00fa\u00f1ez","sequence":"additional","affiliation":[{"name":"Dept. Sistemas Inform\u00e1ticos y Programaci\u00f3n, Universidad Complutense de Madrid, Madrid, Spain"}]},{"given":"Ismael","family":"Rodr\u00edguez","sequence":"additional","affiliation":[{"name":"Dept. Sistemas Inform\u00e1ticos y Programaci\u00f3n, Universidad Complutense de Madrid, Madrid, Spain"}]},{"given":"Fernando","family":"Rubio","sequence":"additional","affiliation":[{"name":"Dept. Sistemas Inform\u00e1ticos y Programaci\u00f3n, Universidad Complutense de Madrid, Madrid, Spain"}]}],"member":"320","published-online":{"date-parts":[[2004,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.3.284.16077"},{"key":"e_1_2_1_2_1","first-page":"87","volume-title":"Annual Conference on Financial Cryptography, LNCS 2357","author":"LIPMAA H.","year":"2002","unstructured":"LIPMAA , H. , ASOKAN , N. , AND NIEMI , V. 2002 . Secure Vickrey auctions without threshold trust . In Annual Conference on Financial Cryptography, LNCS 2357 . Springer , 87 - 101 . LIPMAA, H., ASOKAN, N., AND NIEMI, V. 2002. Secure Vickrey auctions without threshold trust. In Annual Conference on Financial Cryptography, LNCS 2357. Springer, 87-101."},{"key":"e_1_2_1_3_1","unstructured":"L\u00d3PEZ N. NU\u00d1EZ M. RODR\u00cdGUEZ I. AND RUBIO F. 2003. Technical quote: Functions fulfilling conditions (1) (2) and (3). http:\/\/dalila.sip.ucm.es\/~fernando\/TechQuote.ps.  L\u00d3PEZ N. NU\u00d1EZ M. RODR\u00cdGUEZ I. AND RUBIO F. 2003. Technical quote: Functions fulfilling conditions (1) (2) and (3). http:\/\/dalila.sip.ucm.es\/~fernando\/TechQuote.ps."},{"key":"e_1_2_1_4_1","first-page":"699","article-title":"Auctions and bidding","author":"MCAFEE R.","year":"1987","unstructured":"MCAFEE , R. AND MCMILLAN , J. 1987 . Auctions and bidding . Journal of Economic Literature XXV , 699 - 738 . MCAFEE, R. AND MCMILLAN, J. 1987. Auctions and bidding. Journal of Economic Literature XXV, 699-738.","journal-title":"Journal of Economic Literature"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.6.1.58"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337028"},{"key":"e_1_2_1_7_1","first-page":"74","volume-title":"Proc. 17th National Conference on Artificial Intelligence (AAAI-00)","author":"PARKES D.","year":"2000","unstructured":"PARKES , D. AND UNGAR , L. 2000 . Iterative combinatorial auctions: Theory and practice . In Proc. 17th National Conference on Artificial Intelligence (AAAI-00) . 74 - 81 . PARKES, D. AND UNGAR, L. 2000. Iterative combinatorial auctions: Theory and practice. In Proc. 17th National Conference on Artificial Intelligence (AAAI-00). 74-81."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.44.8.1131"},{"volume-title":"Multiagent Systems","author":"SANDHOLM T.","key":"e_1_2_1_9_1","unstructured":"SANDHOLM , T. 1999. Distributed rational decision making . In Multiagent Systems . The MIT Press , 201-258. SANDHOLM, T. 1999. Distributed rational decision making. In Multiagent Systems. The MIT Press, 201-258."},{"key":"e_1_2_1_10_1","first-page":"33","article-title":"On automated contracting in multi-enterprise manufacturing","author":"SANDHOLM T.","year":"1995","unstructured":"SANDHOLM , T. AND LESSER , V. 1995 . On automated contracting in multi-enterprise manufacturing . In Distributed Enterprise: Advanced Systems and Tools. 33 - 42 . SANDHOLM, T. AND LESSER, V. 1995. On automated contracting in multi-enterprise manufacturing. In Distributed Enterprise: Advanced Systems and Tools. 33-42.","journal-title":"Distributed Enterprise: Advanced Systems and Tools."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1267185.1267187"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352874"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/280765.280847"}],"container-title":["ACM SIGecom Exchanges"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1120694.1120696","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1120694.1120696","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:13:56Z","timestamp":1750277636000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1120694.1120696"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,7]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,7]]}},"alternative-id":["10.1145\/1120694.1120696"],"URL":"https:\/\/doi.org\/10.1145\/1120694.1120696","relation":{},"ISSN":["1551-9031"],"issn-type":[{"type":"electronic","value":"1551-9031"}],"subject":[],"published":{"date-parts":[[2004,7]]},"assertion":[{"value":"2004-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}