Welcome to the InfoSci Platform
Reference Hub2
An Attribute-Based Searchable Encryption Scheme for Non-Monotonic Access Structure

An Attribute-Based Searchable Encryption Scheme for Non-Monotonic Access Structure

Mamta ­, Brij B. Gupta
Copyright: © 2020 |Pages: 21
ISBN13: 9781799822424|ISBN10: 1799822427|EISBN13: 9781799822431
DOI: 10.4018/978-1-7998-2242-4.ch013
Cite Chapter Cite Chapter

MLA

­, Mamta, and Brij B. Gupta. "An Attribute-Based Searchable Encryption Scheme for Non-Monotonic Access Structure." Handbook of Research on Intrusion Detection Systems, edited by Brij B. Gupta and Srivathsan Srinivasagopalan, IGI Global, 2020, pp. 263-283. https://doi.org/10.4018/978-1-7998-2242-4.ch013

APA

­, M. & Gupta, B. B. (2020). An Attribute-Based Searchable Encryption Scheme for Non-Monotonic Access Structure. In B. Gupta & S. Srinivasagopalan (Eds.), Handbook of Research on Intrusion Detection Systems (pp. 263-283). IGI Global. https://doi.org/10.4018/978-1-7998-2242-4.ch013

Chicago

­, Mamta, and Brij B. Gupta. "An Attribute-Based Searchable Encryption Scheme for Non-Monotonic Access Structure." In Handbook of Research on Intrusion Detection Systems, edited by Brij B. Gupta and Srivathsan Srinivasagopalan, 263-283. Hershey, PA: IGI Global, 2020. https://doi.org/10.4018/978-1-7998-2242-4.ch013

Export Reference

Mendeley
Favorite

Abstract

Attribute based encryption (ABE) is a widely used technique with tremendous application in cloud computing because it provides fine-grained access control capability. Owing to this property, it is emerging as a popular technique in the area of searchable encryption where the fine-grained access control is used to determine the search capabilities of a user. But, in the searchable encryption schemes developed using ABE it is assumed that the access structure is monotonic which contains AND, OR and threshold gates. Many ABE schemes have been developed for non-monotonic access structure which supports NOT gate, but this is the first attempt to develop a searchable encryption scheme for the same. The proposed scheme results in fast search and generates secret key and search token of constant size and also the ciphertext components are quite fewer than the number of attributes involved. The proposed scheme is proven secure against chosen keyword attack (CKA) in selective security model under Decisional Bilinear Diffie-Hellman (DBDH) assumption.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.