activity
20082015
most citedLearning Low-Density Separators

11 citations · 28 across the 5 of their papers we have counts for

collaborators

5 papers

quant-ph2015★ 8 cited

Quantifying the Leakage of Quantum Protocols for Classical Two-Party Cryptography

Louis Salvail, Christian Schaffner, Miroslava Sotakova

We study quantum protocols among two distrustful parties. By adopting a rather strict definition of correctness - guaranteeing that honest players obtain their correct outcomes onl…

quant-ph2009★ 4 cited

Two-Party Quantum Protocols Do Not Compose Securely Against Honest-But-Curious Adversaries

Louis Salvail, Miroslava Sotakova

In this paper, we build upon the model of two-party quantum computation introduced by Salvail et al. [SSS09] and show that in this model, only trivial correct two-party quantum pro…

quant-ph2009★ 5 cited

On the Power of Two-Party Quantum Cryptography

Louis Salvail, Christian Schaffner, Miroslava Sotakova

We study quantum protocols among two distrustful parties. Under the sole assumption of correctness - guaranteeing that honest players obtain their correct outcomes - we show that e…

cs.LG2008★ 11 cited

Learning Low-Density Separators

Shai Ben-David, Tyler Lu, David Pal +1

We define a novel, basic, unsupervised learning problem - learning the lowest density homogeneous hyperplane separator of an unknown probability distribution. This task is relevant…

cs.CC2008

Breaking One-Round Key-Agreement Protocols in the Random Oracle Model

Miroslava Sotakova

In this paper we study one-round key-agreement protocols analogous to Merkle's puzzles in the random oracle model. The players Alice and Bob are allowed to query a random permutati…