SILMARILS: Information-Theoretic and Quantum-Secure Designated-Verifier Signatures

• URL: http://arxiv.org/abs/2605.03230v1
• Date: Mon, 04 May 2026 23:48:01 GMT
• Title: SILMARILS: Information-Theoretic and Quantum-Secure Designated-Verifier Signatures
• Abstract summary: SILMARILS is built from a minimal algebraic core over $mathbbF_p$ using true randomness and perfect $2$-out-of-$2$ Shamir secret sharing.<n>In the two-party setting, SILMARILS realizes a transferable designated-verifier (TDV) signature scheme.<n>In the three-party mode, adopting the broadcast model of Fitzi et al., we obtain a statistically secure signature protocol with simulation-based security and error$1/p$.
• Score: 4.985913181990347
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: SILMARILS is built from a minimal algebraic core over $\mathbb{F}_p$ using true randomness and perfect $2$-out-of-$2$ Shamir secret sharing. The framework supports both two-party and three-party modes. In the two-party setting, SILMARILS realizes a transferable designated-verifier (TDV) signature scheme. The designated verifier can simulate accepting transcripts indistinguishable from real ones, achieving Jakobsson-Sako-Impagliazzo DV security. The verifier may publish a receipt $r$ enabling public verification, yet even with $r$, no external party can tell whether a transcript was signed or simulated. As DV signatures permit simulation, standard EUF-CMA cannot hold for the designated verifier; instead, we prove $\mathsf{EUF\text{-}CMA}^{\neg\mathsf{DV}}$ security for all non-designated verifiers in both the random oracle model (ROM) and quantum random oracle model (QROM). In the three-party mode, adopting the broadcast model of Fitzi et al., we obtain a statistically secure signature protocol with simulation-based security and error~$1/p$. We analyze security in the Pure IT model, the IT+ROM, and the QROM, extending the Fitzi et al. framework to quantum adversaries with classical I/O. Correctness, secrecy, transferability, and unforgeability for non-designated parties remain equivalent to simulation-based security. Thanks to its simple algebraic structure, SILMARILS achieves substantially smaller keys and signatures than standardized post-quantum schemes such as Dilithium, Falcon, and SPHINCS$^+$, while providing post-quantum security in a TDV setting well suited to blockchain applications.

Related papers

• GAUGE: A Formal Framework for Measuring Cryptographic Security under Heterogeneous Adversary Cost Models [0.0]
  Standards bodies report cryptographic security as a single number of bits.<n>Different conventions produce different rankings of cryptographic schemes.<n>GAUGE provides an explicit and auditable framework for reporting cryptographic security under competing cost models.
  arXiv  Detail & Related papers  (2026-09-15T14:55:29Z)
• A Compact Post-quantum Strong Designated Verifier Signature Scheme from Isogenies [0.0]
  We present a novel isogeny-based Strong Designated Verifier Signature scheme.<n>It offers a compact, quantum-resistant alternative to existing SDVS constructions.<n>It achieves strong security guarantees, Strong Unforgeability under Chosen-Message Attacks (SUF-CMA), Non-Transferability (NT), and Privacy of Signer's Identity (PSI)
  arXiv  Detail & Related papers  (2025-07-20T10:15:38Z)
• Application of $α$-order Information Metrics for Secure Communication in Quantum Physical Layer Design [45.41082277680607]
  We study the $alpha$-order information-theoretic metrics based on R'enyi entropy.<n>We apply our framework to a practical scenario involving BPSK modulation over a lossy bosonic channel.
  arXiv  Detail & Related papers  (2025-02-07T03:44:11Z)
• 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)
• An Experimentally Validated Feasible Quantum Protocol for Identity-Based Signature with Application to Secure Email Communication [1.156080039774429]
  In 1984, Shamir developed the first Identity-based signature (IBS) to simplify public key infrastructure. IBS protocols rely on several theoretical assumption-based hard problems. Quantum cryptography (QC) is one such approach.
  arXiv  Detail & Related papers  (2024-03-27T04:32:41Z)
• 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)
• On black-box separations of quantum digital signatures from pseudorandom states [1.9254132307399263]
  We show that there $textitdoes not$ exist a black-box construction of a quantum digital signatures scheme. Our result complements that of Morimae and Yamakawa (2022), who described a $textitone-time$ secure QDS scheme with classical signatures.
  arXiv  Detail & Related papers  (2024-02-13T03:36:35Z)
• Quantum Secure Protocols for Multiparty Computations [2.9561405287476177]
  We present secure multiparty computation (MPC) protocols that can withstand quantum attacks. We first present the design and analysis of an information-theoretic secure oblivious linear evaluation (OLE), namely $sf qOLE$ in the quantum domain. We further utilize $sf qOLE$ as a building block to construct a quantum-safe multiparty private set intersection (MPSI) protocol.
  arXiv  Detail & Related papers  (2023-12-26T19:53:29Z)
• Quantum Symmetric Private Information Retrieval with Secure Storage and Eavesdroppers [32.97918488607827]
  We consider both the classical and quantum variations of $X$-secure, $E$-eavesdropped and $T$-colluding symmetric private information retrieval (SPIR) We first develop a scheme for classical $X$-secure, $E$-eavesdropped and $T$-colluding SPIR (XSETSPIR) based on a modified version of cross subspace alignment (CSA)
  arXiv  Detail & Related papers  (2023-08-21T17:30:38Z)
• 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)
• Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41: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.