Relating non-local quantum computation to information theoretic cryptography (2023)

doi.orgsite

Connects $f$-routing to topics in classical cryptography, in particular conditional disclosure of secrets. Shows a sub-exponential upper bound for attacks for any $f$ and finds an $f$ that is believed to be outside of $\mathsf{P}$ (with pre-processing), but efficiently attacked.

from

Position-Based Quantum Cryptography

added

2026-10-10

likes

0

Position-Based Quantum Cryptography › First Protocols > $f$-routing: “Connects $f$-routing to topics in classical cryptography, in particular conditional disclosure of secrets. Shows a sub-exponential upper bound for attacks for any $f$ and finds an $f$ that is believed to be outside of $\mathsf{P}$ (with pre-processing), but efficiently attacked.”