Stateful Hash-Based Signature (SHBS) Benchmark Data for XMSS and LMS

• URL: http://arxiv.org/abs/2502.06033v1
• Date: Sun, 09 Feb 2025 21:14:17 GMT
• Title: Stateful Hash-Based Signature (SHBS) Benchmark Data for XMSS and LMS
• Authors: Brian Romansky, Thomas Mazzuchi, Shahram Sarkani,
• Abstract summary: 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.
• Score: 1.2835555561822447
• License:
• Abstract: The National Institute of Standards and Technology (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, the two approved algorithms, 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.

Related papers

• Cryptanalysis via Machine Learning Based Information Theoretic Metrics [58.96805474751668]
  We propose two novel applications of machine learning (ML) algorithms to perform cryptanalysis on any cryptosystem. These algorithms can be readily applied in an audit setting to evaluate the robustness of a cryptosystem. We show that our classification model correctly identifies the encryption schemes that are not IND-CPA secure, such as DES, RSA, and AES ECB, with high accuracy.
  arXiv  Detail & Related papers  (2025-01-25T04:53:36Z)
• 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)
• A Watermark for Order-Agnostic Language Models [55.89285889529492]
  Pattern-mark is a pattern-based watermarking framework specifically designed for order-agnostic LMs. We develop a Markov-chain-based watermark generator that produces watermark key sequences with high-frequency key patterns. Our evaluations on order-agnostic LMs, such as ProteinMPNN and CMLM, demonstrate Pattern-mark's enhanced detection efficiency, generation quality, and robustness.
  arXiv  Detail & Related papers  (2024-10-17T17:41:28Z)
• 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)
• 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)
• 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)
• 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)
• One-Time Universal Hashing Quantum Digital Signatures without Perfect Keys [24.240914319917053]
  We show that imperfect quantum keys with limited information leakage can be used for digital signatures and authentication without compromising security. This study significantly reduces the delay for data postprocessing and is compatible with any quantum key generation protocols.
  arXiv  Detail & Related papers  (2023-01-03T14:54:27Z)
• When Counting Meets HMER: Counting-Aware Network for Handwritten Mathematical Expression Recognition [57.51793420986745]
  We propose an unconventional network for handwritten mathematical expression recognition (HMER) named Counting-Aware Network (CAN) We design a weakly-supervised counting module that can predict the number of each symbol class without the symbol-level position annotations. Experiments on the benchmark datasets for HMER validate that both joint optimization and counting results are beneficial for correcting the prediction errors of encoder-decoder models.
  arXiv  Detail & Related papers  (2022-07-23T08:39:32Z)

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.