Model: other

Statements with model: other. This page only exists because at least one statement currently uses this value – if you add a statement with a new model value not listed under Problems, copy this page as the starting point for its facet page (see CONTRIBUTING.md).

Status Statement Tags
– Constant-round Luby–Rackoff, quantum
Open for every round count: whether some constant number of Luby-Rackoff rounds with random round functions is indistinguishable from a random invertible permutation against quantum queries in both directions. Four rounds are refuted by a known quantum attack, and the source reports that the published proof of the weaker forward-only four-round claim is flawed. 6 open 		otherequivalenceresearch-opennew-idea (ai)
– CRS-free everlasting commitment from malicious PUFs
Open: whether everlasting UC commitment is achievable in the fully malicious token model with no trusted setup. The source achieves it with a common reference string (its Theorem 31) and explicitly leaves removing the CRS as a question, noting that the usual equivocation techniques do not transfer to the everlasting setting. 6 open 		otherassumptionresearch-opennew-idea (ai)
– 6-round Feistel indifferentiability
Whether 6-round Feistel is fully indifferentiable from a random permutation is open, bridging the proven r=5 attack and the proven r>=8 construction. 2 open 		othertight-boundresearch-opennew-idea (ai)
– Double-sided zero search
Open: whether finding x with H(x||0^n) = y||0^n is hard for a quantum adversary with polynomially many queries to a random permutation H and its inverse. The source proves it only under its own compressed-permutation-oracle soundness conjecture, as a usage example. 6 open 		otherlower-boundresearch-opennew-idea (ai)
– No key agreement from GC-OWF
Open for round complexity growing with the security parameter. Proved in full for two messages, which is public-key encryption; the constant-round extension is sketched in the paper’s appendix without a theorem, its security half deferred to the PKE proof. 5 open 		otherseparationresearch-openadaptation (ai)
– OWFs are black-box useless for key agreement
Open in the general case, which the paper names as the central open problem left by its work. Settled for three restricted protocol classes: constant-query perfect, constant-round constant-query imperfect, and Merkle-type. 6 open 		otherimpossibilityresearch-opennew-idea (ai)
– OWFs are black-box helpful for CRHFs
Open in both directions. Two relaxations — distributional and class-reduction helpfulness — are proved conditional on the Simon-oracle amplification conjecture; neither yields the universal auxiliary primitive the full statement needs. 5 open 		otherseparationresearch-opennew-idea (ai)
– Simon-oracle amplification, strong version
Open. The version without the collision finder is known only when the one-way function is itself a random oracle; with an arbitrary one-way function, with or without the collision finder, nothing is established. 5 open 		otherlower-boundresearch-opennew-idea (ai)
– Compressed permutation oracle soundness
Open: whether the compressed permutation oracle is indistinguishable from a random permutation with inverse access, against polynomially many quantum queries. The source defines the oracle and proves only a conditional converse; the statement itself is settled nowhere. 5 open 		otherequivalenceresearch-opennew-idea (ai)
No matching items