{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:26:08Z","timestamp":1725564368423},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540229834"},{"type":"electronic","value":"9783540300731"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30073-1_5","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T03:27:13Z","timestamp":1283830033000},"page":"55-66","source":"Crossref","is-referenced-by-count":16,"title":["Experimental Analysis of Privacy-Preserving Statistics Computation"],"prefix":"10.1007","author":[{"given":"Hiranmayee","family":"Subramaniam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rebecca N.","family":"Wright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiqiang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-24676-3_3","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"G. Aggarwal","year":"2004","unstructured":"Aggarwal, G., Mishra, N., Pinkas, B.: Secure computation of the kth-ranked element. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 40\u201355. Springer, Heidelberg (2004)"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1145\/342009.335438","volume-title":"Proc. ACM SIGMOD Conference on Management of Data","author":"R. Agrawal","year":"2000","unstructured":"Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proc. ACM SIGMOD Conference on Management of Data, May 2000, pp. 439\u2013450. ACM Press, New York (2000)"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-44634-6_16","volume-title":"Proc. 7th International Workshop on Algorithms and Data Structures","author":"M. Atallah","year":"2001","unstructured":"Atallah, M., Du, W.: Secure multi-party computational geometry. In: Proc. 7th International Workshop on Algorithms and Data Structures, pp. 165\u2013179. Springer, Heidelberg (2001)"},{"key":"5_CR4","first-page":"1","volume-title":"Proc. 20th ACM Symposium on the Theory of Computing (STOC)","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computation. In: Proc. 20th ACM Symposium on the Theory of Computing (STOC), pp. 1\u201310. ACM Press, New York (1988)"},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/383962.384047","volume-title":"Proc. 20th Annual ACM Symposium on Principles of Distributed Computing","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Ishai, Y., Kumar, R., Reiter, M., Rubinfeld, R., Wright, R.: Selective private function evaluation with applications to private statistics. In: Proc. 20th Annual ACM Symposium on Principles of Distributed Computing, pp. 293\u2013304. ACM Press, New York (2001)"},{"key":"5_CR6","unstructured":"Canetti, R., Ishai, Y., Kumar, R., Reiter, M., Rubinfeld, R., Wright, R.: Personal communication (2003)"},{"key":"5_CR7","first-page":"211","volume-title":"Proc. 22nd Symposium on Principles of Database Systems","author":"A. Evfimievski","year":"2003","unstructured":"Evfimievski, A., Gehrke, J., Srikant, R.: Limiting privacy breaches in privacy preserving data mining. In: Proc. 22nd Symposium on Principles of Database Systems, pp. 211\u2013222. ACM Press, New York (2003)"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1145\/775047.775080","volume-title":"Proc. 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"A. Evfimievski","year":"2002","unstructured":"Evfimievski, A., Srikant, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. In: Proc. 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 217\u2013228. ACM Press, New York (2002)"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/3-540-48224-5_75","volume-title":"Proc. 28th International Colloquium on Automata, Languages and Programming","author":"J. Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Ishai, Y., Malkin, T., Nissim, K., Strauss, M., Wright, R.: Secure multiparty computation of approximations. In: Proc. 28th International Colloquium on Automata, Languages and Programming, pp. 927\u2013938. Springer, Heidelberg (2001)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_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":"5_CR11","first-page":"218","volume-title":"Proc. 19th Annual ACM Conference on Theory of Computing","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proc. 19th Annual ACM Conference on Theory of Computing, pp. 218\u2013229. ACM Press, New York (1987)"},{"key":"5_CR12","unstructured":"Kantarcioglu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. In: Proc. ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD 2002), June 2002, pp. 24\u201331 (2002)"},{"issue":"3","key":"5_CR13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y. Lindell","year":"2002","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. J. Cryptology\u00a015(3), 177\u2013206 (2002); An earlier version appeared in Bellare, M. (ed.): CRYPTO 2000. LNCS, vol.\u00a01880. Springer, Heidelberg (2000)","journal-title":"J. Cryptology"},{"key":"5_CR14","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay \u2013 a secure two-party computation system. In: Proc. Usenix Security Symposium 2004 (2004) (to appear)"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residue classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"5_CR16","unstructured":"Sella, Y.: Personal communication (2004)"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1145\/775047.775142","volume-title":"Proc. 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"J. Vaidya","year":"2002","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: Proc. 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 639\u2013644. ACM Press, New York (2002)"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1145\/956750.956776","volume-title":"Proc. 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"J. Vaidya","year":"2003","unstructured":"Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: Proc. 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 206\u2013215. ACM Press, New York (2003)"},{"key":"5_CR19","volume-title":"Proc. 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"R.N. Wright","year":"2004","unstructured":"Wright, R.N., Yang, Z.: Privacy-preserving Bayesian network structure computation on distributed heterogeneous data. In: Proc. 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, New York (2004) (to appear)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Yao, A.: How to generate and exchange secrets. In: Proc. 27th IEEE Symposium on Foundations of Computer Science, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Secure Data Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30073-1_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T20:13:04Z","timestamp":1636402384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30073-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229834","9783540300731"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30073-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}