Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
From MaRDI portal
Publication:2104234
DOI10.1007/978-3-030-56877-1_22zbMath1504.94168OpenAlexW3037017048MaRDI QIDQ2104234
Vinod Vaikuntanathan, Alex Lombardi
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56877-1_22
Related Items (11)
Does Fiat-Shamir require a cryptographic hash function? ⋮ Non-interactive batch arguments for NP from standard assumptions ⋮ 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 ⋮ Simple and efficient batch verification techniques for verifiable delay functions ⋮ Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds ⋮ Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a problem of Oppenheim concerning Factorisatio Numerorum
- On the complexity of the parity argument and other inefficient proofs of existence
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Verifiable delay functions
- From obfuscation to the security of Fiat-Shamir for proofs
- Candidate iO from homomorphic encryption schemes
- Continuous verifiable delay functions
- Statistical ZAP arguments
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Delegation with updatable unambiguous proofs and PPAD-hardness
- On the (In)security of Kilian-based SNARGs
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Verifiable delay functions from supersingular isogenies and pairings
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Lower bounds for non-black-box zero knowledge
- On the Correlation Intractability of Obfuscated Pseudorandom Functions
- A Decade of Lattice Cryptography
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Security Proofs for Signature Schemes
- Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling
- Tuple lattice sieving
- The random oracle methodology, revisited
- Interactive Oracle Proofs
- Resettable zero-knowledge (extended abstract)
- Settling the complexity of computing two-player Nash equilibria
- Magic Functions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Asymptotically Fast Factorization of Integers
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Algebraic methods for interactive proof systems
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- The knowledge complexity of interactive proof-systems
- Computationally Sound Proofs
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
- Pseudorandomness of ring-LWE for any ring and modulus
- Constant-Round Interactive Proofs for Delegating Computation
- Simple verifiable delay functions
- The Complexity of Computing a Nash Equilibrium
- Fiat-Shamir: from practice to theory
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
- How to delegate computations publicly
- The Past, Evolving Present, and Future of the Discrete Logarithm
- Advances in Cryptology - CRYPTO 2003
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Classical hardness of learning with errors
- On lattices, learning with errors, random linear codes, and cryptography
- Efficient verifiable delay functions
This page was built for publication: Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
