Skip to main content
SpringerLink
Log in

Dynamic Searchable Encryption with Access Control

  • Conference paper
  • First Online:
Foundations and Practice of Security (FPS 2019)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 12056))

Included in the following conference series:

  • 692 Accesses

Abstract

We present a searchable encryption scheme for dynamic document collections in a multi-user scenario. Our scheme features fine-grained access control to search results, as well as access control to operations such as adding documents to the document collection, or changing individual documents. The scheme features verifiability of search results. Our scheme also satisfies the forward privacy notion crucial for the security of dynamic searchable encryption schemes.

This work was supported by the Ministry of Culture and Science of the German State of North Rhine-Westphalia within the research program “Digital Future.”

The full version of this paper is available from the IACR e-print archive [4].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    A set of tuples as in Sect. 2.1.

  2. 2.

    In the data structures literature, labels are typically called keys. We prefer the term “label” as to avoid confusion with cryptographic keys.

  3. 3.

    A linked list, symmetrically encrypted node by node with a node’s decryption key being stored as part of the pointer to that node.

References

  1. Alderman, J., Martin, K.M., Renwick, S.L.: Multi-level access in searchable symmetric encryption. In: Brenner, M., et al. (eds.) FC 2017. LNCS, vol. 10323, pp. 35–52. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-70278-0_3

    Chapter  Google Scholar 

  2. Bethencourt, J., Sahai, A., Waters, B.: Ciphertext-policy attribute-based encryption. In: S&P 2007, pp. 321–334. IEEE (2007)

    Google Scholar 

  3. Blömer, J., Löken, N.: Cloud architectures for searchable encryption. In: ARES 2018, pp. 25:1–25:10. ACM (2018)

    Google Scholar 

  4. Blömer, J., Löken, N.: Dynamic searchable encryption with access control. IACR Cryptology ePrint Archive 2019/1038 (2019)

    Google Scholar 

  5. Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506–522. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24676-3_30

    Chapter  Google Scholar 

  6. Bösch, C., Hartel, P.H., Jonker, W., Peter, A.: A survey of provably secure searchable encryption. ACM Comput. Surv. 47(2), 18:1–18:51 (2014)

    Article  Google Scholar 

  7. Bost, R.: \({\varSigma }o{\phi }o\varsigma \): forward secure searchable encryption. In: CCS 2016, pp. 1143–1154. ACM (2016)

    Google Scholar 

  8. Cachin, C., Geisler, M.: Integrity protection for revision control. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol. 5536, pp. 382–399. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01957-9_24

    Chapter  Google Scholar 

  9. Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. J. Comput. Secur. 19(5), 895–934 (2011)

    Article  Google Scholar 

  10. Etemad, M., Küpçü, A., Papamanthou, C., Evans, D.: Efficient dynamic searchable encryption with forward privacy. PoPETs 2018(1), 5–20 (2018)

    Google Scholar 

  11. Kaci, A., Bouabana-Tebibel, T.: Access control reinforcement over searchable encryption. In: IRI 2014, pp. 130–137. IEEE (2014)

    Google Scholar 

  12. Löken, N.: Searchable encryption with access control. In: ARES 2017, pp. 24:1–24:6. ACM (2017)

    Google Scholar 

  13. Rouselakis, Y., Waters, B.: Practical constructions and new proof methods for large universe attribute-based encryption. In: CCS 2013, pp. 463–474. ACM (2013)

    Google Scholar 

  14. Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 457–473. Springer, Heidelberg (2005). https://doi.org/10.1007/11426639_27

    Chapter  Google Scholar 

  15. Singh, A., Liu, L.: Sharoes: a data sharing platform for outsourced enterprise storage environments. In: ICDE 2008, pp. 993–1002. IEEE (2008)

    Google Scholar 

  16. Song, D.X., Wagner, D.A., Perrig, A.: Practical techniques for searches on encrypted data. In: S&P 2000, pp. 44–55. IEEE (2000)

    Google Scholar 

  17. Stefanov, E., Papamanthou, C., Shi, E.: Practical dynamic searchable encryption with small leakage. In: NDSS 2014. The Internet Society (2014)

    Google Scholar 

  18. Sun, W., Yu, S., Lou, W., Hou, Y.T., Li, H.: Protecting your right: verifiable attribute-based keyword search with fine-grained owner-enforced search authorization in the cloud. IEEE Trans. Parallel Distrib. Syst. 27(4), 1187–1198 (2016)

    Article  Google Scholar 

  19. Tomescu, A., Bhupatiraju, V., Papadopoulos, D., Papamanthou, C., Triandopoulos, N., Devadas, S.: Transparency logs via append-only authenticated dictionaries. IACR Cryptology ePrint Archive 2018/721 (2018)

    Google Scholar 

  20. Zhang, Y., Katz, J., Papamanthou, C.: All your queries are belong to us: the power of file-injection attacks on searchable encryption. In: USENIX 2016, pp. 707–720. USENIX Association (2016)

    Google Scholar 

  21. Zheng, Q., Xu, S., Ateniese, G.: VABKS: verifiable attribute-based keyword search over outsourced encrypted data. In: INFOCOM 2014, pp. 522–530. IEEE (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Paderborn University, Paderborn, Germany

    Johannes Blömer & Nils Löken

Authors
  1. Johannes Blömer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nils Löken
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nils Löken .

Editor information

Editors and Affiliations

  1. Université Paul Sabatier (CNRS IRIT), Toulouse, France

    Abdelmalek Benzekri

  2. Carleton University, Ottawa, ON, Canada

    Michel Barbeau

  3. University of Waterloo, Waterloo, ON, Canada

    Guang Gong

  4. Université Paul Sabatier (CNRS IRIT), Toulouse, France

    Romain Laborde

  5. Telecom SudParis, IMT, Palaiseau, France

    Joaquin Garcia-Alfaro

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Blömer, J., Löken, N. (2020). Dynamic Searchable Encryption with Access Control. In: Benzekri, A., Barbeau, M., Gong, G., Laborde, R., Garcia-Alfaro, J. (eds) Foundations and Practice of Security. FPS 2019. Lecture Notes in Computer Science(), vol 12056. Springer, Cham. https://doi.org/10.1007/978-3-030-45371-8_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-45371-8_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-45370-1

  • Online ISBN: 978-3-030-45371-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation