引用本文: |
-
陈辉焱,王庆楠,谭舜聪,姚云飞.格上可验证定时可链接环签名与应用[J].信息安全学报,已采用 [点击复制]
- Chen Huiyan,Wang Qingnan,Tan Shuncong,Yao Yunfei.Lattices-based Verifiable Timed Linkable Ring Signatures and Its Application[J].Journal of Cyber Security,Accept [点击复制]
|
|
摘要: |
可验证定时可链接环签名(VTLRS)允许签名人将签名锁定在预定时间T内,任何人在完成时间难度为T的顺序计算后可以从时间锁中提取出该签名,可验证性允许在不完成计算的情况下验证签名的有效性,可链接性允许同一签名者生成的不同签名能够被识别并关联起来,同时不泄露签名者身份. Raptor签名是第一个基于Falcon签名的高效可链接环签名方案,基于Raptor签名构造的VTLRS方案称为VTLRS-Raptor,该方案采用了具备批处理能力的时间锁谜题,克服了普通VTLRS签名可能遭受流氓谜题攻击的威胁,在方案的应用上,我们设计了一个电子投票协议VTLRS-RaptorEVoting,该方案建立了一种链上隐私泄露惩罚机制,用于保障合法投票人的权益. 最后,通过计算复杂性分析和仿真实验展示了VTLRS-Raptor的实际性能. |
关键词: 可验证定时可链接环签名 格 电子投票 时间锁谜题 零知识证明 |
DOI: |
投稿时间:2024-09-18修订日期:2025-03-17 |
基金项目:中央高校基本科研业务费资金 |
|
Lattices-based Verifiable Timed Linkable Ring Signatures and Its Application |
Chen Huiyan1, Wang Qingnan1, Tan Shuncong1, Yao Yunfei2
|
(1.Beijing Electronic Science and Technology Institute;2.Beijing University of Posts and Telecommunications) |
Abstract: |
Verifiable Timed Linkable Ring Signatures (VTLRS) enable a signer to lock a signature within a predetermined time T. Anyone can extract the signature from the time lock after completing a sequential computation of time difficulty T. Ver-ifiability allows for the validation of the signature's authenticity without completing the computation, while linkability permits different signatures generated by the same signer to be identified and associated without revealing the signer's identity. Raptor signatures are the first efficient linkable ring signature scheme based on Falcon signatures. The VTLRS scheme constructed based on Raptor signatures is called VTLRS-Raptor. This scheme employs a time-lock puzzle with batch processing capabilities, overcoming the threat of rogue puzzle attacks that regular VTLRS signatures might face. In terms of application, VTLRS-RaptorEVoting, an electronic voting protocol, was designed, which establishes an on-chain privacy leakage penalty mechanism to protect the rights of legitimate voters. The practical performance of VTLRS-Raptor is demonstrated through computational complexity analysis and simulation experiments. |
Key words: verifiable timed linkable ring signatures lattice electronic voting timelock puzzles zero-knowledge proofs |