Linearly Homomorphic Ring Signature Scheme over Lattices
arXiv SecurityArchived Mar 30, 2026✓ Full text saved
arXiv:2507.02281v4 Announce Type: replace Abstract: Construct the first provably secure linear homomorphic ring signature scheme. Ring signatures allow a signer to anonymously sign a message on behalf of a user group (ring) and are widely applied in areas such as identity protection, electronic voting, and privacy enhancement in blockchain. Homomorphic signatures, on the other hand, support verifiable computations on signed data. The integration of anonymity and computability in homomorphic ring
Full text archived locally
✦ AI Summary· Claude Sonnet
Computer Science > Cryptography and Security
[Submitted on 3 Jul 2025 (v1), last revised 27 Mar 2026 (this version, v4)]
Linearly Homomorphic Ring Signature Scheme over Lattices
Heng Guo, Jia Li, Yanan Wang, Fengxia Liu, Zhiyong Zheng, Kun Tian
Construct the first provably secure linear homomorphic ring signature scheme. Ring signatures allow a signer to anonymously sign a message on behalf of a user group (ring) and are widely applied in areas such as identity protection, electronic voting, and privacy enhancement in blockchain. Homomorphic signatures, on the other hand, support verifiable computations on signed data. The integration of anonymity and computability in homomorphic ring signatures holds the potential to create new application scenarios for privacy-preserving distributed systems. It is worth noting that Choi and Kim first introduced the concept of linear homomorphic ring signatures in 2017 and proposed a specific scheme. However, their scheme lacks a complete security proof, leaving its security theoretically unconfirmed. To address this research gap, this paper presents the first provably secure lattice-based linear homomorphic ring signature scheme, designed for scenarios where the ring size is O(log n). This scheme not only combines the anonymity of ring signatures with the malleability of homomorphic signatures but also achieves resistance against quantum attacks.
Subjects: Cryptography and Security (cs.CR)
Cite as: arXiv:2507.02281 [cs.CR]
(or arXiv:2507.02281v4 [cs.CR] for this version)
https://doi.org/10.48550/arXiv.2507.02281
Focus to learn more
Submission history
From: Heng Guo [view email]
[v1] Thu, 3 Jul 2025 03:43:40 UTC (35 KB)
[v2] Tue, 30 Sep 2025 12:51:10 UTC (36 KB)
[v3] Mon, 17 Nov 2025 14:23:46 UTC (36 KB)
[v4] Fri, 27 Mar 2026 11:42:21 UTC (38 KB)
Access Paper:
HTML (experimental)
view license
Current browse context:
cs.CR
< prev | next >
new | recent | 2025-07
Change to browse by:
cs
References & Citations
NASA ADS
Google Scholar
Semantic Scholar
Export BibTeX Citation
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Demos
Related Papers
About arXivLabs
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)