Paper 2015/975

Extended Functionality in Verifiable Searchable Encryption

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


When outsourcing the storage of sensitive data to an (untrusted) remote server, a data owner may choose to encrypt the data beforehand to preserve confidentiality. However, it is then difficult to efficiently retrieve specific portions of the data as the server is unable to identify the relevant information. Searchable encryption has been well studied as a solution to this problem, allowing data owners and other authorised users to generate search queries which the server may execute over the encrypted data to identify relevant data portions. However, many current schemes lack two important properties: verifiability of search results, and expressive queries. We introduce Extended Verifiable Searchable Encryption (eVSE) that permits a user to verify that search results are correct and complete. We also permit verifiable computational queries over keywords and specific data values, that go beyond the standard keyword matching queries to allow functions such as averaging or counting operations. We formally define the notion of eVSE within relevant security models and give a provably secure instantiation.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. MAJOR revision.BalkanCryptSec 2015
Verifiable Searchable EncryptionVerifiable ComputationAttribute-based Encryption
Contact author(s)
Christian Janson 2012 @ live rhul ac uk
2015-10-22: revised
2015-10-12: received
See all versions
Short URL
Creative Commons Attribution


      author = {James Alderman and Christian Janson and Keith M.  Martin and Sarah Louise Renwick},
      title = {Extended Functionality in Verifiable Searchable Encryption},
      howpublished = {Cryptology ePrint Archive, Paper 2015/975},
      year = {2015},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.