14 citations · 20 across the 3 of their papers we have counts for
3 papers
cs.CC2016★ 2 cited
On Probabilistic Checking in Perfect Zero Knowledge
Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes +3
We present the first constructions of single-prover proof systems that achieve perfect zero knowledge (PZK) for languages beyond NP, under no intractability assumptions: 1. The com…
cs.IT2014★ 4 cited
Subspace Polynomials and Cyclic Subspace Codes
Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon +1
Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possib…
cs.CC2010★ 14 cited
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions
Eli Ben-Sasson, Jakob Nordström
For current state-of-the-art DPLL SAT-solvers the two main bottlenecks are the amounts of time and memory used. In proof complexity, these resources correspond to the length and sp…