52 citations · 160 across the 14 of their papers we have counts for
16 papers
Good Quantum Locally Testable Codes from Lossless Cubical Complexes
Itay Cohen, Itai Leigh, Assaf Reiner +2
Sipser and Spielman constructed LDPC codes from either bipartite \emph{spectral} expanders or one-sided \emph{lossless} expanders. In higher dimensions, \emph{spectral} expansion s…
List Decoding with Double Samplers
Irit Dinur, Prahladh Harsha, Tali Kaufman +2
We strengthen the notion of "double samplers", first introduced by Dinur and Kaufman [Proc. 58th FOCS, 2017], which are samplers with additional combinatorial properties, and whose…
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy
Ishay Haviv, Oded Regev, Amnon Ta-Shma
$ \newcommand{\eps}ε \newcommand{\NP}{\mathsf{NP}} \newcommand{\YES}{\mathsf{YES}} \newcommand{\NO}{\mathsf{NO}} \newcommand{\myminus}{\text{-}}\newcommand{\Bsat}{\mathsf{B}} \newc…
Limits of privacy amplification against non-signalling memory attacks
Rotem Arnon, Amnon Ta-Shma
The task of privacy amplification, in which Alice holds some partially secret information with respect to an adversary Eve and wishes to distill it until it is completely secret, i…
Towards the Impossibility of Non-Signalling Privacy Amplification from Time-Like Ordering Constraints
Rotem Arnon, Esther Hänggi, Amnon Ta-Shma
In the past few years there was a growing interest in proving the security of cryptographic protocols, such as key distribution protocols, from the sole assumption that the systems…
Better short-seed quantum-proof extractors
Avraham Ben-Aroya, Amnon Ta-Shma
We construct a strong extractor against quantum storage that works for every min-entropy , has logarithmic seed length, and outputs bits, provided that the quantum advers…