{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:05:44Z","timestamp":1725473144068},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540462422"},{"type":"electronic","value":"9783540462439"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11888727_16","type":"book-chapter","created":{"date-parts":[[2006,11,22]],"date-time":"2006-11-22T07:54:45Z","timestamp":1164182085000},"page":"212-225","source":"Crossref","is-referenced-by-count":1,"title":["On Correctness and Privacy in Distributed Mechanisms"],"prefix":"10.1007","author":[{"given":"Felix","family":"Brandt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tuomas","family":"Sandholm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1111\/1467-937X.00140","volume":"67","author":"C. Avery","year":"2000","unstructured":"Avery, C., Hendershott, T.: Bundling and optimal auctions of multiple products. Review of Economic Studies\u00a067, 483\u2013497 (2000)","journal-title":"Review of Economic Studies"},{"key":"16_CR2","first-page":"1","volume-title":"Proc.\u00a0of 20th STOC","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc.\u00a0of 20th STOC, pp. 1\u201310. ACM Press, New York (1988)"},{"key":"16_CR3","first-page":"133","volume-title":"Proc.\u00a0of 24th IEEE Spring Computer Conference","author":"M. Blum","year":"1982","unstructured":"Blum, M.: Coin flipping by telephone. In: Proc.\u00a0of 24th IEEE Spring Computer Conference, pp. 133\u2013137. IEEE Press, Los Alamitos (1982)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/0-387-34799-2_4","volume-title":"Advances in Cryptology - CRYPTO 1988","author":"M. Ben-Or","year":"1990","unstructured":"Ben-Or, M., Goldreich, O., Goldwasser, S., H\u00e5stad, J., Kilian, J., Micali, S., Rogaway, P.: Everything provable is provable in zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 37\u201356. Springer, Heidelberg (1990)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-45126-6_16","volume-title":"Financial Cryptography","author":"F. Brandt","year":"2003","unstructured":"Brandt, F.: Fully private auctions in a constant number of rounds. In: Wright, R.N. (ed.) FC 2003. LNCS, vol.\u00a02742, pp. 223\u2013238. Springer, Heidelberg (2003)"},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1145\/779928.779968","volume-title":"Proc.\u00a0of 4th ACM Conference on Electronic Commerce","author":"F. Brandt","year":"2003","unstructured":"Brandt, F.: Social choice and preference protection - Towards fully private mechanism design. In: Nisan, N. (ed.) Proc.\u00a0of 4th ACM Conference on Electronic Commerce, pp. 220\u2013221. ACM Press, New York (2003)"},{"key":"16_CR7","first-page":"810","volume-title":"Proc.\u00a0of 3rd AAMAS Conference","author":"F. Brandt","year":"2004","unstructured":"Brandt, F., Sandholm, T. (Im)possibility of unconditionally privacy-preserving auctions. In: Sierra, C., Sonenberg, L. (eds.) Proc.\u00a0of 3rd AAMAS Conference, pp. 810\u2013817. ACM Press, New York (2004)"},{"issue":"3","key":"16_CR8","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"J. Bartholdi III","year":"1989","unstructured":"Bartholdi III, J., Tovey, C.A., Trick, M.A.: The computational difficulty of manipulating an election. Social Choice and Welfare\u00a06(3), 227\u2013241 (1989)","journal-title":"Social Choice and Welfare"},{"key":"16_CR9","first-page":"11","volume-title":"Proc.\u00a0of 20th STOC","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multi-party unconditionally secure protocols. In: Proc.\u00a0of 20th STOC, pp. 11\u201319. ACM Press, New York (1988)"},{"key":"16_CR10","first-page":"36","volume-title":"Proc.\u00a0of 21st STOC","author":"B. Chor","year":"1989","unstructured":"Chor, B., Kushilevitz, E.: A zero-one law for Boolean privacy. In: Proc.\u00a0of 21st STOC, pp. 36\u201347. ACM Press, New York (1989)"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1145\/501158.501191","volume-title":"Proc.\u00a0of 3rd ACM Conference on E-Commerce","author":"W. Conen","year":"2001","unstructured":"Conen, W., Sandholm, T.: Preference elicitation in combinatorial auctions. In: Proc.\u00a0of 3rd ACM Conference on E-Commerce, pp. 256\u2013259. ACM Press, New York (2001)"},{"unstructured":"Conitzer, V., Sandholm, T.: Complexity of mechanism design. In: Proc.\u00a0of 18th Conference on Uncertainty in Artificial Intelligence (UAI), pp. 103\u2013110 (2002)","key":"16_CR12"},{"key":"16_CR13","first-page":"392","volume-title":"Proc.\u00a0of 18th AAAI Conference","author":"V. Conitzer","year":"2002","unstructured":"Conitzer, V., Sandholm, T.: Vote elicitation: Complexity and strategy-proofness. In: Proc.\u00a0of 18th AAAI Conference, pp. 392\u2013397. AAAI Press, Menlo Park (2002)"},{"unstructured":"Conitzer, V., Sandholm, T.: Applications of automated mechanism design. In: Proc.\u00a0of UAI workshop on Bayesian Modeling Applications (2003)","key":"16_CR14"},{"doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T.: Computational criticisms of the revelation principle. In: Proc. of 5th Workshop on Agent Mediated Electronic Commerce (AMEC). LNCS. Springer, Heidelberg (2003)","key":"16_CR15","DOI":"10.1145\/988772.988824"},{"unstructured":"Conitzer, V., Sandholm, T.: Universal voting protocol tweaks to make manipulation hard. In: Proc.\u00a0of 18th IJCAI, pp. 781\u2013788 (2003)","key":"16_CR16"},{"issue":"6","key":"16_CR17","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory\u00a0IT-22(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"unstructured":"Feigenbaum, J., Nisan, N., Ramachandran, V., Sami, R., Shenker, S.: Agents\u2019 privacy in distributed algorithmic mechanisms. Position Paper (2002)","key":"16_CR18"},{"key":"16_CR19","first-page":"1","volume-title":"Proc. of 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications","author":"J. Feigenbaum","year":"2002","unstructured":"Feigenbaum, J., Shenker, S.: Distributed algorithmic mechanism design: Recent results and future directions. In: Proc. of 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 1\u201313. ACM Press, New York (2002)"},{"key":"16_CR20","first-page":"218","volume-title":"Proc. of 19th STOC","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proc. of 19th STOC, pp. 218\u2013229. ACM Press, New York (1987)"},{"key":"16_CR21","series-title":"Basic Tools","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Tools, vol.\u00a01. Cambridge University Press, Cambridge (2001)"},{"key":"16_CR22","volume-title":"Proc.\u00a0of 36th STOC","author":"J. Halpern","year":"2004","unstructured":"Halpern, J., Teague, V.: Rational secret sharing and multiparty computation. In: Proc.\u00a0of 36th STOC, ACM Press, New York (2004)"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-46088-8_27","volume-title":"Financial Cryptography","author":"H. Kikuchi","year":"2002","unstructured":"Kikuchi, H.: (M+1)st-price auction protocol. In: Syverson, P.F. (ed.) FC 2001. LNCS, vol.\u00a02339, pp. 351\u2013363. Springer, Heidelberg (2002)"},{"key":"16_CR24","first-page":"416","volume-title":"Proc.\u00a0of 30th FOCS Symposium","author":"E. Kushilevitz","year":"1989","unstructured":"Kushilevitz, E.: Privacy and communication complexity. In: Proc.\u00a0of 30th FOCS Symposium, pp. 416\u2013421. IEEE Computer Society Press, Los Alamitos (1989)"},{"issue":"3","key":"16_CR25","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Transactions on Programming Languages and Systems\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"doi-asserted-by":"crossref","unstructured":"McGrew, R., Porter, R., Shoham, Y.: Towards a general theory of non-cooperative computation. In: Proc.\u00a0of 9th International Conference on Theoretical Aspects of Rationality and Knowledge (TARK) (2003)","key":"16_CR26","DOI":"10.1145\/846241.846249"},{"key":"16_CR27","first-page":"32","volume-title":"Proc.\u00a0of 15th AAAI Conference","author":"D. Monderer","year":"1999","unstructured":"Monderer, D., Tennenholtz, M.: Distributed games: From mechanisms to protocols. In: Proc.\u00a0of 15th AAAI Conference, pp. 32\u201337. AAAI Press, Menlo Park (1999)"},{"key":"16_CR28","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/988772.988791","volume-title":"Proc.\u00a0of 5th ACM Conference on E-Commerce","author":"A. Mehta","year":"2004","unstructured":"Mehta, A., Vazirani, V.: Randomized truthful auctions of digital goods are randomizations over truthful auctions. In: Proc.\u00a0of 5th ACM Conference on E-Commerce, pp. 120\u2013124. ACM Press, New York (2004)"},{"key":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/0-387-34805-0_13","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"M. Naor","year":"1990","unstructured":"Naor, M.: Bit commitment using pseudorandomness. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 128\u2013137. Springer, Heidelberg (1990)"},{"key":"16_CR30","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/336992.337028","volume-title":"Proc.\u00a0of 1st ACM Conference on E-Commerce","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: Proc.\u00a0of 1st ACM Conference on E-Commerce, pp. 129\u2013139. ACM Press, New York (1999)"},{"key":"16_CR31","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1145\/779928.779938","volume-title":"Proc.\u00a0of 4th ACM Conference on E-Commerce","author":"R. Porter","year":"2003","unstructured":"Porter, R., Shoham, Y.: On cheating in sealed-bid auctions. In: Proc.\u00a0of 4th ACM Conference on E-Commerce, pp. 76\u201384. ACM Press, New York (2003)"},{"issue":"1","key":"16_CR32","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1086\/261670","volume":"98","author":"M.H. Rothkopf","year":"1990","unstructured":"Rothkopf, M.H., Teisberg, T.J., Kahn, E.P.: Why are Vickrey auctions rare? Journal of Political Economy\u00a098(1), 94\u2013109 (1990)","journal-title":"Journal of Political Economy"},{"key":"16_CR33","first-page":"256","volume-title":"Proc.\u00a0of 10th AAAI Conference","author":"T. Sandholm","year":"1993","unstructured":"Sandholm, T.: An implementation of the contract net protocol based on marginal cost calculations. In: Proc.\u00a0of 10th AAAI Conference, pp. 256\u2013262. AAAI Press, Menlo Park (1993)"},{"key":"16_CR34","first-page":"160","volume-title":"Proc.\u00a0of 23th FOCS Symposium","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Protocols for secure computation. In: Proc.\u00a0of 23th FOCS Symposium, pp. 160\u2013164. IEEE Computer Society Press, Los Alamitos (1982)"}],"container-title":["Lecture Notes in Computer Science","Agent-Mediated Electronic Commerce. Designing Trading Agents and Mechanisms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11888727_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T12:43:52Z","timestamp":1555937032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11888727_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462422","9783540462439"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/11888727_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}