
- Home
高级 检索
Chinese
English



1.西安理工大学计算机科学与工程学院,陕西 西安 710048
2.河南理工大学软件学院,河南 焦作 454003
Received:16 June 2026,
Revised:2026-08-20,
Accepted:21 August 2026,
移动端阅览
Ye Qing, Shao Zhenjie, Tang Yongli, et al. An efficient aggregate ring signature scheme based on homomorphic vector commitment and compressed Σ protocol[J/OL]. Journal on Communications, 2026.
Ye Qing, Shao Zhenjie, Tang Yongli, et al. An efficient aggregate ring signature scheme based on homomorphic vector commitment and compressed Σ protocol[J/OL]. Journal on Communications, 2026. DOI: 10.11959/j.issn.1000-436x.TXXB260353.
针对现有环签名方案在大规模环成员和多签名验证场景下存在通信成本大、验证开销高等问题,设计了一种基于同态向量承诺和压缩
<math display="block" id="M2"><mstyle mathvariant="normal" mathsize="normal"><mo>∑</mo></mstyle></math>
协议的新型聚合环签名方案。该方案首先基于BLS签名、
<math display="block" id="M3"><mrow><mstyle mathvariant="normal" mathsize="normal"><mo stretchy="false">(</mo></mstyle><msub><mstyle mathvariant="normal" mathsize="normal"><mi>ℤ</mi></mstyle><mstyle mathvariant="italic" mathsize="normal"><mi>q</mi></mstyle></msub><mstyle mathvariant="normal" mathsize="normal"><mo>
</mo></mstyle><msub><mi mathvariant="normal">𝔾</mi><mn>1</mn></msub><mstyle mathvariant="normal" mathsize="normal"><mo stretchy="false">)</mo></mstyle></mrow></math>
向量承诺、面向
<math display="block" id="M4"><mrow><mstyle mathvariant="normal" mathsize="normal"><mo stretchy="false">(</mo></mstyle><msub><mstyle mathvariant="normal" mathsize="normal"><mi>ℤ</mi></mstyle><mstyle mathvariant="italic" mathsize="normal"><mi>q</mi></mstyle></msub><mstyle mathvariant="normal" mathsize="normal"><mo>
</mo></mstyle><msub><mi mathvariant="normal">𝔾</mi><mn>1</mn></msub><mstyle mathvariant="normal" mathsize="normal"><mo stretchy="false">)</mo></mstyle></mrow></math>
向量承诺的压缩
<math display="block" id="M5"><mstyle mathvariant="normal" mathsize="normal"><mo>∑</mo></mstyle></math>
协议生成单个环签名,进一步基于类ElGamal向量承诺及面向类ElGamal向量的
<math display="block" id="M6"><mstyle mathvariant="normal" mathsize="normal"><mo>∑</mo></mstyle></math>
协议将
<math display="block" id="M7"><mstyle mathvariant="italic" mathsize="normal"><mi>k</mi></mstyle></math>
个单环签名聚合为一个环签名进行传输与验证。理论分析与实验验证表明,该方案无需可信第三方,满足匿名性与不可伪造性等安全特性,且
<math display="block" id="M8"><mstyle mathvariant="italic" mathsize="normal"><mi>k</mi></mstyle></math>
个单签名的总签名长度、验证时间均为
<math display="block" id="M9"><mrow><mstyle mathvariant="italic" mathsize="normal"><mi>O</mi></mstyle><mstyle mathvariant="normal" mathsize="normal"><mo stretchy="false">(</mo></mstyle><mstyle mathvariant="italic" mathsize="normal"><mi>k</mi></mstyle><mstyle mathvariant="normal" mathsize="normal"><mo stretchy="false">)</mo></mstyle></mrow></math>
,与环大小无关,效率显著优于同类方案。
Aiming at the problems of high communication cost and large verification overhead in existing ring signature schemes under scenarios of large-scale ring members and multi-signature verification
this paper designs a novel aggregate ring signature scheme based on homomorphic vector commitments and compressed
<math display="block" id="M10"><mstyle mathvariant="normal" mathsize="normal"><mo>∑</mo></mstyle></math>
protocols. The scheme first generates individual ring signatures based on BLS signatures
<math display="block" id="M11"><mrow><mstyle mathvariant="normal" mathsize="normal"><mo stretchy="false">(</mo></mstyle><msub><mstyle mathvariant="normal" mathsize="normal"><mi>ℤ</mi></mstyle><mstyle mathvariant="italic" mathsize="normal"><mi>q</mi></mstyle></msub><mstyle mathvariant="normal" mathsize="normal"><mo>
</mo></mstyle><msub><mi mathvariant="normal">𝔾</mi><mn>1</mn></msub><mstyle mathvariant="normal" mathsize="normal"><mo stretchy="false">)</mo></mstyle></mrow></math>
vector commitments
and the compressed
<math display="block" id="M12"><mstyle mathvariant="normal" mathsize="normal"><mo>∑</mo></mstyle></math>
protocol for
<math display="block" id="M13"><mrow><mstyle mathvariant="normal" mathsize="normal"><mo stretchy="false">(</mo></mstyle><msub><mstyle mathvariant="normal" mathsize="normal"><mi>ℤ</mi></mstyle><mstyle mathvariant="italic" mathsize="normal"><mi>q</mi></mstyle></msub><mstyle mathvariant="normal" mathsize="normal"><mo>
</mo></mstyle><msub><mi mathvariant="normal">𝔾</mi><mn>1</mn></msub><mstyle mathvariant="normal" mathsize="normal"><mo stretchy="false">)</mo></mstyle></mrow></math>
vector commitments. Furthermore
based on ElGamal-like vector commitments and the
<math display="block" id="M14"><mstyle mathvariant="normal" mathsize="normal"><mo>∑</mo></mstyle></math>
protocol for ElGamal-like vectors
it aggregates
<math display="block" id="M15"><mstyle mathvariant="italic" mathsize="normal"><mi>k</mi></mstyle></math>
individual ring signatures into one aggregated ring signature for transmission and verification. Theoretical analysis and experimental verification demonstrate that the proposed scheme does not require a trusted third party and satisfies security properties such as anonymity and unforgeability. Moreover
the total signature length and verification time for
<math display="block" id="M16"><mstyle mathvariant="italic" mathsize="normal"><mi>k</mi></mstyle></math>
individual signatures are both
<math display="block" id="M17"><mrow><mstyle mathvariant="italic" mathsize="normal"><mi>O</mi></mstyle><mstyle mathvariant="normal" mathsize="normal"><mo stretchy="false">(</mo></mstyle><mstyle mathvariant="italic" mathsize="normal"><mi>k</mi></mstyle><mstyle mathvariant="normal" mathsize="normal"><mo stretchy="false">)</mo></mstyle></mrow></math>
independent of the ring size
and the efficiency is significantly superior to similar schemes.
Rivest R L , Shamir A , Tauman Y . How to leak a secret [C ] // International Conference on the Theory and Application of Cryptology and Information Security . Berlin, Heidelberg : Springer Berlin Heidelberg , 2001 : 552 - 565 .
Shen N . Ring signature confidential transactions for monero [J ] . Tech. rep. Cryptology ePrint Archive , Report 2015 / 1098 , 2015 .
Qin M J , Zhao Y L , Ma Z J . Practical constant-size ring signature [J ] . Journal of Computer Science and Technology , 2018 , 33 ( 3 ): 533 - 541 .
Backes M , Döttling N , Hanzlik L , Kluczniak K , Schneider J . Ring signatures: logarithmic-size, no setup—from standard assumptions [C ] // Advances in Cryptology—Eurocrypt 2019 . Cham : Springer International Publishing , 2019 : 281 - 304 .
Boneh D , Gentry C , Lynn B , et al . Aggregate and verifiably encrypted signatures from bilinear maps [C ] // International Conference on the Theory and Applications of Cryptographic Techniques . Berlin, Heidelberg : Springer Berlin Heidelberg , 2003 : 416 - 432 .
Tong X , Zhou J , Cao Z , et al . A ring signature with aggregation for ensuring privacy in blockchain transactions [J ] . IEEE Internet of Things Journal , 2025 , 12 ( 12 ): 21001 - 21015 .
Attema T , Cramer R , Rambaud M . Compressed Σ-protocols for bilinear group arithmetic circuits and application to logarithmic transparent threshold signatures [C ] // International Conference on the Theory and Application of Cryptology and Information Security . Cham : Springer International Publishing , 2021 : 526 - 556 .
Groth J , Kohlweiss M . One-out-of-many proofs: Or how to leak a secret and spend a coin [J ] . Annual International Conference on the Theory and Applications of Cryptographic Techniques , 2015 : 253 - 280 .
Malavolta G , Schröder D . Efficient ring signatures in the standard model [J ] . International Conference on the Theory and Application of Cryptology and Information Security , 2017 : 128 - 157 .
Liu J K , Wei V K , Wong D S . Linkable spontaneous anonymous group signature for ad hoc groups [J ] . Australasian Conference on Information Security and Privacy , 2004 : 325 - 335 .
Fujisaki E , Suzuki K . Traceable ring signature [J ] . International Workshop on Public Key Cryptography , 2007 : 181 - 200 .
Yuen T H , Esgin M F , Liu J K , et al . DualRing: Generic construction of ring signatures with efficient instantiations [C ] // Annual International Cryptology Conference . Cham : Springer International Publishing , 2021 : 251 - 281 .
Feng H , Liu J , Li D , et al . Traceable ring signatures: general framework and post-quantum security [J ] . Designs, Codes and Cryptography , 2021 , 89 ( 6 ): 1111 - 1145 .
Ye Q , Lang Y , Guo H , et al . Efficient lattice-based traceable ring signature scheme with its application in blockchain [J ] . Information Sciences , 2023 , 648 : 119536 .
Sun S F , Au M H , Liu J K , et al . Ringct 2.0: A compact accumulator-based (linkable ring signature) protocol for blockchain cryptocurrency monero [C ] // European Symposium on Research in Computer Security . Cham : Springer International Publishing , 2017 : 456 - 474 .
Yuen T H , Sun S , Liu J K , et al . Ringct 3.0 for blockchain confidential transaction: Shorter size and stronger security [C ] // International Conference on Financial Cryptography and Data Security . Cham : Springer International Publishing , 2020 : 464 - 483 .
Lai R W F , Ronge V , Ruffing T , et al . Omniring: Scaling private payments without trusted setup [C ] // Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security . 2019 : 31 - 48 .
Duan J , Zheng S , Wang W , et al . Concise RingCT protocol based on linkable threshold ring signature [J ] . IEEE Transactions on Dependable and Secure Computing , 2024 , 21 ( 5 ): 5014 - 5028 .
Teng D , Yao Y , Huang C . Optimizing signature space performance in privacy-enhanced blockchains: novel ring signature solutions [J ] . EURASIP Journal on Information Security , 2025 , 2025 ( 1 ): 6 .
Attema T , Cramer R , Rambaud M . Compressed sigma protocol theory and practical application to plug &play secure algorithmics [C ] // Cryptology ePrint Archive , Report 2020 / 152 , 2020 .
Galbraith S D , Paterson K G , Smart N P . Pairings for cryptographers [J ] . Discrete Applied Mathematics , 2008 , 156 ( 16 ): 3113 - 3121 .
Rackoff C , Simon D R . Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack [C ] // Annual International Cryptology Conference . Berlin, Heidelberg : Springer Berlin Heidelberg , 1991 : 433 - 444 .
Catalano D , Fiore D . Vector commitments and their applications [C ] // International Workshop on Public Key Cryptography . Berlin, Heidelberg : Springer Berlin Heidelberg , 2013 : 55 - 72 .
Abe M , Fuchsbauer G , Groth J , et al . Structure-preserving signatures and commitments to group elements [J ] . Journal of Cryptology , 2016 , 29 ( 2 ): 363 - 421 .
Lai R W F , Malavolta G , Ronge V . Succinct arguments for bilinear group arithmetic: Practical structure-preserving cryptography [C ] // Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security . 2019 : 2057 - 2074 .
ElGamal T . A public key cryptosystem and a signature scheme based on discrete logarithms [J ] . IEEE Transactions on Information Theory , 1985 , 31 ( 4 ): 469 - 472 .
Attema T , Cramer R , Fehr S . Compressing proofs of k-out-of-n partial knowledge [C ] // Annual International Cryptology Conference . Cham : Springer International Publishing , 2021 : 65 - 91 .
Attema T , Cramer R . Compressed-protocol theory and practical application to plug & play secure algorithmics [C ] // Annual International Cryptology Conference . Cham : Springer International Publishing , 2020 : 513 - 543 .
0
Views
0
下载量
0
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution
京公网安备11010602201714号