Generalized Quantum-assisted Digital Signature

• URL: http://arxiv.org/abs/2406.19978v1
• Date: Fri, 28 Jun 2024 15:04:38 GMT
• Title: Generalized Quantum-assisted Digital Signature
• Authors: Alberto Tarable, Rudi Paolo Paganelli, Elisabetta Storelli, Alberto Gatto, Marco Ferrari,
• Abstract summary: 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.
• Score: 2.187441808562386
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper introduces Generalized Quantum-assisted Digital Signature (GQaDS), 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. The hash functions of the previous implementation are replaced with Carter-Wegman Message Authentication Codes (MACs), strengthening the scheme security and reducing the signature length. For particular scenarios where the second verifier has a safe reputation, a simplified version of GQaDS, namely deterministic GQaDS, can further reduce the required signature length, keeping the desired security strength.

Related papers

• Stateful Hash-Based Signature (SHBS) Benchmark Data for XMSS and LMS [1.2835555561822447]
  NIST has recommended the use of stateful hash-based digital signatures for long-term applications that may require protection from future threats that use quantum computers. XMSS and LMS have multiple parameter options that impact digital signature size, public key size, the number of signatures that can be produced over the life of a keypair, and the computational effort to validate signatures. This collection of benchmark data is intended to support system designers in understanding the differences among the configuration options.
  arXiv  Detail & Related papers  (2025-02-09T21:14:17Z)
• One-Time Signature Based on Pseudorandom Number Generator [0.0]
  Hash functions are widely applied in pseudorandom number generators (PRNGs) This study proposes a modified approach that introduces a DSA based on PRNGs, suitable for one-time signature (OTS) applications.
  arXiv  Detail & Related papers  (2024-12-23T05:36:42Z)
• 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)
• Continuous-variable quantum digital signatures that can withstand coherent attacks [5.777874043843867]
  Quantum digital signatures (QDSs) guarantee authenticity, integrity, and nonrepudiation of classical messages based on quantum laws. We introduce a CV QDS protocol designed to withstand general coherent attacks through the use of a cutting-edge fidelity test function. Results demonstrate a significant reduction of eight orders of magnitude in signature length for a megabit message signing task.
  arXiv  Detail & Related papers  (2024-07-04T03:39:59Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• Practical quantum secure direct communication with squeezed states [55.41644538483948]
  We report the first table-top experimental demonstration of a CV-QSDC system and assess its security. This realization paves the way into future threat-less quantum metropolitan networks, compatible with coexisting advanced wavelength division multiplexing (WDM) systems.
  arXiv  Detail & Related papers  (2023-06-25T19:23:42Z)
• Reversible Quantization Index Modulation for Static Deep Neural Network Watermarking [57.96787187733302]
  Reversible data hiding (RDH) methods offer a potential solution, but existing approaches suffer from weaknesses in terms of usability, capacity, and fidelity. We propose a novel RDH-based static DNN watermarking scheme using quantization index modulation (QIM) Our scheme incorporates a novel approach based on a one-dimensional quantizer for watermark embedding.
  arXiv  Detail & Related papers  (2023-05-29T04:39:17Z)
• 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)
• A Variational Quantum Attack for AES-like Symmetric Cryptography [69.80357450216633]
  We propose a variational quantum attack algorithm (VQAA) for classical AES-like symmetric cryptography. In the VQAA, the known ciphertext is encoded as the ground state of a Hamiltonian that is constructed through a regular graph.
  arXiv  Detail & Related papers  (2022-05-07T03:15:15Z)
• 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)
• Efficient Quantum Digital Signatures without Symmetrization Step [7.848038078036641]
  Quantum digital signatures (QDS) exploit quantum laws to guarantee non-repudiation, unforgeability and transferability of messages. Current QDS protocols face two major restrictions, including the requirement of the symmetrization step. We present an efficient QDS protocol to overcome these issues by utilizing the classical post-processing operation called post-matching method.
  arXiv  Detail & Related papers  (2021-04-08T01:54:50Z)

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.