Non-interactive universal arguments
From MaRDI portal
Publication:6145782
DOI10.1007/978-3-031-38545-2_5OpenAlexW4385654250MaRDI QIDQ6145782
Omer Paneth, Tomer Solomon, Unnamed Author, Nir Bitansky
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38545-2_5
proofs of knowledgezero-knowledge proof systemsprobabilistic proof systemscomputationally sound proof systemsprobabilistic checkable proofs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How easy is local search?
- On the complexity of the parity argument and other inefficient proofs of existence
- Which problems have strongly exponential complexity?
- A simple construction of iO for Turing machines
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- On distributional collision resistant hashing
- Delegation with updatable unambiguous proofs and PPAD-hardness
- Non-interactive batch arguments for NP from standard assumptions
- Adaptively secure and succinct functional encryption: improving security and efficiency, simultaneously
- Time-Lock Puzzles from Randomized Encodings
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Concurrent Nonmalleable Commitments
- Improved Delegation of Computation Using Fully Homomorphic Encryption
- Universal Arguments and their Applications
- A Pseudorandom Generator from any One-way Function
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
- How to delegate computations publicly
- Multi-collision resistance: a paradigm for keyless hash functions
- How to delegate computations
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- On the complexity of \(k\)-SAT
- The complexity of gradient descent: CLS = PPAD ∩ PLS
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Collision-resistance from multi-collision-resistance
- PPAD is as hard as LWE and iterated squaring
