Searchable encryption with randomized ciphertext and randomized keyword search
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 recogni...
Saved in:
| Published in: | Journal of mathematical cryptology Vol. 18; no. 1; pp. 506 - 22 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Berlin
De Gruyter
01.01.2024
Walter de Gruyter GmbH |
| Subjects: | |
| ISSN: | 1862-2984, 1862-2976, 1862-2984 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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
. Our scheme is
secure in the single-user setting and
secure in the multi-user setting with a stronger security, i.e., with |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1862-2984 1862-2976 1862-2984 |
| DOI: | 10.1515/jmc-2023-0029 |