Skip to content

Back to the catalog

Hybrid Quantum–Computational Key Distribution with Reduced Assumptions (Short Paper)
eprint.iacr.orgpaper

Hybrid Quantum–Computational Key Distribution with Reduced Assumptions (Short Paper)

Short paper analysing the HM-QCT hybrid quantum–computational time-lock QKD protocol (Mazzoncini et al., 2025). It spells out the two "harvest now, decrypt later" strategies (quantum memory and classical memory) and shows each is excluded by exactly one of the two assumptions: short-term encryption and low-fidelity quantum storage. It then proposes HM-PRF, which replaces the short-term encryption with a locally evaluated pseudorandom function, so security needs only one-way functions rather than a predicted lasting gap in quantum memory technology.

TL;DR HM-PRF variant of the HM-QCT hybrid QKD protocol replaces time-limited encryption with a PRF, so harvest-now-decrypt-later resistance needs only one-way functions.
Open original ↗

Organisations named here

  • harvest now, decrypt later
  • noisy-storage model
  • quantum–computational time-lock

Technologies named here

  • HM-PRF
  • HM-QCT protocol
  • HM-QCT

Techniques named here

  • Time-release encryption
  • Hidden matching problem
  • Hybrid quantum–computational time-lock security model

Related in other