Adaptively secure key-policy ABE scheme with fast decryption

In the existing adaptively secure ABE (attribute-based encryption) schemes,the decryption cost goes linearly with the number of attributes that are used in decryption.An adaptively secure key-policy ABE (FKP-ABE) scheme with fast decryption is proposed,where constant size of computation overhead is...

Full description

Saved in:
Bibliographic Details
Main Authors: Qi LI, Jian-feng MA, Jin-bo XIONG, Xi-meng LIU
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2014-11-01
Series:Tongxin xuebao
Subjects:
Online Access:http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.z2.005/
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the existing adaptively secure ABE (attribute-based encryption) schemes,the decryption cost goes linearly with the number of attributes that are used in decryption.An adaptively secure key-policy ABE (FKP-ABE) scheme with fast decryption is proposed,where constant size of computation overhead is implemented in decryption.This scheme is constructed on composite order bilinear groups and supports any monotonic access structure that can be expressed by LSSS (linear secret sharing schemes).The proposed scheme is proved to be adaptively secure in the standard model.
ISSN:1000-436X