Learn More
A major consideration we had in writing this survey was to make it accessible to mathematicians as well as to computer scientists, since expander graphs, the protagonists of our story, come up in numerous and often surprising contexts in both fields. But, perhaps, we should start with a few words about graphs in general. They are, of course, one of the(More)
Given two independent weak random sources X, Y , with the same length ℓ and min-entropies bX , bY whose sum is greater than ℓ + Ω(polylog(ℓ/ε)), we construct a deterministic two-source extractor (aka " blender ") that extracts max(bX , bY) + (bX + bY − ℓ − 4 log(1/ε)) bits which are ε-close to uniform. In contrast, best previously published construction [4](More)
We consider a new model for online secure computation on encrypted inputs in the presence of malicious adversaries. The inputs are independent of the circuit computed in the sense that they can be contributed by separate third parties. The model attempts to emulate as closely as possible the model of " Computing with Encrypted Data " that was put forth in(More)
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can allow low latency (that is, small round) secure multi-party protocols that are universally-composable (UC). In particular, we allow any polynomial time preprocessing as long as(More)
We consider a natural framework of learning from correlated data, in which successive examples used for learning are generated according to a random walk over the space of possible examples. Previous research has suggested that the Random Walk model is more powerful than comparable standard models of learning from independent examples , by exhibiting(More)
  • 1