{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:53:55Z","timestamp":1725490435978},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734192"},{"type":"electronic","value":"9783540734208"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73420-8_23","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T14:58:43Z","timestamp":1188053923000},"page":"243-254","source":"Crossref","is-referenced-by-count":2,"title":["Private Multiparty Sampling and Approximation of Vector Combinations"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[]},{"given":"Tal","family":"Malkin","sequence":"additional","affiliation":[]},{"given":"Martin J.","family":"Strauss","sequence":"additional","affiliation":[]},{"given":"Rebecca N.","family":"Wright","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/303976.303978","volume-title":"Proc. Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","author":"N. Alon","year":"1999","unstructured":"Alon, N., Gibbons, P., Matias, Y., Szegedy, M.: Tracking join and self-join sizes in limited storage. In: Proc. Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 10\u201320. ACM Press, New York (1999)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proc. 22th ACM STOC, pp. 503\u2013513 (1990)","DOI":"10.1145\/100216.100287"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","first-page":"404","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"C. Cachin","year":"1999","unstructured":"Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 404\u2013414. Springer, Heidelberg (1999)"},{"issue":"2","key":"23_CR4","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E. Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E., Romberg, J., Tao, T.: Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory\u00a052(2), 489\u2013509 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"23_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. J. Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"J. Cryptology"},{"key":"23_CR6","first-page":"41","volume-title":"Proc. 36th IEEE FOCS","author":"B. Chor","year":"1995","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: Proc. 36th IEEE FOCS, pp. 41\u201350. IEEE Computer Society Press, Los Alamitos (1995)"},{"issue":"3","key":"23_CR7","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1006\/jcss.1997.1534","volume":"55","author":"E. Cohen","year":"1997","unstructured":"Cohen, E.: Size-estimation framework with applications to transitive closure and reachability. J. Computer and System Sciences\u00a055(3), 441\u2013453 (1997)","journal-title":"J. Computer and System Sciences"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: Estimating dominance norms of multiple data streams. In: Proc. 11\u2019th European Symposium on Algorithms, pp. 148\u2013160 (2003)","DOI":"10.1007\/978-3-540-39658-1_16"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-45539-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"G. Crescenzo Di","year":"2000","unstructured":"Di Crescenzo, G., Malkin, T., Ostrovsky, R.: Single database private information retrieval implies oblivious transfer. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 122\u2013138. Springer, Heidelberg (2000)"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Damgard, I., Jurik, M.: A generalisation, a simplification and some applications of paillier\u2019s probabilistic public-key system. Public Key Cryptography, 119\u2013136 (2001)","DOI":"10.1007\/3-540-44586-2_9"},{"key":"23_CR11","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. Communications of the ACM\u00a028, 637\u2013647 (1985)","journal-title":"Communications of the ACM"},{"issue":"3","key":"23_CR12","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/1159892.1159900","volume":"2","author":"J. Feigenbaum","year":"2005","unstructured":"Feigenbaum, J., Ishai, Y., Malkin, T., Nissim, K., Strauss, M., Wright, R.: Secure multiparty computation of approximations. ACM Transactions on Algorithms 2(3), 435\u2013472 (2005). An earlier version of this paper appeared in ICALP 2001 (2001)","journal-title":"ACM Transactions on Algorithms"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M. Freedman","year":"2004","unstructured":"Freedman, M., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1007\/11523468_65","volume-title":"Automata, Languages and Programming","author":"C. Gentry","year":"2005","unstructured":"Gentry, C., Ramzan, Z.: Single-database private information retrieval with constant communication rate. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 803\u2013815. Springer, Heidelberg (2005)"},{"issue":"3","key":"23_CR15","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1006\/jcss.1999.1689","volume":"60","author":"Y. Gertner","year":"1998","unstructured":"Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. J. Computer and System Sciences\u00a060(3), 592\u2013692 (1998) A preliminary version appeared in 30th STOC (1998)","journal-title":"J. Computer and System Sciences"},{"key":"23_CR16","first-page":"389","volume-title":"Proc. 34th ACM STOC","author":"A. Gilbert","year":"2002","unstructured":"Gilbert, A., Guha, S., Indyk, P., Kotidis, Y., Muthukrishnan, S., Strauss, M.: Fast, small-space algorithms for approximate histogram maintenance. In: Proc. 34th ACM STOC, pp. 389\u2013398. ACM Press, New York (2002)"},{"key":"23_CR17","unstructured":"Goldreich, O.: Secure multi-party computation (working draft, version 1.1) (1998), available at \n                    \n                      http:\/\/philby.ucsd.edu\/cryptolib\/BOOKS\/oded-sc.html"},{"key":"23_CR18","first-page":"218","volume-title":"Proc. 19th ACM STOC","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game. In: Proc. 19th ACM STOC, pp. 218\u2013229. ACM Press, New York (1987)"},{"key":"23_CR19","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\u2014an efficiency improvement. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 73\u201386. Springer, Heidelberg (1988)"},{"key":"23_CR20","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.: Private polylogarithmic approximations and efficient matching. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 245\u2013264. Springer, Heidelberg (2006)"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Killian, J.: Founding cryptography on oblivious transfer. In: Proc. 20th ACM STOC, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"23_CR22","first-page":"455","volume-title":"Proc. 23th ACM STOC","author":"E. Kushilevitz","year":"1991","unstructured":"Kushilevitz, E., Mansour, Y.: Learning decision trees using the fourier sprectrum. In: Proc. 23th ACM STOC, pp. 455\u2013464. ACM Press, New York (1991)"},{"key":"23_CR23","first-page":"364","volume-title":"Proc. 38th IEEE FOCS","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is NOT needed: SINGLE database, computationally-private information retrieval. In: Proc. 38th IEEE FOCS, pp. 364\u2013373. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"23_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-44598-6_3","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y. Lindell","year":"2000","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 177\u2013206. Springer, Heidelberg (2000)"},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/11556992_23","volume-title":"Information Security","author":"H. Lipmaa","year":"2005","unstructured":"Lipmaa, H.: An oblivious transfer protocol with log-squared communication. In: Zhou, J., Lopez, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol.\u00a03650, pp. 314\u2013328. Springer, Heidelberg (2005)"},{"key":"23_CR26","unstructured":"Mann, E.: Private access to distributed information. Master\u2019s thesis, Technion - Israel Institute of Technology, Haifa (1998)"},{"key":"23_CR27","first-page":"590","volume-title":"Proc. 33th ACM STOC","author":"M. Naor","year":"2001","unstructured":"Naor, M., Nissim, K.: Communication preserving protocols for secure function evaluation. In: Proc. 33th ACM STOC, pp. 590\u2013599. ACM Press, New York (2001)"},{"key":"23_CR28","first-page":"245","volume-title":"Proc. 31st ACM STOC","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: Proc. 31st ACM STOC, pp. 245\u2013254. ACM Press, New York (1999)"},{"key":"23_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2000)"},{"key":"23_CR30","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Aiken Computation Laboratory, Harvard University (1981)"},{"key":"23_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73420-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:26:13Z","timestamp":1558275973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73420-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540734192","9783540734208"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73420-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}