{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T09:40:30Z","timestamp":1774950030869,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030299613","type":"print"},{"value":"9783030299620","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29962-0_15","type":"book-chapter","created":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T23:04:10Z","timestamp":1568502250000},"page":"304-321","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":64,"title":["Towards Efficient Verifiable Forward Secure Searchable Symmetric Encryption"],"prefix":"10.1007","author":[{"given":"Zhongjun","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Jianfeng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yunling","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yaping","family":"Su","sequence":"additional","affiliation":[]},{"given":"Xiaofeng","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,15]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Azraoui, M., Elkhiyaoui, K., \u00d6nen, M., Molva, R.: Publicly verifiable conjunctive keyword search in outsourced databases. In: Proceedings of 2015 IEEE Conference on Communications and Network Security, CNS 2015, pp. 619\u2013627. IEEE (2015)","DOI":"10.1109\/CNS.2015.7346876"},{"key":"15_CR2","unstructured":"Bost, R.: $$\\rm \\Sigma $$o$$\\varphi $$o$$\\varsigma $$: forward secure searchable encryption. In: Proceedings of the 2016 ACM Conference on Computer and Communications Security, CCS 2016, pp. 1143\u20131154. ACM (2016)"},{"key":"15_CR3","unstructured":"Bost, R., Fouque, P., Pointcheval, D.: Verifiable dynamic symmetric searchable encryption: optimality and forward security. IACR Cryptology ePrint Archive 2016, p. 62 (2016). http:\/\/eprint.iacr.org\/2016\/062"},{"key":"15_CR4","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, CCS 2017, pp. 1465\u20131482. ACM (2017)","DOI":"10.1145\/3133956.3133980"},{"key":"15_CR5","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":"15_CR6","doi-asserted-by":"crossref","unstructured":"Chai, Q., Gong, G.: Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers. In: Proceedings of 2012 IEEE International Conference on Communications, ICC 2012, pp. 917\u2013922. IEEE (2012)","DOI":"10.1109\/ICC.2012.6364125"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-40061-5_12","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"D Clarke","year":"2003","unstructured":"Clarke, D., Devadas, S., van Dijk, M., Gassend, B., Suh, G.E.: Incremental multiset hash functions and their application to memory integrity checking. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 188\u2013207. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-40061-5_12"},{"issue":"5","key":"15_CR8","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.A., 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":"15_CR9","unstructured":"Dai, W.: Crypto++: A free C++ class library of cryptographic schemes (2019). https:\/\/cryptopp.com\/. Accessed 10 June 2019"},{"key":"15_CR10","unstructured":"Facebook Inc.: Rocksdb: a persistent key-value store for flash and ram storage (2019). http:\/\/rocksdb.org Accessed 10 June 2019"},{"key":"15_CR11","unstructured":"Foundation, W.: Wikimedia downloads (2019). https:\/\/dumps.wikimedia.org. Accessed 10 June 2019"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Giraud, M., Anzala-Yamajako, A., Bernard, O., Lafourcade, P.: Practical passive leakage-abuse attacks against symmetric searchable encryption. In: Proceedings of the 14th International Joint Conference on e-Business and Telecommunications, pp. 200\u2013211. IEEE (2017)","DOI":"10.5220\/0006461202000211"},{"key":"15_CR13","unstructured":"Goh, E.: Secure indexes. IACR Cryptology ePrint Archive 2003, p. 216 (2003). http:\/\/eprint.iacr.org\/2003\/216"},{"key":"15_CR14","unstructured":"Google, Inc.: GRPC: a high performance, open-source universal RPC framework (2019). http:\/\/www.grpc.io\/. Accessed 10 June 2019"},{"key":"15_CR15","unstructured":"Hashim, A.: Latest facebook data breach totals over 540 million records found unsecured. https:\/\/latesthackingnews.com\/2019\/04\/04\/latest-facebook-data-breach-totals-over-540-million-records-found-unsecured\/. Accessed 29 Apr 2019"},{"key":"15_CR16","unstructured":"Islam, M.S., Kuzu, M., Kantarcioglu, M.: Access pattern disclosure on searchable encryption: ramification, attack and mitigation. In: Proceedings of the 19th Annual Network and Distributed System Security Symposium. NDSS (2012)"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: Proceedings of the 19th ACM Conference on Computer and Communications Security, CCS 2012, pp. 965\u2013976. ACM (2012)","DOI":"10.1145\/2382196.2382298"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-32946-3_21","volume-title":"Financial Cryptography and Data Security","author":"Kaoru Kurosawa","year":"2012","unstructured":"Kurosawa, K., Ohtaki, Y.: UC-secure searchable symmetric encryption. In: Proceedings of the 16th International Conference on Financial Cryptography and Data Security, FC 2012, pp. 285\u2013298. IEEE (2012)"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-319-44524-3_5","volume-title":"Advances in Information and Computer Security","author":"Kaoru Kurosawa","year":"2016","unstructured":"Kurosawa, K., Sasaki, K., Ohta, K., Yoneyama, K.: UC-secure dynamic searchable symmetric encryption scheme. In: Proceedings of the 11th International Workshop on Security Advances in Information and Computer Security, IWSEC 2016, pp. 73\u201390. IEEE (2016)"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-319-70972-7_28","volume-title":"Financial Cryptography and Data Security","author":"Wakaha Ogata","year":"2017","unstructured":"Ogata, W., Kurosawa, K.: Efficient no-dictionary verifiable searchable symmetric encryption. In: Proceedings of the 21st International Conference on Financial Cryptography and Data Security, FC 2017, pp. 498\u2013516. IEEE (2017)"},{"key":"15_CR21","unstructured":"Song, D.X., Wagner, D.A., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceedings of 2000 IEEE Symposium on Security and Privacy, S&P 2000, pp. 44\u201355. IEEE (2000)"},{"key":"15_CR22","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2018.2822294","author":"X Song","year":"2018","unstructured":"Song, X., Dong, C., Yuan, D., Xu, Q., Zhao, M.: Forward private searchable symmetric encryption with optimized I\/O efficiency. IEEE Trans. Dependable Secur. Comput. (2018). https:\/\/doi.org\/10.1109\/TDSC.2018.2822294","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Papamanthou, C., Shi, E.: Practical dynamic searchable encryption with small leakage. In: Proceedings of the 21st Annual Network and Distributed System Security Symposium, NDSS (2014)","DOI":"10.14722\/ndss.2014.23298"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Sun, S., et al.: Practical backward-secure searchable encryption from symmetric puncturable encryption. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, pp. 763\u2013780 (2018)","DOI":"10.1145\/3243734.3243782"},{"key":"15_CR25","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: Proceedings of 2015 IEEE Conference on Computer Communications, INFOCOM 2015, pp. 2110\u20132118. IEEE (2015)","DOI":"10.1109\/INFOCOM.2015.7218596"},{"key":"15_CR26","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). https:\/\/doi.org\/10.1007\/978-3-319-98989-1_5"},{"key":"15_CR27","unstructured":"Zhang, Y., Katz, J., Papamanthou, C.: All your queries are belong to us: the power of file-injection attacks on searchable encryption. In: Proceedings of the 25th Security Symposium, USENIX 2016, pp. 707\u2013720. IEEE (2016)"},{"key":"15_CR28","unstructured":"Zhang, Z.: Implementation of our scheme (2019). https:\/\/github.com\/zhangzhongjun\/VFSSSE. Accessed 10 June 2019"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29962-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T00:13:21Z","timestamp":1726359201000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29962-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030299613","9783030299620"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29962-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","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":"23 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conf.laas.fr\/esorics\/","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 (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":"344","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":"67","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":"0","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":"19% - 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,2","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":"11","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}