[1] |
GOLDWASSER S , MICALI S , RIVEST R . A digital signature scheme secure against adaptive chosen-message attacks[J]. SIAM Journal on computing, 1988,17(2): 281-308.
|
[2] |
KHATI L , VERGNAUD D . Analysis and improvement of an authentication scheme in incremental cryptography[C]// International Conference on Selected Areas in Cryptography. Berlin:Springer, 2018: 50-70.
|
[3] |
BELLARE M , GOLDREICH O , GOLDWASSER S . Incremental cryptography:the case of hashing and signing[C]// Annual International Cryptology Conference. Berlin:Springer, 1994: 216-233.
|
[4] |
邵奇峰, 金澈清, 张召 ,等. 区块链技术:架构及进展[J]. 计算机学报, 2018,41(5): 969-988.
|
|
SHAO Q F , JIN C Q , ZHANG Z ,et al. Blockchain:architecture and research progress[J]. Chinese Journal of Computers, 2018,41(5): 969-988.
|
[5] |
ATIGHEHCHI K , . On the incremental digital signatures[C]// IEEE International Conference on Trust,Security and Privacy in Computing and Communications/IEEE International Conference on Big Data Science and Engineering (TrustCom/BigDataSE). Piscataway:IEEE Press, 2018: 1605-1609.
|
[6] |
CHEN J , TIAN M , GAO C ,et al. A lattice-based incremental signature scheme[J]. IEEE Access, 2019,7: 21201-21210.
|
[7] |
SHAMIR A , . Identity-based cryptosystems and signature schemes[C]// Workshop on the Theory and Application of Cryptographic Techniques. Berlin:Springer, 1984: 47-53.
|
[8] |
AJTAI M , . Generating hard instances of lattice problems[C]// ACM Symposium on Theory of Computing. New York:ACM Press, 1996: 99-108.
|
[9] |
MICCIANCIO D , REGEV O . Worst-case to average-case reductions based on Gaussian measures[J]. SIAM Journal on Computing, 2007,37(1): 267-302.
|
[10] |
REGEV O , . Lattice-based cryptography[C]// Annual International Cryptology Conference. Berlin:Springer, 2006: 131-141.
|
[11] |
TIAN M , HUANG L , WEI Y . A new hierarchical identity-based signature scheme from lattices in the standard model[J]. International Journal of Network Security, 2012,14(6): 310-315.
|
[12] |
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.
|
[13] |
TIAN M , HUANG L . Efficient identity-based signature from lattices[C]// IFIP International Information Security Conference. Berlin:Springer, 2014: 321-329.
|
[14] |
TIAN M , HUANG L . Identity-based signatures from lattices:simpler,faster,shorter[J]. Fundamenta Informaticae, 2016,145(2): 171-187.
|
[15] |
YANG Z , DUONG D ,et al. Hierarchical identity-based signature in polynomial rings[J]. The Computer Journal, 2020,63(10): 1490-1499.
|
[16] |
XIE J , HU Y , GAO J ,et al. Efficient identity-based signature over NTRU lattice[J]. Frontiers of Information Technology & Electronic Engineering, 2016,17(2): 135-142.
|
[17] |
ZHAO G , TIAN M . A simpler construction of identity-based ring signatures from lattices[C]// International Conference on Provable Security. Berlin:Springer, 2018: 277-291.
|
[18] |
孙意如, 梁向前, 商玉芳 . 理想格上基于身份的环签名方案[J]. 计算机应用, 2016,36(7): 1861-1865.
|
|
SUN Y R , LIANG X Q , SHANG Y F . Identity based ring signature scheme in ideal lattice[J]. Journal of Computer Applications, 2016,36(7): 1861-1865.
|
[19] |
CANETTI R , GOLDREICH O , HALEVI S . The random oracle methodology,revisited[J]. Journal of the ACM, 2004,51(4): 557-594.
|
[20] |
ZHANG J , CHEN Y , ZHANG Z . Programmable hash functions from lattices:short signatures and IBEs with small key sizes[C]// Annual International Cryptology Conference. Berlin:Springer, 2016: 303-332.
|
[21] |
MICCIANCIO D , PEIKERT C . Trapdoors for lattices:simpler,tighter,faster,smaller[C]// Annual International Conference on the Theory and Applications of Cryptographic Techniques. Berlin:Springer, 2012: 700-718.
|
[22] |
BOYEN X , . Lattice mixing and vanishing trapdoors:a framework for fully secure short signatures and more[C]// International Workshop on Public Key Cryptography. Berlin:Springer, 2010: 499-517.
|
[23] |
CHOON J , CHEON J . An identity-based signature from gap Diffie-Hellman groups[C]// International Workshop on Public Key Cryptography. Berlin:Springer, 2003: 18-30.
|
[24] |
REGEV O , . On lattices,learning with errors,random linear codes,and cryptography[C]// ACM Symposium on Theory of Computing. New York:ACM Press, 2005: 84-93.
|
[25] |
GENTRY C , PEIKERT C , VAIKUNTANATHAN V . Trapdoors for hard lattices and new cryptographic constructions[C]// ACM Symposium on Theory of Computing. New York:ACM Press, 2008: 197-206.
|
[26] |
HOFHEINZ D , KILTZ E . Programmable hash functions and their applications[C]// Annual International Cryptology Conference. Berlin:Springer, 2008: 21-38.
|
[27] |
BONEH D , FREEMAN D . Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures[C]// International Workshop on Public Key Cryptography. Berlin:Springer, 2011: 1-16.
|