Revocable attribute-based proxy re-encryption

Author:

Luo Fucai1,Al-Kuwari Saif1

Affiliation:

1. College of Science and Engineering, Ringgold Standard Institution, Hamad Bin Khalifa University , Qatar , Doha , Qatar

Abstract

Abstract Attribute-based proxy re-encryption (ABPRE), which combines the notions of proxy re-encryption (PRE) and attribute-based encryption (ABE), allows a semi-trusted proxy with re-encryption key to transform a ciphertext under a particular access policy into a ciphertext under another access policy, without revealing any information about the underlying plaintext. This primitive is very useful in applications where encrypted data need to be stored in untrusted environments, such as cloud storage. In many practical applications, and in order to address scenarios where users misbehave or the re-encryption keys are compromised, an efficient revocation mechanism is necessary for ABPRE. Previously, revocation mechanism was considered in the settings of identity-based encryption (IBE), ABE, predicate encryption (PE), and broadcast PRE, but not ABPRE, which is what we set to do in this paper. We first formalize the concept of revocable ABPRE and its security model. Then, we propose a lattice-based instantiation of revocable ABPRE. Our scheme not only supports an efficient revocation mechanism but also supports polynomial-depth policy circuits and has short private keys, where the size of the keys is dependent only on the depth of the supported policy circuits. In addition, we prove that our scheme is selectively chosen-plaintext attack (CPA) secure in the standard model, based on the learning with errors assumption.

Publisher

Walter de Gruyter GmbH

Subject

Applied Mathematics,Computational Mathematics,Computer Science Applications

Reference44 articles.

1. Agrawal S , Boneh D , Boyen X . Efficient lattice (H)IBE in the standard model. In: Advances in Cryptology - EUROCRYPT 2010, Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco/French Riviera, May 30–June 3, 2010; 2010. p. 553–72.

2. Agrawal S , Freeman DM , Vaikuntanathan V . Functional encryption for inner product predicates from learning with errors. In: Advances in Cryptology - ASIACRYPT 2011, Proceedings of the 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4–8, 2011; 2011. p. 21–40.

3. Ateniese G , Fu K , Green M , Hohenberger S . Improved proxy re-encryption schemes with applications to secure distributed storage. In: Proceedings of the Network and Distributed System Security Symposium, NDSS 2005, San Diego, California, USA; 2005.

4. Attrapadung N , Imai H . Attribute-based encryption supporting direct/indirect revocation modes. In: Parker MG , editor. Cryptography and Coding, Cryptography and Coding, Proceedings of the 12th IMA International Conference, Cryptography and Coding 2009, Cirencester, UK, December 15–17, 2009. Lecture Notes in Computer Science, vol. 5921. Berlin, German: Springer; 2009. p. 278–300.

5. Bendlin R , Damgård I . Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems. In: Micciancio D , editor. Theory of Cryptography, Proceedings of the 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9–11, 2010. Lecture Notes in Computer Science, vol 5978. Berlin, German: Springer; 2010. p. 201–18.

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3