{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:21:09Z","timestamp":1742998869143,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030594091"},{"type":"electronic","value":"9783030594107"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-59410-7_10","type":"book-chapter","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T16:57:43Z","timestamp":1600707463000},"page":"157-177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Searchable Symmetric Encryption with Tunable Leakage Using Multiple Servers"],"prefix":"10.1007","author":[{"given":"Xiangfu","family":"Song","sequence":"first","affiliation":[]},{"given":"Dong","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Han","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Qiuliang","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,18]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Ahmad, A., Kim, K., Sarfaraz, M.I., Lee, B.: OBLIVIATE: a data oblivious filesystem for intel SGX. In: NDSS (2018)","DOI":"10.14722\/ndss.2018.23284"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Blass, E.O., Mayberry, T., Noubir, G., Onarlioglu, K.: Toward robust hidden volumes using write-only oblivious ram. In: ACM CCS, pp. 203\u2013214. ACM (2014)","DOI":"10.1145\/2660267.2660313"},{"key":"10_CR3","unstructured":"Bost, R.: $$\\Sigma $$o$$\\varphi $$o$$\\varsigma $$: forward secure searchable encryption. In: ACM CCS, pp. 1143\u20131154 (2016)"},{"key":"10_CR4","unstructured":"Bost, R., Fouque, P.: Thwarting leakage abuse attacks against searchable encryption - a formal approach and applications to database padding. IACR Cryptology ePrint Archive (2017)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bost, R., Minaud, B., Ohrimenko, O.: Forward and backward private searchable encryption from constrained cryptographic primitives. In: ACM CCS, pp. 1465\u20131482 (2017)","DOI":"10.1145\/3133956.3133980"},{"key":"10_CR6","unstructured":"Brasser, F., M\u00fcller, U., Dmitrienko, A., Kostiainen, K., Capkun, S., Sadeghi, A.R.: Software grand exposure: $$\\{$$SGX$$\\}$$ cache attacks are practical. In: $$\\{$$USENIX$$\\}$$ ($$\\{$$WOOT$$\\}$$) (2017)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Cash, D., Grubbs, P., Perry, J., Ristenpart, T.: Leakage-abuse attacks against searchable encryption. In: ACM CCS, pp. 668\u2013679 (2015)","DOI":"10.1145\/2810103.2813700"},{"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":"351","DOI":"10.1007\/978-3-642-55220-5_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"D Cash","year":"2014","unstructured":"Cash, D., Tessaro, S.: The locality of searchable symmetric encryption. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 351\u2013368. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_20"},{"key":"10_CR10","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: FOCS, pp. 41\u201350. IEEE (1995)"},{"key":"10_CR11","unstructured":"Chow, S.S., Lee, J.H., Subramanian, L.: Two-party computation model for privacy-preserving queries over distributed databases. In: NDSS (2009)"},{"key":"10_CR12","unstructured":"Costan, V., Devadas, S.: Intel SGX explained. IACR Cryptology ePrint Archive 2016(086), pp. 1\u2013118 (2016)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Cui, S., Belguith, S., Zhang, M., Asghar, M.R., Russello, G.: Preserving access pattern privacy in SGX-assisted encrypted search. In: ICCCN, pp. 1\u20139. IEEE (2018)","DOI":"10.1109\/ICCCN.2018.8487338"},{"key":"10_CR14","unstructured":"Cui, S., Song, X., Asghar, M.R., Galbraith, S.D., Russello, G.: Privacy-preserving searchable databases with controllable leakage. arXiv preprint arXiv:1909.11624 (2019)"},{"issue":"5","key":"10_CR15","doi-asserted-by":"publisher","first-page":"895","DOI":"10.3233\/JCS-2011-0426","volume":"19","author":"R Curtmola","year":"2011","unstructured":"Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. J. Comput. Secur. 19(5), 895\u2013934 (2011)","journal-title":"J. Comput. Secur."},{"key":"10_CR16","unstructured":"Demertzis, I., Papadopoulos, D., Papamanthou, C., Shintre, S.: SEAL: attack mitigation for encrypted databases via adjustable leakage. IACR Cryptology ePrint Archive (2019)"},{"issue":"1","key":"10_CR17","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1515\/popets-2018-0002","volume":"2018","author":"M Etemad","year":"2018","unstructured":"Etemad, M., K\u00fcp\u00e7\u00fc, A., Papamanthou, C., Evans, D.: Efficient dynamic searchable encryption with forward privacy. PoPETs 2018(1), 5\u201320 (2018)","journal-title":"PoPETs"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Ghareh Chamani, J., Papadopoulos, D., Papamanthou, C., Jalili, R.: New constructions for forward and backward private symmetric searchable encryption. In: ACM CCS, pp. 1038\u20131055. ACM (2018)","DOI":"10.1145\/3243734.3243833"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"G\u00f6tzfried, J., Eckert, M., Schinzel, S., M\u00fcller, T.: Cache attacks on intel SGX. In: Proceedings of the 10th European Workshop on Systems Security, p. 2. ACM (2017)","DOI":"10.1145\/3065913.3065915"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-319-95729-6_8","volume-title":"Data and Applications Security and Privacy XXXII","author":"T Hoang","year":"2018","unstructured":"Hoang, T., Yavuz, A.A., Durak, F.B., Guajardo, J.: Oblivious dynamic searchable encryption on distributed cloud systems. In: Kerschbaum, F., Paraboschi, S. (eds.) DBSec 2018. LNCS, vol. 10980, pp. 113\u2013130. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-95729-6_8"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Hoang, T., Yavuz, A.A., Guajardo, J.: Practical and secure dynamic searchable encryption via oblivious access on distributed data structure. In: ACSAC, pp. 302\u2013313 (2016)","DOI":"10.1145\/2991079.2991088"},{"key":"10_CR22","unstructured":"Islam, M.S., Kuzu, M., Kantarcioglu, M.: Access pattern disclosure on searchable encryption: ramification, attack and mitigation. In: NDSS (2012)"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-030-17656-3_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"S Kamara","year":"2019","unstructured":"Kamara, S., Moataz, T.: Computationally volume-hiding structured encryption. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 183\u2013213. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_7"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-319-96884-1_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"S Kamara","year":"2018","unstructured":"Kamara, S., Moataz, T., Ohrimenko, O.: Structured encryption and leakage suppression. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 339\u2013370. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_12"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Kim, K.S., Kim, M., Lee, D., Park, J.H., Kim, W.: Forward secure dynamic searchable symmetric encryption with efficient updates. In: ACM CCS, pp. 1449\u20131463 (2017)","DOI":"10.1145\/3133956.3133970"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Kornaropoulos, E.M., Papamanthou, C., Tamassia, R.: The state of the uniform: attacks on encrypted databases beyond the uniform query distribution. IACR Cryptology ePrint Archive, p. 441 (2019)","DOI":"10.1109\/SP40000.2020.00029"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Lai, R.W.F., Chow, S.S.M.: Forward-secure searchable encryption on labeled bipartite graphs. In: ACNS, pp. 478\u2013497 (2017)","DOI":"10.1007\/978-3-319-61204-1_24"},{"key":"10_CR28","unstructured":"Lee, J., et al.: Hacking in darkness: return-oriented programming against secure enclaves. In: USENIX Security, pp. 523\u2013539 (2017)"},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.ins.2013.11.021","volume":"265","author":"C Liu","year":"2014","unstructured":"Liu, C., Zhu, L., Wang, M., Tan, Y.A.: Search pattern leakage in searchable encryption: attacks and new construction. Inf. Sci. 265, 176\u2013188 (2014)","journal-title":"Inf. Sci."},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Markatou, E.A., Tamassia, R.: Full database reconstruction with access and search pattern leakage. IACR Cryptology ePrint Archive, p. 395 (2019)","DOI":"10.1007\/978-3-030-30215-3_2"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Mishra, P., Poddar, R., Chen, J., Chiesa, A., Popa, R.A.: Oblix: an efficient oblivious search index. In: IEEE SP, pp. 279\u2013296. IEEE (2018)","DOI":"10.1109\/SP.2018.00045"},{"issue":"2","key":"10_CR32","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R Pagh","year":"2004","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. J. Algorithms 51(2), 122\u2013144 (2004)","journal-title":"J. Algorithms"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Patel, S., Persiano, G., Yeo, K., Yung, M.: Mitigating leakage in secure cloud-hosted data structures: volume-hiding for multi-maps via hashing. In: ACM CCS, pp. 79\u201393. ACM (2019)","DOI":"10.1145\/3319535.3354213"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Sasy, S., Gorbunov, S., Fletcher, C.W.: Zerotrace: oblivious memory primitives from intel SGX. IACR Cryptology ePrint Archive 2017, 549 (2017)","DOI":"10.14722\/ndss.2018.23239"},{"key":"10_CR35","doi-asserted-by":"publisher","unstructured":"Song, X., Dong, C., Yuan, D., Xu, Q., Zhao, M.: Forward private searchable symmetric encryption with optimized I\/O efficiency. IEEE Trans. Dependable Secure Comput. 17(5), 912\u2013927 (2020). https:\/\/doi.org\/10.1109\/TDSC.2018.2822294","DOI":"10.1109\/TDSC.2018.2822294"},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Papamanthou, C., Shi, E.: Practical dynamic searchable encryption with small leakage. In: NDSS (2014)","DOI":"10.14722\/ndss.2014.23298"},{"key":"10_CR37","unstructured":"Zhang, Y., Katz, J., Papamanthou, C.: All your queries are belong to us: the power of file-injection attacks on searchable encryption. In: USENIX Security, pp. 707\u2013720 (2016)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59410-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:48:36Z","timestamp":1710269316000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59410-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030594091","9783030594107"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59410-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/db.pknu.ac.kr\/dasfaa2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"487","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - 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 (provided by the conference organizers)"}},{"value":"3.11","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6.81","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15 demo papers and 4 industrial papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}