QADR: A Scalable, Quantum-Resistant Protocol for Anonymous Data Reporting

• URL: http://arxiv.org/abs/2511.15272v1
• Date: Wed, 19 Nov 2025 09:37:19 GMT
• Title: QADR: A Scalable, Quantum-Resistant Protocol for Anonymous Data Reporting
• Authors: Nilesh Vyas, Konstantin Baier,
• Abstract summary: The security of future large-scale IoT networks is critically threatened by the Harvest Now, Decrypt Later'' attack paradigm.<n>This paper introduces the Quantum Anonymous Data Reporting protocol, a hybrid framework that provides a theoretical benchmark and high-performance architecture for this challenge.<n>We prove the protocol's critical advantage as a performance benchmark, establishing a high-performance goal for future quantum-secured anonymity systems.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The security of future large-scale IoT networks is critically threatened by the ``Harvest Now, Decrypt Later'' (HNDL) attack paradigm. Securing the massive, long-lived data streams from these systems requires protocols that are both quantum-resistant and highly scalable. Existing solutions are insufficient: post-quantum classical protocols rely on computational assumptions that may not hold for decades, while purely quantum protocols are too resource-intensive for the sheer scale of IoT. This paper introduces the Quantum Anonymous Data Reporting (QADR) protocol, a hybrid framework that provides a theoretical benchmark and high-performance architecture for this challenge, designed for future fully-connected quantum networks. The protocol achieves scalable, quantum-resistant anonymity through a hybrid security model; it leverages information-theoretically secure keys from Quantum Key Distribution (QKD) to seed a quantum-secure pseudorandom function (QS-PRF), grounding its long-term data protection in well-established computational hardness assumptions. We also propose and analyze an automated slot reservation mechanism by making a deliberate trade-off: achieving high performance by accepting a quantifiable information leak during the anonymous slot reservation phase while maintaining strong unlinkability for the final data submission. Our security analysis formally quantifies the anonymity reduction caused by the leak and discusses pathways to fully mitigate it at a significant performance cost. We prove the protocol's critical advantage as a performance benchmark: its primary communication cost scales as $O(n^2)$, a dramatic improvement over quantum-native alternatives ($O(n^4)$), establishing a high-performance goal for future quantum-secured anonymity systems.

Related papers

• Pervasive Vulnerability Analysis and Defense for QKD-based Quantum Private Query [7.908856604745481]
  This study focuses on hidden information extraction under undetermined signal bits, revealing that most such QPQ protocols face severe security threats even without complex quantum resources.<n>To address these critical flaws, the proposed multi-encryption defense scheme is compatible with existing QPQ protocols.
  arXiv  Detail & Related papers  (2026-01-05T09:05:49Z)
• 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)
• Secure and Efficient Quantum Signature Scheme Based on the Controlled Unitary Operations Encryption [5.662132994900804]
  We present an efficient arbitrated quantum signature protocol to encrypt quantum message ensembles.<n>In contrast to existing protocols, our approach successfully prevents disavowal and forgery attacks.
  arXiv  Detail & Related papers  (2025-07-14T12:56:09Z)
• A Fully Device-Independent Ternary Quantum Key Distribution Protocol Based on the Impossible Colouring Game [0.59374762912328]
  We propose a quantum key distribution protocol based on the two-party Impossible Colouring pseudo-telepathy game.<n>The protocol harnesses Bell inequality violations that arise from contextuality in the Kochen-Specker theorem.<n>It operates within an adequate security framework and demonstrates an improved key generation rate compared to standard quantum key distribution schemes.
  arXiv  Detail & Related papers  (2025-05-21T14:52:31Z)
• Authenticated Sublinear Quantum Private Information Retrieval [12.91566002502802]
  This paper introduces a novel lower bound on communication complexity using quantum relative entropy and mutual information.<n>By leveraging Uhlmann's lemma and quantum Pinsker inequalities, the authors establish tighter bounds for information-theoretic security.
  arXiv  Detail & Related papers  (2025-04-05T03:30:04Z)
• Implementing an information-theoretically secure Byzantine agreement with quantum signed message solution [9.643164830645038]
  Byzantine agreement (BA) enables all honest nodes in a decentralized network to reach consensus.<n>We propose a quantum signed Byzantine agreement (QSBA) protocol based on the quantum signed message (QSM) scheme.<n>Our protocol achieves information-theoretic security using only QKD-shared key resources between network nodes.
  arXiv  Detail & Related papers  (2025-02-08T10:30:37Z)
• 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)
• Practical hybrid PQC-QKD protocols with enhanced security and performance [44.8840598334124]
  We develop hybrid protocols by which QKD and PQC inter-operate within a joint quantum-classical network. In particular, we consider different hybrid designs that may offer enhanced speed and/or security over the individual performance of either approach.
  arXiv  Detail & Related papers  (2024-11-02T00:02:01Z)
• Quantum-Secured Data Centre Interconnect in a field environment [38.4938584033229]
  Quantum key distribution (QKD) is an established quantum technology at a high readiness level. In this article, we present the successful implementation of a QKD field trial within a commercial data centre environment. The achieved average secret key rate of 2.392 kbps and an average quantum bit error rate of less than 2% demonstrate the commercial feasibility of QKD in real-world scenarios.
  arXiv  Detail & Related papers  (2024-10-14T08:05:25Z)
• The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet [49.8449750761258]
  Quantum secure direct communication (QSDC) is provably secure and overcomes the threat of quantum computing.<n>We will detail the associated point-to-point communication protocols and show how information is protected and transmitted.
  arXiv  Detail & Related papers  (2023-11-23T12:40:47Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)

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.