Preserving Privacy of Co-occurring Keywords over Encrypted Data - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Preserving Privacy of Co-occurring Keywords over Encrypted Data

Résumé

The indexes of ranked searchable encryption contain encrypted keywords and their encrypted relevance scores. The encryption scheme of relevance scores must preserve the plaintext order after encryption so as to enable the cloud server to determine ranks of the documents directly from the encrypted keywords’ scores for a given trapdoor. Existing schemes such as Order Preserving Encryption (OPE) and One-to-Many OPE preserve the plaintext order. However, they leak the distribution information, i.e., the frequency of ciphertext values, due to the insufficient randomness employed in these schemes. The cloud server uses frequency analysis attack to infer plaintext keywords of the indexes based on the frequency leakage. In this paper, an Enhanced One-to-Many OPE scheme is proposed to minimize the frequency leakage. The proposed scheme reduces not only the frequency leakage of individual keywords but also the co-occurring keywords of the phrases like “computer network”, and “communication network”.
Fichier principal
Vignette du fichier
513274_1_En_9_Chapter.pdf (462.61 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03677031 , version 1 (24-05-2022)

Licence

Paternité

Identifiants

Citer

D. Siva Kumar, P. Santhi Thilagam. Preserving Privacy of Co-occurring Keywords over Encrypted Data. 35th IFIP Annual Conference on Data and Applications Security and Privacy (DBSec), Jul 2021, Calgary, AB, Canada. pp.157-168, ⟨10.1007/978-3-030-81242-3_9⟩. ⟨hal-03677031⟩
11 Consultations
8 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More