In recent years there has been amazing progress in building
practical protocols for Multi-Party Computation (MPC).
So much progress in fact that there are now a number of
companies producing products utilizing this technology. A major issue with existing solutions is the high round
complexity of protocols involving more than two players. In this talk I will survey the main protocols for MPC
and recent ideas in how to obtain practical low round
complexity protocols.

We consider the Navier-Stokes initial boundary value problem (NS-IBVP) in a smooth exterior domain. We are interested in establishing existence of weak solutions (we mean weak solutions as synonym of solutions global in time) with an initial data in L(3,∞)

The relationship between the so-called ancient (backwards) solutions to the Navier-Stokes equations in the space or in a half space and the global well-posedness of initial boundary value problems for these equations will be explained. If time permits I will sketch details of an equivalence theorem and a proof of smoothness properties of mild bounded ancient solutions in the half space, which is a joint work with Gregory Seregin

We study a simple one-dimensional coupled heat wave system, obtaining a sharp estimate for the rate of energy decay of classical solutions. Our approach is based on the asymptotic theory of $C_0$-semigroups and in particular on a result due to Borichev and Tomilov (2010), which reduces the problem of estimating the rate of energy decay to finding a growth bound for the resolvent of the semigroup generator. This technique not only leads to an optimal result, it is also simpler than the methods used by other authors in similar situations and moreover extends to problems on higher-dimensional domains. Joint work with C.J.K. Batty (Oxford) and L. Paunonen (Tampere).

TBA

We provide a simple convergence analysis unified for TR and a new ARC algorithms, which we name ARCq and which is very close in spirit to trust region methods, closer than the original ARC is. We prove global convergence to second order points. We also obtain as a corollary the convergence of the original ARC method. Since one of our aims is to achieve a simple presentation, we sacrifice some generality which we discuss at the end of our developments. In this simplified setting, we prove the optimal complexity property for the ARCq and identify the key elements which allow it. We then propose efficient implementations using a Cholesky like factorization as well as a scalable version based on conjugate gradients.

This is an exciting time to study quantum algorithms. As the technological challenges of building a quantum computer continue to be met there is still much to learn about the power of quantum computing. Understanding which problems a quantum computer could solve faster than a classical device and which problems remain hard is particularly relevant to cryptography. We would like to design schemes that are secure against an adversary with a quantum computer. I'll give an overview of the quantum computing that is accessible to a general audience and use a recently declassified project called "soliloquy" as a case study for the development (and breaking) of post-quantum cryptography.