{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:25Z","timestamp":1725488965718},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540741428"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74143-5_3","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T13:51:33Z","timestamp":1186667493000},"page":"31-49","source":"Crossref","is-referenced-by-count":0,"title":["How Should We Solve Search Problems Privately?"],"prefix":"10.1007","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","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Beimel, A., Carmi, P., Nissim, K., Weinreb, E.: Private approximation of search problems. In: Proc. of the 38th Symp. on the Theory of Comp. pp. 119\u2013128 (2006)","DOI":"10.1145\/1132516.1132533"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-540-70936-7_21","volume-title":"Theory of Cryptography","author":"A. Beimel","year":"2007","unstructured":"Beimel, A., Hallak, R., Nissim, K.: Private approximation of clustering and vertex cover. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 383\u2013403. Springer, Heidelberg (2007)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: Proc. of the 20th Symp. on the Theory of Comp. pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"713","DOI":"10.2307\/2004849","volume":"24","author":"E.R Berlekamp","year":"1970","unstructured":"Berlekamp, E.R: Factoring polynomials over large finite fields. Math. Comp.\u00a024, 713\u2013735 (1970)","journal-title":"Math. Comp."},{"key":"3_CR5","unstructured":"Broder, A.Z.: On the resemblance and containment of documents. In: Compression and Complexity of Sequences 1997, pp. 21\u201329 (1997)"},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1006\/jcss.1999.1690","volume":"60","author":"A.Z. Broder","year":"2000","unstructured":"Broder, A.Z., Charikar, M., Frieze, A.M., Mitzenmacher, M.: Min-wise independent permutations. J. of Computer and System Sciences\u00a060(3), 630\u2013659 (2000)","journal-title":"J. of Computer and System Sciences"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Broder, A.Z., Glassman, S.C., Manasse, M.S., Zweig, G.: Syntactic clustering of the web. In: Proc. of World Wide Web conference, pp. 1157\u20131166 (1997)","DOI":"10.1016\/S0169-7552(97)00031-7"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: Proc. of the 20th Symp. on the Theory of Comp. pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"issue":"1\u20133","key":"3_CR9","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":"Dias, V.M.F., da Fonseca, G.D., de Figueiredo, C.M.H., Szwarcfiter, J.L.: The stable marriage problem with restricted pairs. Theoretical Computer Science\u00a0306(1\u20133), 391\u2013405 (2003)","journal-title":"Theoretical Computer Science"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1007\/3-540-48224-5_75","volume-title":"Automata, Languages and Programming","author":"J. Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Ishai, Y., Malkin, T., Nissim, K., Strauss, M.J., Wright, R.N.: Secure multiparty computation of approximations. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 927\u2013938. Springer, Heidelberg (2001)"},{"key":"3_CR11","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":"2006","unstructured":"Franklin, M., Gondree, M., Mohassel, P.: Improved efficiency for private stable matching. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol.\u00a04377, pp. 163\u2013177. Springer, Heidelberg (2006)"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. American Mathematical Monthly\u00a069, 9\u201315 (1962)","journal-title":"American Mathematical Monthly"},{"issue":"4","key":"3_CR13","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. of the ACM\u00a033(4), 792\u2013807 (1986)","journal-title":"J. of the ACM"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proc. of the 19th Symp. on the Theory of Comp. pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","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, pp. 65\u201380. Springer, Heidelberg (2006)"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Halevi, S., Krauthgamer, R., Kushilevitz, E., Nissim, K.: Private approximation of NP-hard functions. In: Proc. of the 33th Symp. on the Theory of Comp. pp. 550\u2013559 (2001)","DOI":"10.1145\/380752.380850"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/11681878_13","volume-title":"Theory of Cryptography","author":"P. Indyk","year":"2006","unstructured":"Indyk, P., Woodruff, D.: Polylogarithmic private approximations and efficient matching. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 245\u2013264. Springer, Heidelberg (2006)"},{"issue":"4","key":"3_CR18","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1145\/1008731.1008738","volume":"51","author":"M. Jerrum","year":"2004","unstructured":"Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. of the ACM\u00a051(4), 671\u2013697 (2004)","journal-title":"J. of the ACM"},{"key":"3_CR19","first-page":"160","volume-title":"Proc. of the 23th IEEE Symp. on Foundations of Computer Science","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proc. of the 23th IEEE Symp. on Foundations of Computer Science, pp. 160\u2013164. IEEE Computer Society Press, Los Alamitos (1982)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74143-5_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:18:09Z","timestamp":1605763089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74143-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540741428"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74143-5_3","relation":{},"subject":[]}}