Digital signature schemes based on code equivalence and syndrome decoding from restricted errors

• URL: http://arxiv.org/abs/2606.31601v1
• Date: Tue, 30 Jun 2026 12:50:55 GMT
• Title: Digital signature schemes based on code equivalence and syndrome decoding from restricted errors
• Abstract summary: We consider the two digital signature schemes based on error-correcting codes that are second-round candidates in NIST's call for Additional Signature Schemes.<n>We describe their underlying problems of syndrome decoding from restricted errors and code equivalence.<n>We explain how this procedure yields code-based digital signatures believed to be post-quantum secure.
• Score: 6.8130810325695625
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Digital signature schemes are an important cryptographic tool to ensure data authenticity and integrity in many applications that must be resilient to attacks, including those facilitated by quantum computers. We consider the two digital signature schemes based on error-correcting codes that are second-round candidates in NIST's call for Additional Signature Schemes, which is part of the Post-Quantum Cryptography Standardization Process. Specifically, we provide an overview of the Codes and Restricted Objects Signature Scheme (CROSS) and the Linear Equivalence Signature Scheme (LESS). We describe their underlying problems of syndrome decoding from restricted errors and code equivalence. We review sigma protocols and how they can be transformed into digital signature schemes via the Fiat-Shamir transform. Finally, we explain how this procedure yields code-based digital signatures believed to be post-quantum secure.

Related papers

• Post-Quantum Cryptography: An Analysis of Code-Based and Lattice-Based Cryptosystems [55.49917140500002]
  Quantum computers will be able to break modern cryptographic systems using Shor's Algorithm.<n>We first examine the McEliece cryptosystem, a code-based scheme believed to be secure against quantum attacks.<n>We then explore NTRU, a lattice-based system grounded in the difficulty of solving the Shortest Vector Problem.
  arXiv  Detail & Related papers  (2025-05-06T03:42:38Z)
• Quasi-cyclic Linear Error-Block Code-based Post-quantum Signature [0.0]
  We introduce a signature based on a family of linear error-block codes (LEB) with strong algebraic properties.<n>It is the family of quasi-cyclic LEB codes that we do define algebraically during this work.
  arXiv  Detail & Related papers  (2025-03-30T11:36:05Z)
• Secure Semantic Communication With Homomorphic Encryption [52.5344514499035]
  This paper explores the feasibility of applying homomorphic encryption to SemCom.<n>We propose a task-oriented SemCom scheme secured through homomorphic encryption.
  arXiv  Detail & Related papers  (2025-01-17T13:26:14Z)
• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a novel quantum digital signature protocol without a trusted third-party.<n>We prove that the protocol has information-theoretical unforgeability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• Generalized Quantum-assisted Digital Signature [2.187441808562386]
  This paper introduces an improved version of a recently proposed scheme whose information theoretic security is inherited by adopting QKD keys for digital signature purposes. Its security against forging is computed considering a trial-and-error approach taken by the malicious forger and GQaDS parameters are optimized via an analytical approach balancing between forgery and repudiation probabilities.
  arXiv  Detail & Related papers  (2024-06-28T15:04:38Z)
• Efficient Arbitrated Quantum Digital Signature with Multi-Receiver Verification [3.6788660756664773]
  Quantum digital signature is used to authenticate the identity of the signer with theoretical security. In traditional multi-receiver quantum digital signature schemes without an arbitrater, the transferability of one-to-one signature is always required to achieve unforgeability. We propose an arbitrated quantum digital signature scheme, in which the signature can be verified by multiple receivers simultaneously.
  arXiv  Detail & Related papers  (2024-06-12T02:46:54Z)
• 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)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
  We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
  arXiv  Detail & Related papers  (2023-07-20T10:51:23Z)
• A Feasible Hybrid Quantum-Assisted Digital Signature for Arbitrary Message Length [0.0]
  We propose a new quantum-assisted digital signature protocol based on symmetric keys generated by QKD. The protocol is described for a three-user scenario composed of one sender and two receivers.
  arXiv  Detail & Related papers  (2023-03-01T19:00:02Z)
• Signing Information in the Quantum Era [0.0]
  We review digital signature schemes, looking at their origins and where they are under threat. We introduce post-quantum digital schemes, which are being developed with the specific intent of mitigating against threats from quantum algorithms. Finally, we review schemes for signing information carried on quantum channels, which promise provable security metrics.
  arXiv  Detail & Related papers  (2020-09-25T10:44:36Z)

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.