Linear-Time Arguments with Sublinear Verification from Tensor Codes

[1]  Srinath T. V. Setty,et al.  Spartan: Efficient and general-purpose zkSNARKs without trusted setup , 2020, IACR Cryptol. ePrint Arch..

[2]  Ben Fisch,et al.  Transparent SNARKs from DARK Compilers , 2020, IACR Cryptol. ePrint Arch..

[3]  Dawn Xiaodong Song,et al.  Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation , 2019, IACR Cryptol. ePrint Arch..

[4]  Yuval Ishai,et al.  Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs , 2019, CRYPTO.

[5]  Eli Ben-Sasson,et al.  Aurora: Transparent Succinct Arguments for R1CS , 2019, IACR Cryptol. ePrint Arch..

[6]  Jens Groth,et al.  Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution , 2018, IACR Cryptol. ePrint Arch..

[7]  Jens Groth,et al.  Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability , 2017, IACR Cryptol. ePrint Arch..

[8]  Yuval Ishai,et al.  Ligero: Lightweight Sublinear Arguments Without a Trusted Setup , 2017, Designs, Codes and Cryptography.

[9]  Eli Ben-Sasson,et al.  Interactive Oracle Proofs , 2016, TCC.

[10]  Ron Rothblum,et al.  Constant-round interactive proofs for delegating computation , 2016, Electron. Colloquium Comput. Complex..

[11]  Jens Groth,et al.  Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting , 2016, EUROCRYPT.

[12]  Yuval Ishai,et al.  Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications , 2014, ITCS.

[13]  Justin Thaler,et al.  Time-Optimal Interactive Proofs for Circuit Evaluation , 2013, CRYPTO.

[14]  Or Meir,et al.  IP = PSPACE Using Error-Correcting Codes , 2013, SIAM J. Comput..

[15]  Michael Viderman,et al.  A combination of testability and decodability by tensor products , 2011, Random Struct. Algorithms.

[16]  Jens Groth,et al.  Linear Algebra with Sub-linear Zero-Knowledge Arguments , 2009, CRYPTO.

[17]  Eli Ben-Sasson,et al.  Robust locally testable codes and products of codes , 2004, Random Struct. Algorithms.

[18]  Silvio Micali,et al.  Computationally Sound Proofs , 2000, SIAM J. Comput..

[19]  David G. Kirkpatrick,et al.  Addition Requirements for Matrix and Transposed Matrix Products , 1988, J. Algorithms.

[20]  Nicholas Pippenger,et al.  On the Evaluation of Powers and Monomials , 1980, SIAM J. Comput..