The garden-hose model (2013)

doi.orgsite

Studies attacks on $f$-routing and introduces garden-hose complexity to connect attacks on $f$-routing to complexity theory. Provides many first results regarding that connection, for example that any $f \in \mathsf{L}$ (with pre-processing) can be attacked efficiently.

from

Position-Based Quantum Cryptography

added

2026-10-10

likes

0

Position-Based Quantum Cryptography › First Protocols > $f$-routing: “Studies attacks on $f$-routing and introduces garden-hose complexity to connect attacks on $f$-routing to complexity theory. Provides many first results regarding that connection, for example that any $f \in \mathsf{L}$ (with pre-processing) can be attacked efficiently.”