{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T18:24:49Z","timestamp":1757701489019},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2008,4,15]],"date-time":"2008-04-15T00:00:00Z","timestamp":1208217600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron Commerce Res"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s10660-008-9013-1","type":"journal-article","created":{"date-parts":[[2008,4,14]],"date-time":"2008-04-14T15:54:41Z","timestamp":1208188481000},"page":"57-77","source":"Crossref","is-referenced-by-count":6,"title":["Protocol completion incentive problems in cryptographic Vickrey auctions"],"prefix":"10.1007","volume":"8","author":[{"given":"Phillip G.","family":"Bradford","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sunju","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael H.","family":"Rothkopf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heejin","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,4,15]]},"reference":[{"key":"9013_CR1","unstructured":"Abe, M., & Suzuki, K. (2002). M+1-st price auction using homomorphic encryption. In Proceedings of the 5th international workshop on the practice and theory of Public Key Cryptosystems (PKC 2002): Vol. 2274. Lecture Notes in Computer Science (pp. 115\u2013224). Berlin: Springer."},{"key":"9013_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Gonen, R., & Halpern, J. Y. (2006). Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. Symposium on Principles of Distributed Computing (PODC) (pp. 53\u201363).","DOI":"10.1145\/1146381.1146393"},{"key":"9013_CR3","unstructured":"Aigner, M. (1988). Combinatorial search. Wiley-Teubner."},{"key":"9013_CR4","unstructured":"Bradford, P. G., Park, S., & Rothkopf, M. H. (2004). Protocol completion incentive problems in cryptographic Vickrey auctions. In Proceedings of the seventh International Conference on Electronic Commerce Research (ICECR-7) (pp. 55\u201364). See http:\/\/rutcor.rutgers.edu\/pub\/rrr\/reports2004\/3_2004.pdf ."},{"key":"9013_CR5","unstructured":"Brandt, F. (2002). A verifiable, bidder-resolved auction protocol. In R. Falcone, S. Barber, L. Korba & M. Singh (Eds.), Proceedings of first international joint conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2002) (pp. 18\u201325)."},{"key":"9013_CR6","doi-asserted-by":"crossref","unstructured":"Brandt, F. (2003). Fully private auctions in a constant number of rounds. In Proceedings of Financial Cryptography (FC 2003) (pp. 223\u2013238).","DOI":"10.1007\/978-3-540-45126-6_16"},{"key":"9013_CR7","unstructured":"Brandt, F., & Sandholm, T. (2004). Efficient privacy-preserving protocols for multi-unit auctions. Preliminary Draft, 1 October 2004."},{"key":"9013_CR8","doi-asserted-by":"crossref","unstructured":"Cachin, C. (1999). Efficient private bidding and auctions with an oblivious third party. In Proc. 6th ACM Conference on Computer and Communications Security (pp. 120\u2013127).","DOI":"10.1145\/319709.319726"},{"issue":"2","key":"9013_CR9","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"Chaum, D. (1981). Untraceable electronic mail, return addresses and digital pseudonyms. Communications of the ACM, 24(2), 84\u201388.","journal-title":"Communications of the ACM"},{"key":"9013_CR10","doi-asserted-by":"crossref","unstructured":"Cramer, R., Gennaro, R., & Schoenmakers, B. (1997). A secure and optimally efficient multi-authority election scheme. In Proceedings of EUROCRYPT \u201997, LNCS # 1233. Springer (pp. 103\u2013118).","DOI":"10.1007\/3-540-69053-0_9"},{"issue":"4","key":"9013_CR11","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT-31","author":"T. Elgamal","year":"1985","unstructured":"Elgamal, T. (1985). A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, IT-31(4), 469\u2013472.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"9013_CR12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0165-1765(91)90137-A","volume":"35","author":"R. Engelbrecht-Wiggans","year":"1991","unstructured":"Engelbrecht-Wiggans, R., & Kahn, C. M. (1991). Protecting the winner: second-price versus oral auctions. Economics Letters, Elsevier, 35(3), 243\u2013248.","journal-title":"Economics Letters, Elsevier"},{"key":"9013_CR13","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., & Shenker, S. (2002). Distributed algorithmic mechanism design: recent results and future directions. In Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, ACM SIGCOMM (pp. 1\u201313).","DOI":"10.1145\/570810.570812"},{"key":"9013_CR14","doi-asserted-by":"crossref","unstructured":"Feige, U., Fiat, A., & Shamir, A. (1987). Zero-knowledge proofs of identity. In Proceedings of the nineteenth annual ACM conference on Theory of computing (STOC) (pp. 210\u2013217).","DOI":"10.1145\/28395.28419"},{"issue":"5","key":"9013_CR15","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1109\/32.502223","volume":"22","author":"M. K. Franklin","year":"1996","unstructured":"Franklin, M. K., & Reiter, M. K. (1996). The design and implementation of a secure auction service. IEEE Transactions on Software Engineering, 22(5), 302\u2013312.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"9013_CR16","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., & Wigderson, A. (1987). How to play any mental game. In Proceedings of the 19th ACM Symposium on the Theory of Computing (STOC) (pp. 218\u2013229).","DOI":"10.1145\/28395.28420"},{"key":"9013_CR17","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., & Rackoff, C. (1989). The knowledge complexity of interactive proof-systems. SIAM J. Comput., 18, 186\u2013208.","journal-title":"SIAM J. Comput."},{"key":"9013_CR18","doi-asserted-by":"crossref","unstructured":"Gordon, S. D., & Katz, J. (2006). Rational secret sharing, revisited. In Security in Communication Networks (SCN 2006) (pp. 229\u2013241) (also Security and Cryptography for Networks, 2006).","DOI":"10.1007\/11832072_16"},{"key":"9013_CR19","doi-asserted-by":"crossref","unstructured":"Halpern, J., & Teague, V. (2004). Rational secret sharing and multiparty computation. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (STOC 2004) (pp. 623\u2013632).","DOI":"10.1145\/1007352.1007447"},{"issue":"1","key":"9013_CR20","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.tcs.2003.06.003","volume":"321","author":"A. Hevia","year":"2004","unstructured":"Hevia, A., & Kiwi, M. A. (2004). Electronic jury voting protocols. Theoretical Computer Science, 321(1), 73\u201394.","journal-title":"Theoretical Computer Science"},{"key":"9013_CR21","doi-asserted-by":"crossref","unstructured":"Horne, B., Pinkas, B., & Sander, T. (2001). Escrow services and incentives in peer-to-peer networks. In Proceedings of the ACM conference on Electronic Commerce EC\u201901 (pp. 85\u201394), Oct. 2001.","DOI":"10.1145\/501158.501168"},{"key":"9013_CR22","doi-asserted-by":"crossref","unstructured":"Izmalkov, S., Micali, S., & Lepinski, M. (2005). Rational secure computation and ideal mechanism design. In 46th Annual IEEE symposium on Foundations of Computer Science (FOCS\u201905) (pp. 585\u2013595).","DOI":"10.1109\/SFCS.2005.64"},{"key":"9013_CR23","doi-asserted-by":"crossref","unstructured":"Jakobsson, M., & Juels, A. (2000). Mix and match: secure function evaluation via ciphertexts. In T.\u00a0Okamoto (Ed.), Advances in Cryptography \u2013 ASIACRYPT \u201900, LNCS # 1976 (pp. 162\u2013177).","DOI":"10.1007\/3-540-44448-3_13"},{"key":"9013_CR24","doi-asserted-by":"crossref","unstructured":"Kikuchi, H. (2002). Oblivious counter and majority protocol. In Information Security, 5th International Conference (ISC 2002), LNCS # 2433 (pp. 437\u2013445).","DOI":"10.1007\/3-540-45811-5_34"},{"key":"9013_CR25","unstructured":"Kikuchi, H., Harkavy, M., & Tygar, J. D. (1999). Multi-round anonymous auction protocols. In TIEICE: IEICE Transactions on Communications\/Electronics\/Information and Systems (pp. 62\u201369)."},{"key":"9013_CR26","volume-title":"Sorting and searching","author":"D. E. Knuth","year":"1973","unstructured":"Knuth, D. E. (1973). Sorting and searching (Vol. 3). Reading: Addison-Wesley."},{"issue":"3","key":"9013_CR27","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1257\/jep.14.3.183","volume":"14","author":"D. Lucking-Reiley","year":"2000","unstructured":"Lucking-Reiley, D. (2000). Vickrey auctions in practice: from nineteenth-century philately to twenty-first-century e-commerce. Journal of Economic Perspectives, 14(3), 183\u2013192.","journal-title":"Journal of Economic Perspectives"},{"key":"9013_CR28","doi-asserted-by":"crossref","unstructured":"Lysyanskaya, A., & Triandopoulos, N. (2006). Rationality and adversarial behavior in multi-party computation. In CRYPTO 2006 (Vol.\u00a04117, pp. 180\u2013197).","DOI":"10.1007\/11818175_11"},{"key":"9013_CR29","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., & Sumner, R. (1999). Privacy preserving auctions and mechanism design. In 1st ACM Conf. on Electronic Commerce (pp. 129\u2013139). ACM.","DOI":"10.1145\/336992.337028"},{"key":"9013_CR30","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF01384489","volume":"2","author":"H. Nurmi","year":"1993","unstructured":"Nurmi, H., & Salomaa, A. (1993). Cryptographic protocols for Vickrey auctions. Group Decision and Negotiation, 2, 363\u2013373.","journal-title":"Group Decision and Negotiation"},{"key":"9013_CR31","doi-asserted-by":"crossref","unstructured":"Parkes, D. C., Rabin, M. O., Shieber, S. M., & Thorpe, C. A. (2006). Practical secrecy-preserving, verifiably correct and trustworthy auctions. In Proceedings of the 8th international conference on electronic commerce: the new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the Internet (ICEC \u201906) (Vol.\u00a0156, pp.\u00a070\u201381).","DOI":"10.1145\/1151454.1151478"},{"key":"9013_CR32","unstructured":"Parkes, D., & Shneidman, J. (2004). Distributed implementations of Vickrey-Clarke-Groves mechanisms. In Proc. 3rd int. conf. on autonomous agents and multiagent systems, AAMAS (pp. 261\u2013268)."},{"key":"9013_CR33","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in cryptology\u2013EUROCRYPT \u201991: workshop on the theory and application of cryptographic techniques","author":"T. Pedersen","year":"1991","unstructured":"Pedersen, T. (1991). A threshold cryptosystem without a trusted party (extended abstract). In LNCS : Vol. 547. Advances in cryptology\u2013EUROCRYPT \u201991: workshop on the theory and application of cryptographic techniques (pp. 522\u2013526). Berlin: Springer."},{"key":"9013_CR34","doi-asserted-by":"crossref","first-page":"141","DOI":"10.2307\/2555595","volume":"16","author":"M. S. Robinson","year":"1985","unstructured":"Robinson, M. S. (1985). Collusion and the choice of auction. Rand Journal of Economics, 16, 141\u2013145.","journal-title":"Rand Journal of Economics"},{"key":"9013_CR35","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1086\/296663","volume":"68","author":"M. H. Rothkopf","year":"1995","unstructured":"Rothkopf, M. H., & Harstad, R. M. (1995). Two models of bid-taker cheating in Vickrey auctions. Journal of Business, 68, 257\u2013267.","journal-title":"Journal of Business"},{"key":"9013_CR36","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1086\/261670","volume":"98","author":"M. H. Rothkopf","year":"1990","unstructured":"Rothkopf, M. H., Teisberg, E. T. J., & Kahn, P. (1990). Why are Vickrey auctions rare? Journal of Political Economy, 98, 94\u2013109.","journal-title":"Journal of Political Economy"},{"key":"9013_CR37","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02627-4","volume-title":"Public-key cryptography","author":"A. Salomaa","year":"1990","unstructured":"Salomaa, A. (1990). Public-key cryptography. Berlin: Springer."},{"key":"9013_CR38","volume-title":"Applied cryptography","author":"B. Schneier","year":"1996","unstructured":"Schneier, B. (1996). Applied cryptography (2nd ed.). New York: Wiley.","edition":"2"},{"key":"9013_CR39","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W. Vickrey","year":"1961","unstructured":"Vickrey, W. (1961). Counterspeculation, Auctions, and Competitive Sealed Tenders. Journal of Finance, 16, 8\u201337.","journal-title":"Journal of Finance"},{"key":"9013_CR40","doi-asserted-by":"crossref","unstructured":"Yao, A. C.-C. (1982). Protocols for secure computation. In Proceedings of the 23rd Foundations of Computer Science (FOCS) conference (pp. 160\u2013164).","DOI":"10.1109\/SFCS.1982.38"},{"issue":"2","key":"9013_CR41","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0004-3702(01)00077-7","volume":"130","author":"M. Yokoo","year":"2001","unstructured":"Yokoo, M., Sakurai, Y., & Matsubara, S. (2001). Robust combinatorial auction protocol against false-name bids. Artificial Intelligence Journal, 130(2), 167\u2013181.","journal-title":"Artificial Intelligence Journal"}],"container-title":["Electronic Commerce Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10660-008-9013-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10660-008-9013-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10660-008-9013-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T20:49:53Z","timestamp":1559249393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10660-008-9013-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,15]]},"references-count":41,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["9013"],"URL":"https:\/\/doi.org\/10.1007\/s10660-008-9013-1","relation":{},"ISSN":["1389-5753","1572-9362"],"issn-type":[{"value":"1389-5753","type":"print"},{"value":"1572-9362","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,15]]}}}