Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors

DOI10.1007/978-3-031-48621-0_12MaRDI QIDQ6582222zbMATH OpenFDO

Authors Susumu Kiyoshima

Publication date 2 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48621-0_12

zbMATH Keywords

public-coin 3-round zero-knowledgesuccinct non-interactive argument

Mathematics Subject Classification ID

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

Recommendations

• Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
• Lattice-based zero-knowledge SNARGs for arithmetic circuits
• SNARGs for monotone policy batch NP
• SNARGs for P from sub-exponential DDH and QR
• Adaptively sound zero-knowledge SNARKs for UP

Cites work

• \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
• A hierarchy theorem for interactive proofs of proximity
• Advances in Cryptology – CRYPTO 2004
• Arguments of proximity (extended abstract)
• Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
• Delegating computation: interactive proofs for muggles
• Delegating RAM Computations
• Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
• How to delegate computations publicly
• How to Delegate Computations: The Power of No-Signaling Proofs
• Interactive proofs of proximity: delegating computation in sublinear time
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Memory delegation
• 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 the communication complexity of secure function evaluation with long output
• Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
• SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
• SNARGs for P from sub-exponential DDH and QR
• Somewhere statistical soundness, post-quantum security, and SNARGs
• Succinct delegation for low-space non-deterministic computation
• The random oracle methodology, revisited.

Cited in

(3)

• SNARGs for monotone policy batch NP
• Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
• Black-box timed commitments from time-lock puzzles

This page was built for publication: Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors

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