计算机科学
散列函数
格子(音乐)
签名(拓扑)
理论计算机科学
弦(物理)
算法
数学
计算机安全
物理
几何学
声学
数学物理
作者
Pingyuan Zhang,Haining Yang,Zhiting Liang,Yanhua Zhang,Hao Wang,Qiuliang Xu
标识
DOI:10.1016/j.tcs.2023.113942
摘要
Lattice-based online/offline signature scheme enjoys the advantage of resisting quantum feature besides the short online response time. The existing Fiat-Shamir with aborts paradigm candidates do not have perfect online/offline property, and the hash-sign-switch ones usually increase the signature sizes. In this paper we mainly address its online time and the length of signature issues, and propose a new and efficient paradigm of its construction for lattice assumptions over rings. In this paradigm the signer tries to sign for a random string and the message respectively. Specifically, we first discuss the generic construction of Fiat-Shamir lattice-based signatures. Then for a large class of lattice-based relations over rings, we propose an improved framework designed for low-power devices. This new framework allows the signer to extract a part of the signature only for a random string chosen in offline time, and thus can obtain the whole signature by less online time. In addition, the resulting scheme slightly reduces the signature size compared to the Fiat-Shamir counterparts. The performance analysis shows that our construction is efficient.
科研通智能强力驱动
Strongly Powered by AbleSci AI