{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:04:10Z","timestamp":1772240650826,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030319182","type":"print"},{"value":"9783030319199","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":"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-31919-9_23","type":"book-chapter","created":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T19:09:53Z","timestamp":1569438593000},"page":"355-371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["FSPVDsse: A Forward Secure Publicly Verifiable Dynamic SSE Scheme"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7433-0497","authenticated-orcid":false,"given":"Laltu","family":"Sardar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8698-6709","authenticated-orcid":false,"given":"Sushmita","family":"Ruj","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,26]]},"reference":[{"key":"23_CR1","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 2015, Florence, Italy, 28\u201330 September 2015, pp. 619\u2013627 (2015)","DOI":"10.1109\/CNS.2015.7346876"},{"key":"23_CR2","unstructured":"Bost, R.: $$\\sum $$o$$\\varphi $$o$$\\varsigma $$: forward secure searchable encryption. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, 24\u201328 October 2016, pp. 1143\u20131154 (2016)"},{"key":"23_CR3","first-page":"62","volume":"2016","author":"R Bost","year":"2016","unstructured":"Bost, R., Fouque, P., Pointcheval, D.: Verifiable dynamic symmetric searchable encryption: optimality and forward security. IACR Cryptol. ePrint Arch. 2016, 62 (2016)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"23_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, Dallas, TX, USA, 30 October\u201303 November 2017, pp. 1465\u20131482 (2017)","DOI":"10.1145\/3133956.3133980"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Chai, Q., Gong, G.: Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers. In: Proceedings of IEEE International Conference on Communications, ICC 2012, Ottawa, ON, Canada, 10\u201315 June 2012, pp. 917\u2013922 (2012)","DOI":"10.1109\/ICC.2012.6364125"},{"key":"23_CR6","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-17373-8_33"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Cheng, R., Yan, J., Guan, C., Zhang, F., Ren, K.: Verifiable searchable symmetric encryption from indistinguishability obfuscation. In: Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security, ASIA CCS 2015, Singapore, 14\u201317 April 2015, pp. 621\u2013626 (2015)","DOI":"10.1145\/2714576.2714623"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, Alexandria, VA, USA, 30 October\u20133 November 2006, pp. 79\u201388 (2006)","DOI":"10.1145\/1180405.1180417"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Jiang, S., Zhu, X., Guo, L., Liu, J.: Publicly verifiable boolean query over outsourced encrypted data. In: 2015 IEEE Global Communications Conference, GLOBECOM 2015, San Diego, CA, USA, 6\u201310 December 2015, pp. 1\u20136 (2015)","DOI":"10.1109\/GLOCOM.2015.7417807"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Kamara, S., Papamanthou, C., Roeder, T.: Dynamic searchable symmetric encryption. In: The ACM Conference on Computer and Communications Security, CCS 2012, Raleigh, NC, USA, 16\u201318 October 2012, pp. 965\u2013976 (2012)","DOI":"10.1145\/2382196.2382298"},{"issue":"5","key":"23_CR11","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s10207-017-0394-9","volume":"17","author":"Y Li","year":"2018","unstructured":"Li, Y., Zhou, F., Qin, Y., Lin, M., Xu, Z.: Integrity-verifiable conjunctive keyword searchable encryption in cloud storage. Int. J. Inf. Sec. 17(5), 549\u2013568 (2018)","journal-title":"Int. J. Inf. Sec."},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-15546-8_7","volume-title":"Secure Data Management","author":"P Liesdonk van","year":"2010","unstructured":"van Liesdonk, P., Sedghi, S., Doumen, J., Hartel, P., Jonker, W.: Computationally efficient searchable symmetric encryption. In: Jonker, W., Petkovi\u0107, M. (eds.) SDM 2010. LNCS, vol. 6358, pp. 87\u2013100. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15546-8_7"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1016\/j.future.2017.02.024","volume":"78","author":"Z Liu","year":"2018","unstructured":"Liu, Z., Li, T., Li, P., Jia, C., Li, J.: Verifiable searchable encryption with aggregate keys for data sharing system. Future Gener. Comp. Syst. 78, 778\u2013788 (2018)","journal-title":"Future Gener. Comp. Syst."},{"key":"23_CR14","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. Inf. Sci. 475, 18\u201328 (2019)","journal-title":"Inf. Sci."},{"issue":"4","key":"23_CR15","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1007\/s12083-016-0458-z","volume":"10","author":"Y Miao","year":"2017","unstructured":"Miao, Y., Ma, J., Wei, F., Liu, Z., Wang, X.A., Lu, C.: VCSE: verifiable conjunctive keywords search over encrypted data without secure-channel. Peer-to-Peer Netw. Appl. 10(4), 995\u20131007 (2017)","journal-title":"Peer-to-Peer Netw. Appl."},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-319-70972-7_28","volume-title":"Financial Cryptography and Data Security","author":"W Ogata","year":"2017","unstructured":"Ogata, W., Kurosawa, K.: Efficient no-dictionary verifiable searchable symmetric encryption. In: Kiayias, A. (ed.) FC 2017. LNCS, vol. 10322, pp. 498\u2013516. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-70972-7_28"},{"issue":"4","key":"23_CR17","doi-asserted-by":"publisher","first-page":"733","DOI":"10.3934\/amc.2019043","volume":"13","author":"L Sardar","year":"2019","unstructured":"Sardar, L., Ruj, S.: The secure link prediction problem. Adv. Math. Commun. 13(4), 733\u2013757 (2019)","journal-title":"Adv. Math. Commun."},{"issue":"1","key":"23_CR18","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":"23_CR19","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, Toronto, ON, Canada, 15\u201319 October 2018, pp. 763\u2013780 (2018)","DOI":"10.1145\/3243734.3243782"},{"key":"23_CR20","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 2015, Kowloon, Hong Kong, 26 April\u20131 May 2015, pp. 2110\u20132118 (2015)","DOI":"10.1109\/INFOCOM.2015.7218596"},{"key":"23_CR21","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":"23_CR22","doi-asserted-by":"crossref","unstructured":"Xu, C., Zhang, C., Xu, J.: vChain: enabling verifiable boolean range queries over blockchain databases. CoRR abs\/1812.02386 (2018)","DOI":"10.1145\/3299869.3300083"},{"key":"23_CR23","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":"23_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, R., Xue, R., Yu, T., Liu, L.: PVSAE: a public verifiable searchable encryption service framework for outsourced encrypted data. In: IEEE International Conference on Web Services, ICWS 2016, San Francisco, CA, USA, 27 June\u20132 July 2016, pp. 428\u2013435 (2016)","DOI":"10.1109\/ICWS.2016.62"},{"key":"23_CR25","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, Austin, TX, USA, 10\u201312 August 2016, pp. 707\u2013720 (2016)"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Zhu, X., Liu, Q., Wang, G.: A novel verifiable and dynamic fuzzy keyword search scheme over encrypted data in cloud computing. In: 2016 IEEE Trustcom\/BigDataSE\/ISPA, Tianjin, China, 23\u201326 August 2016, pp. 845\u2013851 (2016)","DOI":"10.1109\/TrustCom.2016.0147"}],"updated-by":[{"DOI":"10.1007\/978-3-030-31919-9_25","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T00:00:00Z","timestamp":1569456000000}}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31919-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T15:05:16Z","timestamp":1573657516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31919-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030319182","9783030319199"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31919-9_23","relation":{"correction":[{"id-type":"doi","id":"10.1007\/978-3-030-31919-9_25","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"26 September 2019","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The original structure of the book is incorrect and cannot be corrected. The papers \u201cA Coin-Free Oracle-Based Augmented Black Box Framework\u201d (Chapter 15) and \u201cFSPVDsse: A Forward Secure Publicly Verifiable Dynamic SSE Scheme\u201d (Chapter 23) were switched. Chapter 15 was supposed to appear under the Part Title: Short Papers, while Chapter 23 was supposed to appear under the Part Title: Protocols.","order":4,"name":"change_details","label":"Change Details","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ProvSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Provable Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cairns, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"1 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 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":"provsec2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.monash.edu\/provsec2019","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":"51","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":"18","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":"6","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":"35% - 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,882","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":"2,579","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)"}}]}}