Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
From MaRDI portal
Publication:6104342
DOI10.1007/978-3-031-15979-4_15zbMath1515.68143OpenAlexW4312735032MaRDI QIDQ6104342
Publication date: 28 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-15979-4_15
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (7)
SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption ⋮ Registered attribute-based encryption ⋮ Non-interactive universal arguments ⋮ SNARGs for monotone policy batch NP ⋮ Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Correlation intractability and SNARGs from sub-exponential DDH
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synchronized aggregate signatures from the RSA assumption
- The hunting of the SNARK
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- Non-interactive zero knowledge from sub-exponential DDH
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Batch verification and proofs of proximity with polylog overhead
- Non-interactive batch arguments for NP from standard assumptions
- SNARGs for P from sub-exponential DDH and QR
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Somewhere statistical soundness, post-quantum security, and SNARGs
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Programmable Hash Functions in the Multilinear Setting
- Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
- Secure Two-Party Computation with Low Communication
- Universal Signature Aggregators
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
- Perfect Non-interactive Zero Knowledge for NP
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Secure Hybrid Encryption from Weakened Key Encapsulation
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Algebraic methods for interactive proof systems
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Vector Commitments and Their Applications
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Fiat-Shamir: from practice to theory
- How to delegate computations publicly
- How to use indistinguishability obfuscation
- How to delegate computations
- On the existence of extractable one-way functions
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Constant-round interactive proofs for delegating computation
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Delegation for bounded space
- Theory of Cryptography
- On the Size of Pairing-Based Non-interactive Arguments
- Public Key Cryptography - PKC 2006
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG
This page was built for publication: Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
