Attribute-based fully homomorphic encryption scheme over rings
Papers|更新时间:2024-06-05
|
Attribute-based fully homomorphic encryption scheme over rings
Journal on CommunicationsVol. 38, Issue 4, Pages: 55-63(2017)
作者机构:
1. 信息工程大学,河南 郑州 450002
2. 数学工程与先进计算国家重点实验室,江苏 无锡 214125
3. 中国人民解放军66136部队,北京 100043
作者简介:
基金信息:
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 Foundation
The fully homomorphic encryption has important applications in the area of data security and privacy security of cloud computing
but the size of secret keys and ciphertext in most of current homomorphic encryption schemes were too large
which restricted its practical.To improve these drawbacks
a recoding scheme and a attribute-based encryption scheme based on learning with errors problem over rings were provided
then a attribute-based fully homomorphic encryption was constructed.The new scheme overcame the above mentioned drawbacks
because it did't need public key certificate
meanwhile
it can achieve the fine-grained access control to the ciphertext.Compared with similar results
proposed method decreases the size of keys and ciphertext greatly.
关键词
Keywords
references
RIVEST R L , ADLEMAN L , DERTOUZOS M L . On data banks and privacy homomorphisms [J ] . Foundations of Secure Computation , 1978 , 4 ( 11 ): 169 - 180 .
DUK M V , GENTRY C , HALEVI S , et al . Fully homomorphic encryption over the integers [C ] // The 29th Annual Eurocrypt Conference . Riviera,French , 2010 : 24 - 43 .
SMART N P , VERCAUTEREN F . Fully homomorp-hic encryption with relatively small key and cipher-ext sizes [C ] // The 13th International Conference on Practive and Theory in Public Key Cryptography(PKC2010) . Paris,France , 2010 : 420 - 443 .
GENTRY C , HALEVI S . Implementing gentry's fully homomorphic encryption scheme [C ] // EUROCRYP-T,Lecture Notes in Computer Science . 2011 : 129 - 148 .
BRAKERSKI Z , VAIKUNTANATHAN V . Efficient fully homomorphic encryption from (standard) LWE [J ] . SIAM Journal on Computing , 2014 , 43 ( 2 ): 831 - 871 .
BRAKERSKI Z , VAIKUNTANATHAN V . Fully homomorphic encryption from ring-LWE and security for key dependent messages [M ] . Advances in Cryptology CRYPTO 2011 . Springer Berlin Heidelberg , 2011 : 505 - 524 .
REGEV O . On lattices,learning with errors,random linear codes,and cryptography [J ] . Journal of the ACM (JACM) , 2009 , 56 ( 6 ): 34 .
LYUBASHEVSKY V , PEIKERT C , REGEV O . On ideal lattices and learning with errors over rings [J ] . Journal of the ACM (JACM) , 2013 , 60 ( 6 ): 43 .
BRAKERSKI Z , Gentry C , VAIKUNTANATHAN V . (Leveled) fully homomorphic encryption without bootstrapping [C ] // The 3rd Innovations in Theoretical Computer Science Conference . ACM , 2012 : 309 - 325 .
SAHAI A , WATERS B . Fuzzy identity-based encryption [M ] . Advances in Cryptology–EUROCRYPT 2005 . Springer Berlin Heidelberg , 2005 : 457 - 473 .
GOYAL V , PANDEY O , SAHAI A , et al . Attribute-based encryption for fine-grained access control of encrypted data [C ] // Proceedings of the 13th ACM Conference on Computer and Communications Security . ACM , 2006 : 89 - 98 .
SHAMIR A , . Identity-based cryptosystems and signa-ture schemes [C ] // Advances in Cryptology . Springer Berlin Heidelberg , 1985 : 47 - 53 .
GORBUNOY S , VAIKUNTANATHAN V , WEE H . Attribute-based encryption for circuits [J ] . Journal of the ACM (JACM) , 2015 , 62 ( 6 ): 45 .
GENTRY C , SAHAI A , WATERS B . Homomorphic encryption from learning with errors:conceptually-simpler,asymptotically-faster,attribute-based [M ] . Advances in Cryptology–CRYPTO 2013 . Springer Berlin Heidelberg , 2013 : 75 - 92 .
LYUBASHEVSKY V , PEIKERT C , REGEV O . A toolkit for ring-LWE cryptography [M ] . Advances in Cryptology–EUROCRYPT 2013 . Springer Berlin Heidelberg , 2013 : 35 - 54 .
KANG Y J , GU C X , ZHENG Y H , et al . Identity-based fully homomorphism encryption from eigenvector [J ] . Journal of Software,doi:10.13328/j.cnki.jos.004991 .
GENTRY C , PEIKERT C , VAIKUNTANATHAN V . Trapdoors for hard lattices and new cryptographic constructions [C ] // The 40th Annual ACM Symposium on Theory of Computing . ACM , 2008 : 197 - 206 .