Onion-Routed Multi-Circuit Key Establishment for Quantum-Resilient Sessions

• URL: http://arxiv.org/abs/2605.21349v1
• Date: Wed, 20 May 2026 16:14:07 GMT
• Title: Onion-Routed Multi-Circuit Key Establishment for Quantum-Resilient Sessions
• Abstract summary: RSA, Diffie-Hellman, and elliptic-curve cryptography are vulnerable to Shor's algorithm on a sufficiently capable quantum computer.<n>We propose a session-key establishment scheme that distributes a freshly generated key as multiple, independently encrypted fragments.<n>We implement the design as a Flask-based prototype on AWS EC2, with both the proxy and the client deployed as Tor onion services.
• Score: 8.056193828705942
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Public-key primitives that today anchor session-key establishment - RSA, Diffie-Hellman, and elliptic-curve cryptography - reduce to integer factorization or discrete logarithm and are therefore vulnerable to Shor's algorithm on a sufficiently capable quantum computer. The harvest-now, decrypt-later (HNDL) threat model turns this future capability into a present liability: ciphertext archived today can be decrypted retrospectively once a cryptographically relevant quantum computer becomes available. We propose a session-key establishment scheme that distributes a freshly generated key as multiple, independently encrypted fragments across distinct, ephemeral Tor circuits between an onion-service proxy and an onion-service client. Reconstruction requires every fragment; each fragment travels its own per-bundle circuit established via a NEWNYM signal. The security argument rests on the standard end-to-end correlation bound for onion routing: an adversary controlling a fraction of Tor relays must independently deanonymize every fresh circuit to correlate the fragments belonging to one session, and the per-fragment probability of success decays multiplicatively in the number of fragments. We implement the design as a Flask-based prototype on AWS EC2, with both the proxy and the client deployed as Tor onion services, and measure end-to-end key-establishment latency. The implemented prototype completes a key establishment in 13-20 s on average (7-50 s including tails), of which approximately 88% is attributable to Tor-related delay - a cost we discuss in the context of the privacy-versus-responsiveness trade-off.

Related papers

• Pushing Forward Multi-Secret-Key Homomorphic Encryption for Private Average Aggregation [45.381652768314375]
  Homomorphic Encryption naturally fits the client--aggregator communication pattern of Federated Learning.<n>We propose lightweight multi-secret-key protocols for private average aggregation based on RLWE-based Homomorphic Encryption.<n>Our results show that the proposed approach substantially reduces ciphertext expansion and online cost, while preserving practical homomorphic aggregation performance.
  arXiv  Detail & Related papers  (2026-09-01T23:21:48Z)
• Eavesdropper-Blind Remote State Preparation and Applications to Quantum Public-Key Encryption [46.01993114598725]
  We study a weaker form of remote state preparation, which we call eavesdropper-blind remote state preparation (EB-RSP)<n>EB-RSP requires blindness only against external observers who see the transcript of the honest protocol, rather than against the quantum server itself.<n>We show that two-message EB-RSP already suffices to construct quantum public-key encryption with classical public keys and quantumtext ciphers.
  arXiv  Detail & Related papers  (2026-08-21T15:51:55Z)
• Aquaman: A Transparent Proxy Architecture for Quantum Resilient Key Establishment [8.056193828705942]
  We present Aquaman, a transparent-proxy architecture for quantum-resilient session-key establishment.<n>A transparent proxy intercepts session-key requests at the edge of a trusted network without requiring client-side configuration.<n>A 1,000-run prototype evaluation on AWS EC2 shows that latency is dominated by network transmission, not by multi-path overhead.
  arXiv  Detail & Related papers  (2026-05-07T20:45:39Z)
• CHRONOS: A Hardware-Assisted Phase-Decoupled Framework for Secure Federated Learning in IoT [0.0]
  CHRONOS is a hardware-assisted framework that decouples the cryptographic setup required for private gradient aggregation from the active training phase.<n>It generates ephemeral keypairs and derives PRG keys entirely within an ARM TrustZone enclave.<n>It reduces active-phase aggregation latency by up to 74% compared to synchronous secure aggregation for 20 clients.
  arXiv  Detail & Related papers  (2026-04-21T04:00:49Z)
• Variational Secret Common Randomness Extraction [38.319927578257726]
  We study the problem of extracting common randomness (CR) or secret keys from correlated random sources observed by two legitimate parties, Alice and Bob, through public discussion in the presence of an eavesdropper, Eve.<n>We propose a practical two-stage CR extraction framework. In the first stage, Alice and Bob employ probabilistic neural network (NN) encoders to map their observations into discrete, nearly uniform random variables (RVs) with high agreement probability.<n>In the second stage, a secure sketch using code-offset construction reconciles the encoder outputs into identical secret keys, whose secrecy is guaranteed by the VPQ objective
  arXiv  Detail & Related papers  (2025-10-02T14:22:21Z)
• Quantum Skyshield: Quantum Key Distribution and Post-Quantum Authentication for Low-Altitude Wireless Networks in Adverse Skies [36.14072181405793]
  Low-altitude wireless networks (LAWNs) have emerged as a critical backbone for supporting the low-altitude economy.<n>To meet growing data demands, some LAWN deployments incorporate free-space optical (FSO) links, which offer exceptional bandwidth and beam directivity.<n>Quantum Skyshield is proposed to enable reliable communication between the base transceiver station (BTS) and LAWN.
  arXiv  Detail & Related papers  (2025-07-20T04:43:33Z)
• Post Quantum Migration of Tor [0.40964539027092917]
  This dissertation proposes an overview of the cryptographic schemes used by Tor.<n>It highlights the non-quantum-resistant ones and introduces theoretical performance assessment methods of a local Tor network.
  arXiv  Detail & Related papers  (2025-03-13T10:28:03Z)
• Secure Multi-Party Biometric Verification using QKD assisted Quantum Oblivious Transfer [34.46964288961048]
  We present a practical implementation of a secure multiparty computation application enabled by quantum oblivious transfer (QOT)<n>The QOT protocol uses polarization-encoded entangled states to share oblivious keys between two parties with quantum key distribution (QKD) providing authentication.<n>A practical use case is demonstrated for privacy-preserving fingerprint matching against no-fly lists from Interpol and the United Nations.
  arXiv  Detail & Related papers  (2025-01-09T15:51:30Z)
• Polynomial Time Cryptanalytic Extraction of Deep Neural Networks in the Hard-Label Setting [45.68094593114181]
  Deep neural networks (DNNs) are valuable assets, yet their public accessibility raises security concerns. This paper introduces new techniques that, for the first time, achieve cryptanalytic extraction of DNN parameters in the most challenging hard-label setting.
  arXiv  Detail & Related papers  (2024-10-08T07:27:55Z)
• High-Rate Point-to-Multipoint Quantum Key Distribution using Coherent States [6.058240259980149]
  Quantum key distribution (QKD) which enables information-theoretically security is now heading towards quantum secure networks. It requires high-performance and cost-effective protocols while increasing the number of users. Here, we show a 'protocol solution' using continuous-variable quantum information.
  arXiv  Detail & Related papers  (2023-02-05T14:21:33Z)
• 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)
• Optimised Multithreaded CV-QKD Reconciliation for Global Quantum Networks [3.4519649635864584]
  Quantum Key Distribution system requires estimation of quantum channel characteristics and extraction of secure key bits. On standard processors, it can take several hours to reconcile the required number of quantum signals. New solution results in a significant increase in the final key rate relative to non-optimised reconciliation.
  arXiv  Detail & Related papers  (2021-08-19T00:43:07Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)

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.