{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:57:38Z","timestamp":1649181458266},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T00:00:00Z","timestamp":1225929600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s00145-008-9032-z","type":"journal-article","created":{"date-parts":[[2008,11,5]],"date-time":"2008-11-05T18:18:54Z","timestamp":1225909134000},"page":"344-371","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["How Should We Solve Search Problems Privately?"],"prefix":"10.1007","volume":"23","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"given":"Tal","family":"Malkin","sequence":"additional","affiliation":[]},{"given":"Kobbi","family":"Nissim","sequence":"additional","affiliation":[]},{"given":"Enav","family":"Weinreb","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,11,6]]},"reference":[{"key":"9032_CR1","doi-asserted-by":"crossref","unstructured":"A. Beimel, P. Carmi, K. Nissim, E. Weinreb, Private approximation of search problems, in Proc. of the 38th ACM Symp. on the Theory of Computing, pp. 119\u2013128, 2006","DOI":"10.1145\/1132516.1132533"},{"key":"9032_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/978-3-540-70936-7_21","volume-title":"Proc. of the Fourth Theory of Cryptography Conference\u2014TCC 2007","author":"A. Beimel","year":"2007","unstructured":"A. Beimel, R. Hallak, K. Nissim, Private approximation of clustering and vertex cover, in Proc. of the Fourth Theory of Cryptography Conference\u2014TCC 2007, ed. by S. Vadhan. Lecture Notes in Computer Science, vol. 4392 (Springer, Berlin, 2007), pp. 383\u2013403"},{"key":"9032_CR3","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for noncryptographic fault-tolerant distributed computations, in Proc. of the 20th ACM Symp. on the Theory of Computing, pp. 1\u201310, 1988","DOI":"10.1145\/62212.62213"},{"key":"9032_CR4","doi-asserted-by":"publisher","first-page":"713","DOI":"10.2307\/2004849","volume":"24","author":"E.R. Berlekamp","year":"1970","unstructured":"E.R. Berlekamp, Factoring polynomials over large finite fields. Math. Comput. 24, 713\u2013735 (1970)","journal-title":"Math. Comput."},{"key":"9032_CR5","unstructured":"N. Bhatnagar, S. Greenberg, D. Randall, Sampling stable marriages: Why spouse-swapping won\u2019t work, in Proc. of the 19th ACM-SIAM Symp. on Discrete Algorithms, pp. 1223\u20131232, 2008"},{"key":"9032_CR6","unstructured":"A.Z. Broder, On the resemblance and containment of documents, in Compression and Complexity of Sequences 1997, pp. 21\u201329, 1997"},{"key":"9032_CR7","doi-asserted-by":"crossref","unstructured":"A.Z. Broder, S.C. Glassman, M.S. Manasse, G. Zweig, Syntactic clustering of the web, in Proc. of World Wide Web Conference, pp. 1157\u20131166, 1997","DOI":"10.1016\/S0169-7552(97)00031-7"},{"issue":"3","key":"9032_CR8","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1006\/jcss.1999.1690","volume":"60","author":"A.Z. Broder","year":"2000","unstructured":"A.Z. Broder, M. Charikar, A.M. Frieze, M. Mitzenmacher, Min-wise independent permutations. J. Comput. Syst. Sci. 60(3), 630\u2013659 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"9032_CR9","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd, Multiparty unconditionally secure protocols, in Proc. of the 20th ACM Symp. on the Theory of Computing, pp. 11\u201319, 1988","DOI":"10.1145\/62212.62214"},{"issue":"1\u20133","key":"9032_CR10","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/S0304-3975(03)00319-0","volume":"306","author":"V.M.F. Dias","year":"2003","unstructured":"V.M.F. Dias, G.D. da Fonseca, C.M.H. de Figueiredo, J.L. Szwarcfiter, The stable marriage problem with restricted pairs. Theor. Comput. Sci. 306(1\u20133), 391\u2013405 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9032_CR11","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1145\/1159892.1159900","volume":"2","author":"J. Feigenbaum","year":"2006","unstructured":"J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M.J. Strauss, R.N. Wright, Secure multiparty computation of approximations. ACM Trans. Algorithms 2(3), 435\u2013472 (2006). Conference version, in Proc. of the 28th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 2076 (Springer, Berlin, 2001), pp. 927\u2013938","journal-title":"ACM Trans. Algorithms"},{"key":"9032_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11967668_11","volume-title":"Topics in Cryptology \u2013 CT-RSA 2007","author":"M. Franklin","year":"2007","unstructured":"M. Franklin, M. Gondree, P. Mohassel, Improved efficiency for private stable matching, in Topics in Cryptology \u2013 CT-RSA 2007, ed. by M. Abe. Lecture Notes in Computer Science, vol. 4377 (Springer, Berlin, 2007), pp. 163\u2013177"},{"key":"9032_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"D. Gale, L.S. Shapley, College admissions and the stability of marriage. Am. Math. Mon. 69, 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"issue":"4","key":"9032_CR14","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, S. Micali, How to construct random functions. J. ACM 33(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"9032_CR15","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game, in Proc. of the 19th ACM Symp. on the Theory of Computing, pp. 218\u2013229, 1987","DOI":"10.1145\/28395.28420"},{"key":"9032_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/11889663_5","volume-title":"10th International Conference on Financial Cryptography and Data Security","author":"P. Golle","year":"2006","unstructured":"P. Golle, A private stable matching algorithm, in 10th International Conference on Financial Cryptography and Data Security, ed. by G. Di. Lecture Notes in Computer Science, vol. 4107 (Springer, Berlin, 2006), pp. 65\u201380"},{"key":"9032_CR17","doi-asserted-by":"crossref","unstructured":"S. Halevi, R. Krauthgamer, E. Kushilevitz, K. Nissim, Private approximation of NP-hard functions, in Proc. of the 33th ACM Symp. on the Theory of Computing, pp. 550\u2013559, 2001","DOI":"10.1145\/380752.380850"},{"key":"9032_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/11681878_13","volume-title":"Proc. of the Third Theory of Cryptography Conference\u2014TCC 2006","author":"P. Indyk","year":"2006","unstructured":"P. Indyk, D. Woodruff, Polylogarithmic private approximations and efficient matching, in Proc. of the Third Theory of Cryptography Conference\u2014TCC 2006, ed. by S. Halevi, T. Rabin. Lecture Notes in Computer Science, vol. 3876 (Springer, Berlin, 2006), pp. 245\u2013264"},{"issue":"4","key":"9032_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1145\/1008731.1008738","volume":"51","author":"M. Jerrum","year":"2004","unstructured":"M. Jerrum, A. Sinclair, E. Vigoda, A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM 51(4), 671\u2013697 (2004)","journal-title":"J. ACM"},{"key":"9032_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","volume":"47","author":"L.G. Valiant","year":"1986","unstructured":"L.G. Valiant, V.V. Vazirani, NP is as easy as detecting unique solutions. Theor. Comput. Sci. 47, 85\u201393 (1986)","journal-title":"Theor. Comput. Sci."},{"key":"9032_CR21","doi-asserted-by":"crossref","unstructured":"A.C. Yao, Protocols for secure computations, in Proc. of the 23th IEEE Symp. on Foundations of Computer Science, pp. 160\u2013164, 1982","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-008-9032-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-008-9032-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-008-9032-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-008-9032-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:43:25Z","timestamp":1586335405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-008-9032-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,6]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["9032"],"URL":"https:\/\/doi.org\/10.1007\/s00145-008-9032-z","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,6]]},"assertion":[{"value":"7 December 2007","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 October 2008","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2008","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}