{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T22:40:03Z","timestamp":1752446403075,"version":"3.41.2"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030812416"},{"type":"electronic","value":"9783030812423"}],"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-81242-3_5","type":"book-chapter","created":{"date-parts":[[2021,7,14]],"date-time":"2021-07-14T03:04:02Z","timestamp":1626231842000},"page":"84-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Nowhere to Leak: A Multi-client Forward and Backward Private Symmetric Searchable Encryption Scheme"],"prefix":"10.1007","author":[{"given":"Alexandros","family":"Bakas","sequence":"first","affiliation":[]},{"given":"Antonis","family":"Michalas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,14]]},"reference":[{"key":"5_CR1","unstructured":"PyCrypto - the Python cryptography toolkit (2013). https:\/\/pypi.org\/project\/pycrypto\/"},{"key":"5_CR2","unstructured":"AMD: Secure Encrypted Virtualization API Version 0.22. Technical Report (07 2019)"},{"key":"5_CR3","doi-asserted-by":"publisher","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 (EuroSec 2019), Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3301417.3312496, https:\/\/doi.org\/10.1145\/3301417.3312496","DOI":"10.1145\/3301417.3312496"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Bakas, A., Dang, H.V., Michalas, A., Zalitko, A.: The cloud we share: access control on symmetrically encrypted data in untrusted clouds. IEEE Access 8, 210462\u2013210477 (2020)","DOI":"10.1109\/ACCESS.2020.3038838"},{"key":"5_CR5","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-030-37231-6_28","volume-title":"Security and Privacy in Communication Networks","author":"A Bakas","year":"2019","unstructured":"Bakas, A., Michalas, A.: Modern family: a revocable hybrid encryption scheme based on attribute-based encryption, symmetric searchable Encryption and SGX. In: Chen, S., Choo, K.-K.R., Fu, X., Lou, W., Mohaisen, A. (eds.) SecureComm 2019. LNICST, vol. 305, pp. 472\u2013486. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-37231-6_28"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Bakas, A., Michalas, A.: Power range: forward private multi-client symmetric searchable encryption with range queries support. In: 2020 IEEE Symposium on Computers and Communications (ISCC). pp. 1\u20137. IEEE (2020)","DOI":"10.1109\/ISCC50000.2020.9219739"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-319-70500-2_9","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2017","unstructured":"Boneh, D., Kim, S., Wu, D.J.: Constrained Keys for invertible pseudorandom functions. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 237\u2013263. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_9"},{"key":"5_CR8","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, October 24\u201328, 2016 (2016)"},{"key":"5_CR9","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, New York, NY, USA (2017)","DOI":"10.1145\/3133956.3133980"},{"key":"5_CR10","unstructured":"Brasser, F., Hahn, F., Kerschbaum, F., Sadeghi, A.R., Fuhry, B., Bahmani, R.: HardiDX: practical and secure index with SGX (2017)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Cash, D., Grubbs, P., Perry, J., Ristenpart, T.: Leakage-abuse attacks against searchable encryption. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security. ACM (2015)","DOI":"10.1145\/2810103.2813700"},{"key":"5_CR12","unstructured":"Costan, V., Devadas, S.: Intel SUX explained. IACR Cryptol. ePrint Arch. 2016(086), 1\u2013118 (2016)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Etemad, M., K\u00fcp\u00e7\u00fc, A., Papamanthou, C., Evans, D.: Efficient dynamic searchable encryption with forward privacy. Proc. Privacy Enhan. Technol. 2918 (1), 5\u201320 (2018)","DOI":"10.1515\/popets-2018-0002"},{"key":"5_CR14","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.: 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":"5_CR15","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: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 1038\u20131055 (2018)","DOI":"10.1145\/3243734.3243833"},{"key":"5_CR16","unstructured":"Islam, M.S., Kuzu, M., Kantarcioglu, M.: Access pattern disclosure on searchable encryption: ramification, attack and mitigation. In: NDSS Symposium, vol. 20, p. 12. Citeseer (2012)"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Kim, K.S., Kim, M., Lee, D., Park, J.H., Kim, W.H.: Forward secure dynamic searchable symmetric encryption with efficient updates. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 1449\u20131463 (2017)","DOI":"10.1145\/3133956.3133970"},{"key":"5_CR18","unstructured":"Michalas, A.: Text files from Gutenberg database, August 2019"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Mofrad, S., Zhang, F., Lu, S., Shi, W.: A comparison study of intel SUX and AMD memory encryption technology. In: Proceedings of the 7th International Workshop on Hardware and Architectural Support for Security and Privacy, pp. 1\u20138 (2018)","DOI":"10.1145\/3214292.3214301"},{"key":"5_CR20","unstructured":"Naveed, M.: The fallacy of composition of oblivious ram and searchable encryption. IACR Cryptol. ePrint Arch. 2015, 668 (2015)"},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Paladi, N., Gehrmann, C., Michalas, A.: Providing user security guarantees in public infrastructure clouds. IEEE Trans. Cloud Comput. 5(3), 405\u2013419 (2017). https:\/\/doi.org\/10.1109\/TCC.2016.2525991","DOI":"10.1109\/TCC.2016.2525991"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Papamanthou, C., Shi, E.: Practical dynamic searchable encryption with small leakage. NDSS 71, 72\u201375 (2014)","DOI":"10.14722\/ndss.2014.23298"},{"key":"5_CR23","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 (2018)","DOI":"10.1145\/3243734.3243782"},{"key":"5_CR24","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, pp. 707\u2013720 (2016)"}],"container-title":["Lecture Notes in Computer Science","Data and Applications Security and Privacy XXXV"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-81242-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T22:02:53Z","timestamp":1752444173000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81242-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030812416","9783030812423"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81242-3_5","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":"14 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DBSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP Annual Conference on Data and Applications Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Calgary, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"19 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dbsec2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wpsites.ucalgary.ca\/dbsec2021\/","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":"45","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":"15","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":"8","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":"33% - 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","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":"3","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)"}}]}}