{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T04:21:52Z","timestamp":1747196512668,"version":"3.40.5"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662454718"},{"type":"electronic","value":"9783662454725"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45472-5_26","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:31:39Z","timestamp":1416000699000},"page":"399-416","source":"Crossref","is-referenced-by-count":3,"title":["Privacy Preserving T\u00e2tonnement"],"prefix":"10.1007","author":[{"given":"John Ross","family":"Wallrabenstein","sequence":"first","affiliation":[]},{"given":"Chris","family":"Clifton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,9]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Cole, R., Fleischer, L.: Fast-converging tatonnement algorithms for one-time and ongoing market problems. In: STOC \u201908: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 315\u2013324. ACM, New York (2008)","DOI":"10.1145\/1374376.1374422"},{"key":"26_CR2","unstructured":"Walras, L.: \u00c9lements d\u2019Economie Politique or Elements of Pure Economics; translated by William Jaffe (1874)"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-44598-6_7","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y Dodis","year":"2000","unstructured":"Dodis, Y., Halevi, S., Rabin, T.: A cryptographic solution to a game theoretic problem. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 112\u2013130. Springer, Heidelberg (2000)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-642-32928-9_16","volume-title":"Security and Cryptography for Networks","author":"R Canetti","year":"2012","unstructured":"Canetti, R., Vald, M.: Universally composable security with local adversaries. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol. 7485, pp. 281\u2013301. Springer, Heidelberg (2012)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-642-20465-4_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"G Asharov","year":"2011","unstructured":"Asharov, G., Canetti, R., Hazay, C.: Towards a game theoretic view of secure computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 426\u2013445. Springer, Heidelberg (2011)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Gradwohl, R., Livne, N., Rosen, A.: Sequential rationality in cryptographic protocols. In: Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS \u201910, pp. 623\u2013632. IEEE Computer Society, Washington, DC (2010)","DOI":"10.1109\/FOCS.2010.65"},{"key":"26_CR7","unstructured":"Halpern, J.Y., Pass, R.: Game theory with costly computation. In: Proceedings of the Behavioral and Quantitative Game Theory on Conference on Future Directions BQGT, vol. 10, p. 1 (2008)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Izmalkov, S., Micali, S., Lepinski, M.: Rational secure computation and ideal mechanism design. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS \u201905, pp. 585\u2013595. IEEE Computer Society, Washington, DC (2005)","DOI":"10.1109\/SFCS.2005.64"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-540-78524-8_15","volume-title":"Theory of Cryptography","author":"J Katz","year":"2008","unstructured":"Katz, J.: Bridging game theory and cryptography: recent results and future directions. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 251\u2013272. Springer, Heidelberg (2008)"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Kol, G., Naor, M.: Games for exchanging information. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC \u201908, pp. 423\u2013432. ACM, New York (2008)","DOI":"10.1145\/1374376.1374437"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/11818175_11","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"A Lysyanskaya","year":"2006","unstructured":"Lysyanskaya, A., Triandopoulos, N.: Rationality and adversarial behavior in multi-party computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 180\u2013197. Springer, Heidelberg (2006)"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC \u201987: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 218\u2013229. ACM, New York (1987)","DOI":"10.1145\/28395.28420"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: SFCS \u201986: Proceedings of the 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE Computer Society, Washington, DC (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-03549-4_20","volume-title":"Financial Cryptography and Data Security","author":"P Bogetoft","year":"2009","unstructured":"Bogetoft, P., et al.: Secure multiparty computation goes live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325\u2013343. Springer, Heidelberg (2009)"},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1287\/msom.1070.0167","volume":"10","author":"C Clifton","year":"2008","unstructured":"Clifton, C., Iyer, A., Cho, R., Jiang, W., Kantarc\u0131o\u011flu, M., Vaidya, J.: An approach to identifying beneficial collaboration securely in decentralized logistics systems. Manage. Serv. Oper. Manage. 10, 108\u2013125 (2008)","journal-title":"Manage. Serv. Oper. Manage."},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1093\/revfin\/hhm001","volume":"20","author":"J Eaves","year":"2007","unstructured":"Eaves, J., Williams, J.C.: Walrasian ttonnement auctions on the tokyo grain exchange. Rev. Financ. Stud. 20, 1183\u20131218 (2007)","journal-title":"Rev. Financ. Stud."},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Jiang, W., Clifton, C.: Ac-framework for privacy-preserving collaboration. In: Proceedings of the Seventh SIAM International Conference on Data Mining. SIAM, Minneapolis, 26\u201328 April 2007","DOI":"10.1137\/1.9781611972771.5"},{"key":"26_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography, vol. 2. Cambridge University Press, New York (2004)"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Ben-David, A., Nisan, N., Pinkas, B.: Fairplaymp: a system for secure multi-party computation. In: Proceedings of the 15th ACM Conference on Computer and Communications Security, CCS \u201908, pp. 257\u2013266. ACM, New York (2008)","DOI":"10.1145\/1455770.1455804"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-00468-1_10","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"I Damg\u00e5rd","year":"2009","unstructured":"Damg\u00e5rd, I., Geisler, M., Kr\u00f8igaard, M., Nielsen, J.B.: Asynchronous multiparty computation: theory and implementation. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 160\u2013179. Springer, Heidelberg (2009)"},{"key":"26_CR21","unstructured":"Burkhart, M., Strasser, M., Many, D., Dimitropoulos, X.: Sepia: privacy-preserving aggregation of multi-domain network events and statistics. In: Proceedings of the 19th USENIX Conference on Security, USENIX Security\u201910, p. 15. USENIX Association, Berkeley (2010)"},{"key":"26_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-32946-3_13","volume-title":"Financial Cryptography and Data Security","author":"M Dahl","year":"2012","unstructured":"Dahl, M., Ning, C., Toft, T.: On secure two-party integer division. In: Keromytis, A.D. (ed.) FC 2012. LNCS, vol. 7397, pp. 164\u2013178. Springer, Heidelberg (2012)"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-85230-8_9","volume-title":"Financial Cryptography and Data Security","author":"KB Frikken","year":"2008","unstructured":"Frikken, K.B., Opyrchal, L.: PBS: private bartering systems. In: Tsudik, G. (ed.) FC 2008. LNCS, vol. 5143, pp. 113\u2013127. Springer, Heidelberg (2008)"},{"key":"26_CR24","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: EC \u201999: Proceedings of the 1st ACM Conference on Electronic Commerce, pp. 129\u2013139. ACM, New York (1999)","DOI":"10.1145\/336992.337028"},{"key":"26_CR25","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28, 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"26_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"26_CR28","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Ann. Math. 54, 286\u2013295 (1951)","journal-title":"Ann. Math."}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45472-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T18:26:48Z","timestamp":1747160808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45472-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662454718","9783662454725"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45472-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}