{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:24:35Z","timestamp":1758273875592,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030925178"},{"type":"electronic","value":"9783030925185"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92518-5_22","type":"book-chapter","created":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T07:03:27Z","timestamp":1638947007000},"page":"487-509","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exipnos: An\u00a0Efficient Verifiable Dynamic Symmetric Searchable Encryption Scheme with\u00a0Forward and\u00a0Backward Privacy"],"prefix":"10.1007","author":[{"given":"Najwa","family":"Aaraj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chiara","family":"Marcolla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojie","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,9]]},"reference":[{"key":"22_CR1","unstructured":"20newsgroups (2019). http:\/\/qwone.com\/~jason\/20Newsgroups\/"},{"issue":"1","key":"22_CR2","doi-asserted-by":"publisher","first-page":"245","DOI":"10.2478\/popets-2019-0014","volume":"2019","author":"G Amjad","year":"2019","unstructured":"Amjad, G., Kamara, S., Moataz, T.: Breach-resistant structured encryption. Priv. Enhancing Technol. 2019(1), 245\u2013265 (2019)","journal-title":"Priv. Enhancing Technol."},{"key":"22_CR3","unstructured":"Baeza-Yates, R., Ribeiro-Neto, B., et al.: Modern information retrieval, vol. 463. ACM press, New York (1999)"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-662-43933-3_23","volume-title":"Fast Software Encryption","author":"A Bogdanov","year":"2014","unstructured":"Bogdanov, A., Mendel, F., Regazzoni, F., Rijmen, V., Tischhauser, E.: ALE: AES-based lightweight authenticated encryption. In: Moriai, S. (ed.) FSE 2013. LNCS, vol. 8424, pp. 447\u2013466. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43933-3_23"},{"key":"22_CR5","unstructured":"Bost, R.: $$\\Sigma o \\varphi o \\varsigma $$: forward secure searchable encryption. In: ACM SIGSAC Conference on Computer and Communications Security, pp. 1143\u20131154. ACM (2016)"},{"key":"22_CR6","unstructured":"Bost, R., Fouque, P.A., Pointcheval, D.: Verifiable dynamic symmetric searchable encryption: Optimality and forward security. IACR Cryptology ePrint Arch. 2016, 62 (2016)"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Bost, R., Minaud, B., Ohrimenko, O.: Forward and backward private searchable encryption from constrained cryptographic primitives. In: ACM SIGSAC Conference on Computer and Communications Security, pp. 1465\u20131482. ACM (2017)","DOI":"10.1145\/3133956.3133980"},{"key":"22_CR8","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":"22_CR9","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":"22_CR10","unstructured":"Chamani, J.G., Papadopoulos, D., Papamanthou, C., Jalili, R.: New constructions for forward and backward private symmetric searchable encryption. In: ACM SIGSAC Conference on Computer and Communications Security, pp. 1038\u20131055 (2018)"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/11496137_30","volume-title":"Applied Cryptography and Network Security","author":"Y-C Chang","year":"2005","unstructured":"Chang, Y.-C., Mitzenmacher, M.: Privacy preserving keyword searches on remote encrypted data. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 442\u2013455. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11496137_30"},{"key":"22_CR12","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: IEEE 36th Annual Foundations of Computer Science, pp. 41\u201350. IEEE (1995)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: CCS, pp. 79\u201388. ACM, New York (2006)","DOI":"10.1145\/1180405.1180417"},{"issue":"5","key":"22_CR14","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":"22_CR15","doi-asserted-by":"crossref","unstructured":"Demertzis, I., Chamani, J.G., Papadopoulos, D., Papamanthou, C.: Dynamic searchable encryption with small client storage. IACR Cryptology ePrint Arch. 2019, 1227 (2019)","DOI":"10.14722\/ndss.2020.24423"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Demertzis, I., Chamani, J.G., Papadopoulos, D., Papamanthou, C.: Dynamic searchable encryption with small client storage. In: 27th Annual Network and Distributed System Security Symposium, NDSS 2020, San Diego, California, USA, 23\u201326 February 2020. The Internet Society (2020)","DOI":"10.14722\/ndss.2020.24423"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Demertzis, L., Papadopoulos, S., Papapetrou, O., Deligiannakis, A., Garofalakis, M.: Practical private range search revisited. In: Proceedings of the 2016 International Conference on Management of Data, pp. 185\u2013198. ACM (2016)","DOI":"10.1145\/2882903.2882911"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"60539","DOI":"10.1109\/ACCESS.2020.2983117","volume":"8","author":"A Diro","year":"2020","unstructured":"Diro, A., Reda, H., Chilamkurti, N., Mahmood, A., Zaman, N., Nam, Y.: Lightweight authenticated-encryption scheme for internet of things based on publish-subscribe communication. IEEE Access 8, 60539\u201360551 (2020)","journal-title":"IEEE Access"},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1515\/popets-2018-0002","volume":"1","author":"M Etemad","year":"2018","unstructured":"Etemad, M., K\u00fcp\u00e7\u00fc, A., Papamanthou, C., Evans, D.: Efficient dynamic searchable encryption with forward privacy. Priv. Enhancing Technol. 1, 5\u201320 (2018)","journal-title":"Priv. Enhancing Technol."},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-662-53015-3_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"S Garg","year":"2016","unstructured":"Garg, S., Mohassel, P., Papamanthou, C.: TWORAM: efficient oblivious RAM in two rounds with applications to searchable encryption. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 563\u2013592. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_20"},{"key":"22_CR21","unstructured":"Goh, E.J.: Secure indexes. IACR Cryptology ePrint Archive 2003, 216 (2003)"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Green, M.D., Miers, I.: Forward secure asynchronous messaging from puncturable encryption. In: 2015 IEEE Symposium on Security and Privacy, pp. 305\u2013320. IEEE (2015)","DOI":"10.1109\/SP.2015.26"},{"key":"22_CR23","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). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_4"},{"key":"22_CR24","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":"22_CR25","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":"22_CR26","doi-asserted-by":"crossref","unstructured":"Kim, K.S., Kim, M., Lee, D., Park, J., Kim, W.H.: Forward secure dynamic searchable symmetric encryption with efficient updates. In: ACM SIGSAC Conference on Computer and Communications Security (2017)","DOI":"10.1145\/3133956.3133970"},{"key":"22_CR27","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). https:\/\/doi.org\/10.1007\/978-3-642-32946-3_21"},{"key":"22_CR28","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). https:\/\/doi.org\/10.1007\/978-3-319-02937-5_17"},{"key":"22_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-319-61204-1_24","volume-title":"Applied Cryptography and Network Security","author":"RWF Lai","year":"2017","unstructured":"Lai, R.W.F., Chow, S.S.M.: Forward-secure searchable encryption on\u00a0labeled bipartite graphs. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 2017. LNCS, vol. 10355, pp. 478\u2013497. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_24"},{"key":"22_CR30","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: IEEE Symposium on Security and Privacy, pp. 44\u201355. IEEE (2000)"},{"key":"22_CR31","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":"22_CR32","doi-asserted-by":"crossref","unstructured":"Stefanov, E., et al.: Path oram: an extremely simple oblivious ram protocol. In: 2013 ACM SIGSAC Conference on Computer & Communications Security, pp. 299\u2013310. ACM (2013)","DOI":"10.1145\/2508859.2516660"},{"key":"22_CR33","unstructured":"Sun, S.F., et al.: Practical non-interactive searchable encryption with forward and backward privacy"},{"key":"22_CR34","doi-asserted-by":"crossref","unstructured":"Sun, S.F., et al.: Practical backward-secure searchable encryption from symmetric puncturable encryption. In: 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 763\u2013780 (2018)","DOI":"10.1145\/3243734.3243782"},{"key":"22_CR35","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). https:\/\/doi.org\/10.1007\/978-3-319-89500-0_42"},{"key":"22_CR36","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":"22_CR37","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). https:\/\/doi.org\/10.1007\/978-3-030-29962-0_15"},{"key":"22_CR38","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). https:\/\/doi.org\/10.1007\/978-3-030-29962-0_14"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92518-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:37:44Z","timestamp":1710268664000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92518-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030925178","9783030925185"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92518-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jaipur","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/indocrypt2021.lnmiit.ac.in\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"65","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":"27","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":"42% - 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":"4","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)"}}]}}