Previous Conferences & Workshops

We prove that every key exchange protocol in the random oracle model in which the honest users make at most $n$ queries to the oracle can be broken by an adversary making $O(n^2)$ queries to the oracle. This improves on the previous $\Tilde{O}(n^6)$...

For a squarefree integer $d$ we ask, if the negative Pell equation $x^2-dy^2 = -1$ is solvable over the integers. By easy considerations we see that in this case $d>0$ and that all odd prime divisors of $d$ are congruent to 1 modulo 4. Now we call a...

In this talk I will consider actions of non-abelian groups on n-dimensional tori, explain the notions of stiffness and stationary measures, and show how under fairly general assumptions stationary measures can be classified. A key ingredient is a...

I will present a recent result of Green and Tao showing the following. Let P:F^n --> F be a polynomial in n variables over F of degree at most d . We say that P is "equidistributed" if it takes on each of its |F| values close to equally often. We...

Learning theory, and in particular PAC learning, was introduced by Valiant in 1984 and has since become a major area of research in theoretical and applied computer science. One natural question that was posed at the very inception of the field is...