{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T15:52:11Z","timestamp":1794412331984,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642279539","type":"print"},{"value":"9783642279546","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-27954-6_26","type":"book-chapter","created":{"date-parts":[[2012,2,22]],"date-time":"2012-02-22T09:23:15Z","timestamp":1329902595000},"page":"416-432","source":"Crossref","is-referenced-by-count":64,"title":["Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces"],"prefix":"10.1007","author":[{"given":"Seung Geol","family":"Choi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kyung-Wook","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tal","family":"Malkin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dan","family":"Rubenstein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Armbrust, M., Fox, A., Griffith, R., Joseph, A.D., Katz, R., Konwinski, A., Lee, G., Patterson, D.A., Rabkin, A., Stoica, I., Zaharia, M.: Above the clouds: A Berkeley view of cloud computing. Technical Report UCB\/EECS-2009-28, EECS Department, UC Berkeley (2009)"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-44750-4_8","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"D. Beaver","year":"1995","unstructured":"Beaver, D.: Precomputing Oblivious Transfer. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 97\u2013109. Springer, Heidelberg (1995)"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Ben-David, A., Nisan, N., Pinkas, B.: FairplayMP: A system for secure multi-party computation. In: 15th ACM Conf. on Computer and Communications Security, pp. 257\u2013266. ACM Press (2008)","DOI":"10.1145\/1455770.1455804"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-88313-5_13","volume-title":"Computer Security - ESORICS 2008","author":"D. Bogdanov","year":"2008","unstructured":"Bogdanov, D., Laur, S., Willemson, J.: Sharemind: A Framework for Fast Privacy-Preserving Computations. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol.\u00a05283, pp. 192\u2013206. Springer, Heidelberg (2008)"},{"key":"26_CR5","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., Christensen, D.L., Damg\u00e5rd, I., Geisler, M., Jakobsen, T., Kr\u00f8igaard, M., Nielsen, J.D., Nielsen, J.B., Nielsen, K., Pagter, J., Schwartzbach, M., Toft, T.: Secure Multiparty Computation Goes Live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol.\u00a05628, pp. 325\u2013343. Springer, Heidelberg (2009)"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/11889663_10","volume-title":"Financial Cryptography and Data Security","author":"P. Bogetoft","year":"2006","unstructured":"Bogetoft, P., Damg\u00e5rd, I., Jakobsen, T., Nielsen, K., Pagter, J., Toft, T.: A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol.\u00a04107, pp. 142\u2013147. Springer, Heidelberg (2006)"},{"key":"26_CR7","unstructured":"Burkhart, M., Strasser, M., Many, D., Dimitropoulos, X.: SEPIA: Privacy-preserving aggregation of multi-domain network events and statistics. In: 19th USENIX Security Symposium, pp. 223\u2013240. USENIX Association (2010)"},{"issue":"3","key":"26_CR8","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1109\/JPROC.2004.842784","volume":"93","author":"R. Buyya","year":"2005","unstructured":"Buyya, R., Abramson, D., Venugopal, S.: The grid economy. Proc. IEEE\u00a093(3), 698\u2013714 (2005)","journal-title":"Proc. IEEE"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/3-540-45748-8_29","volume-title":"Peer-to-Peer Systems","author":"Y. Chen","year":"2002","unstructured":"Chen, Y., Katz, R.H., Katz, Y.H., Kubiatowicz, J.D.: Dynamic Replica Placement for Scalable Content Delivery. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, pp. 306\u2013318. Springer, Heidelberg (2002)"},{"key":"26_CR10","unstructured":"Choi, S.G., Hwang, K., Katz, J., Malkin, T., Rubenstein, D.: Secure multi-party computation of boolean circuits with applications to privacy in on-line marketplaces. Cryptology ePrint Archive, Report 2011\/257 (2011), \n                    \n                      http:\/\/eprint.iacr.org\/2011\/257"},{"key":"26_CR11","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.\u00a05443, pp. 160\u2013179. Springer, Heidelberg (2009)"},{"key":"26_CR12","series-title":"Basic Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Applications, vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game, or a completeness theorem for protocols with honest majority. In: 19th ACM STOC Annual ACM Symposium on Theory of Computing (STOC), pp. 218\u2013229. ACM Press (1987)","DOI":"10.1145\/28395.28420"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Henecka, W., K\u00f6gl, S., Sadeghi, A.-R., Schneider, T., Wehrenberg, I.: TASTY: Tool for automating secure two-party computations. In: 17th ACM Conf. on Computer and Communications Security (CCCS), pp. 451\u2013462. ACM Press (2010)","DOI":"10.1145\/1866307.1866358"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: 20th USENIX Security Symposium. USENIX Association (2011)","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y. Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending Oblivious Transfers Efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 145\u2013161. Springer, Heidelberg (2003)"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-13708-2_16","volume-title":"Applied Cryptography and Network Security","author":"T.P. Jakobsen","year":"2010","unstructured":"Jakobsen, T.P., Makkes, M.X., Nielsen, J.D.: Efficient Implementation of the Orlandi Protocol. In: Zhou, J., Yung, M. (eds.) ACNS 2010. LNCS, vol.\u00a06123, pp. 255\u2013272. Springer, Heidelberg (2010)"},{"issue":"4","key":"26_CR18","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/S0140-3664(01)00409-1","volume":"25","author":"J. Kangasharju","year":"2002","unstructured":"Kangasharju, J., Roberts, J., Ross, K.W.: Object replication strategies in content distribution networks. Computer Communications\u00a025(4), 376\u2013383 (2002)","journal-title":"Computer Communications"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-10433-6_1","volume-title":"Cryptology and Network Security","author":"V. Kolesnikov","year":"2009","unstructured":"Kolesnikov, V., Sadeghi, A.-R., Schneider, T.: Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol.\u00a05888, pp. 1\u201320. Springer, Heidelberg (2009)"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1007\/978-3-540-87700-4_106","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN X","author":"P.R. Lewis","year":"2008","unstructured":"Lewis, P.R., Marrow, P., Yao, X.: Evolutionary Market Agents for Resource Allocation in Decentralised Systems. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol.\u00a05199, pp. 1071\u20131080. Springer, Heidelberg (2008)"},{"key":"26_CR21","unstructured":"Li, B., Li, H., Xu, G., Xu, H.: Efficient reduction of 1-out-of-n oblivious transfers in random oracle model. Cryptology ePrint Archive, Report 2005\/279 (2005)"},{"key":"26_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-85855-3_2","volume-title":"Security and Cryptography for Networks","author":"Y. Lindell","year":"2008","unstructured":"Lindell, Y., Pinkas, B., Smart, N.P.: Implementing Two-Party Computation Efficiently with Security against Malicious Adversaries. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol.\u00a05229, pp. 2\u201320. Springer, Heidelberg (2008)"},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Malka, L., Katz, J.: VMCrypt \u2014 modular software architecture for scalable secure computation, \n                    \n                      http:\/\/eprint.iacr.org\/2010\/584","DOI":"10.1145\/2046707.2046787"},{"key":"26_CR24","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay \u2014 a secure two-party computation system. In: 13th USENIX Security Symposium, pp. 287\u2013302. USENIX Association (2004)"},{"issue":"1","key":"26_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-004-0102-6","volume":"18","author":"M. Naor","year":"2005","unstructured":"Naor, M., Pinkas, B.: Computationally secure oblivious transfer. J. Cryptology\u00a018(1), 1\u201335 (2005)","journal-title":"J. Cryptology"},{"key":"26_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-10366-7_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"B. Pinkas","year":"2009","unstructured":"Pinkas, B., Schneider, T., Smart, N.P., Williams, S.C.: Secure Two-Party Computation is Practical. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 250\u2013267. Springer, Heidelberg (2009)"},{"issue":"3","key":"26_CR27","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1016\/j.ejor.2006.05.049","volume":"187","author":"B. Schnizler","year":"2008","unstructured":"Schnizler, B., Neumann, D., Veit, D., Weinhardt, C.: Trading grid services \u2014 a multi-attribute combinatorial approach. European J. Operational Research\u00a0187(3), 943\u2013961 (2008)","journal-title":"European J. Operational Research"},{"key":"26_CR28","doi-asserted-by":"crossref","unstructured":"Tan, Z., Gurd, J.R.: Market-based grid resource allocation using a stable continuous double auction. In: Proc. 8th IEEE\/ACM Intl. Conf. on Grid Computing, pp. 283\u2013290. IEEE (2007)","DOI":"10.1109\/GRID.2007.4354144"},{"issue":"3","key":"26_CR29","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1177\/109434200101500305","volume":"15","author":"R. Wolski","year":"2006","unstructured":"Wolski, R., Plank, J.S., Brevik, J., Bryan, T.: Analyzing market-based resource allocation strategies for the computational grid. International Journal of High Performance Computing Applications\u00a015(3), 258\u2013281 (2006)","journal-title":"International Journal of High Performance Computing Applications"},{"key":"26_CR30","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets. In: 27th Annual Symp. on Foundations of Computer Science (FOCS), pp. 162\u2013167. IEEE (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2012"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27954-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:38:14Z","timestamp":1558298294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27954-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642279539","9783642279546"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27954-6_26","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-27954-6","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}