One-way functions vs. TFNP: Simpler and improved
From MaRDI portal
Cites work
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Can PPAD hardness be based on standard cryptographic assumptions?
- Delegation with updatable unambiguous proofs and PPAD-hardness
- Equilibria, fixed points, and computational complexity -- Nevanlinna prize lecture
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- From minicrypt to obfustopia via private-key functional encryption
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- How easy is local search?
- scientific article; zbMATH DE number 1303133 (Why is no real title available?)
- scientific article; zbMATH DE number 7650354 (Why is no real title available?)
- Integer factoring and modular square roots
- On average-case hardness in \textsf{TFNP} from one-way functions
- On the complexity of finding falsifying assignments for Herbrand disjunctions
- On the complexity of the parity argument and other inefficient proofs of existence
- On the cryptographic hardness of finding a Nash equilibrium
- On total functions, existence theorems and computational complexity
- PPAD is as hard as LWE and iterated squaring
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- Structure versus hardness through the obfuscation lens
- The journey from NP to TFNP hardness
- The theory of hash functions and random oracles. An approach to modern cryptography
- Theory of Cryptography
- White-box vs. black-box complexity of search problems: Ramsey and graph property testing
This page was built for publication: One-way functions vs. TFNP: Simpler and improved
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906381)
