4 citations · 8 across the 3 of their papers we have counts for
3 papers
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…
Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints
Ariel Gabizon, Daniel Lokshtanov, Michal Pilipczuk
In parameterized complexity, it is a natural idea to consider different generalizations of classic problems. Usually, such generalization are obtained by introducing a "relaxation"…
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…