{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:51:26Z","timestamp":1743108686860,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030184186"},{"type":"electronic","value":"9783030184193"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-18419-3_6","type":"book-chapter","created":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:25:20Z","timestamp":1556738720000},"page":"78-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Secure Joins with MapReduce"],"prefix":"10.1007","author":[{"given":"Xavier","family":"Bultel","sequence":"first","affiliation":[]},{"given":"Radu","family":"Ciucanu","sequence":"additional","affiliation":[]},{"given":"Matthieu","family":"Giraud","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Lafourcade","sequence":"additional","affiliation":[]},{"given":"Lihua","family":"Ye","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,14]]},"reference":[{"key":"6_CR1","unstructured":"Apache Hadoop. \n                      https:\/\/hadoop.apache.org\/"},{"key":"6_CR2","unstructured":"Higgs Twitter Dataset. \n                      http:\/\/snap.stanford.edu\/data\/higgs-twitter.html"},{"key":"6_CR3","unstructured":"Secure Joins with MapReduce - Technical report. \n                      https:\/\/hal.archives-ouvertes.fr\/hal-01903098"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Afrati, F.N., Ullman, J.D.: Optimizing joins in a MapReduce environment. In: EDBT (2010)","DOI":"10.1145\/1739041.1739056"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201994","author":"M Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: Optimal asymmetric encryption. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 92\u2013111. Springer, Heidelberg (1995). \n                      https:\/\/doi.org\/10.1007\/BFb0053428"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-31680-7_10","volume-title":"Privacy Enhancing Technologies","author":"E-O Blass","year":"2012","unstructured":"Blass, E.-O., Di Pietro, R., Molva, R., \u00d6nen, M.: PRISM \u2013 privacy-preserving search in MapReduce. In: Fischer-H\u00fcbner, S., Wright, M. (eds.) PETS 2012. LNCS, vol. 7384, pp. 180\u2013200. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-31680-7_10"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Bultel, X., Ciucanu, R., Giraud, M., Lafourcade, P.: Secure matrix multiplication with MapReduce. In: ARES (2017)","DOI":"10.1145\/3098954.3098989"},{"key":"6_CR8","unstructured":"Chow, S.S.M., Lee, J., Subramanian, L.: Two-party computation model for privacy-preserving queries over distributed databases. In: NDSS (2009)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Chu, S., Balazinska, M., Suciu, D.: From theory to practice: efficient join query evaluation in a parallel database system. In: SIGMOD Conference (2015)","DOI":"10.1145\/2723372.2750545"},{"key":"6_CR10","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04722-4","volume-title":"The Design of Rijndael: AES - The Advanced Encryption Standard","author":"J Daemen","year":"2002","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael: AES - The Advanced Encryption Standard. ISC. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/978-3-662-04722-4"},{"key":"6_CR11","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. In: OSDI (2004)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cosrev.2016.05.001","volume":"20","author":"P Derbeko","year":"2016","unstructured":"Derbeko, P., Dolev, S., Gudes, E., Sharma, S.: Security and privacy aspects in MapReduce on clouds: a survey. Comput. Sci. Rev. 20, 1\u201328 (2016)","journal-title":"Comput. Sci. Rev."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Dolev, S., Gilboa, N., Li, X.: Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation: extended abstract. In: ASIACCS (2015)","DOI":"10.1145\/2732516.2732526"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Dolev, S., Li, Y., Sharma, S.: Private and secure secret shared MapReduce. In: DBSec (2016)","DOI":"10.1007\/978-3-319-41483-6_11"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10\u201318. Springer, Heidelberg (1985). \n                      https:\/\/doi.org\/10.1007\/3-540-39568-7_2"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Emek\u00e7i, F., Agrawal, D., El Abbadi, A., Gulbeden, A.: Privacy preserving query processing using third parties. In: ICDE (2006)","DOI":"10.1109\/ICDE.2006.116"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Laur, S., Talviste, R., Willemson, J.: From oblivious AES to efficient and secure database join in the multiparty setting. In: ACNS (2013)","DOI":"10.1007\/978-3-642-38980-1_6"},{"key":"6_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139924801","volume-title":"Mining of Massive Datasets","author":"J Leskovec","year":"2014","unstructured":"Leskovec, J., Rajaraman, A., Ullman, J.D.: Mining of Massive Datasets, 2nd edn. Cambridge University Press, Cambridge (2014)","edition":"2"},{"key":"6_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57048-8","volume-title":"Tutorials on the Foundations of Cryptography","year":"2017","unstructured":"Lindell, Y. (ed.): Tutorials on the Foundations of Cryptography. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-57048-8"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-642-39884-1_32","volume-title":"Financial Cryptography and Data Security","author":"T Mayberry","year":"2013","unstructured":"Mayberry, T., Blass, E.-O., Chan, A.H.: PIRMAP: efficient private information retrieval for MapReduce. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 371\u2013385. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-39884-1_32"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Popa, R.A., Redfield, C.M.S., Zeldovich, N., Balakrishnan, H.: CryptDB: protecting confidentiality with encrypted query processing. In: SOSP (2011)","DOI":"10.1145\/2043556.2043566"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Popa, R.A., Zeldovich, N.: Cryptographic treatment of CryptDB\u2019s adjustable join (2012)","DOI":"10.1145\/2330667.2330691"},{"issue":"11","key":"6_CR23","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-319-26850-7_29","volume-title":"Networked Systems","author":"TD Vo-Huu","year":"2015","unstructured":"Vo-Huu, T.D., Blass, E.-O., Noubir, G.: EPiC: efficient privacy-preserving counting for MapReduce. In: Bouajjani, A., Fauconnier, H. (eds.) NETYS 2015. LNCS, vol. 9466, pp. 426\u2013443. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-26850-7_29"}],"container-title":["Lecture Notes in Computer Science","Foundations and Practice of Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18419-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:33:18Z","timestamp":1558348398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-18419-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030184186","9783030184193"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18419-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FPS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Foundations and Practice of Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fps2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fps2018.encs.concordia.ca\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"51","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"1","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}