Extended Functionality in Verifiable Searchable Encryption

James Alderman; Christian Janson; Keith Martin; Sarah Renwick

doi:10.1007/978-3-319-29172-7_12

Extended Functionality in Verifiable Searchable Encryption

James Alderman, Christian Janson, Keith Martin, Sarah Renwick

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

118 Downloads (Pure)

Abstract

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 language	English
Title of host publication	Proceedings of the 2nd International Conference on Cryptography and Information Security in the Balkans - BalkanCryptSec 2015
Publisher	Springer
Pages	187-205
Number of pages	19
Volume	9540
ISBN (Electronic)	978-3-319-29172-7
ISBN (Print)	978-3-319-29171-0
DOIs	https://doi.org/10.1007/978-3-319-29172-7_12
Publication status	E-pub ahead of print - 9 Jan 2016

Publication series

Name	Lecture Notes in Computer Science
Volume	9540
ISSN (Print)	0302-9743

Access to Document

10.1007/978-3-319-29172-7_12

Accepted ManuscriptAccepted author manuscript, 466 KB

http://link.springer.com/chapter/10.1007%2F978-3-319-29172-7_12

Cite this

Alderman, J., Janson, C., Martin, K., & Renwick, S. (2016). Extended Functionality in Verifiable Searchable Encryption. In Proceedings of the 2nd International Conference on Cryptography and Information Security in the Balkans - BalkanCryptSec 2015 (Vol. 9540, pp. 187-205). (Lecture Notes in Computer Science; Vol. 9540). Springer. Advance online publication. https://doi.org/10.1007/978-3-319-29172-7_12

@inproceedings{cd7c488341744a2f9a365d65067228e7,

title = "Extended Functionality in Verifiable Searchable Encryption",

abstract = "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.",

author = "James Alderman and Christian Janson and Keith Martin and Sarah Renwick",

year = "2016",

month = jan,

day = "9",

doi = "10.1007/978-3-319-29172-7_12",

language = "English",

isbn = " 978-3-319-29171-0 ",

volume = "9540",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "187--205",

booktitle = "Proceedings of the 2nd International Conference on Cryptography and Information Security in the Balkans - BalkanCryptSec 2015",

}

Extended Functionality in Verifiable Searchable Encryption. / Alderman, James; Janson, Christian; Martin, Keith et al.
Proceedings of the 2nd International Conference on Cryptography and Information Security in the Balkans - BalkanCryptSec 2015. Vol. 9540 Springer, 2016. p. 187-205 (Lecture Notes in Computer Science; Vol. 9540).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Extended Functionality in Verifiable Searchable Encryption

AU - Alderman, James

AU - Janson, Christian

AU - Martin, Keith

AU - Renwick, Sarah

PY - 2016/1/9

Y1 - 2016/1/9

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-319-29172-7_12

DO - 10.1007/978-3-319-29172-7_12

M3 - Conference contribution

SN - 978-3-319-29171-0

VL - 9540

T3 - Lecture Notes in Computer Science

SP - 187

EP - 205

BT - Proceedings of the 2nd International Conference on Cryptography and Information Security in the Balkans - BalkanCryptSec 2015

PB - Springer

ER -