How to use nondeterminism in cryptography
From MaRDI portal
Cites work
- A cryptanalytic time-memory trade-off
- A Pseudorandom Generator from any One-way Function
- Advances in Cryptology - CRYPTO 2003
- Amplifying Collision Resistance: A Complexity-Theoretic Treatment
- Bounded fixed-parameter tractability and \(\log^{2} n\) nondeterministic bits
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions
- Counterexamples to hardness amplification beyond negligible
- Counting unpredictable bits: a simple PRG from one-way functions
- Extracting randomness from samplable distributions
- Improving exhaustive search implies superpolynomial lower bounds
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (extended abstract)
- Nondeterministic direct product reductions and the success probability of SAT solvers
- On the Power of the Randomized Iterate
- On the structure of parameterized problems in NP
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
- Qualitative relativizations of complexity classes
- Quantitative Relativizations of Complexity Classes
- The complexity theory companion
- The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
- The non-uniform perebor conjecture for time-bounded Kolmogorov complexity is false
- Using nondeterminism to amplify hardness
This page was built for publication: How to use nondeterminism in cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445528)