Paper 2017/211

Multi-level Access in Searchable Symmetric Encryption

James Alderman, Keith M. Martin, and Sarah Louise Renwick


Remote storage delivers a cost effective solution for data storage. If data is of a sensitive nature, it should be encrypted prior to outsourcing to ensure confidentiality; however, searching then becomes challenging. Searchable encryption is a well-studied solution to this problem. Many schemes only consider the scenario where users can search over the entirety of the encrypted data. In practice, sensitive data is likely to be classified according to an access control policy and different users should have different access rights. It is unlikely that all users have unrestricted access to the entire data set. Current schemes that consider multi-level access to searchable encryption are predominantly based on asymmetric primitives. We investigate symmetric solutions to multi-level access in searchable encryption where users have different access privileges to portions of the encrypted data and are not permitted to search over, or learn information about, data for which they are not authorised.

Available format(s)
Secret-key cryptography
Publication info
Published elsewhere. Minor revision. 5th Workshop on Encrypted Computing and Applied Homomorphic Cryptography
searchable encryptionaccess controlsearchable symmetric encryption
Contact author(s)
sarahlouise renwick 2012 @ live rhul ac uk
2017-03-01: received
Short URL
Creative Commons Attribution


      author = {James Alderman and Keith M.  Martin and Sarah Louise Renwick},
      title = {Multi-level Access in Searchable Symmetric Encryption},
      howpublished = {Cryptology ePrint Archive, Paper 2017/211},
      year = {2017},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.