| [1] Even S, Goldreich O, Macali S. On-line/off-line digital signatures[C]//Proceedings of Advances in Cryptology: Crypto'89. California, USA: Springer-Verlag, 1990: 263-275.[2] Crutchfield C, Molnar D, Turner D. Generic on-line/off-line threshold signatures[C]//Proceedings of Public Key Cryptography. New York, USA: Springer-Verlag, 2006: 58-74.[3] Shamir A, Tauman Y. Improved online/offline signature schemes[C]//Proceedings of Advances in Cryptology. Santa Barbara, CA, USA: Springer-Verlag, 2001: 355-367.[4] Xu Shidi, Mu Yi, Susilo W, et al. Online/offline signatures and multisignatures for AVOD and DSR routing security[C]//ACISP'06. Melbourne, Australia: Springer-Verlag, 2006: 99-110.[5] Joseph K L, Baek J, Zhou Jianying, et al. Efficient online/offline identity-based signature for wireless sensor network[J]. International Journal of Information Security, 2010, 9(4): 287-296.[6] Yao A C-C, Zhao Yunlei. Online/offline signatures for low-power devices[J]. IEEE Transactions on Information Forensics and Security, 2013, 8(2): 283-294.[7] Hohenberger S, Waters B. Online/offline attribute-based encryption[C]. PKC'14, Melbourne, Australia: Springer-Verlag, 2014: 293-310.[8] Gentry C, Peikert C, Vaikuntanathan V. How to use a short basis: trapdoors for hard lattices and new cryptographic constructions[C]//STOC 2008. Victoria, British Columbia, Canada: Association for Computing Machinery, May 17-20, 2008: 197-206.[9] 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.[10] Agrawal S, Boneh D, Boyen X. Lattice basis delegation in fixed dimension and shorter ciphertext hierarchical IBE[C]//Crypto 2010. Santa Barbara, CA, USA: Springer-Verlag, 2010: 98-115.[11] Krawczyk H, Rabin T. Chameleon signatures[C]// NDSS'00. San Diego, CA, USA: The Internet Society, 2000: 143-154.[12] Chen Xiaofeng, Zhang Fangguo, Susilo W, et al. Identity-based chameleon hashing and signatures without key exposure[J]. Information Sciences, 2014, 265(5): 198-210.[13] Rückert M. Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles[C]// PQCrypto 2010. Darmstadt, Germany: Lecture Notes in Computer Science, Springer-Verlag, 2010, 6061: 182-200.[14] Bellare M, Neven G. Multi-signatures in the plain public-key model and a general forking lemma[C]//CCS 2006. October 30-November 3, Alexandria, VA, USA: Association for Computing Machinery, 2006: 390-399.[15] Xagawa K. Cryptography with lattices[EB/OL]. [2010-02-15]. http://xagawa.net/pdf/2010Thesis.pdf. |
