Non-interactive batch arguments for NP from standard assumptions
From MaRDI portal
Publication:2139642
DOI10.1007/978-3-030-84259-8_14zbMATH Open1486.68079OpenAlexW3157193347MaRDI QIDQ2139642FDOQ2139642
Arka Rai Choudhuri, Abhishek Jain, Zhengzhong Jin
Publication date: 18 May 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84259-8_14
Recommendations
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Perfect Non-interactive Zero Knowledge for NP
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The random oracle methodology, revisited
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Advances in Cryptology - CRYPTO 2003
- On interactive proofs with a laconic prover
- On the complexity of interactive proofs with bounded communication
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Algebraic methods for interactive proof systems
- IP = PSPACE
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Secure Two-Party Computation with Low Communication
- Title not available (Why is that?)
- Trapdoor functions from the computational Diffie-Hellman assumption
- Batch verification of short signatures
- Title not available (Why is that?)
- Identity-based encryption from the Diffie-Hellman assumption
- How to delegate computations publicly
- Constant-round interactive proofs for delegating computation
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Anonymous IBE, leakage resilience and circular security from new assumptions
- New constructions of identity-based and key-dependent message secure encryption schemes
- New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- From obfuscation to the security of Fiat-Shamir for proofs
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Trapdoor hash functions and their applications
- Non-interactive zero knowledge from sub-exponential DDH
- Public-coin statistical zero-knowledge batch verification against malicious verifiers
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Batch verification for statistical zero knowledge proofs
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Fiat-Shamir: from practice to theory
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
- On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- On the (In)security of Kilian-based SNARGs
- Batch verification and proofs of proximity with polylog overhead
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
Cited In (26)
- Batch Processing of Interactive Proofs
- A simple and efficient framework of proof systems for NP
- Non-interactive universal arguments
- SNARGs for monotone policy batch NP
- Locally verifiable distributed SNARGs
- On black-box verifiable outsourcing
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
- Triply adaptive UC NIZK
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Non-interactive zero-knowledge from non-interactive batch arguments
- Non-interactive publicly-verifiable delegation of committed programs
- On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles
- Correlation intractability and SNARGs from sub-exponential DDH
- Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- PPAD is as hard as LWE and iterated squaring
- SNARGs for P from sub-exponential DDH and QR
- Rate-1 fully local somewhere extractable hashing from DDH
- Monotone-policy aggregate signatures
- Strong batching for non-interactive statistical zero-knowledge
- Fully-succinct multi-key homomorphic signatures from standard assumptions
- Non-interactive zero-knowledge from LPN and MQ
- Boosting batch arguments and RAM delegation
- Constant-round arguments from one-way functions
- When Arthur has neither random coins nor time to spare: superfast derandomization of proof systems
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
Uses Software
This page was built for publication: Non-interactive batch arguments for NP from standard assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139642)
