{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:01:28Z","timestamp":1725494488867},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540768999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76900-2_17","type":"book-chapter","created":{"date-parts":[[2007,11,4]],"date-time":"2007-11-04T20:38:44Z","timestamp":1194208724000},"page":"283-297","source":"Crossref","is-referenced-by-count":6,"title":["Multi-party Indirect Indexing and Applications"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Franklin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Gondree","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Payman","family":"Mohassel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44987-6_8","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"B. Aiello","year":"2001","unstructured":"Aiello, B., Ishai, Y., Reingold, O.: Priced oblivious transfer: How to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 119\u2013135. Springer, Heidelberg (2001)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"O. Barkol","year":"2005","unstructured":"Barkol, O., Ishai, Y.: Secure computation of constant-depth circuits with application to database search problems. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, Springer, Heidelberg (2005)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant disributed computation. In: Proc. of STOC 1988, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Brassard, G., Cr\u00e9peau, C., Robert, J.-M.: Information theoretic reductions among disclosure problems. In: Proc. of FOCS, pp. 168\u2013173 (1986)","DOI":"10.1109\/SFCS.1986.26"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology\u00a013, 143\u2013202 (2000)","journal-title":"Journal of Cryptology"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions. In: Proc. of FOCS, pp. 42\u201352 (1988)","DOI":"10.1109\/SFCS.1988.21920"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/11681878_15","volume-title":"Theory of Cryptography","author":"I. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 285\u2013304. Springer, Heidelberg (2006)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of Paillier\u2019s probabilistic public-key system. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Jurik, M.: A length-flexible threshold cryptosystem with applications. In: Information Security and Privacy, pp. 350\u2013364 (2003)","DOI":"10.1007\/3-540-45067-X_30"},{"issue":"6","key":"17_CR10","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Comm. of the ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Comm. of the ACM"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Franklin, M., Gondree, M., Mohassel, P.: Improved efficiency for private stable matching. In: Proc. of CT-RSA (2007)","DOI":"10.1007\/11967668_11"},{"key":"17_CR12","unstructured":"Franklin, M., Gondree, M., Mohassel, P.: Multi-party indirect indexing and applications. Cryptology ePrint Archive, Report 2007\/341 (2007)"},{"key":"17_CR13","unstructured":"Freuder, E.C., Wallace, R.J.: Constraint-based multi-agent meeting scheduling: effects of agent heterogeneity on performance and privacy loss. In: Proc. of the 3rd Workshop on Distributed Constraint Reasoning (DCR 2002), pp. 176\u2013182 (2002)"},{"key":"17_CR14","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: Proc. of STOC 1987, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"17_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography. Cambridge University Press, Cambridge (2001)"},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. Journal of the ACM\u00a043(3), 431\u2013473 (1996)","journal-title":"Journal of the ACM"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/3-540-48184-2_6","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"O. Goldreich","year":"1988","unstructured":"Goldreich, O., Vainish, R.: How to solve any protocol problem - an efficiency improvement. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 73\u201386. Springer, Heidelberg (1988)"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11889663_5","volume-title":"Financial Cryptography and Data Security","author":"P. Golle","year":"2006","unstructured":"Golle, P.: A private stable matching algorithm. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol.\u00a04107, Springer, Heidelberg (2006)"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Malkin, T., Strauss, M.J., Wright, R.N.: Private multiparty sampling and approximation of vector combinations. In: Proc. of International Colloquium on Automata, Languages and Programming (ICALP) (2007)","DOI":"10.1007\/978-3-540-73420-8_23"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A general completeness theorem for 2-party games. In: Proc. of STOC 1991, pp. 553\u2013560 (1991)","DOI":"10.1145\/103418.103475"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: Single database, computationally-private information retrieval. In: Proc. of FOCS, pp. 364\u2013373 (1997)","DOI":"10.1109\/SFCS.1997.646125"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/978-3-540-40061-5_27","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"H. Lipmaa","year":"2003","unstructured":"Lipmaa, H.: Verifiable homomorphic oblivious transfer and private equality test. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 416\u2013433. Springer, Heidelberg (2003)"},{"key":"17_CR23","unstructured":"Meisels, A., Lavee, O.: Using additional information in DisCSP search. In: Proc. of the 5th Workshop on Distributed Constraint Reasoning (DCR-04) (2004)"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Naor, M., Nissim, K.: Communication preserving protocols for secure function evaluation. In: Proc. of STOC 2001, pp. 590\u2013599 (2001)","DOI":"10.1145\/380752.380855"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: Proc. of STOC 1999, pp. 245\u2013254 (1999)","DOI":"10.1145\/301250.301312"},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-44448-3_16","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Naor","year":"2000","unstructured":"Naor, M., Pinkas, B.: Distributed oblivious transfer. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 205\u2013219. Springer, Heidelberg (2000)"},{"key":"17_CR27","first-page":"129","volume-title":"EC 1999","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: EC 1999. Proc. of the 1st ACM conference on Electronic Commerce, pp. 129\u2013139. ACM Press, New York (1999)"},{"key":"17_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/3-540-36231-2_31","volume-title":"Progress in Cryptology - INDOCRYPT 2002","author":"V. Nikov","year":"2002","unstructured":"Nikov, V., Nikova, S., Preneel, B., Vandewalle, J.: On unconditionally secure distributed oblivious transfer. In: Menezes, A.J., Sarkar, P. (eds.) INDOCRYPT 2002. LNCS, vol.\u00a02551, pp. 395\u2013408. Springer, Heidelberg (2002)"},{"key":"17_CR29","unstructured":"Nissim, K., Zivan, R.: Secure DisCSP protocols - from centralized towards distributed solutions. In: Proc. of the 6th Workshop on Distributed Constraint Reasoning (DCR-05) (2005)"},{"key":"17_CR30","unstructured":"Ostrovsky, R., Skeith III, W.E.: A survey of single database PIR: Techniques and applications. Cryptology ePrint Archive, Report 2007\/059 (2007)"},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Shoup, V.: Private information storage (extended abstract). In: Proc of STOC 1997, pp. 294\u2013303 (1997)","DOI":"10.1145\/258533.258606"},{"issue":"2","key":"17_CR32","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/322123.322138","volume":"26","author":"N. Pippenger","year":"1979","unstructured":"Pippenger, N., Fischer, M.J.: Relations among complexity measures. Journal of the ACM\u00a026(2), 361\u2013381 (1979)","journal-title":"Journal of the ACM"},{"key":"17_CR33","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. Technical Report TR-81, Harvard University, available as the Cryptology ePrint Archive Report 2005\/187 (1981), http:\/\/eprint.iacr.org\/"},{"key":"17_CR34","unstructured":"Silaghi, M.-C.: Solving a distributed CSP with cryptographic multi-party computations, without revealing constraints and without involving trusted servers. In: Proc. of the 4th Workshop on Distributed Constraint Reasoning (DCR-03) (2003)"},{"key":"17_CR35","doi-asserted-by":"crossref","unstructured":"Silaghi, M.-C., Mitra, D.: Distributed constraint satisfaction and optimization with privacy enforcement. In: Proc. of the 3rd International Conference on Intelligence Agent Technology, pp. 531\u2013535 (2004)","DOI":"10.1109\/IAT.2004.1343012"},{"key":"17_CR36","doi-asserted-by":"crossref","unstructured":"Solotorevsky, G., Gudes, E., Meisels, A.: Modeling and solving distributed constraint satisfaction problems (DCSPs). In: Constraint Processing-96, pp. 561\u2013562 (1996)","DOI":"10.1007\/3-540-61551-2_116"},{"key":"17_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/3-540-49649-1_28","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"J.P. Stern","year":"1998","unstructured":"Stern, J.P.: A new and efficient all-or-nothing disclosure of secrets protocol. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 357\u2013371. Springer, Heidelberg (1998)"},{"key":"17_CR38","unstructured":"Yokoo, M.: Algorithms for distributed satisfaction problems: A review. In: Autonomous Agents and Multi-Agent Sys., pp. 198\u2013212 (2000)"},{"key":"17_CR39","doi-asserted-by":"crossref","unstructured":"Yokoo, M., Suzuki, K., Hirayama, K.: Secure distributed constraint satisfaction: Reaching agreement without revealing private information. In: Artificial Intelligence, pp. 229\u2013246 (2005)","DOI":"10.1016\/j.artint.2004.10.007"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76900-2_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:45:56Z","timestamp":1619505956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76900-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540768999"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76900-2_17","relation":{},"subject":[]}}