全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
-  2016 

在线/离线非单调CP-ABE方案构造
A compact construction for non-monotonic online/offline CP-ABE

DOI: 10.6040/j.issn.1671-9352.0.2015.479

Keywords: 选择性安全,在线/离线,线性秘密共享方案,非单调访问结构,CP-ABE,
CP-ABE
,online/offline,linear secret sharing scheme,selective security,non-monotonic access structure

Full-Text   Cite this paper   Add to My Lib

Abstract:

摘要: 提出了支持非单调访问结构的在线/离线的CP-ABE方案。在离线加密阶段,完成了密文的主要构成部分的计算;在线加密阶段,将正属性集合上的非单调访问控制结构转变成由正、负属性集合上的基于线性秘密共享方案的单调访问控制结构,利用少量的加法和乘法操作生成密文的其余构成部分。在n-(B)假设成立条件下,证明了该方案具有选择性安全性。与原来的非单调CP-ABE方案相比,该方案系统参数和私钥规模保持不变,加密的总体计算复杂度仅有少量增加,但在线加密阶段的计算复杂度较小,可与解密外包服务相结合,使得该方案的离线加密和解密阶段都可在资源受限的小型设备上完成。
Abstract: We proposed an online/offline ciphertext-policy attribute-based encryption scheme that could support non-monotonic access structure. In the offline phase, most of the computations for encryption are done; in the online phase, we transform the non-monotonic access structure with positive attribute sets into a monotonic access structure which is based on the linear secret sharing scheme with positive and negative attribute sets, then it only needs a small amount of addition and multiplication operations for the rest components of encryption. The selective security of the scheme under the n-(B)assumption was proved. Compared with the original non-monotonic CP-ABE scheme, our scheme remains the same on the public keys and the master secret keys, with only a small increase in computational complexity. However, the computational complexity during online phase is very small. We can combine our scheme with outsourcing techniques, thus the online encryption phase and the decryption phase could be completed on the resource-constrained small devices

References

[1]  HOHENBERGER S, WATERS B. Attribute-based encryption with fast decryption[C] // Proceedings of PKC2013. Berlin: Springer Verlag, 2013: 162-179.
[2]  GARG S, GENTRY C, HALEVI S, et al. Fully secure attribute based encryption from multilinear maps[R/OL]. Cryptology ePrint Archive, Report 2014/622, 2014. [2015-02-26]. http://eprint.iacr.org/eprint-bin/getfile.pl?entry=2014/622&version=20140813:235325&file=622.pdf.
[3]  LIU J K, BAEK J, ZHOU J. Online/offline identity-based signcryption revisited[J]. Lecture Notes in Computer Science, 2011: 36-51.
[4]  HOHENBERGER S, WATERS B. Online/offline attribute-based encryption[C] // Proceedings of PKC2014. Berlin: Springer Verlag, 2014: 293-310.
[5]  SAHAI A, WATERS B. Fuzzy identity-based encryption[J]. Lecture Notes in Computer Science, 2004, 3494:457-473.
[6]  GOYAL V, PANDEY O, SAHAI A, et al. Attribute-based encryption for fine grained access control of encrypted data[C] //Proceedings of the ACM Conference on Computer and Communications Security. New York: ACM, 2006: 89-98.
[7]  BETHENCOURT J, SAHAI A, WATERS B. Ciphertext-policy attribute-based encryption[J]. IEEE Symposium on Security and Privacy, 2007: 321-334.
[8]  WATERS B. Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization[J]. Lecture Notes in Computer Science, 2015, 2008:321-334.
[9]  ATTRAPADUNG N, LIBERT B, PANAFIEU E D. Expressive key-policy attribute-based encryption with constant-size ciphertexts[C] // Proceedings of PKC2011. Berlin: Springer Verlag, 2011: 90-108
[10]  ROUSELAKIS Y, WATERS B. Practical constructions and new proof methods for large universe attribute-based encryption[C] //Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security. New York: ACM, 2013: 463-474.
[11]  OSTROVSKY R, SAHAI A, WATERS B. Attribute-based encryption with non-monotonic access structures[C] //Proceedings of the 14th ACM Conference on Computer and Communications Security. New York: ACM, 2007: 195-203.
[12]  YANG X, DU W, WANG X, et al. Fully secure attribute-based encryption with non-monotonic access structures[C] //Proceedings of 5th International Conference on Intelligent Networking and Collaborative Systems(INCoS). Piscataway: IEEE, 2013: 521-527.
[13]  GUO F, MU Y, CHEN Z. Identity-based online/offline encryption[J]. Computer Technology and Development, 2008: 247-261.
[14]  LAI J, DENG R H, LI Y, et al. Fully secure key-policy attribute-based encryption with constant-size ciphertexts and fast decryption[C] //Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security. New York: ACM, 2014: 239-248.
[15]  CHEUNG L, NEWPORT C. Provably secure ciphertext policy ABE[C] //Proceedings of the 14th ACM Conference on Computer and Communications Security. New York: ACM, 2007: 456-465.
[16]  LEWKO A, SAHAI A, WATERS B. Revocation systems with very small private keys[J]. IEEE Symposium on Security and Privacy, 2010, 2008(3):273-285.
[17]  YAMADA S, ATTRAPADUNG N, HANAOKA G, et al. A framework and compact constructions for non-monotonic attribute-based encryption[C] // Proceedings of PKC2014. Berlin: Springer Verlag, 2014: 275-292.
[18]  CHOW S S M, LIU J K, ZHOU J. Identity-based online/offline key encapsulation and encryption[C] //Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security. New York: ACM, 2011: 52-60.
[19]  LAI J, MU Y, GUO F, et al. Improved identity-based online/offline encryption[J]. Information Security and Privacy, 2015: 160-173.
[20]  马海英, 曾国荪, 王占君, 等. 高效可证明安全的基于属性的在线/离线加密机制[J]. 通信学报,2014, 35(7):104-112. MA Haiying, ZENG Guosun, WANG Zhanjun, et al. Efficient and proven secure property based online/offline encryption mechanism[J]. Journal of Communication, 2014, 35(7):104-112.
[21]  GREEN M, HOHENBERGER S, WATERS B. Outsourcing the decryption of ABE ciphertexts[J]. Pearson Education, 49(3-4):56-61.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133