RLWE-based key-policy ABE scheme

Ze-dong SUN; Yue-fei ZHU; Chun-xiang GU; Yong-hui1 ZHENG

doi:10.11959/j.issn.1000-436x.2016258

您当前的位置：

首页 >

文章列表页 >

RLWE-based key-policy ABE scheme

Contents Papers | 更新时间：2024-06-05

- RLWE-based key-policy ABE scheme
- Journal on Communications Vol. 37, Issue Z1, Pages: 125-131(2016)
- 作者机构：
  
  1. 解放军信息工程大学，河南郑州 450001
  2. 数学工程与先进计算国家重点实验室，江苏无锡 214125
- 作者简介：
- 基金信息：
  
  Henan Provincial Science and Technology Innovation Fund for Outstanding Young(134100510002);Foundation and Research in Cutting-edge Technologies in the Project of Henan Province(142300410002);State Key Laboratory of Mathematical Engineering and Advanced Computing Open-End Fund
- DOI：10.11959/j.issn.1000-436x.2016258
  CLC： TP309.7
- Online First：2016-10，
  
  Published：25 October 2016
- 稿件说明：
移动端阅览
Ze-dong SUN, Yue-fei ZHU, Chun-xiang GU, et al. RLWE-based key-policy ABE scheme[J]. Journal on Communications, 2016, 37(Z1): 125-131.
DOI：

Ze-dong SUN, Yue-fei ZHU, Chun-xiang GU, et al. RLWE-based key-policy ABE scheme[J]. Journal on Communications, 2016, 37(Z1): 125-131. DOI： 10.11959/j.issn.1000-436x.2016258.

摘要

在Brakerski等提出的基于LWE问题的属性加密体制基础上，提出了一个基于RLWE问题的属性加密体制。相比基于LWE问题的属性加密体制，该体制效率更高、密钥尺寸更小。在RLWE的安全性假设下，该体制支持长度不受限制的属性和半适应性安全。最后设计了一个编译器，利用该编译器可以将满足要求的属性加密体制转化为基于属性的全同态加密体制。

Abstract

Based on the attribute-based encryption(ABE) scheme which was proposed by Brakerski and constructed on the LWE problem

a RLWE-based key-policy ABE scheme was presented.Efficiency and key size of this scheme over-takes old ones which are based on the LWE problem.Under the RLWE assumption

this scheme supports attributes of unbounded length and semi-adaptive security.Moreover

a compiler was constructed and could compile ABE scheme that meets its demand into an attribute-based fully homomorphic encryption (ABFHE) scheme.

关键词

Keywords

references

SAHAI A , WATERS B . Fuzzy identity-based encryption[C]// International Conference on Theory and Applications of Cryptographic Techniques . Springer-Verlag , 2005 : 457 - 473 .

GOYAL V , PANDEY O , SAHAI A , et al . Attribute-based encryption for fine-grained access control of encrypted data[C]//ACM Conference on Computer and Communications Security , CCS 2006 , Alexandria,VA,USA , 2006 : 89 - 98 .

AJTAI M . Generating hard instances of lattice problems (extended abstract)[C]//The 28th Annual ACM Symposium on Theory of Com-puting . ACM , 1996 : 99 - 108 .

AJTAI M , DWORK C . A public-key cryptosystem with worst-case/average-case equivalence[C]//STOC , ACM , 1997 : 184 - 193 .

REGEV O . On lattices,learning with errors,random linear codes,and cryptography [J ] . Journal of the ACM , 2005 , 56 ( 6 ): 84 - 93 .

GENTRY C , Luby C , VAIKUNTANATHAN V . Trapdoors for hard lattices and new cryptographic constructions[C]//40th ACM Symp . on Theory of Computing (STOC) , Victoria,British Columbia,Canada , 2008 : 197 - 206 .

BOYEN X . Attribute-based functional encryption on lattices[C]//TCC 2013 . LNCS 7785 , 2013 : 122 - 142 .

LYUBASHEVSKY V , PEIKERT C , REGEV O . On ideal lattices and learning with errors over rings [C]//Eurocrypt 2010 . LNCS 6110 , 2010 : 1 - 23 .

DAN B , GENTRY C , GORBUNOV S , et al . Fully key-homomorphic encryption,arithmetic circuit abe and compact garbled circuits[M]//Advances in Cryptology-EUROCRYPT 2014 . Springer Berlin Hei-delberg , 2014 : 533 - 556 .

BRAKERSKI Z , VAIKUNTANATHAN V . Circuit-ABE from LWE:unbounded attributes and semi-adaptive security [EB/OL ] . http://eprint.iacr.org/2016/118.pdf http://eprint.iacr.org/2016/118.pdf , 2016 . 7 . 15 .

GENTRY C , SAHAI A , WATERS B . Homomorphic encryption from learning with errors:conceptually-simpler,asymptotically-faster,at-tribute-based[M]//Advances in Cryptology-Crypto 2013 . Springer Berlin Heidelberg , 2013 : 75 - 92 .

SERGEY G , VINOD V , HOETECK W . Attribute-based encryption for circuits[C]//STOC . 2013 : 545 - 554 .

LYUBASHEVSKY V , PEIKERT C , REGEV O . A toolkit for ring-lwe cryptography[M]//Advances in Cryptology-Eurocrypt 2013 . Springer Berlin Heidelberg , 2013 : 35 - 54 .

MICCIANCIO D , PEIKERT C . Trapdoors for lattices:simpler,tighter,faster,smaller[M]// Advances in Cryptology-Eurocrypt 2012 . Springer Berlin Heidelberg , 2012 : 700 - 718 .

CASH D , HOFHEINZ D , KILTZ E , et al . Bonsai trees or how to dele-gate a lattice basis [J ] . Journal of Cryptology , 2012 , 25 ( 4 ): 523 - 552 .

Views

2562

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Linearly homomorphic aggregate signature secure in the standard model

Attribute-based proxy re-encryption scheme with multiple features

RLWE-based ciphertext-policy attribute proxy re-encryption

Attribute-based fully homomorphic encryption scheme over rings

Adaptively secure attribute-based encryption for traitor tracing

Related Author

YANG Xiaoyuan

WANG Jingjing

ZHOU Tanping

LI Ruifeng

HAN Yiliang

Liping ZOU

Ding YUAN

Zhiguang QIN

Related Institution

Key Laboratory of Counter-Terrorism Command & Information Engineering of Ministry of Education, Engineering University of PAP

Key Lab of the Armed Police Force for Network and Information Security

School of Cryptography and Engineering, Engineering University of PAP

Network and Data Security Key Laboratory of Sichuan Province,University of Electronic Science and Technology of China

School of Computer Science,Sichuan Normal University

AI问答

⁰