Efficient Certificateless Signature Scheme on NTRU Lattice |
Xie, Jia
(School of Telecommunications Engineering, Xidian University)
Hu, Yupu (School of Telecommunications Engineering, Xidian University) Gao, Juntao (School of Telecommunications Engineering, Xidian University) Gao, Wen (School of Telecommunications Engineering, Xidian University) Jiang, Mingming (School of Computer Science and Technology, Huaibei Normal University) |
1 |
O. Regev, “Lattice-based cryptography,” in |
2 |
C. Gentry, C. Peikert and V. Vaikuntanathan, “Trapdoors for Hard Lattices and New Cryptographic Constructions,” in |
3 |
J. Alwen and C. Peiker, “Generating shorter bases for hard random lattices,” |
4 |
D. Micciancio and C. Peikert, “Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller,” in |
5 |
T. Laarhoven, M. Mosca and J. van de Pol, “Finding shortest lattice vectors faster using quantum search,” |
6 |
D. Cash, D. Hofheinz, E. Kiltz, et al, “Bonsai trees, or how to delegate a lattice basis,” in |
7 |
S. Agrawal, D. Boneh and X. Boyen, “Efficient lattice (H)IBE in the standard model,” in |
8 |
S. Agrawal, D. Boneh and X. Boyen, “Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE,” in |
9 |
D. Stehlé and R. Steinfeld, “Making NTRU as secure as worst-case problems over ideal lattices,” in |
10 |
L. Ducas, V. Lyubashevsky and T. Prest, “Efficient Identity-Based Encryption over NTRU Lattices,” in |
11 |
C. Gentry, “Fully homomorphic encryption using ideal lattices,” in |
12 |
C. Gentry, “Toward basing fully homomorphic encryption on worst-case hardness,” in |
13 |
X. Huang, W. Susilo, Y. Mu and F. Zhang, “On the security of certificateless signature schemes from Asiacrypt 2003,” in |
14 |
Z. Brakerski and V. Vaikuntanathan, “Efficient fully homomorphic encryption from (standard) LWE,” in |
15 |
X. Boyen, “Lattice mixing and vanishing trapdoors: a framework for fully secure short signature and more,” in |
16 |
A. Langlois, S. Ling, K. Nguyen and H. X. Wang, “Lattice-based group signature scheme with verifier-local revocation,” in |
17 |
V. Lyubashevsky, “Lattice signatures without trapdoors,” in |
18 |
L. Ducas, A. Durmus, T. Lepoint and V. Lyubashevsky, “Lattice signatures and bimodal Gaussians,” in |
19 |
F. Laguillaumie, A. Langlois, B. Libert and D. Stehlé, “Lattice-Based Group Signatures with Logarithmic Signature Size,” in |
20 |
P. Q. Nguyen, J. Zhang, Z. F. Zhang, “Simpler Efficient Group Signatures from Lattices,” in |
21 |
P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” |
22 |
C. Gentry, C. Peikert, V. Vaikuntanathan, “Trapdoors for hard lattices and new cryptographic constructions,” in |
23 |
V. Lyubashevsky, “Lattice signatures without trapdoors,” in |
24 |
D. Micciancio and P. Voulgaris, “A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations,” in |
25 |
D. Stehlé and R. Steinfeld, “Making NTRUEncrypt and NTRUSign as Secure as Standard Worst-Case Problems over ideal lattices,” |
26 |
A. K. Lenstra, H. W. Lenstra, and L. Lovâsz, “Factoring polynomials with rational coefficients,” |
27 |
C. P. Schnorr, “A hierarchy of polynomial time lattice basis reduction algorithms,” |
28 |
M. Bellare and G. Neven, “Multi-signatures in the plain public-key model and a general forking lemma,” in |
29 |
V. Lyubashevsky and D. Wichs, “Simple lattice trapdoor sampling from a broad class of distributions,” in |
30 |
Z. Brakerski and V. Vaikuntanathan, “Fully homomorphic encryption from ring-LWE and security for key dependent messages,” in |
31 |
X. Huang, Y. Mu, W. Susilo, D. S. Wong and W. Wu, “Certificateless signature revisited,” in |
32 |
M. M. Tian and L. S. Huang, “Certificateless and certificate-based signatures from lattices,” |
33 |
D. Boneh, Ӧ. Dagdelen, M. Fischlin, A. Lehmann, C. Schaffner, and M. Zhandry, “Random oracles in a quantum world,” in |
34 |
D. Arroyo, J. Diaz and F. B. Rodriguez, “Non-conventional Digital Signatures and Their Implementations-A Review,” in |
35 |
P. Zhou, |
36 |
A. Shamir, “Identity-based cryptosystems and signature schemes,” in |
37 |
S. S. Al-Riyami and K. G. Paterson, “Certificateless public key cryptography,” in |
38 |
Z. Zhang, D. S. Wong, J. Xu and D. Feng, “Certificateless public-key signature: security model and efficient construction,” in Proc |
39 |
B. G. Kang, J. H. Park and S. G. Hahn, “A certificate-based signature scheme,” in |
40 |
J. K. Liu, M. H. Au and W. Susilo, “Self-generated-certificate public key cryptography and certificateless signature/encryption scheme in the standard model,” in |
41 |
J. Li, X. Huang, Y. Mu, W. Susilo and Q. Wu, “Certificatebased signature: security model and efficient construction,” in |
42 |
J. K. Liu, J. Baek, W. Susilo and J. Zhou, “Certificate-based signature schemes without pairings or random oracles,” in |
43 |
M. Krenn, M. Huber, R. Fickler, R. Lapkiewicz, S. Ramelow and A. Zeilinger, “Generation and confirmation of a (100×100) dimensional entangled quantum system,” in |
44 |
D. J. Bernstein, “Introduction to Post-Quantum Cryptography,” D. J. Bernstein, J. Buchmann, E. Dahmen (Eds), |