[1] Shor P W. Polynomial-time Algorithm for Prime Factorizeation and Discrete Logarithm on a Quantum Computer [J]. SIAM Journal on Computing, 1997, 26(5): 1484-1509.
[2] Lyubashevsky V, Micciancio D. Asymptotically Efficient Lattice-Based Digital Signature[C]//Proc of TCC2008: LNCS 4948. Berlin: Springer, 2008: 37-54.
[3] Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for Hard Lattices and New Cryptographic Constructions[C]//Proc of STOC'2008: ACM. Victoria: STOC, 2008: 197-206.
[4] Cash D, Hofheinz D, Kiltz E, et al. Bonsai Trees, or How to Delegate a Lattice Basis[C]//Proc of Eurocrypt 2010: LNCS 6110. Berlin: Springer, 2010: 523-552.
[5] Rückert M. Strongly Ungorgeable Signatures and Hierarchical Identity-based Signatures from Lattices without Random Oracles[C]//Proc of Post-Quantum Cryptography 2010: LNCS 6061. Darmstadt: Springer, 2010: 182-200.
[6] Gordon S D, Katz J, Vaikuntanathan V. A Group Signature Scheme from Lattice Assumptions[C]//Proc of ASIACRYPT 2010: LNCS 6477. Berlin: Springer, 2010: 395-412.
[7] Rückert M. Lattice-based Blind Signatures [C]//Proc of Asiacrypt'10: LNCS 6477. Berlin: Springer, 2010: 413-430.
[8] Boyen X. Lattice Mixing and Vanishing Trapdoors: a Framework for Fully Secure Short Signatures and More[C]// Proc of PKC 2010: LNCS 6056. Berlin: Springer, 2010: 499-517.
[9] Agrawal S, Boneh D, Boyen X. Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE[C]//Proc of CRYPTO'10: LNCS 6223. Berlin: Springer, 2010: 98-115.
[10] Alwen J, Peikert C. Generating Shorter Bases for Hard Random Lattices[C]//Proc of STACS: 09001. Freiburg: Springer, 2009: 75-86.
[11] Micciancio D, Regev O. Worst-case to Average-case Reductions Based on Gaussian Measures [J]. SIAM J Comput, 2007, 37(1): 267-302.
[12] 张乐友, 胡予濮, 刘振华. 标准模型下基于身份的可证安全门限签名方案[J]. 西安电子科技大学学报, 2008, 35(1): 81-86.
Zhang Leyou, Hu Yupu, Liu Zhenhua. Provable Secure ID-based Threshold Signature Scheme without Random Oracles [J]. Journal of Xidian University, 2008, 35(1): 81-86. |