{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:25:07Z","timestamp":1740108307765,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2018,6,18]],"date-time":"2018-06-18T00:00:00Z","timestamp":1529280000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,6,18]],"date-time":"2018-06-18T00:00:00Z","timestamp":1529280000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1218197"],"award-info":[{"award-number":["1218197"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s00607-018-0634-5","type":"journal-article","created":{"date-parts":[[2018,6,18]],"date-time":"2018-06-18T09:25:38Z","timestamp":1529313938000},"page":"1265-1286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["EPiC: efficient privacy-preserving counting for MapReduce"],"prefix":"10.1007","volume":"101","author":[{"given":"Triet Dang","family":"Vo-Huu","sequence":"first","affiliation":[]},{"given":"Erik-Oliver","family":"Blass","sequence":"additional","affiliation":[]},{"given":"Guevara","family":"Noubir","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,18]]},"reference":[{"key":"634_CR1","unstructured":"Amazon Elastic MapReduce. \n                    http:\/\/aws.amazon.com\/elasticmapreduce\/"},{"key":"634_CR2","unstructured":"Apache Hadoop (2010) \n                    http:\/\/hadoop.apache.org\/"},{"key":"634_CR3","doi-asserted-by":"crossref","unstructured":"Babai L, Fortnow L (1991) Arithmetization: a new method in structural complexity theory. In: Computational complexity, pp 41\u201366, ISSN: 1016-3328","DOI":"10.1007\/BF01200057"},{"key":"634_CR4","doi-asserted-by":"crossref","unstructured":"Boneh D, DiCrescenzo G, Ostrovsky R, Persiano G (2004) Public key encryption with keyword search. In: Proceedings of Eurocrypt, pp 506\u2013522. Barcelona, Spain","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"634_CR5","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Vaikuntanathan V (2011) Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway P (eds) Advances in cryptology\u2014CRYPTO 2011, pp 505\u2013524. Springer, Berlin. ISBN: 978-3-642-22792-9","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"634_CR6","unstructured":"Dean J, Ghemawat S (2004) MapReduce: simplified data processing on large clusters. In: Proceedings of symposium on operating system design and implementation, pp 137\u2013150. San Francisco, USA"},{"key":"634_CR7","doi-asserted-by":"crossref","unstructured":"Dwork C (2006) Differential privacy. In: Proceedings of colloquium automata, languages and programming, pp 1\u201312, Venice, Italy, 2006. ISBN: 3-540-35907-9","DOI":"10.1007\/11787006_1"},{"key":"634_CR8","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: Proceedings of the forty-first annual ACM symposium on theory of computing, STOC \u201909, pp 169\u2013178. New York, NY, 2009. ACM. ISBN: 978-1-60558-506-2","DOI":"10.1145\/1536414.1536440"},{"key":"634_CR9","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S (2011) Implementing Gentry\u2019s fully-homomorphic encryption scheme. In: Advances in cryptology\u2014EUROCRYPT 2011, pp 129\u2013148. Tallinn, Estonia, 2011. Springer, Berlin. ISBN: 78-3-642-20464-7","DOI":"10.1007\/978-3-642-20465-4_9"},{"key":"634_CR10","unstructured":"Google (2010) A new approach to China. \n                    http:\/\/googleblog.blogspot.com\/2010\/01\/new-approach-to-china.html"},{"key":"634_CR11","unstructured":"Hadoop. Powered by Hadoop, list of applications using Hadoop MapReduce (2011). \n                    http:\/\/wiki.apache.org\/hadoop\/PoweredBy"},{"key":"634_CR12","doi-asserted-by":"crossref","unstructured":"Hoffstein J, Pipher J, Silverman JH (1998) NTRU: a ring-based public key cryptosystem. In: Algorithmic number theory, third international symposium, ANTS-III, Portland, Oregon, USA, June 21\u201325, 1998, proceedings, pp. 267\u2013288","DOI":"10.1007\/BFb0054868"},{"key":"634_CR13","doi-asserted-by":"crossref","unstructured":"Kamara S, Raykova M (2013) Parallel homomorphic encryption. In: Adams AA, Brenner M, Smith M (eds) Financial cryptography and data security, pp 213\u2013225. Springer, Berlin. ISBN: 978-3-642-41320-9","DOI":"10.1007\/978-3-642-41320-9_15"},{"key":"634_CR14","unstructured":"Katz J, Lindell Y (2007) Introduction to modern cryptography (Chapman & Hall\/CRC Cryptography and network security series). Chapman & Hall\/CRC"},{"key":"634_CR15","doi-asserted-by":"crossref","unstructured":"Lauter K, Naehrig N, Vaikuntanathan V (2011) Can homomorphic encryption be practical? In: Proceedings of ACM workshop on cloud computing security. Chicago","DOI":"10.1145\/2046660.2046682"},{"key":"634_CR16","doi-asserted-by":"crossref","unstructured":"Lepoint T, Tibouchi M (2015) Cryptanalysis of a (somewhat) additively homomorphic encryption scheme used in PIR. In: Financial cryptography and data security\u2014FC 2015 international workshops, BITCOIN, WAHC, and Wearable, San Juan, Puerto Rico, January 30, 2015, Revised Selected Papers, pp 184\u2013193","DOI":"10.1007\/978-3-662-48051-9_14"},{"key":"634_CR17","doi-asserted-by":"crossref","unstructured":"Rocha F, Correia M (2011) Lucy in the sky without diamonds: stealing confidential data in the cloud. In: Proceedings of international workshop on dependability of clouds, data centers and virtual computing y environments, pp 129\u2013134, Hong Kong, China","DOI":"10.1109\/DSNW.2011.5958798"},{"key":"634_CR18","doi-asserted-by":"crossref","unstructured":"Shamir A (1992) IP = PSPACE. J ACM 39(4):869\u2013877. ISSN: 0004-5411","DOI":"10.1145\/146585.146609"},{"key":"634_CR19","unstructured":"Song D, Wagner D, Perrig A (2000) Practical techniques for searches on encrypted data. In: Proceedings of symposium on security and privacy, pp 44\u201355, Berkeley, USA"},{"key":"634_CR20","unstructured":"Techcrunch. Google confirms that it fired engineer for breaking internal privacy policies (2010). \n                    http:\/\/techcrunch.com\/2010\/09\/14\/google-engineer-spying-fired\/"},{"key":"634_CR21","unstructured":"The Telegraph (2011) Patient records go online in data cloud. \n                    http:\/\/bit.ly\/1yb28bw"},{"key":"634_CR22","unstructured":"Trostle J, Parrish A (2010) Efficient computationally private information retrieval from anonymity or trapdoor groups. In: Proceedings of conference on information security, pp 114\u2013128, Boca Raton, USA, 2010. ISBN: 978-3-642-18177-1"},{"key":"634_CR23","doi-asserted-by":"crossref","unstructured":"Vaikuntanathan V (2011) Computing blindfolded: new developments in fully homomorphic encryption. In: Proceedings of the 2011 IEEE 52nd annual symposium on foundations of computer science, FOCS\u201911, pp 5\u201316, Washington, DC, USA 2011. ISBN: 978-0-7695-4571-4","DOI":"10.1109\/FOCS.2011.98"},{"key":"634_CR24","doi-asserted-by":"crossref","unstructured":"van Dijk M, Gentry C, Halevi S, Vaikuntanathan V (2010) Fully homomorphic encryption over the integers. In: Proceedings of international conference on theory and applications of cryptographic techniques, EUROCRYPT\u201910, pp 24\u201343, Monaco, 2010. Springer, Berlin. ISBN: 3-642-13189-1","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"634_CR25","unstructured":"Vo-Huu TD, Blass E-O, Noubir G EPiC Source Code. \n                    http:\/\/www.ccs.neu.edu\/home\/noubir\/projects\/epic"},{"key":"634_CR26","unstructured":"Whittaker Z (2011) Microsoft admits Patriot Act can access EU-based cloud data. Zdnet \n                    http:\/\/www.zdnet.com\/"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0634-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-018-0634-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0634-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T08:04:00Z","timestamp":1589443440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-018-0634-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,18]]},"references-count":26,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["634"],"URL":"https:\/\/doi.org\/10.1007\/s00607-018-0634-5","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2018,6,18]]},"assertion":[{"value":"6 May 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}