[1] |
SHAMIR A . Identity-based cryptosystems and signature schemes[A]. Advances in Cryptology[C]. Springer Berlin Heidelberg, 1985. 47-53.
|
[2] |
BONEH D , FRANKLIN M . Identity-based cryptosystems and signature schemes[A]. Advances in Cryptology CRYPTO 2001[C]. Springer Berlin Heidelberg, 2001. 213-229.
|
[3] |
WATERS B . Efficient identity-based encryption without random oracles[A]. Advances in Cryptology–EUROCRYPT 2005[C]. Springer Berlin Heidelberg, 2005. 114-127.
|
[4] |
PATERSON K G , SCHULDT J C N . Efficient identity-based signatures secure in the standard model[A]. Information Security and Privacy[C]. Springer Berlin Heidelberg, 2006. 207-222.
|
[5] |
SHOR P W . Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[J]. SIAM Journal on Computing, 1997,26(5): 1484-1509.
|
[6] |
AJTAI M . Generating hard instances of lattice problems[A]. Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing[C]. ACM, 1996. 99-108.
|
[7] |
REGEV O . On lattices,learning with errors,random linear codes,and cryptography[J]. Journal of the ACM (JACM), 2009,56(6): 34-.
|
[8] |
MICCIANCIO D , PEIKERT C . Trapdoors for lattices:simpler,tighter,faster,smaller[A]. Advances in Cryptology–EUROCRYPT 2012[C]. Springer Berlin Heidelberg, 2012. 700-718.
|
[9] |
GENTRY C , PEIKERT C , VAIKUNTANATHAN V . Trapdoors for hard lattices and new cryptographic constructions[A]. Proceedings of the 40th Annual ACM Symposium on Theory of Computing[C]. ACM, 2008. 197-206.
|
[10] |
BOYEN X . Lattice mixing and vanishing trapdoors:a framework for fully secure short signatures and more[A]. Public Key Cryptography–PKC 2010[C]. Springer Berlin Heidelberg, 2010. 499-517.
|
[11] |
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.
|
[12] |
AGRAWAL S , BONEH D , BOYEN X . Efficient Lattice (H) IBE in the Standard Model[M]. Advances in Cryptology–EUROCRYPT 2010. Springer Berlin Heidelberg, 2010: 553-572.
|
[13] |
BRAKERSKI Z , VAIKUNTANATHAN V . Efficient fully homomorphic encryption from (standard) LWE[A]. Foundations of Computer Science (FOCS),2011 IEEE 52nd Annual Symposium on[C]. IEEE, 2011. 97-106.
|
[14] |
BRAKERSKI Z , GENTRY C , VAIKUNTANATHAN V . (Leveled) Fully homomorphic encryption without bootstrapping[A]. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference[C]. ACM, 2012. 309-325.
|
[15] |
LEURENT Z , NGUYEN P . How risky is the random-oracle model[A]. Advances in Cryptology-CRYPTO 2009[C]. Springer Berlin Heidelberg, 2009. 445-464.
|
[16] |
Lyubashevsky V . Lattice signatures without trapdoors[A]. Advances in Cryptology EUROCRYPT 2012[C]. Springer Berlin Heidelberg, 2012. 738-755.
|
[17] |
DUCAS L , DURMUS A , LEPOINT T , et al. Lattice signatures and bimodal Gaussians[A]. Advances in Cryptology–CRYPTO 2013[C]. Springer Berlin Heidelberg, 2013. 40-56.
|
[18] |
RüCKERT M . Strongly unforgeable signatures and hierarchical identitybased signatures from lattices without random oracles[A]. Post-Quantum Cryptography[C]. Springer Berlin Heidelberg, 2010. 182-200.
|
[19] |
XIA F , YANG B , SUN W . An efficient identity-based signature from lattice in the random oracle model[J]. Journal of Computational Information Systems, 2011,7(11): 3963-3971.
|
[20] |
TIAN M , HUANG L . Efficient identity-based signature from lattices[A]. ICT Systems Security and Privacy Protection[C]. Springer Berlin Heidelberg, 2014. 321-329.
|
[21] |
TIAN M , HUANG L , YANG W . A new hierarchical identity-based signature scheme from lattices in the standard model[J]. IJ Network Security, 2012,14(6): 310-315.
|
[22] |
LIU Z , HU Y , ZHANG X , et al. Efficient and strongly unforgeable identity-based signature scheme from lattices in the standard model[J]. Security and Communication Networks, 2013,6(1): 69-77.
|
[23] |
MICCIANCIO D , GOLDWASSER S . Complexity of Lattice Problems:a Cryptographic Perspective[M]. Springer, 2002.
|
[24] |
MICCIANCIO D , REGEV O . Worst-case to average-case reductions based on Gaussian measures[J]. SIAM Journal on Computing, 2007,37(1): 267-302.
|
[25] |
ALWEN J , PEIKERT C . Generating shorter bases for hard random lattices[J]. Theory of Computing Systems, 2011,48(3): 535-553.
|