{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:41:34Z","timestamp":1726062094119},"publisher-location":"Cham","reference-count":63,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030369378"},{"type":"electronic","value":"9783030369385"}],"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-36938-5_3","type":"book-chapter","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T19:04:11Z","timestamp":1575918251000},"page":"37-52","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Dynamic Searchable Symmetric Encryption with Forward and Backward Privacy: A Survey"],"prefix":"10.1007","author":[{"given":"Qingqing","family":"Gan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cong","family":"Zuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianfeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi-Feng","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoming","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,10]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Amjad, G., Kamara, S., Moataz, T.: Forward and backward private searchable encryption with SGX. In: Proceedings of the 12th European Workshop on Systems Security, p. 4. ACM (2019)","DOI":"10.1145\/3301417.3312496"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Azraoui, M., Elkhiyaoui, K., \u00d6nen, M., Molva, R.: Publicly verifiable conjunctive keyword search in outsourced databases. In: 2015 IEEE Conference on Communications and Network Security (CNS), pp. 619\u2013627. IEEE (2015)","DOI":"10.1109\/CNS.2015.7346876"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-540-70936-7_29","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2007","unstructured":"Boneh, D., Waters, B.: Conjunctive, subset, and range queries on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 535\u2013554. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-70936-7_29"},{"key":"3_CR4","unstructured":"Bost, R.: $$\\varSigma $$$$o\\varphi o \\varsigma $$: forward secure searchable encryption. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 1143\u20131154. ACM (2016)"},{"key":"3_CR5","unstructured":"Bost, R., Fouque, P.A., Pointcheval, D.: Verifiable dynamic symmetric searchable encryption: optimality and forward security. IACR Cryptology ePrint Archive, vol. 2016, p. 62 (2016)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Bost, R., Minaud, B., Ohrimenko, O.: Forward and backward private searchable encryption from constrained cryptographic primitives. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 1465\u20131482. ACM (2017)","DOI":"10.1145\/3133956.3133980"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Cash, D., et al.: Dynamic searchable encryption in very-large databases: data structures and implementation. In: NDSS, vol. 14, pp. 23\u201326. Citeseer (2014)","DOI":"10.14722\/ndss.2014.23264"},{"key":"3_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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-40041-4_20"},{"key":"3_CR9","unstructured":"Chamani, G.J., Papadopoulos, D., Papamanthou, C., Jalili, R.: New constructions for forward and backward private symmetric searchable encryption. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 1038\u20131055. ACM (2018)"},{"key":"3_CR10","unstructured":"Cui, S., Song, X., Asghar, M.R., Galbraith, S.D., Russello, G.: Privacy-preserving searchable databases with controllable leakage. arXiv preprint \narXiv:1909.11624\n\n (2019)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 79\u201388. ACM (2006)","DOI":"10.1145\/1180405.1180417"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.cosrev.2017.08.001","volume":"26","author":"R Dowsley","year":"2017","unstructured":"Dowsley, R., Michalas, A., Nagel, M., Paladi, N.: A survey on design and implementation of protected searchable data in the cloud. Comput. Sci. Rev. 26, 17\u201330 (2017)","journal-title":"Comput. Sci. Rev."},{"issue":"9","key":"3_CR13","doi-asserted-by":"publisher","first-page":"2320","DOI":"10.1109\/TIFS.2018.2818651","volume":"13","author":"M Du","year":"2018","unstructured":"Du, M., Wang, Q., He, M., Weng, J.: Privacy-preserving indexing and query processing for secure dynamic cloud storage. IEEE Trans. Inf. Forensics Secur. 13(9), 2320\u20132332 (2018)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-24177-7_7","volume-title":"Computer Security \u2013 ESORICS 2015","author":"S Faber","year":"2015","unstructured":"Faber, S., Jarecki, S., Krawczyk, H., Nguyen, Q., Rosu, M., Steiner, M.: Rich queries on encrypted data: beyond exact matches. In: Pernul, G., Ryan, P.Y.A., Weippl, E. (eds.) ESORICS 2015. LNCS, vol. 9327, pp. 123\u2013145. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-24177-7_7"},{"issue":"99","key":"3_CR15","first-page":"1","volume":"PP","author":"X Ge","year":"2019","unstructured":"Ge, X., et al.: Towards achieving keyword search over dynamic encrypted cloud data with symmetric-key based verification. IEEE Trans. Dependable Secure Comput. PP(99), 1 (2019)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"3_CR16","unstructured":"Goh, E.J., et al.: Secure indexes. IACR Cryptology ePrint Archive, vol. 2003, p. 216 (2003)"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.future.2016.01.007","volume":"62","author":"F Han","year":"2016","unstructured":"Han, F., Qin, J., Hu, J.: Secure searches in the cloud: a survey. Future Gener. Comput. Syst. 62, 66\u201375 (2016)","journal-title":"Future Gener. Comput. Syst."},{"issue":"17","key":"3_CR18","doi-asserted-by":"publisher","first-page":"e5201","DOI":"10.1002\/cpe.5201","volume":"31","author":"R Handa","year":"2019","unstructured":"Handa, R., Krishna, C.R., Aggarwal, N.: Searchable encryption: a survey on privacy-preserving search schemes on encrypted outsourced data. Concurrency Comput. Pract. Experience 31(17), e5201 (2019)","journal-title":"Concurrency Comput. Pract. Experience"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"35035","DOI":"10.1109\/ACCESS.2019.2902855","volume":"7","author":"C Hu","year":"2019","unstructured":"Hu, C., et al.: Forward secure conjunctive-keyword searchable encryption. IEEE Access 7, 35035\u201335048 (2019)","journal-title":"IEEE Access"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-319-56617-7_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"S Kamara","year":"2017","unstructured":"Kamara, S., Moataz, T.: Boolean searchable symmetric encryption with worst-case sub-linear complexity. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10212, pp. 94\u2013124. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-56617-7_4"},{"key":"3_CR21","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-39884-1_22"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, pp. 965\u2013976. ACM (2012)","DOI":"10.1145\/2382196.2382298"},{"key":"3_CR23","unstructured":"Kerschbaum, F., Tueno, A.: An efficiently searchable encrypted data structure for range queries. arXiv preprint \narXiv:1709.09314\n\n (2017)"},{"issue":"2","key":"3_CR24","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1109\/TDSC.2016.2568182","volume":"15","author":"M Kim","year":"2018","unstructured":"Kim, M., Lee, H.T., Ling, S., Wang, H.: On the efficiency of fhe-based private queries. IEEE Trans. Dependable Secure Comput. 15(2), 357\u2013363 (2018). \nhttps:\/\/doi.org\/10.1109\/TDSC.2016.2568182","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-32946-3_21","volume-title":"Financial Cryptography and Data Security","author":"K Kurosawa","year":"2012","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-32946-3_21"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-319-02937-5_17","volume-title":"Cryptology and Network Security","author":"K Kurosawa","year":"2013","unstructured":"Kurosawa, K., Ohtaki, Y.: How to update documents Verifiably in searchable symmetric encryption. In: Abdalla, M., Nita-Rotaru, C., Dahab, R. (eds.) CANS 2013. LNCS, vol. 8257, pp. 309\u2013328. Springer, Cham (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-319-02937-5_17"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Lai, S., et al.: Result pattern hiding searchable encryption for conjunctive queries. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 745\u2013762. ACM (2018)","DOI":"10.1145\/3243734.3243753"},{"key":"3_CR28","doi-asserted-by":"publisher","unstructured":"Li, J., et al.: Searchable symmetric encryption with forward search privacy. IEEE Trans. Dependable Secure Comput. (2019). \nhttps:\/\/doi.org\/10.1109\/TDSC.2019.2894411","DOI":"10.1109\/TDSC.2019.2894411"},{"key":"3_CR29","doi-asserted-by":"publisher","unstructured":"Liu, X., Yang, G., Mu, Y., Deng, R.: Multi-user verifiable searchable symmetric encryption for cloud storage. IEEE Trans. Dependable Secure Comput. (2018). \nhttps:\/\/doi.org\/10.1109\/TDSC.2018.2876831","DOI":"10.1109\/TDSC.2018.2876831"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-030-14234-6_16","volume-title":"Information Security and Cryptology","author":"R Loh","year":"2019","unstructured":"Loh, R., Zuo, C., Liu, J.K., Sun, S.-F.: A multi-client DSSE scheme supporting range queries. In: Guo, F., Huang, X., Yung, M. (eds.) Inscrypt 2018. LNCS, vol. 11449, pp. 289\u2013307. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-14234-6_16"},{"key":"3_CR31","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ins.2018.09.067","volume":"475","author":"M Miao","year":"2019","unstructured":"Miao, M., Wang, J., Wen, S., Ma, J.: Publicly verifiable database scheme with efficient keyword search. Inform. Sci. 475, 18\u201328 (2019)","journal-title":"Inform. Sci."},{"key":"3_CR32","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/j.future.2019.06.018","volume":"101","author":"A Najafi","year":"2019","unstructured":"Najafi, A., Javadi, H.H.S., Bayat, M.: Verifiable ranked search over encrypted data with forward and backward privacy. Future Gener. Comput. Syst. 101, 410\u2013419 (2019)","journal-title":"Future Gener. Comput. Syst."},{"issue":"1","key":"3_CR33","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1587\/transfun.E102.A.114","volume":"102","author":"W Ogata","year":"2019","unstructured":"Ogata, W., Kurosawa, K.: No-dictionary searchable symmetric encryption. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102(1), 114\u2013124 (2019)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"Ozmen, M.O., Hoang, T., Yavuz, A.A.: Forward-private dynamic searchable symmetric encryption with efficient search. In: 2018 IEEE International Conference on Communications (ICC), pp. 1\u20136. IEEE (2018)","DOI":"10.1109\/ICC.2018.8422480"},{"issue":"3","key":"3_CR35","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/3064005","volume":"50","author":"GS Poh","year":"2017","unstructured":"Poh, G.S., Chin, J.J., Yau, W.C., Choo, K.K.R., Mohamad, M.S.: Searchable symmetric encryption: designs and challenges. ACM Comput. Surv. (CSUR) 50(3), 40 (2017)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"3_CR36","doi-asserted-by":"publisher","unstructured":"Shao, J., Lu, R., Guan, Y., Wei, G.: Achieve efficient and verifiable conjunctive and fuzzy queries over encrypted data in cloud. IEEE Trans. Serv. Comput. (2019). \nhttps:\/\/doi.org\/10.1109\/TSC.2019.2924372","DOI":"10.1109\/TSC.2019.2924372"},{"issue":"1","key":"3_CR37","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10623-018-0489-y","volume":"87","author":"A Soleimanian","year":"2019","unstructured":"Soleimanian, A., Khazaei, S.: Publicly verifiable searchable symmetric encryption based on efficient cryptographic components. Des. Codes Crypt. 87(1), 123\u2013147 (2019)","journal-title":"Des. Codes Crypt."},{"key":"3_CR38","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceeding 2000 IEEE Symposium on Security and Privacy, S&P 2000, pp. 44\u201355. IEEE (2000)"},{"key":"3_CR39","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. (2018). \nhttps:\/\/doi.org\/10.1109\/TDSC.2018.2822294","DOI":"10.1109\/TDSC.2018.2822294"},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Papamanthou, C., Shi, E.: Practical dynamic searchable encryption with small leakage. In: NDSS, vol. 71, pp. 72\u201375 (2014)","DOI":"10.14722\/ndss.2014.23298"},{"key":"3_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-319-45744-4_8","volume-title":"Computer Security \u2013 ESORICS 2016","author":"S-F Sun","year":"2016","unstructured":"Sun, S.-F., Liu, J.K., Sakzad, A., Steinfeld, R., Yuen, T.H.: An efficient non-interactive multi-client searchable encryption with support for boolean queries. In: Askoxylakis, I., Ioannidis, S., Katsikas, S., Meadows, C. (eds.) ESORICS 2016. LNCS, vol. 9878, pp. 154\u2013172. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-45744-4_8"},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"Sun, S.F., et al.: Practical backward-secure searchable encryption from symmetric puncturable encryption. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 763\u2013780. ACM (2018)","DOI":"10.1145\/3243734.3243782"},{"key":"3_CR43","doi-asserted-by":"crossref","unstructured":"Sun, W., Liu, X., Lou, W., Hou, Y.T., Li, H.: Catch you if you lie to me: efficient verifiable conjunctive keyword search over large dynamic encrypted cloud data. In: 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 2110\u20132118. IEEE (2015)","DOI":"10.1109\/INFOCOM.2015.7218596"},{"key":"3_CR44","doi-asserted-by":"publisher","unstructured":"Tahir, S., Steponkus, L., Ruj, S., Rajarajan, M., Sajjad, A.: A parallelized disjunctive query based searchable encryption scheme for big data. Future Generation Computer Systems (2018, in press). \nhttps:\/\/doi.org\/10.1016\/j.future.2018.05.048","DOI":"10.1016\/j.future.2018.05.048"},{"key":"3_CR45","unstructured":"Wang, J., Chow, S.S.M.: Forward and backward-secure range-searchable symmetric encryption. IACR Cryptology ePrint Archive, vol. 2019, p. 497 (2019)"},{"key":"3_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-98989-1_5","volume-title":"Computer Security","author":"J Wang","year":"2018","unstructured":"Wang, J., Chen, X., Sun, S.-F., Liu, J.K., Au, M.H., Zhan, Z.-H.: Towards efficient verifiable conjunctive keyword search for large encrypted database. In: Lopez, J., Zhou, J., Soriano, M. (eds.) ESORICS 2018. LNCS, vol. 11099, pp. 83\u2013100. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-98989-1_5"},{"key":"3_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-030-02744-5_9","volume-title":"Network and System Security","author":"Q Wang","year":"2018","unstructured":"Wang, Q., Guo, Y., Huang, H., Jia, X.: Multi-user forward secure dynamic searchable symmetric encryption. In: Au, M.H., et al. (eds.) NSS 2018. LNCS, vol. 11058, pp. 125\u2013140. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-030-02744-5_9"},{"issue":"4","key":"3_CR48","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BF03391580","volume":"1","author":"Y Wang","year":"2016","unstructured":"Wang, Y., Wang, J., Chen, X.: Secure searchable encryption: a survey. J. Commun. Inf. Netw. 1(4), 52\u201365 (2016)","journal-title":"J. Commun. Inf. Netw."},{"key":"3_CR49","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.ins.2019.05.059","volume":"500","author":"Y Wei","year":"2019","unstructured":"Wei, Y., Lv, S., Guo, X., Liu, Z., Huang, Y., Li, B.: FSSE: forward secure searchable encryption with keyed-block chains. Inf. Sci. 500, 113\u2013126 (2019). \nhttps:\/\/doi.org\/10.1016\/j.ins.2019.05.059","journal-title":"Inf. Sci."},{"key":"3_CR50","doi-asserted-by":"crossref","unstructured":"Wu, S., Li, Q., Li, G., Yuan, D., Yuan, X., Wang, C.: ServeDB: secure, verifiable, and efficient range queries on outsourced database. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 626\u2013637. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00062"},{"key":"3_CR51","doi-asserted-by":"publisher","first-page":"49418","DOI":"10.1109\/ACCESS.2019.2910457","volume":"7","author":"Z Wu","year":"2019","unstructured":"Wu, Z., Li, K., Li, K., Wang, J.: Fast boolean queries with minimized leakage for encrypted databases in cloud computing. IEEE Access 7, 49418\u201349431 (2019). \nhttps:\/\/doi.org\/10.1109\/ACCESS.2019.2910457","journal-title":"IEEE Access"},{"issue":"1","key":"3_CR52","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00778-018-0517-6","volume":"28","author":"Zhiqiang Wu","year":"2018","unstructured":"Wu, Z., Li, K.: Vbtree: forward secure conjunctive queries over encrypted data for cloud computing. In: Very Large Data Bases, vol. 28, no. 1, pp. 25\u201346 (2019)","journal-title":"The VLDB Journal"},{"key":"3_CR53","doi-asserted-by":"crossref","unstructured":"Xu, C., Zhang, C., Xu, J.: vchain: Enabling verifiable boolean range queries over Blockchain databases. In: Proceedings of the 2019 International Conference on Management of Data, pp. 141\u2013158. ACM (2019)","DOI":"10.1145\/3299869.3300083"},{"key":"3_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-319-89500-0_42","volume-title":"Information and Communications Security","author":"K Yoneyama","year":"2018","unstructured":"Yoneyama, K., Kimura, S.: Verifiable and forward secure dynamic searchable symmetric encryption with storage efficiency. In: Qing, S., Mitchell, C., Chen, L., Liu, D. (eds.) ICICS 2017. LNCS, vol. 10631, pp. 489\u2013501. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-89500-0_42"},{"key":"3_CR55","doi-asserted-by":"publisher","unstructured":"Yuan, X., Yuan, X., Zhang, Y., Li, B., Wang, C.: Enabling encrypted boolean queries in geographically distributed databases. IEEE Trans. Parallel Distrib. Syst. 1\u20131 (2019). \nhttps:\/\/doi.org\/10.1109\/TPDS.2019.2940945","DOI":"10.1109\/TPDS.2019.2940945"},{"key":"3_CR56","doi-asserted-by":"crossref","unstructured":"Yuan, X., Guo, Y., Wang, X., Wang, C., Li, B., Jia, X.: EncKV: an encrypted key-value store with rich queries. In: Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security, pp. 423\u2013435. ACM (2017)","DOI":"10.1145\/3052973.3052977"},{"issue":"6","key":"3_CR57","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1109\/TSC.2017.2762296","volume":"11","author":"R Zhang","year":"2017","unstructured":"Zhang, R., Xue, R., Liu, L.: Searchable encryption for healthcare clouds: a survey. IEEE Trans. Serv. Comput. 11(6), 978\u2013996 (2017)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"3_CR58","first-page":"1","volume":"2018","author":"Y Zhang","year":"2018","unstructured":"Zhang, Y., Li, Y., Wang, Y.: Conjunctive and disjunctive keyword search over encrypted mobile cloud data in public key system. Mob. Inf. Syst. 2018, 1\u201311 (2018)","journal-title":"Mob. Inf. Syst."},{"key":"3_CR59","unstructured":"Zhang, Y., Katz, J., Papamanthou, C.: All your queries are belong to us: the power of file-injection attacks on searchable encryption. In: 25th $$\\{$$USENIX$$\\}$$ Security Symposium ($$\\{$$USENIX$$\\}$$ Security 16), pp. 707\u2013720 (2016)"},{"key":"3_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-030-29962-0_15","volume-title":"Computer Security \u2013 ESORICS 2019","author":"Z Zhang","year":"2019","unstructured":"Zhang, Z., Wang, J., Wang, Y., Su, Y., Chen, X.: Towards efficient verifiable forward secure searchable symmetric encryption. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS 2019. LNCS, vol. 11736, pp. 304\u2013321. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-29962-0_15"},{"issue":"8","key":"3_CR61","doi-asserted-by":"publisher","first-page":"1721","DOI":"10.1109\/TPDS.2018.2808283","volume":"29","author":"J Zhu","year":"2018","unstructured":"Zhu, J., Li, Q., Wang, C., Yuan, X., Wang, Q., Ren, K.: Enabling generic, verifiable, and secure data search in cloud services. IEEE Trans. Parallel Distrib. Syst. 29(8), 1721\u20131735 (2018)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"3_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-98989-1_12","volume-title":"Computer Security","author":"C Zuo","year":"2018","unstructured":"Zuo, C., Sun, S.-F., Liu, J.K., Shao, J., Pieprzyk, J.: Dynamic searchable symmetric encryption schemes supporting range queries with forward (and backward) security. In: Lopez, J., Zhou, J., Soriano, M. (eds.) ESORICS 2018. LNCS, vol. 11099, pp. 228\u2013246. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-98989-1_12"},{"key":"3_CR63","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-030-29962-0_14","volume-title":"Computer Security \u2013 ESORICS 2019","author":"C Zuo","year":"2019","unstructured":"Zuo, C., Sun, S.-F., Liu, J.K., Shao, J., Pieprzyk, J.: Dynamic searchable symmetric encryption with forward and stronger backward privacy. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS 2019. LNCS, vol. 11736, pp. 283\u2013303. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-29962-0_14"}],"container-title":["Lecture Notes in Computer Science","Network and System Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36938-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T19:04:33Z","timestamp":1575918273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36938-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030369378","9783030369385"],"references-count":63,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36938-5_3","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":"10 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Network and System Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sapporo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nss2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/nss2019\/","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":"89","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":"36","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":"7","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":"40% - 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":"2.8","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":"7","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)"}}]}}