Paper 2022/738
Secure Search on Multi-key Homomorphically Encrypted Data with Finite Fields
Abstract
Homomorphic Encryption (HE) is a very attractive solution to ensure privacy when outsourcing confidential data to the cloud, as it enables computation on the data without decryption. As the next step, searching this homomorphic data becomes necessary to navigate it in the server. In this paper, we propose a novel algorithm to search homomorphically encrypted data outsourced to an untrusted server and shared with multiple users. We optimize the steps involved in the process to reduce the number of rounds of communication. We use an order-preserving encoding to batch the data with multi-key HE cryptosystems to reduce the multiplicative depth of the equality circuits and enable direct comparison. Further, we use LEAF to retrieve indices securely, and SealPIR to retrieve the values obliviously to the user. Overall, we provide an efficient end-to-end framework for searching shared data in a semi-honest server.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- homomorphic encryption multi-key HE Secure Search Finite fields Encrypted databases data sharing
- Contact author(s)
-
b ganesh @ cs ucc ie
p palmieri @ cs ucc ie - History
- 2022-06-09: approved
- 2022-06-09: received
- See all versions
- Short URL
- https://ia.cr/2022/738
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/738,
author = {Buvana Ganesh and Paolo Palmieri},
title = {Secure Search on Multi-key Homomorphically Encrypted Data with Finite Fields},
howpublished = {Cryptology ePrint Archive, Paper 2022/738},
year = {2022},
note = {\url{https://eprint.iacr.org/2022/738}},
url = {https://eprint.iacr.org/2022/738}
}
