Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
type: Item
instance of: scholarly article
title: Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
zbMATH Open document ID: 1504.94168
DOI: 10.1007/978-3-030-56877-1_22
author: Alex Lombardi
author: Vinod Vaikuntanathan
publication date: 2022-12-07T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7627836
zbMATH Keywords: Fiat-Shamir transform
zbMATH Keywords: succinct interactive proof system
MaRDI profile type: Publication
full work available at URL: 978-3-030-56877-1 22
OpenAlex ID: W3037017048
cites work: Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
cites work: Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling
cites work: Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
cites work: Verifiable delay functions
cites work: On the (In)security of Kilian-based SNARGs
cites work: Interactive Oracle Proofs
cites work: Candidate iO from homomorphic encryption schemes
cites work: Statistical ZAP arguments
cites work: Q5875699
cites work: Q4783716
cites work: Classical hardness of learning with errors
cites work: Tuple lattice sieving
cites work: Q3826476
cites work: Lower bounds for non-black-box zero knowledge
cites work: Fiat-Shamir: from practice to theory
cites work: On the Correlation Intractability of Obfuscated Pseudorandom Functions
cites work: Fiat-Shamir and correlation intractability from strong KDM-secure encryption
cites work: Settling the complexity of computing two-player Nash equilibria
cites work: On a problem of Oppenheim concerning ''Factorisatio Numerorum''
cites work: Resettable zero-knowledge (extended abstract)
cites work: The random oracle methodology, revisited
cites work: Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
cites work: Verifiable delay functions from supersingular isogenies and pairings
cites work: The Complexity of Computing a Nash Equilibrium
cites work: Asymptotically Fast Factorization of Integers
cites work: Magic Functions
cites work: Q5365081
cites work: Continuous verifiable delay functions
cites work: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Candidate indistinguishability obfuscation and functional encryption for all circuits
cites work: Q3549691
cites work: The knowledge complexity of interactive proof-systems
cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
cites work: Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
cites work: Q3615925
cites work: Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
cites work: How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
cites work: The Past, Evolving Present, and Future of the Discrete Logarithm
cites work: How to delegate computations publicly
cites work: Delegation with updatable unambiguous proofs and PPAD-hardness
cites work: From obfuscation to the security of Fiat-Shamir for proofs
cites work: Algebraic methods for interactive proof systems
cites work: Computationally Sound Proofs
cites work: Advances in Cryptology - CRYPTO 2003
cites work: On the complexity of the parity argument and other inefficient proofs of existence
cites work: A decade of lattice cryptography
cites work: Simple verifiable delay functions
cites work: Q3808150
cites work: Pseudorandomness of ring-LWE for any ring and modulus
cites work: Security Proofs for Signature Schemes
cites work: Noninteractive zero knowledge for NP from (Plain) Learning With Errors
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Constant-Round Interactive Proofs for Delegating Computation
cites work: Q3210171
cites work: Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
cites work: Efficient verifiable delay functions
description: scientific article; zbMATH DE number 7627836