M-EDESE: Multi-Domain, Easily Deployable, and Efficiently Searchable Encryption
Pages 606 - 623
Abstract
Searchable encryption is an essential component of cryptography, which allows users to search for keywords and retrieve records from an encrypted database at cloud storage while ensuring the confidentiality of users’ queries. While most existing research on searchable encryption focuses on the single domain setting, we propose the first Multi-Domain, Easily-Deployable, Efficiently-Searchable Encryption (M-EDESE) system that allows users to query keywords cross domains with high efficiency and preserved privacy without additional cooperation from the cloud storage. In the multi-domain setting, a user who belongs to a domain can query keywords from another domain under an inter-domain partnership. Any party can participate in the M-EDESE system as a domain without global coordination other than agreeing on an initial set of global reference parameters. Each domain maintains a set of users and acts as an individual multiple-user searchable encryption system while maintaining its own database. M-EDESE enables easy deployment without any requirement for cloud storage setup, thus it is compatible with the existing cloud storage platform. In addition, the M-EDESE system facilitates instant user revocation within each domain and instant partner revocation across domains. We provide a concrete construction of M-EDESE and security proofs on query privacy, unforgeability, and revocability. We also conduct a rigorous experimental evaluation of the performance of M-EDESE in a real-world setting, showing that M-EDESE is highly efficient for querying an open-sourced database.
References
[1]
Hamad SA, Sheng QZ, Zhang WE, and Nepal S Realizing an internet of secure things: a survey on issues and enabling technologies IEEE Commun. Surv. Tutor. 2020 22 2 1372-1391
[2]
He, W., Akhawe, D., Jain, S., Shi, E., Song, D.: Shadowcrypt: encrypted web applications for everyone. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp. 1028–1039 (2014)
[3]
Lau, B., Chung, S., Song, C., Jang, Y., Lee, W., Boldyreva, A.: Mimesis aegis: a mimicry privacy shield-a system’s approach to data privacy on public cloud. In: 23rd USENIX Security Symposium (USENIX Security 2014), pp. 33–48 (2014)
[4]
Boneh D, Di Crescenzo G, Ostrovsky R, and Persiano G Cachin C and Camenisch JL Public key encryption with keyword search Advances in Cryptology - EUROCRYPT 2004 2004 Heidelberg Springer 506-522
[5]
Amanatidis G, Boldyreva A, and O’Neill A Barker S and Ahn G-J Provably-secure schemes for basic query support in outsourced databases Data and Applications Security XXI 2007 Heidelberg Springer 14-30
[6]
Boneh D, Sahai A, and Waters B Functional encryption: a new vision for public-key cryptography Commun. ACM 2012 55 11 56-64
[7]
Boneh D and Waters B Vadhan SP Conjunctive, subset, and range queries on encrypted data Theory of Cryptography 2007 Heidelberg Springer 535-554
[8]
Bösch C, Hartel P, Jonker W, and Peter A A survey of provably secure searchable encryption ACM Comput. Surv. (CSUR) 2014 47 2 1-51
[9]
Cash, D., et al.: Dynamic searchable encryption in very-large databases: data structures and implementation. In: NDSS, vol. 14, pp. 23–26 (2014)
[10]
Chai, Q., Gong, G.: Verifiable symmetric searchable encryption for semi-honest-but-curious cloud servers. In: 2012 IEEE International Conference on Communications (ICC), pp. 917–922. IEEE (2012)
[11]
Chang Y-C and Mitzenmacher M Ioannidis J, Keromytis A, and Yung M Privacy preserving keyword searches on remote encrypted data Applied Cryptography and Network Security 2005 Heidelberg Springer 442-455
[12]
Curtmola R, Garay J, Kamara S, and Ostrovsky R Searchable symmetric encryption: improved definitions and efficient constructions J. Comput. Secur. 2011 19 5 895-934
[13]
Faber S, Jarecki S, Krawczyk H, Nguyen Q, Rosu M, and Steiner M Pernul G, Ryan PYA, and Weippl E Rich queries on encrypted data: beyond exact matches Computer Security – ESORICS 2015 2015 Cham Springer 123-145
[14]
Poh GS, Chin JJ, Yau WC, Choo KKR, and Mohamad MS Searchable symmetric encryption: designs and challenges ACM Comput. Surv. (CSUR) 2017 50 3 1-37
[15]
Boneh D, Lynn B, and Shacham H Boyd C Short signatures from the weil pairing Advances in Cryptology — ASIACRYPT 2001 2001 Heidelberg Springer 514-532
[16]
Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In Proceeding 2000 IEEE Symposium on Security and Privacy, S &P 2000, pp. 44–55. IEEE (2000)
[17]
Bao F, Deng RH, Ding X, and Yang Y Chen L, Mu Y, and Susilo W Private query on encrypted data in multi-user settings Information Security Practice and Experience 2008 Heidelberg Springer 71-85
[18]
Yin H et al. CP-ABSE: a ciphertext-policy attribute-based searchable encryption scheme IEEE Access 2019 7 5682-5694
[19]
De Caro, A., Iovino, V. : jPBC: java pairing based cryptography. In: 2011 IEEE Symposium on Computers and Communications (ISCC), pp. 850–855. IEEE (2011)
[20]
Enron email dataset (2019). https://www.cs.cmu.edu/./enron. Accessed 23 Nov 2019
Index Terms
- M-EDESE: Multi-Domain, Easily Deployable, and Efficiently Searchable Encryption
Index terms have been assigned to the content through auto-classification.
Recommendations
Multi-keyword ranked searchable public-key encryption
Most related works on Public-Key Encryption with Keyword Search scheme also called Searchable Public-key Encryption focus on single keyword search. Some works supporting multi-keyword search cannot provide search result ranking. In this paper, we study ...
Decryptable searchable encryption
ProvSec'07: Proceedings of the 1st international conference on Provable securityAs such, public-key encryption with keyword search (a.k.a PEKS or searchable encryption) does not allow the recipient to decrypt keywords i.e. encryption is not invertible. This paper introduces searchable encryption schemes which enable decryption. An ...
Deniable Searchable Symmetric Encryption
In the recent years, Searchable Symmetric Encryption (SSE) has become one of the hottest topic in cloud-computing area because of its availability and flexibility, and there are a series of SSE schemes were proposed. The adversary considered in these ...
Comments
Information & Contributors
Information
Published In
Nov 2022
642 pages
ISBN:978-3-031-21279-6
DOI:10.1007/978-3-031-21280-2
- Editors:
- Chunhua Su,
- Dimitris Gritzalis,
- Vincenzo Piuri
© Springer Nature Switzerland AG 2022.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 23 November 2022
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 22 Sep 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in