期刊名称：International Journal of Security and Its Applications
印刷版ISSN：1738-9976
出版年度：2013
卷号：7
期号：6
页码：385-394
DOI：10.14257/ijsia.2013.7.6.38
出版社：SERSC
摘要：In this work, we design a method for e . cient revocation within Ciphertext-Policy Attribute-Based Encryption scheme. Our main technical innovation is based on linear secret sharing and binary tree techniques, every user in system is assigned with both a set of attributes and a unique identifier. Any user can also be efficiently revoked by using this identifier. Furthermore, this technique resulted in two key contributions: the size of the cryptographic key material is smaller and encryption/decryption cannot be affected with an unbounded number of revoked users. Then, the scheme is proved to be secure under the q-MEBDH assumption in the standard model. The e . ciency is also optimized that the size of user's private key has only a constant increase. The revocation information is embedded in the ciphertext so that the fine-grained access control is more flexible.
关键词：Ciphertext-Policy Attribute-Based Encryption; Efficient Revocation; Linear ; Secret Sharing Schemes; Security Model
