[1] |
RIVEST R , ADLEMAN L , DERTOUZOS M . On data banks and privacy homomorphisms[C]// IEEE 17nd Annual Symposium on Foundations of Computer Science (FOCS1978). 1978: 169-177.
|
[2] |
GENTRY C , . Fully homomorphic encryption using ideal lattices[C]// The 41rd ACM Symposium on Theory of Computing (STOC2009). 2009: 169-178.
|
[3] |
DUCAS L , MICCIANCIO D.FHEW . Bootstrapping homomorphic encryption in less than a second[C]// Advances in Cryptology EUROCRYPT 2016. 2015: 617-640.
|
[4] |
BRAKERSKI Z , PERLMAN R . Lattice-based fully dynamic multi-key FHE with short ciphertexts[C]// Advances in Cryptology CRYPTO 2016. 2016: 190-213.
|
[5] |
NUIDA K , KUROSAWA K . (Batch) Fully homomorphic encryption over integers for non-binary message spaces[C]// Advances in Cryptology EUROCRYPT 2015. 2015: 537-555.
|
[6] |
光焱, 祝跃飞, 费金龙 ,等. 利用容错学习问题构造基于身份的全同态加密体制[J]. 通信学报, 2014,35(2): 111-117.
|
|
GUANG Y , ZHU Y F , FEI J L ,et al. Identity-based fully homomorphic encryption from learning with error problem[J]. Journal on Communications, 2014,35(2): 111-117.
|
[7] |
康元基, 顾纯祥, 郑永辉 ,等. 利用特征向量构造基于身份的全同态加密体制[J]. 软件学报, 2016,27(6): 1487-1497.
|
|
KANG Y J , GU C X , ZHENG Y H ,et al. Identity-based fully homomorphic encryption from eigenvector[J]. Journal of Software, 2016,27(6): 1487-1497.
|
[8] |
GENTRY C , SAHAI A , WATERS B.Homomorphic encryption from learning with errors . Conceptually-simpler,asymptotically-faster,attribute-based[C]// Advances in Cryptology CRYPTO 2013. 2013: 75-92.
|
[9] |
CLEAR M , MCGOLDRICK C . Multi-identity and multi-key leveled FHE from learning with errors[C]// Advances in Cryptology CRYPTO 2015. 2015: 630-656.
|
[10] |
GENTRY C , PEIKERT C , VAIKUNTANATHAN V . Trapdoors for hard lattices and new cryptographic constructions[C]// The 40th ACM Symposium on Theory of Computing(STOC2008). 2008: 197-206.
|
[11] |
AJTAIM . Generating hard instances of the short basis problem[C]// Automata,Languages and Programming(ICALP1999). 1999: 1-9.
|
[12] |
AGRAWAL S , BONEHD , BOYEN X . Efficient lattice (H)IBE in the standard model[C]// Advances in Cryptology EUROCRYPT2010. 2010: 553-572.
|
[13] |
APON D , FAN X , LIU F H . Fully-secure lattice-based IBE as compact as PKE[R]. IACRePrint Cryptography Archive, 2016.
|
[14] |
YAMADA S , . Adaptively secure identity-based encryption from lattices with asymptotically shorter public parameters[C]// Advances in Cryptology EUROCRYPT 2016. 2016: 32-62.
|
[15] |
ALWEN J , PEIKERT C . Generating shorter bases for hard random lattices[C]// The 26th International Symposium on Theoretical Aspects of Computer Science. 2009: 535-553.
|
[16] |
MICCIANCIO D , PEIKERT C . Trapdoors for lattices,simpler,tighter,faster,smaller[C]// Advances in Cryptology EUROCRYPT 2012. 2012: 700-718.
|
[17] |
REGEV O . On lattices,learning with errors,random linear codes,and cryptography[J]. The Annual ACM Symposium on Theory of Computing, 2009,56(6): 84-93.
|
[18] |
AGRAWAL S , BOYEN X , VAIKUNTANATHAN V ,et al. Functional encryption for threshold functions(or fuzzy IBE) from lattices[C]// The 15th International Conference on Practice and Theory in Public Key Cryptography. 2012: 280-297.
|
[19] |
WANG F H , LIU Z H , WANG C X . Full secure identity-based encryption scheme with short public key size over lattices in the standard model[J]. The International Journal of Computer Mathematics, 2016,93(6): 854-863.
|
[20] |
DODIS Y , OSTROVSKY R , REYZIN L . Fuzzy extractors.How to generate strong keys from biometrics and other noisy data[J]. The Society for Industrial and Applied Mathematics (SIAM), 2008,38(1): 97-139.
|
[21] |
PEIKERT C , . An efficient and parallel gaussian sampler for lattices[C]// Advances in Cryptology CRYPTO 2010. 2010: 80-97.
|