Succinct non-interactive arguments via linear interactive proofs

Recommendations

Succinct non-interactive arguments via linear interactive proofs
Quasi-optimal SNARGs via linear multi-prover interactive proofs
On succinct arguments and witness encryption from groups
On the size of pairing-based non-interactive arguments
Succinct arguments from multi-prover interactive proofs and their efficiency benefits

Cites work

scientific article; zbMATH DE number 1670844 (Why is no real title available?)
scientific article; zbMATH DE number 5485522 (Why is no real title available?)
scientific article; zbMATH DE number 176566 (Why is no real title available?)
scientific article; zbMATH DE number 3557235 (Why is no real title available?)
scientific article; zbMATH DE number 3597878 (Why is no real title available?)
scientific article; zbMATH DE number 1302862 (Why is no real title available?)
scientific article; zbMATH DE number 708807 (Why is no real title available?)
scientific article; zbMATH DE number 1559563 (Why is no real title available?)
A New Algorithm for Factoring Polynomials Over Finite Fields
A public key cryptosystem and a signature scheme based on discrete logarithms
Advances in Cryptology - CRYPTO 2003
Advances in Cryptology – CRYPTO 2004
Automata, Languages and Programming
Combinatorial PCPs with short proofs
Computationally Sound Proofs
Deterministic extractors for affine sources over large fields
Does co-NP have short interactive proofs ?
Efficient Fully Homomorphic Encryption from (Standard) LWE
Extractors and rank extractors for polynomial sources
Factoring Polynomials Over Large Finite Fields
Factoring polynomials over finite fields: A survey
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
From secrecy to soundness: efficient verification via secure computation (extended abstract)
Hiding information and signatures in trapdoor knapsacks
Homomorphic encryption: from private-key to public-key
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
IP = PSPACE
Improved delegation of computation using fully homomorphic encryption
Interactive PCP
Interactive proofs and the hardness of approximating cliques
Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
Locally testable codes and PCPs of almost-linear length
Minimum disclosure proofs of knowledge
Nearly-linear size holographic proofs
Non-interactive verifiable computing: outsourcing computation to untrusted workers
On ideal lattices and learning with errors over rings
On interactive proofs with a laconic prover
On lattices, learning with errors, random linear codes, and cryptography
On polynomial systems arising from a Weil descent
On succinct arguments and witness encryption from groups
On the complexity of interactive proofs with bounded communication
On the concrete efficiency of probabilistically-checkable proofs
On the size of pairing-based non-interactive arguments
Pairing-Friendly Elliptic Curves of Prime Order
Perfect NIZK with Adaptive Soundness
Polylogarithmic two-round argument systems
Practical verified computation with streaming interactive proofs
Probabilistic checking of proofs
Probabilistic encryption
Probabilistically Checkable Arguments
Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
Proof verification and the hardness of approximation problems
Pseudorandom bits for polynomials
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Quadratic span programs and succinct NIZKs without PCPs
Query efficient PCPs with perfect completeness
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
Recursive composition and bootstrapping for SNARKs and proof-carrying data
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
Robust PSPs of proximity, shorter PSPs and applications to coding
Secure two-party computation with low communication
Separating succinct non-interactive arguments from all falsifiable assumptions
Short PCPs with Polylog Query Complexity
Short pairing-based non-interactive zero-knowledge arguments
Small PCPs with low query complexity
Small-Bias Probability Spaces: Efficient Constructions and Applications
Sound 3-query PCPPs are long
Square span programs with applications to succinct NIZK arguments
Succinct NP Proofs from an Extractability Assumption
Succinct arguments from multi-prover interactive proofs and their efficiency benefits
Targeted malleability: homomorphic encryption for restricted computations
The Knowledge Complexity of Interactive Proof Systems
The PCP theorem by gap amplification
The hunting of the SNARK
The power of distributed verifiers in interactive proofs
Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
Transparent SNARKs from DARK compilers
Two protocols for delegation of computation
Two-query PCP with subconstant error
Universal Arguments and their Applications
Verifiable delegation of computation over large datasets
Witness encryption and its applications
Zero-knowledge proofs on secret-shared data via fully linear PCPs

Cited in

(7)

Succinct non-interactive arguments via linear interactive proofs
Linear-time arguments with sublinear verification from tensor codes
On the size of pairing-based non-interactive arguments
Quasi-optimal SNARGs via linear multi-prover interactive proofs
Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
Succinct arguments from multi-prover interactive proofs and their efficiency benefits
On succinct arguments and witness encryption from groups

This page was built for publication: Succinct non-interactive arguments via linear interactive proofs

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