参考文献
[1]Ducas L,Lyubashevsky V,Prest T.Efficient Identity-based Encryption over NTRU Lattices[C]//Proceedings of the 20th International Conference on the Theory and Application of Cryptology and Information Security.Berlin,Germany:Springer,2014:22-41.
[2]Agrawal S,Boneh D,Boyen X.Efficient Lattice(H)IBE in the Standard Model[C]//Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques.Berlin,Germany:Springer,2010:553-572.
[3]Lyubashevsky V,Prest T.Quadratic Time,Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices[C]//Proceedings of the 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques.Berlin,Germany:Springer,2015:789-815.
[4]Peikert C.Public-key Cryptosystems from the Worst-case Shortest Vector Problem:Extended Abstract[C]//Proceedings of the 41st Annual ACM Symposium on Theory of Computing.New York,USA:ACM Press,2009:333-342.
[5]Ducas L,Durmus A,Lepoint T,et al.Lattice Signatures and Bimodal Gaussians[C]//Proceedings of the 33rd Annual Cryptology Conference on Lattice Signatures and Bimodal Gaussians.Berlin,Germany:Springer,2015:789-815.
[6]Hoffstein J,Pipher J,Silverman J H.NTRU:A Ring-based Public Key Cryptosystem[C]//Proceedings of the 3rd International Symposiun on Algorithmic Number Theory.Berlin,Germany:Springer,1998:267-288.
[7]Hoffstein J,Pipher J,Silverman J H.NSS:An NTRU Lattice-based Signature Scheme[C]//Proceedings of International Conference on the Theory and Application of Cryptographic Techniques.Berlin,Germany:Springer,2001:211-228.
[8]Lyubashevsky V,Peikert C,Regev O.On Ideal Lattices and Learning with Errors over Rings[J].Journal of the ACM,2013,60(6):1-23.
[9]Shamir A.Identity-based Cryptosystems and Signature Schemes[C]//Proceedings of CRYPTO’84.Berlin,Germany:Springer,1984:47-53.
[10]Boneh D,Franklin M K.Identity-based Encryption from the Weil Pairing[J].SIAM Journal on Computing,2003,32(3):213-229.
[11]Boneh D,Boyen X.Efficient Selective-id Secure Identity-based Encryption Without Random Oracles[C]//Pro-ceedings of International Conference on the Theory and Applications of Cryptographic Techniques.Berlin,Germany:Springer,2004:223-238.
[12]Waters B.Efficient Identity-based Encryption Without Random Oracles[C]//Proceedings of the 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques.Berlin,Germany:Springer,2005:114-127.
[13]Gentry C.Practical Identity-based Encryption Without Random Oracles[C]//Proceedings of the 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques.Berlin,Germany:Springer,2006:445-464.
[14]钱海峰,李祥学,郁昱.基于广义切比雪夫多项式的身份基加密体制安全性分析[J].中国通信,2012,9(1):58-63.
[15]马融,曹珍富.一个高效安全的身份基加密方案[J].上海交通大学学报,2010,44(3):389-392.
[16]焦金平,刘国艳.机构可问责的可追踪属性基加密方案[J].计算机工程,2015,41(7):163-170.
[17]Gentry C,Peikert C,Vaikuntanathan V.Trapdoors for Hard Lattices and New Cryptographic Constructions[C]//Proceedings of the 40th Annual ACM Symposium on Theory of Computing.New York,USA:ACM Press,2008:197-206.
[18]Cash D,Hofheinz D,Kiltz E,et al.Bonsai Trees,or How to Delegate a Lattice Basis[C]//Proceedings of the 29th Annual International Conference on Theory and Appli-cations of Cryptographic Techniques.New York,USA:ACM Press,2010:523-552.
[19]Cohen H.A Course in Computational Algebraic Number Theory[M].Berlin,Germany:Springer,1995.
[20]Babai L.On Lovász Lattice Reduction and the Nearest Lattice Point Problem[C]//Proceedings of the 2nd Symposium of Theoretical Aspects of Computer Science.New York,USA:ACM Press,1985:13-20.
[21]Stehlé D,Steinfeld R.Making Ntruencrypt and Ntrusign as Secure as Standard Worst-case Problems over Ideal Lattices[M].Berlin,Germany:Springer,2013.
编辑顾逸斐 |