Linearly Homomorphic Ring Signature Scheme over Lattices

• URL: http://arxiv.org/abs/2507.02281v1
• Date: Thu, 03 Jul 2025 03:43:40 GMT
• Title: Linearly Homomorphic Ring Signature Scheme over Lattices
• Authors: Heng Guo, Kun Tian, Fengxia Liu, Zhiyong Zheng,
• Abstract summary: Homomorphic ring signature schemes combine the strong anonymity of ring signatures with the computability of homomorphic signatures.<n>No feasible homomorphic ring signature scheme currently exists.<n>We propose the first lattice-based linearly homomorphic ring signature scheme.
• Score: 7.911831986965765
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Homomorphic ring signature schemes combine the strong anonymity of ring signatures with the computability of homomorphic signatures, demonstrating significant potential in scenarios requiring both anonymous data provenance and verifiable homomorphic computation (e.g., confidential blockchain transactions and secure multi-party computation). However, no feasible homomorphic ring signature scheme currently exists. In this work, we propose the first lattice-based linearly homomorphic ring signature scheme. Proven secure in the standard model under the small integer solution (SIS) assumption, our scheme achieves strong anonymity under full key exposure and unforgeability against insider corruption attacks. As the first unified framework for ring signatures and linear homomorphic signatures, this construction provides a post-quantum-secure solution for the aforementioned applications, advancing the development of privacy-enhanced homomorphic computation.

Related papers

• One For All: Formally Verifying Protocols which use Aggregate Signatures (extended version) [6.604074204101799]
  BLS aggregate signatures are a popular kind of aggregate signature, deployed by Dfinity, and Cloudflare amongst others.<n> BLS aggregate signatures are difficult to use correctly, with nuanced requirements that must be carefully handled by protocol developers.<n>We design the first models of aggregate signatures that enable formal verification tools, such as Tamarin and ProVerif, to be applied to protocols using these signatures.
  arXiv  Detail & Related papers  (2025-05-15T14:01:30Z)
• Semigroup-homomorphic Signature [7.911831986965765]
  We introduce, for the first time, a semigroup-homomorphic signature scheme.<n>Under certain conditions, we prove that the security of this scheme is based on the hardness of the Short Solution (SIS) problem.<n>We extend it to a linear semigroup-homomorphic signature scheme over lattices, and this scheme can also ensure privacy.
  arXiv  Detail & Related papers  (2025-03-21T13:38:07Z)
• Privacy-Preserving Biometric Verification with Handwritten Random Digit String [49.77172854374479]
  Handwriting verification has stood as a steadfast identity authentication method for decades.<n>However, this technique risks potential privacy breaches due to the inclusion of personal information in handwritten biometrics such as signatures.<n>We propose using the Random Digit String (RDS) for privacy-preserving handwriting verification.
  arXiv  Detail & Related papers  (2025-03-17T03:47:25Z)
• Linearly Homomorphic Signature with Tight Security on Lattice [7.911831986965765]
  Boyen and Li posed an open problem in their ASIACRYPT 2016 conference paper.<n>How to construct a tightly secure homomorphic signature scheme under the Short Solution (SIS) hardness assumption.<n>This work provides the first complete resolution of this problem under the same assumption.
  arXiv  Detail & Related papers  (2024-12-02T15:51:57Z)
• An Undeniable Signature Scheme Utilizing Module Lattices [0.0]
  An undeniable signature scheme is type of digital signature where the signer retains control over the signature's verifiability. We develop a module lattice-based post-quantum undeniable signature system.
  arXiv  Detail & Related papers  (2024-10-25T00:09:29Z)
• Provably Secure Disambiguating Neural Linguistic Steganography [66.30965740387047]
  The segmentation ambiguity problem, which arises when using language models based on subwords, leads to occasional decoding failures.<n>We propose a novel secure disambiguation method named SyncPool, which effectively addresses the segmentation ambiguity problem.<n> SyncPool does not change the size of the candidate pool or the distribution of tokens and thus is applicable to provably secure language steganography methods.
  arXiv  Detail & Related papers  (2024-03-26T09:25:57Z)
• Revocable Quantum Digital Signatures [57.25067425963082]
  We define and construct digital signatures with revocable signing keys from the LWE assumption. In this primitive, the signing key is a quantum state which enables a user to sign many messages. Once the key is successfully revoked, we require that the initial recipient of the key loses the ability to sign.
  arXiv  Detail & Related papers  (2023-12-21T04:10:07Z)
• Publicly-Verifiable Deletion via Target-Collapsing Functions [81.13800728941818]
  We show that targetcollapsing enables publiclyverifiable deletion (PVD) We build on this framework to obtain a variety of primitives supporting publiclyverifiable deletion from weak cryptographic assumptions.
  arXiv  Detail & Related papers  (2023-03-15T15:00:20Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• A Note on the Post-Quantum Security of (Ring) Signatures [17.284592769143075]
  This work revisits the security of classical signatures and ring signatures in a quantum world. We focus on the arguably preferable security notion of blind-unforgeability recently proposed by Alagic et al. We present two short signature schemes achieving this notion.
  arXiv  Detail & Related papers  (2021-12-11T21:51:41Z)
• Isogeny-based Group Signatures and Accountable Ring Signatures in QROM [6.457790847177476]
  We present the first provably secure isogeny-based group signature (GS) and accountable ring signature (ARS) in the quantum random oracle model (QROM) We do so via introducing and constructing an intermediate primitive called the openable sigma protocol and demonstrating that any such protocol gives rise to a secure GS and ARS.
  arXiv  Detail & Related papers  (2021-10-10T13:40:16Z)
• Improved, Deterministic Smoothing for L1 Certified Robustness [119.86676998327864]
  We propose a non-additive and deterministic smoothing method, Deterministic Smoothing with Splitting Noise (DSSN) In contrast to uniform additive smoothing, the SSN certification does not require the random noise components used to be independent. This is the first work to provide deterministic "randomized smoothing" for a norm-based adversarial threat model.
  arXiv  Detail & Related papers  (2021-03-17T21:49:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.