{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T02:51:49Z","timestamp":1761706309462,"version":"3.41.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2014,2,1]],"date-time":"2014-02-01T00:00:00Z","timestamp":1391212800000},"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":["Commun. ACM"],"published-print":{"date-parts":[[2014,2]]},"abstract":"<jats:p>A solution to the persistent problem of preventing collusion in Vickrey auctions.<\/jats:p>","DOI":"10.1145\/2574871","type":"journal-article","created":{"date-parts":[[2014,1,28]],"date-time":"2014-01-28T13:49:22Z","timestamp":1390916962000},"page":"85-93","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Cryptography miracles, secure auctions, matching problem verification"],"prefix":"10.1145","volume":"57","author":[{"given":"Silvio","family":"Micali","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael O.","family":"Rabin","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455804"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1962.11989827"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1086\/261512"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2005.12.004"},{"key":"e_1_2_1_7_1","first-page":"223","article-title":"Public-key encryptions based on composite residuosity classes","volume":"99","author":"Paillier P","year":"1999","unstructured":"Paillier , P . Public-key encryptions based on composite residuosity classes . In Proceedings of EUROCRYPT 99 ( 1999 ), 223 -- 239 . Paillier, P. Public-key encryptions based on composite residuosity classes. In Proceedings of EUROCRYPT 99 (1999), 223--239.","journal-title":"Proceedings of EUROCRYPT"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1151454.1151478"},{"key":"e_1_2_1_9_1","first-page":"129","article-title":"Non-interactive and information-theoretic secure verifiable secret sharing","volume":"91","author":"Pedersen T","year":"1991","unstructured":"Pedersen , T . Non-interactive and information-theoretic secure verifiable secret sharing . In Proceedings of CRYPTO 91 ( 1991 ), Springer Verlag, 129 -- 140 . Pedersen, T. Non-interactive and information-theoretic secure verifiable secret sharing. In Proceedings of CRYPTO 91 (1991), Springer Verlag, 129--140.","journal-title":"Proceedings of CRYPTO"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31594-7_62"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of IEEE Symposium on Logic in Computer Science (Wroclaw","author":"Rabin M.","year":"2007","unstructured":"Rabin , M. , Servedio , R. , Thorpe , C. Practical secrecy-preserving, verifiably correct and trustworthy auctions . In Proceedings of IEEE Symposium on Logic in Computer Science (Wroclaw , 2007 ). Rabin, M., Servedio, R., Thorpe, C. Practical secrecy-preserving, verifiably correct and trustworthy auctions. In Proceedings of IEEE Symposium on Logic in Computer Science (Wroclaw, 2007)."},{"volume-title":"Limitations of the Vickrey auction in computational multi-agent systems. Research Paper. Department of Computer Science","author":"Sandhholm T.","key":"e_1_2_1_12_1","unstructured":"Sandhholm , T. Limitations of the Vickrey auction in computational multi-agent systems. Research Paper. Department of Computer Science , Washington University , St . Louis, MO. Sandhholm, T. Limitations of the Vickrey auction in computational multi-agent systems. Research Paper. Department of Computer Science, Washington University, St. Louis, MO."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2307\/2098473"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2574871","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2574871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:00:44Z","timestamp":1750276844000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2574871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["10.1145\/2574871"],"URL":"https:\/\/doi.org\/10.1145\/2574871","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"type":"print","value":"0001-0782"},{"type":"electronic","value":"1557-7317"}],"subject":[],"published":{"date-parts":[[2014,2]]},"assertion":[{"value":"2014-02-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}