[1] |
MAMBO M , USUDA K , OKAMOTO K . Proxy signatures: delegation of the power to sign messages[J]. IEICE Transactions on Fundamen-tals, 1996, 79(9): 1338-1353.
|
[2] |
SHOR P W . Polynomial-time algorithm for prime factorization and discrete logarithm on a quantum computer[J]. SIAM Journal on Com-puting, 1997, 26(5): 1484-1509.
|
[3] |
YAO , YAN Q , LI Z J , GUO H . A novel nonlinear network coding signature scheme determined by the SIS problem[J]. International Journal of Security and its Applications, 2012, 6(2): 403-408.
|
[4] |
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.
|
[5] |
AGRAWAL S , BONEH D , BOYEN X . Efficient lattice (H)IBE in the standard model[A]. EUROCRYPT 2010, LNCS[C]. Riviera, France, 2010, 553-572.
|
[6] |
AGRAWAL S , BONEH D , BOYEN X . Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE[A]. CRYPTO 2010, LNCS[C]. CA, USA, 2010, 98-115.
|
[7] |
LYUBASHEVSKY V . Lattice signatures without trapdoors[A]. Eurocrypt 2012, LNCS[C]. Cambridge, UK, 2012, 738-755.
|
[8] |
JIANG Y L , KONG F Y , JU X L . Lattice-based Proxy signature[A]. CIS 2010[C]. Nanning, China, 2010, 382-385.
|
[9] |
夏峰, 杨波, 马莎 等. 基于格的代理签名方案[J]. 湖南大学学报(自然科学版), 2011,38(6):84-88. XIA F , YANG B , MA S , et al. Lattice-based proxy signature scheme [J]. Journal of Hunan University(Natural Sciences), 2011,38(6):84-88.
|
[10] |
WANG C X , QI M N . Lattice-based proxy signature scheme[J]. Jour-nal of Information and Computational Science, 2011, 12(8): 2451-2458.
|
[11] |
KIM K S , HONG D , JEONG I R . Identity-based proxy signature from lattices[J]. JJournal of Communications and Networks, 2013, 15(1): 1-7.
|
[12] |
BISWAS S , MISC J , MISC V . An identity-based authentication scheme for safety messages in wave-enabled vanets[J]. International Journal of Parallel, Emergent and Distributed Systems, 2012, 27(6): 541-546.
|
[13] |
SWAPNA G , REDDY P V , GOWRI T . Efficient identity-based multi-proxy multi-signcryption scheme using bilinear pairings over el-liptic curves[A]. ICACCI 2013[C]. Mysore, India, 2013, 418-423.
|
[14] |
MICHAEL S L , TERRENCE J S . Learning over complete representa-tions[J]. Neural Computation, 2000, 12(2): 337-365.
|
[15] |
MICCIANCIO D , SHA GOLDWASSER . Complexity of Lattice Problems: a Cryptographic Perspective[M]. Boston: Kluwer Academic Publishers, 2002: 1-220.
|
[16] |
MICCIANCIO D , REGEV O . Worst-case to average-case reductions based on Gaussian measures[A]. Proceedings of 45th Annual IEEE Symposium on Foundations of Computer Science[C] Rome, Italy, 2004. 372-381.
|
[17] |
CASH D , HOFHEINZ D , KILTZ E , et al. Bonsai trees, or how to delegate a lattice basis[A]. Advances in Cryptology- EUROCRYPT 2010[C]. Riviera, France, 2010, 523-552.
|
[18] |
MICCIANCIO D , PEIKERT C . Trapdoors for lattices: simpler, tighter, faster, smaller[A]. EUROCRYPT 2012[C]. Cambridge, UK, 2012, 700-718.
|
[19] |
RüCKERT M . Lattice-based blind signatures[EB/OL]. , 2010.
|
[20] |
BELLARE M , NEVEN G . Multi-signatures in the plain public-key model and a general forking lemma[A]. roceedings of ACM CCS 2006[C]. Alexandria, 2006, 390-399.
|