Searchable Encryption with randomized ciphertext and randomized keyword search

Marco Calderini; Riccardo Longo; Massimiliano Sala; Irene Villa

Paper 2022/945

Searchable Encryption with randomized ciphertext and randomized keyword search

Marco Calderini

, University of Trento

Riccardo Longo, University of Trento

Massimiliano Sala

, University of Trento

Irene Villa

, University of Trento

Abstract

The notion of public key encryption with keyword search (PEKS) was introduced to efficiently search over encrypted data. In this paper, we propose a PEKS scheme in which both the encrypted keyword and the trapdoor are randomized, so that the cloud server is not able to recognize identical queries. Our scheme is CI-secure in the single-user setting and TI-secure in the multi-user setting with multi-trapdoor.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: public key searchable encryption provable security Keyword search
Contact author(s): Marco calderini @ unitn it
riccardo longo @ unitn it
maxsalacodes @ gmail com
irene villa @ unitn it
History: 2022-07-23: approved; 2022-07-21: received; See all versions
Short URL: https://ia.cr/2022/945
License: CC BY

BibTeX

@misc{cryptoeprint:2022/945,
      author = {Marco Calderini and Riccardo Longo and Massimiliano Sala and Irene Villa},
      title = {Searchable Encryption with randomized ciphertext and randomized keyword search},
      howpublished = {Cryptology {ePrint} Archive, Paper 2022/945},
      year = {2022},
      url = {https://eprint.iacr.org/2022/945}
}