Non-interactive universal arguments

DOI10.1007/978-3-031-38545-2_5MaRDI QIDQ6145782zbMATH OpenOpenAlexFDO

Authors Nir Bitansky, Omer Paneth, Tomer Solomon

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

zbMATH Keywords

proofs of knowledgezero-knowledge proof systemsprobabilistic proof systemscomputationally sound proof systemsprobabilistic checkable proofs

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Universal Arguments and their Applications
• Non-interactive batch arguments for NP from standard assumptions
• Separating succinct non-interactive arguments from all falsifiable assumptions
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• The hunting of the SNARK

Cites work

• scientific article; zbMATH DE number 708802 (Why is no real title available?)
• scientific article; zbMATH DE number 2019635 (Why is no real title available?)
• scientific article; zbMATH DE number 7650354 (Why is no real title available?)
• A Pseudorandom Generator from any One-way Function
• A simple construction of iO for Turing machines
• Adaptively secure and succinct functional encryption: improving security and efficiency, simultaneously
• Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
• Collision-resistance from multi-collision-resistance
• Concurrent Nonmalleable Commitments
• Delegation with updatable unambiguous proofs and PPAD-hardness
• How easy is local search?
• How to delegate computations
• How to delegate computations publicly
• Improved delegation of computation using fully homomorphic encryption
• Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
• Multi-collision resistance: a paradigm for keyless hash functions
• Non-interactive batch arguments for NP from standard assumptions
• Non-interactive delegation and batch NP verification from standard computational assumptions
• On distributional collision resistant hashing
• On the complexity of k-SAT
• On the complexity of the parity argument and other inefficient proofs of existence
• PPAD is as hard as LWE and iterated squaring
• Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
• Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
• SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Succinct garbling schemes from functional encryption through a local simulation paradigm
• The complexity of gradient descent: CLS = PPAD ∩ PLS
• Time-lock puzzles from randomized encodings
• Universal Arguments and their Applications
• Which problems have strongly exponential complexity?

This page was built for publication: Non-interactive universal arguments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6145782)