University of Surrey

Test tubes in the lab Research in the ATI Dance Research

An Efficient Key-Policy Attribute-Based Searchable Encryption in Prime-Order Groups (11th International Conference, ProvSec 2017, Xi'an, China, October 23-25, 2017, Proceedings)

Meng, Ru, Zhou, Yanwei, Ning, Jianting, Liang, Kaitai, Han, Jinguang and Susilo, Willy (2017) An Efficient Key-Policy Attribute-Based Searchable Encryption in Prime-Order Groups (11th International Conference, ProvSec 2017, Xi'an, China, October 23-25, 2017, Proceedings) In: Provable Security. LNCS, 10592 (10592). Springer International Publishing AG. Part of Springer Nature, pp. 39-56. ISBN 978-3-319-68636-3

Full text not available from this repository.

Abstract

Public key encryption with keyword search (PEKS) is a promising cryptographic mechanism to enable secure search over encrypted data in cloud. The mechanism allows a semi-trusted cloud server to return related encrypted contents without knowing what the query is and what the corresponding contents are. It has been combined with attribute based encryption (ABE) to support more expressiveness in search. Most of the existing searchable ABE schemes, however, are restricted to heavy complexity. In particular, the size of ciphertext and pairing cost in the test phase are both linear in the size of the keyword set, say O(n), where n is the number of keyword. This limitation hinders the scalability of searchable ABE in practice. To address this long-lasting open problem, this paper proposes a new key-policy attribute-based search encryption (KP-ABSE) scheme. Our construction can be regarded as a novel combination of fast decryption, anonymouslike encryption, and KP-ABE technologies. As of independent interest, the scheme is built in asymmetric bilinear groups. The scheme is further proved secure under the asymmetric decisional DBDH, decisional q-BDHE and decisional linear assumptions in the standard model. Compared with existing KP-ABSE schemes, our new scheme achieves the following properties: (1) flexible access structure for search - any monotonic access structure, (2) constant ciphertext size, (3) constant pairing operations in the test phase.

Item Type: Book Section
Divisions : Faculty of Engineering and Physical Sciences > Computing Science
Authors :
NameEmailORCID
Meng, Ru
Zhou, Yanwei
Ning, Jianting
Liang, Kaitaik.liang@surrey.ac.uk
Han, Jinguangj.han@surrey.ac.uk
Susilo, Willy
Editors :
NameEmailORCID
Okamoto, T
Yu, Yong
Man Ho Au, Man
Li, Yannan
Date : 17 October 2017
Identification Number : 10.1007/978-3-319-68637-0
Copyright Disclaimer : © Springer International Publishing AG 2017
Uncontrolled Keywords : Key-policy attribute-based encryption; Searchable encryption; Prime-order groups; Efficiency
Depositing User : Jane Hindle
Date Deposited : 30 Oct 2017 09:37
Last Modified : 24 Jan 2018 15:47
URI: http://epubs.surrey.ac.uk/id/eprint/842651

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800