Publication Type

Conference Proceeding Article

Publication Date

5-2013

Abstract

Different from the traditional public key encryption, searchable public key encryption allows a data owner to encrypt his data under a user’s public key in such a way that the user can generate search token keys using her secret key and then query an encryption storage server. On receiving such a search token key, the server filters all or related stored encryptions and returns matched ones as response. Searchable pubic key encryption has many promising applications. Unfortunately, existing schemes either only support simple query predicates, such as equality queries and conjunctive queries, or have a superpolynomial blowup in ciphertext size and search token key size. In this paper, based on the key-policy attribute-based encryption scheme proposed by Lewko et al. recently, we present a new construction of searchable public key encryption. Compared to previous works in this field, our construction is much more expressive and efficient and is proven secure in the standard model.

Keywords

Searchable Public Key Encryption, Public Key Encryption with Keyword Search, Anonymous Key-Policy Attribute-Based Encryption

Discipline

Information Security

Research Areas

Cybersecurity

Publication

ASIA CCS '13 Proceedings of the 8th ACM SIGSAC Symposium on Information, Computer and Communications Security: May 8-10, 2013, Hangzhou, China

First Page

243

Last Page

252

ISBN

9781450317672

Identifier

10.1145/2484313.2484345

Publisher

ACM

City or Country

New York

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://dx.doi.org/10.1145/2484313.2484345

Share

COinS