Efficient Fully Secure Attribute-Based Encryption Schemes for General Access Structures
Efficient Fully Secure Attribute-Based Encryption Schemes for General Access Structures
复制标题
DOI：
10.1007/978-3-642-33272-2_13
复制
发表时间：
2012-09
期刊：
影响因子：
--
通讯作者：
Tapas Pandit;R. Barua
中科院分区：
文献类型：
--
作者：
Tapas Pandit;R. Barua
本文针对复合序双线性群上标准模型下完全安全的单调访问结构（MAS），提出了一个高效的短密文-策略属性加密（CP-ABE）方案和一个短密钥-策略属性加密（KP-ABE）方案.我们得到我们的计划，通过使用一个简单的“编码技术”，表示的单调访问结构的最小集，从而获得计划的密文大小或密钥大小取决于最小集的数量。大多数最近的CP-ABE/KP-ABE方案的密文大小或密钥大小大致为单调跨度程序（MSP）的大小或属性的数量级。因此，我们的方案通常具有较短的密文或较短的密钥。为了说明，我们给出的例子MAS的最小集的数量是恒定的，而相应的MSP的大小是线性的属性的数量。利用类似的思想，我们给出了在复合阶双线性群上，在三个静态假设下，对于任意的访问结构（不一定是单调的），如何得到一个具有常数大小密钥的CP-ABE方案和一个具有常数大小密文的分层（H）KP-ABE方案，它们在标准模型下也是完全安全的。到目前为止，对于所有的一般策略，解密成本是多项式的合格的行数在跨度程序。但在我们提出的所有方案中，对于一般的访问结构，解密成本是恒定的。
In this paper, we present an efficient ciphertext-policy attribute based encryption (CP-ABE) scheme with “short” ciphertext and a key-policy attribute based encryption (KP-ABE) scheme with “short” key for monotone access structures (MAS) which are fully secure in the standard model over composite order bilinear groups. We obtain our schemes by using a simple “encoding technique”, representing the monotone access structure by their minimal sets only, thereby obtaining schemes whose ciphertext size or key size depends on number of minimal sets. Most of the recent CP-ABE/KP-ABE schemes have ciphertext size or key size roughly of the order of the size of the monotone span program (MSP) or the number of attributes. Consequently, our schemes will, in general, have shorter ciphertext or shorter key. To illustrate, we give examples of MAS where the number of minimal sets is constant whereas the size of the corresponding MSP is linear in the number of attributes. Using similar ideas, we show how to obtain a CP-ABE scheme withconstant size keyand a Hierarchical (H) KP-ABE scheme withconstant size ciphertextfor arbitrary access structures (not necessarily monotone) which are also fully secure in the standard model under three static assumptions over composite order bilinear groups. To date, for all general policies, the decryption cost is polynomial in the number of qualified rows in the span programs. But in all of our proposed schemes, the decryption cost iscontantfor general access structures.