素数阶群上快速解密的KP-ABE方案

大部分基于属性的加密方案(ABE)解密开销随解密时用到的属性数量呈线性增长,解密时双线性对运算为常数次的快速解密ABE方案(FABE)能用来解决此问题。针对现有自适应安全的FABE方案在合数阶群上构造,解密运算时双线性配对计算开销过大的问题,提出一种素数阶群上快速解密的密钥策略ABE(PFKP-ABE)方案。首先基于对偶正交基和线性秘密共享(LSSS)技术提出一个PFKP-ABE方案,然后采用对偶系统加密技术构建一系列两两不可区分的攻击游戏证明该方案在标准模型下是自适应安全的。性能分析表明,与现有的合数阶群上一种快速解密自适应安全密钥策略ABE方案(FKP-ABE)相比,该方案在自适应安全的前提下,解密计算速率提高了约15倍。

Attribute-based encryption with fast decryption on prime order groups

The decryption costs of most Attribute-Based Encryption (ABE) schemes go linearly with the number of attributes used in decryption. Attribute-Based Encryption scheme with Fast decryption (FABE) was used to solve this problem where cipher texts could be decrypted with a constant number of pairings. To solve the problem of existing adaptively secure FABE suffered from superfluous computation overhead because it was designed on composite order groups, an adaptively secure key-policy ABE scheme with fast decryption on prime order groups named PFKP-ABE was proposed. Firstly, based on dual pairing vector space and Linear Secret-Sharing Scheme (LSSS) technology, PFKP-ABE was constructed on prime order groups. Then, a sequence of attacking games indistinguishable from each other was designed to prove that this scheme is adaptively secure in the standard mode when dual system encryption approach was employed. Performance analysis indicates that in comparison with another adaptively secure key-policy ABE scheme with fast decryption on composite order groups (FKP-ABE), the speed of decryption has increased by roughly 15 times.