Extended Functionality in Verifiable Searchable Encryption

James Alderman, Christian Janson, Keith Martin, Sarah Renwick

Research output: Chapter in Book/Report/Conference proceedingConference contribution

116 Downloads (Pure)


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 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.
Original languageEnglish
Title of host publicationProceedings of the 2nd International Conference on Cryptography and Information Security in the Balkans - BalkanCryptSec 2015
Number of pages19
ISBN (Electronic)978-3-319-29172-7
ISBN (Print) 978-3-319-29171-0
Publication statusE-pub ahead of print - 9 Jan 2016

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743

Cite this