The notion of public-key encryption with keyword search (PEKS) was introduced to search over encrypted data without performing any decryption. In this article, 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 a priori. Our scheme is Ciphertext-Indistinguishabiltity secure in the single-user setting and Trapdoor-Indistinguishability secure in the multi-user setting with a stronger security, i.e., with multi-trapdoor.
Searchable encryption with randomized ciphertext and randomized keyword search / Calderini, Marco; Longo, Riccardo; Sala, Massimiliano; Villa, Irene. - In: JOURNAL OF MATHEMATICAL CRYPTOLOGY. - ISSN 1862-2984. - 2024, 18:1(2024), pp. 2023002901-2023002914. [10.1515/jmc-2023-0029]
Searchable encryption with randomized ciphertext and randomized keyword search
Calderini, Marco;Longo, Riccardo
;Sala, Massimiliano;Villa, Irene
2024-01-01
Abstract
The notion of public-key encryption with keyword search (PEKS) was introduced to search over encrypted data without performing any decryption. In this article, 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 a priori. Our scheme is Ciphertext-Indistinguishabiltity secure in the single-user setting and Trapdoor-Indistinguishability secure in the multi-user setting with a stronger security, i.e., with multi-trapdoor.File | Dimensione | Formato | |
---|---|---|---|
10.1515_jmc-2023-0029.pdf
accesso aperto
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Creative commons
Dimensione
2.76 MB
Formato
Adobe PDF
|
2.76 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione