Paper 2020/999 Original: eprint.iacr.org/2020/999 ↗

Attribute-Based Symmetric Searchable Encryption

Hai-Van Dang
Amjad Ullah
Alexandros Bakas
Antonis Michalas
Abstract

Symmetric Searchable Encryption (SSE) is an encryption technique that allows users to search directly on their outsourced encrypted data while preserving the privacy of both the files and the queries. Unfortunately, majority of the SSE schemes allows users to either decrypt the whole ciphertext or nothing at all. In this paper, we propose a novel scheme based on traditional symmetric primitives, that allows data owners to bind parts of their ciphertexts with specific policies. Inspired by the concept of Attribute-Based Encryption (ABE) in the public setting, we design a scheme through which users can recover only certain parts of an encrypted document if and only if they retain a set of attributes that satisfy a policy. Our construction satisfies the important notion of forward privacy while at the same time supports the multi-client model by leveraging SGX functionality for the synchronization of users. To prove the correctness of our approach, we provide a detailed simulation-based security analysis coupled with an extensive experimental evaluation that shows the effectiveness of our scheme.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint.
History
2020-08-18: last updated
2020-08-18: published
Short URL
https://ia.cr/2020/999
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2020/999,
      author = {Hai-Van Dang and Amjad Ullah and Alexandros Bakas and Antonis Michalas},
      title = {Attribute-Based Symmetric Searchable Encryption},
      howpublished = {Cryptology {ePrint} Archive, Paper 2020/999},
      year = {2020},
      url = {https://eprint.iacr.org/2020/999}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.