|Table of Contents|

Lattice-based signature scheme for constant-sized message in standard model


Research Field:
Publishing date:


Lattice-based signature scheme for constant-sized message in standard model
Wang Jiejie1Xu Chungen1Xu Lei1Zhang Xing2
1.School of Science;
2.School of Computer Science and Engineering,NUST,Nanjing 210094,China
lattices signature schemes sampleLeft algorithm small integer solution existentially unforgeable
In order to secure against quantum computing,based on the lattice theory,a new lattice-based signature scheme is presented here for the constant-sized message in the standard model by using sampleleft algorithm.The scheme is proved to be existentially unforgeable against statically chosen message attacks in the standard model under the small integer solution(SIS)assumption.Compared with other signature schemes,the proposed scheme has shorter public-key length and lower computational complexity,and it is more efficient than the others.


[1] Peter Shor.Algorithms for quantum computation:Discrete logarithms and factoring[A].IEEE Symposium on Foundations of Computer Science[C].Santa Fe,US:IEEE Computer Soceity Press,1994:124-134.
[2]You I,Hori Y,Sakurai K.Enhancing SVO logic for mobile IPV6 security protocols[J].Journal of Wireless Mobile Networks,Ubiquitous Computing,and Dependable Applications(JoWUA),2011,2(3):26-52.
[3]Micciancio D,Regev O.Post-quantum cryptography[M].Berlin,Germany:Springer Berlin Heidelberg,2009:147-191.
[4]Gentry C,Peikert C,Vaikuntanathan V.Trapdoors for hard lattices and new cryptographic constructions[J].Electronic Colloquium on Computational Complexity,2008,14:197-206.
[5]Cash D,Hofheinz D,Kiltz E,et al.Bonsai trees,or how to delegate a lattice basis[J].Journal of Cryptology,2012,25(4):601-639.
Wang Fenghe,Hu Yupu,Jia Yanyan.Lattice-based signature scheme in the standard model[J].Journal of Xidian University,2012,39(4):57-61.
[7]Agrawal S,Boneh D,Boyen X.Efficient lattice(H)IBE in the standard model[J].Advances in Cryptology-Eurocrypt 2010(The Series Lecture Notes in Computer Science),6110:553-572.
[8]Singh K,Pandu Rangan C,Banerjee A K.Security,privacy,and applied cryptography engineering[M].Berlin,Germany:Springer Berlin Heidelberg,2012:153-172.
[9]Singh K,Pandu Rangan C,Banerjee A K.Efficient lattice HIBE in the standard model with shorter public parameters[J].Information and Communication(Technology Lecture Notes in Computer Science),2014,8407:542-553.
Xu Chungen,Zhang Aohong,Han Mu,et al.Certificateless proxy signature scheme based on discrete logarithm problem[J].Journal of Nanjing University of Science and Technology,2010,34(6):733-737.

Liu Fenghua,Mi Junli,Ding Enjie.Intrusion-tolerant proxy blind signature scheme based on discrete logarithm[J].Journal of Nanjing University of Science and Technology,2015,39(1):34-38.

[12]Micciancio D,Regev O.Worst-case to average-case reductions based on Gaussian measures[J].SIAM Journal on Computing,2007,37(1):267-302.

[13]Alwen J,Peikert C.Generating shorter bases for hard random lattices[J].Theory of Computing Systems,2011,48(3):535-553.
[14]Boneh D,Boyen X.Short signatures without random oracles[J].Advances in Cryptology-Eurocrypt,2004,21(2):56-73.


Last Update: 2015-10-31