Introduction to attribute based searchable encryption

19Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

An Attribute Based Searchable Encryption Scheme (ABSE) is a public key encryption with keyword search (PEKS) where each user owns a set of attributes, and the senders decide on a policy. The policy is a function of these attributes expressed as a predicate and determines, among the users of the system, who is eligible to decrypt and search the ciphertext. Only members who own sufficient attributes to satisfy that policy can send the server a valid search query. In our work we introduce the concept of a secure ABSE by defining the functionalities and the relevant security notions. © 2014 IFIP International Federation for Information Processing.

Cite

CITATION STYLE

APA

Khader, D. (2014). Introduction to attribute based searchable encryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8735 LNCS, pp. 131–135). Springer Verlag. https://doi.org/10.1007/978-3-662-44885-4_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free