ChipmunkRing: A Practical Post-Quantum Ring Signature Scheme for Blockchain Applications

• URL: http://arxiv.org/abs/2510.09617v1
• Date: Wed, 17 Sep 2025 07:39:35 GMT
• Title: ChipmunkRing: A Practical Post-Quantum Ring Signature Scheme for Blockchain Applications
• Abstract summary: ChipmunkRing is a practical post-quantum ring signature construction tailored for blockchain environments.<n>This implementation delivers compact digital signatures ranging from 20.5 to 279.7KB, with rapid signing operations completing in 1.1-15.1ms.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: ChipmunkRing, a practical post-quantum ring signature construction tailored for blockchain environments. Building on our Chipmunk lattice-based cryptographic framework, this implementation delivers compact digital signatures ranging from 20.5 to 279.7KB, with rapid signing operations completing in 1.1-15.1ms and efficient validation processes requiring only 0.4-4.5ms for participant groups of 2-64 members. The cornerstone of our approach is Acorn Verification-a streamlined zero-knowledge protocol that supersedes the classical Fiat-Shamir methodology. This innovation enables linear O(n) authentication complexity using concise 96-byte cryptographic proofs per participant, yielding a remarkable 17.7x performance enhancement for 32-member rings when compared to conventional techniques. Our work includes rigorous mathematical security demonstrations confirming 112-bit post-quantum protection (NIST Level 1), extensive computational benchmarking, and comprehensive support for both standard anonymity sets and collaborative threshold constructions with flexible participation requirements.

Related papers

• A Lightweight and Post-Quantum Secure Framework for IEC 61869-9 Sampled Value Communication [0.0]
  This paper presents an experimentally validated security framework that combines lightweight per-frame authentication for operational SV traffic with post-quantum-capable key establishment protocol.<n> optimized Chaskey-12 achieves 90% lower latency than HMAC on SV packets.<n>The proposed security framework is a practical and scalable candidate for protecting IEC 61869-9 SV traffic on resource-constrained digital-substation devices.
  arXiv  Detail & Related papers  (2026-08-22T22:35:04Z)
• Repurposing Backdoors for Good: Ephemeral Intrinsic Proofs for Verifiable Aggregation in Cross-silo Federated Learning [30.440611659881494]
  We propose a lightweight architecture that shifts from cryptographic proofs to textitIntrinsic Proofs<n>We harness Catastrophic Forgetting to embed verification signals directly into model parameters.<n>Our approach achieves over $1000times$ speedup on ResNet-18 compared to cryptographic baselines, effectively scaling to large models.
  arXiv  Detail & Related papers  (2026-03-11T12:04:18Z)
• Obfuscation as an Effective Signal for Prioritizing Cross-Chain Smart Contract Audits: Large-Scale Measurement and Risk Profiling [42.77773046319942]
  HOBFNET is a fast surrogate of OBFPROBE, enabling million-scale cross-chain scoring.<n>We observe systematic score drift, motivating within-chain percentile queues.<n>Cross-chain reuse is tail-enriched and directionally biased from smaller to larger ecosystems.
  arXiv  Detail & Related papers  (2026-01-24T08:05:39Z)
• Verifier-initiated quantum message-authentication via quantum zero-knowledge proofs [38.81686642226027]
  We introduce a new method where the verifier can request authentication only when needed, improving efficiency for quantum networks and blockchain applications.<n>Our approach adapts the concept of zero-knowledge widely used in classical cryptography to quantum settings, ensuring that verification reveals nothing about secret keys.<n>This work delivers the first general verifier-initiated quantum signature scheme with formal security, paving the way for scalable, secure authentication in future quantum infrastructures and decentralized systems.
  arXiv  Detail & Related papers  (2025-12-05T04:40:34Z)
• Categorical Framework for Quantum-Resistant Zero-Trust AI Security [0.0]
  We present a novel integration of post-quantum cryptography (PQC) and zero trust architecture (AZT) to secure AI model.<n>Our framework uniquely models cryptographic access as morphisms and trust policies as functors.<n>We demonstrate its efficacy through a concrete ESP32-based implementation.
  arXiv  Detail & Related papers  (2025-11-25T17:17:24Z)
• Fortytwo: Swarm Inference with Peer-Ranked Consensus [36.94429692322632]
  We present Fortytwo, a novel protocol that leverages swarm intelligence principles and distributed pairwise ranking consensus to achieve superior performance in AI inference.<n>Using pairwise ranking with a custom Bradley-Terry-style aggregation model, we demonstrate that swarm inference substantially outperforms majority voting.
  arXiv  Detail & Related papers  (2025-10-27T23:19:48Z)
• A Hybrid Chaos-Based Cryptographic Framework for Post-Quantum Secure Communications [2.474908349649168]
  We present CryptoChaos, a novel hybrid cryptographic framework that synergizes deterministic chaos theory with cutting-edge cryptographic primitives to achieve robust, post-quantum resilient encryption.<n> CryptoChaos harnesses the intrinsic unpredictability of four discrete chaotic maps to generate a high-entropy, multidimensional key from a unified entropy pool.
  arXiv  Detail & Related papers  (2025-04-11T15:24:21Z)
• Federated Distributed Key Generation [0.0]
  Distributed Key Generation (DKG) is vital to threshold-based cryptographic protocols such as threshold signatures, secure multiparty computation, and i-voting.<n>Standard $(n,t)$-DKG requires a known set of $n$ participants and a fixed threshold $t$, making it impractical for public or decentralized settings where membership and availability can change.<n>We introduce Federated Distributed Key Generation (FDKG), which relaxes these constraints by allowing each participant to select its own guardian set, with a local threshold to reconstruct that participant's partial key.
  arXiv  Detail & Related papers  (2025-02-28T08:31:16Z)
• 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)
• Collaborative CP-NIZKs: Modular, Composable Proofs for Distributed Secrets [3.3373764108905455]
  Composability allows users to combine different specialized NIZKs. We present the first, general definition for collaborative commit-and-prove NIZK.
  arXiv  Detail & Related papers  (2024-07-27T08:45:34Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Quantum-Secure Hybrid Blockchain System for DID-based Verifiable Random Function with NTRU Linkable Ring Signature [1.4792750204228]
  We present a smart contract-based Verifiable Random Function (VRF) model, addressing the shortcomings of existing systems. To enhance our VRF's robustness, we employ post-quantum Ring-LWE encryption for generating pseudo-random sequences. We show the security and privacy advantages of our proposed VRF model with the approximated estimation of overall temporal and spatial complexities.
  arXiv  Detail & Related papers  (2024-01-30T11:17:25Z)
• ScionFL: Efficient and Robust Secure Quantized Aggregation [36.668162197302365]
  We introduce ScionFL, the first secure aggregation framework for federated learning. It operates efficiently on quantized inputs and simultaneously provides robustness against malicious clients. We show that with no overhead for clients and moderate overhead for the server, we obtain comparable accuracy for standard FL benchmarks.
  arXiv  Detail & Related papers  (2022-10-13T21:46:55Z)
• Efficient NIZKs and Signatures from Commit-and-Open Protocols in the QROM [10.5811404306981]
  Commit-and-open Sigma-protocols are a popular class of protocols for constructing non-interactive zero-knowledge arguments and digital-signature schemes. We prove tight online extractability in the quantum random oracle model (QROM) Our results yield a significant improvement of the provable post-quantum security of the digital-signature scheme Picnic.
  arXiv  Detail & Related papers  (2022-02-28T12:51:51Z)

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.