Ligero: lightweight sublinear arguments without a trusted setup (Q6063128): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10623-023-01222-8
+Normal rank
@@ Property / OpenAlex ID @@
+W4384200977
@@ Property / OpenAlex ID: W4384200977 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4638056
@@ Property / cites work: Q4638056 / rank @@
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Locally computable UOWHF with linear shrinkage
@@ Property / cites work: Locally computable UOWHF with linear shrinkage / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic checking of proofs
@@ Property / cites work: Probabilistic checking of proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Integrity with a Public Random String from Quasi-Linear PCPs
+Normal rank
@@ Property / cites work @@
+Fast Reed-Solomon Interactive Oracle Proofs of Proximity
+Normal rank
@@ Property / cites work @@
+Scalable zero knowledge with no trusted setup
@@ Property / cites work: Scalable zero knowledge with no trusted setup / rank @@
+Normal rank
@@ Property / cites work @@
+On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
+Normal rank
@@ Property / cites work @@
+Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
+Normal rank
@@ Property / cites work @@
+Recursive composition and bootstrapping for SNARKS and proof-carrying data
+Normal rank
@@ Property / cites work @@
+Q5111371
@@ Property / cites work: Q5111371 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
+Normal rank
@@ Property / cites work @@
+Linear-time arguments with sublinear verification from tensor codes
+Normal rank
@@ Property / cites work @@
+On the concrete efficiency of probabilistically-checkable proofs
+Normal rank
@@ Property / cites work @@
+Succinct Non-interactive Arguments via Linear Interactive Proofs
+Normal rank
@@ Property / cites work @@
+Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
+Normal rank
@@ Property / cites work @@
+Recursive proof composition from accumulation schemes
+Normal rank
@@ Property / cites work @@
+Aurora: transparent succinct arguments for R1CS
@@ Property / cites work: Aurora: transparent succinct arguments for R1CS / rank @@
+Normal rank
@@ Property / cites work @@
+Interactive Oracle Proofs
@@ Property / cites work: Interactive Oracle Proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5875697
@@ Property / cites work: Q5875697 / rank @@
+Normal rank
@@ Property / cites work @@
+Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
+Normal rank
@@ Property / cites work @@
+Time- and space-efficient arguments from groups of unknown order
+Normal rank
@@ Property / cites work @@
+On linear-size pseudorandom generators and hardcore functions
+Normal rank
@@ Property / cites work @@
+Exploring crypto dark matter: new simple PRF candidates and their applications
+Normal rank
@@ Property / cites work @@
+Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
+Normal rank
@@ Property / cites work @@
+Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
+Normal rank
@@ Property / cites work @@
+Fiat-Shamir: from practice to theory
@@ Property / cites work: Fiat-Shamir: from practice to theory / rank @@
+Normal rank
@@ Property / cites work @@
+Practical verified computation with streaming interactive proofs
+Normal rank
@@ Property / cites work @@
+\textsc{Fractal}: post-quantum and transparent recursive proofs from holography
+Normal rank
@@ Property / cites work @@
+Scalable Secure Multiparty Computation
@@ Property / cites work: Scalable Secure Multiparty Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
+Normal rank
@@ Property / cites work @@
+BBQ: using AES in Picnic signatures
@@ Property / cites work: BBQ: using AES in Picnic signatures / rank @@
+Normal rank
@@ Property / cites work @@
+SPARKs: succinct parallelizable arguments of knowledge
+Normal rank
@@ Property / cites work @@
+How To Prove Yourself: Practical Solutions to Identification and Signature Problems
+Normal rank
@@ Property / cites work @@
+Quadratic Span Programs and Succinct NIZKs without PCPs
+Normal rank
@@ Property / cites work @@
+Q3549691
@@ Property / cites work: Q3549691 / rank @@
+Normal rank
@@ Property / cites work @@
+Delegating Computation
@@ Property / cites work: Delegating Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Additive Fast Fourier Transforms Over Finite Fields
+Normal rank
@@ Property / cites work @@
+The knowledge complexity of interactive proof-systems
+Normal rank
@@ Property / cites work @@
+Linear Algebra with Sub-linear Zero-Knowledge Arguments
+Normal rank
@@ Property / cites work @@
+Short Pairing-Based Non-interactive Zero-Knowledge Arguments
+Normal rank
@@ Property / cites work @@
+BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
+Normal rank
@@ Property / cites work @@
+Faster sounder succinct arguments and \textsf{IOP}s
+Normal rank
@@ Property / cites work @@
+Q3549593
@@ Property / cites work: Q3549593 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549728
@@ Property / cites work: Q3549728 / rank @@
+Normal rank
@@ Property / cites work @@
+Zero-Knowledge Proofs from Secure Multiparty Computation
+Normal rank
@@ Property / cites work @@
+On Efficient Zero-Knowledge PCPs
@@ Property / cites work: On Efficient Zero-Knowledge PCPs / rank @@
+Normal rank
@@ Property / cites work @@
+Founding Cryptography on Oblivious Transfer – Efficiently
+Normal rank
@@ Property / cites work @@
+Secure Arithmetic Computation with No Honest Majority
+Normal rank
@@ Property / cites work @@
+Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
+Normal rank
@@ Property / cites work @@
+Interactive PCP
@@ Property / cites work: Interactive PCP / rank @@
+Normal rank
@@ Property / cites work @@
+Algebraic methods for interactive proof systems
@@ Property / cites work: Algebraic methods for interactive proof systems / rank @@
+Normal rank
@@ Property / cites work @@
+Nearly-linear size holographic proofs
@@ Property / cites work: Nearly-linear size holographic proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Constant-round interactive proofs for delegating computation
+Normal rank
@@ Property / cites work @@
+Spartan: efficient and general-purpose zkSNARKs without trusted setup
+Normal rank
@@ Property / cites work @@
+Time-Optimal Interactive Proofs for Circuit Evaluation
+Normal rank
@@ Property / cites work @@
+Libra: succinct zero-knowledge proofs with optimal prover computation
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6063128