{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:05:20Z","timestamp":1743098720053,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319986531"},{"type":"electronic","value":"9783319986548"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-99136-8_10","type":"book-chapter","created":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T08:39:41Z","timestamp":1534235981000},"page":"171-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Practical Attacks on Relational Databases Protected via Searchable Encryption"],"prefix":"10.1007","author":[{"given":"Mohamed Ahmed","family":"Abdelraheem","sequence":"first","affiliation":[]},{"given":"Tobias","family":"Andersson","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Gehrmann","sequence":"additional","affiliation":[]},{"given":"Cornelius","family":"Glackin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,15]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Abdelraheem, M.A., Andersson, T., Gehrmann, C.: Searchable encrypted relational databases: risks and countermeasures. In: The 12th Data Privacy and Management Workshop (2017)","DOI":"10.1007\/978-3-319-67816-0_5"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Kiernan, J., Srikant, R., Xu, Y.: Order preserving encryption for numeric data. In: Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data (2004)","DOI":"10.1145\/1007568.1007632"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/1059513.1059515","volume":"52","author":"N Ailon","year":"2005","unstructured":"Ailon, N., Chazelle, B.: Lower bounds for linear degeneracy testing. J. ACM (JACM) 52(2), 157\u2013171 (2005)","journal-title":"J. ACM (JACM)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Boldyreva, A., O\u2019Neill, A.: Deterministic and efficiently searchable encryption. In: Annual International Cryptology Conference (2007)","DOI":"10.1007\/978-3-540-74143-5_30"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-642-22792-9_33","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"A Boldyreva","year":"2011","unstructured":"Boldyreva, A., Chenette, N., O\u2019Neill, A.: Order-preserving encryption revisited: improved security analysis and alternative solutions. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 578\u2013595. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_33"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Cash, D., Grubbs, P., Perry, J., Ristenpart, T.: Leakage-abuse attacks against searchable encryption. In: CCS 2015 (2015)","DOI":"10.1145\/2810103.2813700"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Cash, D., Jaeger, J., Jarecki, S., Jutla, C., Krawczyk, H., Rosu, M., Steiner, M.: Dynamic searchable encryption in very-large databases: Data structures and implementation. IACR Cryptology ePrint Archive (2014)","DOI":"10.14722\/ndss.2014.23264"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-642-40041-4_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Cash","year":"2013","unstructured":"Cash, D., Jarecki, S., Jutla, C., Krawczyk, H., Ro\u015fu, M.-C., Steiner, M.: Highly-scalable searchable symmetric encryption with support for boolean queries. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 353\u2013373. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_20"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-17373-8_33","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"M Chase","year":"2010","unstructured":"Chase, M., Kamara, S.: Structured encryption and controlled disclosure. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 577\u2013594. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_33"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: CCS (2006)","DOI":"10.1145\/1180405.1180417"},{"key":"10_CR11","unstructured":"Erickson, J.: Lower bounds for linear satisfiability problems. In: SODA 1995 (1995)"},{"key":"10_CR12","unstructured":"Center for Machine Learning and Intelligent Systems. University of california, irvine. https:\/\/archive.ics.uci.edu\/ml\/datasets.html . Accessed June 2017"},{"key":"10_CR13","unstructured":"Gold, O., Sharir, M.: Improved bounds for 3sum, k-sum, and linear degeneracy. CoRR, abs\/1512.05279 (2015)"},{"key":"10_CR14","unstructured":"IARPA. Poster about protecting privacy and civil liberties. https:\/\/www.iarpa.gov\/images\/files\/programs\/spar\/09-SPAR_final_v21.pdf"},{"key":"10_CR15","unstructured":"Islam, M.S., Kuzu, M., Kantarcioglu, M.: Access pattern disclosure on searchable encryption: Ramification, attack and mitigation. In NDSS 2012 (2012)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-642-39884-1_22","volume-title":"Financial Cryptography and Data Security","author":"S Kamara","year":"2013","unstructured":"Kamara, S., Papamanthou, C.: Parallel and dynamic searchable symmetric encryption. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 258\u2013274. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39884-1_22"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Kellaris, G., Kollios, G., Nissim, K., O\u2019Neill, A.: Generic attacks on secure outsourced databases. In: CCS (2016)","DOI":"10.1145\/2976749.2978386"},{"key":"10_CR18","unstructured":"Kleinberg, J., Tardos, E.: Algorithm design. Pearson Education India (2006)"},{"key":"10_CR19","unstructured":"Kohavi, R., Becker, B.: Adult data set (1996). https:\/\/archive.ics.uci.edu\/ml\/machine-learning-databases\/adult\/ . Accessed June 2017"},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"Kurosawa, K., Ohtaki, Y.: UC-secure searchable symmetric encryption. In: Keromytis, A.D. (ed.) FC 2012. LNCS, vol. 7397, pp. 285\u2013298. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32946-3_21","DOI":"10.1007\/978-3-642-32946-3_21"},{"key":"10_CR21","unstructured":"Lane, T., Kohavi, R.: Census-income (kdd) data set (2000). https:\/\/archive.ics.uci.edu\/ml\/machine-learning-databases\/census-income-mld\/ . Accessed June 2017"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Naveed, M., Kamara, S., Wright, C.: Inference attacks on property-preserving encrypted databases. In: CCS 2015 (2015)","DOI":"10.1145\/2810103.2813651"},{"key":"10_CR23","unstructured":"OpenEMR. http:\/\/www.open-emr.org\/ . Accessed Mar 2017"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Popa, R.A., Redfield, C., Zeldovich, N., Balakrishnan, H.: Cryptdb: protecting confidentiality with encrypted query processing. In: ACM Symposium on Operating Systems Principles (2011)","DOI":"10.1145\/2043556.2043566"},{"key":"10_CR25","unstructured":"Laureano, R., Moro, S., Cortez, P.: Using data mining for bank direct marketing: an application of the crisp-dm methodology. In: Novais, P., et al. (eds.) Proceedings of the European Simulation and Modelling Conference - ESM 2011, pp. 117\u2013121, Guimar\u00e3es, Portugal, EUROSIS, October 2011. https:\/\/archive.ics.uci.edu\/ml\/datasets\/Bank+Marketing . Accessed June 2017"},{"key":"10_CR26","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: IEEE Security and Privacy, S&P 2000"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Van Liesdonk, P., Sedghi, S., Doumen, J., Hartel, P., Jonker, W.: Computationally efficient searchable symmetric encryption. In: Workshop on Secure Data Management (2010)","DOI":"10.1007\/978-3-642-15546-8_7"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99136-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T04:37:43Z","timestamp":1571719063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99136-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99136-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}