性基加密(attribute-basedencryption,ABE)是一种新型公钥加密体制,它实现了对加密数据的细粒度访问控制?在密钥策略属性基加密方案(key-policyattribute-basedencryption,KP-ABE)中,密文与属性集合相关联,密钥则与访问控制结构相关联.因此在大多数KP-ABE方案中,解密开销与解密算法所涉及的属性数目成正比?结合Hohenberger和Waters提出的快速解密属性基加密方案的思想,构造了一个同时支持非单调访问结构、大属性空间的选择属性集合和选择明文安全快速解密密钥策略属性基加密方案,并在随机预言机模型下证明是选择性属性集合和选择明文安全的;并在此基础上,利用Lai等人提出的合数阶上具有强表达能力的快速解密KP-ABE方案的思想,再结合用于给出构造选择密文安全的KP-ABE方案的变色龙Hash技术,构造了一个同样支持非单调的访问控制结构且表达能力丰富的选择密文安全快速解密KP-ABE方案.比较相关方案,所提出的2个方案都具备相当的解密效率.
Attribute-based encryption (ABE) is a promising version of public key encryption, since it enables fine-grained access control on the encrypted data. In a key-policy ABE ( KP-ABE) scheme,every ciphertext is related to attributes set and each secret key is associated with an access structure.Therefore ? the decryption overhead is usually proportional to the number of attributes used indecryption process in most existing KP-ABE schemes. Inspired by Hohenberger and Waters5 KP-ABEscheme with fast decryption, we propose a large universe KP-ABE with fast decryption supportingnon-monotonic access structure ? which is proven selective chosen attribute set secure and chosenplaintext secure in the random oracle model. Moreover, observing Lai et. al expressive KP-ABE withfast decryption and applying with Chameleon Hash technique used to give a direct chosen ciphertextsecure KP-ABE construction, we also give a direct chosen plaintext secure KP-ABE construction inthe random oracle model, which still achieves the following features: non-monotonic access structure,large-universe and fast decryption. Compared with the related work, both two expressive large universe KP-ABE schemes enjoy comparable time efficiency in decryption process.