Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
From MaRDI portal
Publication:2104234
Recommendations
Cites work
- A decade of lattice cryptography
- Advances in Cryptology - CRYPTO 2003
- Algebraic methods for interactive proof systems
- Asymptotically Fast Factorization of Integers
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate iO from homomorphic encryption schemes
- Classical hardness of learning with errors
- Computationally Sound Proofs
- Constant-round interactive proofs for delegating computation
- Continuous verifiable delay functions
- Delegation with updatable unambiguous proofs and PPAD-hardness
- Efficient verifiable delay functions
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Fiat-Shamir: from practice to theory
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
- From obfuscation to the security of Fiat-Shamir for proofs
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- How to delegate computations publicly
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- scientific article; zbMATH DE number 4077312 (Why is no real title available?)
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 6783433 (Why is no real title available?)
- scientific article; zbMATH DE number 7650354 (Why is no real title available?)
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Interactive oracle proofs
- Lower bounds for non-black-box zero knowledge
- Magic functions
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On a problem of Oppenheim concerning Factorisatio Numerorum
- On lattices, learning with errors, random linear codes, and cryptography
- On the (In)security of Kilian-based SNARGs
- On the complexity of the parity argument and other inefficient proofs of existence
- On the correlation intractability of obfuscated pseudorandom functions
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Pseudorandomness of ring-LWE for any ring and modulus
- Resettable zero-knowledge (extended abstract)
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Security proofs for signature schemes
- Settling the complexity of computing two-player Nash equilibria
- Simple verifiable delay functions
- Smooth numbers: computational number theory and beyond
- Solving the shortest vector problem in 2ⁿ time using discrete Gaussian sampling (extended abstract)
- Statistical ZAP arguments
- The complexity of computing a Nash equilibrium
- The knowledge complexity of interactive proof-systems
- The past, evolving present, and future of the discrete logarithm
- The random oracle methodology, revisited.
- Tuple lattice sieving
- Verifiable delay functions
- Verifiable delay functions from supersingular isogenies and pairings
Cited in
(23)- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Does Fiat-Shamir require a cryptographic hash function?
- Non-interactive batch arguments for NP from standard assumptions
- Simple and efficient batch verification techniques for verifiable delay functions
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- Certifying giant nonprimes
- Practical statistically-sound proofs of exponentiation in any group
- Parallelizable delegation from LWE
- PPAD is as hard as LWE and iterated squaring
- Correlation intractability and SNARGs from sub-exponential DDH
- (Verifiable) delay functions from Lucas sequences
- The cost of statistical security in proofs for repeated squaring
- Breaking verifiable delay functions in the random oracle model
- Sometimes-decryptable homomorphic encryption from sub-exponential DDH
- Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- One-way functions vs. TFNP: Simpler and improved
- On the black-box complexity of correlation intractability
- Homomorphic secret sharing with verifiable evaluation
- Indistinguishability obfuscation from well-founded assumptions
- Impossibility of VDFs in the ROM: the complete picture
- Separating verifiable delay functions and time-lock puzzles
- On verifiable delay functions from time-lock puzzles
This page was built for publication: Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104234)
