[1] Blaze M, Bleumer G, Strauss M. Divertible protocols and atomic proxy cryptography[C]//International Conference on the Theory and Application of Cryptographic Techniques. Berlin: Springer-Verlag, 1998: 127-144.
[2] Ateniese G, Hohenberger S. Proxy Re-Signatures:New definitions, algorithms, and applications[C]//Proceedings of the ACM Conference on CCS. New York: ACM, 2005: 310-319.
[3] Shao Jun, Cao Zhenfu, Wang Licheng, et al. Proxy Re-signature Schemes without Random Oracles[C]//Proceedings of Indecrypt 2007, LNCS 4859. Heidelberg: Springer-Verlag, 2007: 197-209.
[4] Libert B, Vergnaud D. Multi-Use Unidirectional Proxy Re-Signatures[C]//Proceedings of the ACM Conference on CCS. New York: ACM, 2008: 511-520.
[5] Yang Piyi, Cao Zhenfu, Dong Xiaolei. Threshold Proxy Re-signature[J]. Journal of Systems Science & Complexity, 2011, 24(4): 816-824.
[6] Shao Jun, Wei Guiyi, Ling Yun, et al. Unidirectional Identity-based Proxy re-signature[C]//Proceedings of the IEEE International Conference on Communications. Piscataway: IEEE, 2011: 1-5.
[7] Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for Hard Lattices and New Cryptographic Constructions[C]//Proceedings of the Annual ACM Symposium on Theory of Computing. New York: ACM, 2008: 197-206.
[8] Lyubashevsky V. Lattice Signatures without Trapdoors[C]//Proceedings of Eurocrypt 2012, LNCS 7237. Heidelberg: Springer-Verlag, 2012: 738-755.
[9] Xagawa K. Cryptography with Lattices[D]. Tokyo: Tokyo Institute of Technology, 2010.
[10] Alwen J, Peiker C. Generating Shorter Bases for Hard Random Lattices[J]. Theory of Computing Systems, 2011, 48(3): 535-553.
[11] Micciancio D, Regev O. Worst-case to Average-case Reductions Based on Gaussian Measures[J]. SIAM Journal Computer, 2007, 37(1): 267-302. |