Paper Info
Title
Fully secure key-policy attribute-based encryption with constant-size ciphertexts and fast decryption
Abstract
Attribute-based encryption (ABE), introduced by Sahai and Waters, is a promising cryptographic primitive, which has been widely applied to implement fine-grained access control system for encrypted data. In its key-policy flavor, attribute sets are used to annotate ciphertexts and secret keys are associated with access structures that specify which ciphertexts a user is entitled to decrypt. In most existing key-policy attribute-based encryption (KP-ABE) constructions, the size of the ciphertext is proportional to the number of attributes associated with it and the decryption cost is proportional to the number of attributes used during decryption. In this paper, we present a new construction of KP-ABE. Our proposed construction is the first KP-ABE scheme, which has the following features simultaneously: expressive (i.e., supporting arbitrary monotonic access structures); fully secure in the standard model; constant-size ciphertexts and fast decryption. The downside of our construction is that secret keys have quadratic size in the number of attributes.
Year
DOI
Venue
2014
10.1145/2590296.2590334
ASIACCS
Keywords
Field
DocType
key-policy attribute-based encryption,public key cryptosystems,constant-size ciphertexts,full security,fast decryption
Monotonic function,Internet privacy,Computer security,Computer science,Attribute-based encryption,Quadratic equation,Encryption,Cryptographic primitive,Theoretical computer science,Access control,Probabilistic encryption,Ciphertext
Conference
Citations 
PageRank 
References 
11
0.57
32
Authors
4
Name
Order
Citations
PageRank
Junzuo Lai141924.55
R.H Deng24423362.82
Yingjiu Li3129892.14
Jian Weng4107377.90