An Undeniable Signature Scheme Utilizing Module Lattices

• URL: http://arxiv.org/abs/2410.19220v1
• Date: Fri, 25 Oct 2024 00:09:29 GMT
• Title: An Undeniable Signature Scheme Utilizing Module Lattices
• Authors: Kunal Dey, Mansi Goyal, Bupendra Singh, Aditi Kar Gangopadhyay,
• Abstract summary: 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.
• Score: 0.0
• License:
• Abstract: An undeniable signature scheme is type of digital signature where the signer retains control over the signature's verifiability. Therefore with the approval of the signer, only an authenticated verifier can verify the signature. In this work, we develop a module lattice-based post-quantum undeniable signature system. Our method is based on the GPV framework utilizing module lattices, with the security assured by the hardness of the SIS and LWE problems. We have thoroughly proved all the desired securities for the proposed scheme. Finally, we have implemented our protocol for different sets of parameters. The purpose of opting a module variant rather than a ring variant is to provide greater flexibility in selecting parameters.

Related papers

• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a brand new quantum digital signature protocol without a trusted third party only with qubit technology to further improve the security. We prove that the protocol has information-theoretical unforgeability. Moreover, it satisfies other important secure properties, including asymmetry, undeniability, and expandability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• A Digital signature scheme based on Module-LWE and Module-SIS [0.0]
  We present an improved version of the digital signature scheme proposed by Sharafi and Daghigh based on Module-LWE and Module-SIS problems. Our proposed signature scheme has a notably higher security level and smaller decoding failure probability, than the ones in the Sharaf-Daghigh scheme.
  arXiv  Detail & Related papers  (2024-09-03T18:47:49Z)
• Investigating the Common Authorship of Signatures by Off-Line Automatic Signature Verification Without the Use of Reference Signatures [3.3498759480099856]
  This paper addresses the problem of automatic signature verification when no reference signatures are available. The scenario we explore consists of a set of signatures, which could be signed by the same author or by multiple signers. We discuss three methods which estimate automatically the common authorship of a set of off-line signatures.
  arXiv  Detail & Related papers  (2024-05-23T10:30:48Z)
• The Variant of Designated Verifier Signature Scheme with Message Recovery [0.40964539027092917]
  We introduce a strong Designated Verifier Signature (DVS) scheme that incorporates a message recovery mechanism. This work is inspired by the concept of the Universal Designated Verifier Signature (UDVS) scheme.
  arXiv  Detail & Related papers  (2024-03-12T17:02:10Z)
• 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)
• A General Framework for Verification and Control of Dynamical Models via Certificate Synthesis [54.959571890098786]
  We provide a framework to encode system specifications and define corresponding certificates. We present an automated approach to formally synthesise controllers and certificates. Our approach contributes to the broad field of safe learning for control, exploiting the flexibility of neural networks.
  arXiv  Detail & Related papers  (2023-09-12T09:37:26Z)
• FedSOV: Federated Model Secure Ownership Verification with Unforgeable Signature [60.99054146321459]
  Federated learning allows multiple parties to collaborate in learning a global model without revealing private data. We propose a cryptographic signature-based federated learning model ownership verification scheme named FedSOV.
  arXiv  Detail & Related papers  (2023-05-10T12:10:02Z)
• Secure access system using signature verification over tablet PC [62.21072852729544]
  We describe a highly versatile and scalable prototype for Web-based secure access using signature verification. The proposed architecture can be easily extended to work with different kinds of sensors and large-scale databases.
  arXiv  Detail & Related papers  (2023-01-11T11:05:47Z)
• Quotable Signatures for Authenticating Shared Quotes [0.8875650122536799]
  Quotable signature schemes are digital signature schemes with the additional property that from the signature for a message, any party can extract signatures for (allowable) quotes from the message. We define a notion of security for quotable signature schemes and construct a concrete example of a quotable signature scheme. We consider both how quotable signatures can be used, and why using them could help mitigate the effects of fake news.
  arXiv  Detail & Related papers  (2022-12-21T12:07:46Z)
• Joint Differentiable Optimization and Verification for Certified Reinforcement Learning [91.93635157885055]
  In model-based reinforcement learning for safety-critical control systems, it is important to formally certify system properties. We propose a framework that jointly conducts reinforcement learning and formal verification.
  arXiv  Detail & Related papers  (2022-01-28T16:53:56Z)

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.