Searchable Encryption Supporting General Boolean Expression Queries - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès FC 2013 : Financial Cryptography and Data Security 17th International Conference Année : 2013

Searchable Encryption Supporting General Boolean Expression Queries

Résumé

We propose a first construction of searchable encryption that supports generic boolean search over encrypted data. It is based on an original idea of considering keywords as vectors and using the Gram-Schmidt process to orthogonalize and then orthonormalize them. It further makes use of a very efficient operation, the inner product, to perform searches at the server side. The inner product indeed leverages the orthonormalized keywords to efficiently test if a boolean expression query matches the label corresponding to an encrypted document or not. The orthonormalized keywords are salted and the queries sent for retrieving encrypted documents are further randomized to guarantee the secruity of our scheme.
Fichier non déposé

Dates et versions

hal-00952577 , version 1 (27-02-2014)

Identifiants

  • HAL Id : hal-00952577 , version 1

Citer

Tarik Moataz, Abdullatif Shikfa. Searchable Encryption Supporting General Boolean Expression Queries. FC 2013 : Financial Cryptography and Data Security 17th International Conference, Apr 2013, Okinawa, Japan. pp.401-401. ⟨hal-00952577⟩
12 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More