We introduce Learning with Errors and Ring Learning with Errors, two hard
lattice problems which are widely used for security of Homomorphic
Encryption schemes. Following a study we conducted comparing four such
schemes, the best scheme was the so-called BGV scheme, introduced by
Brakerski-Gentry-Vaikuntanathan in 2012. We present it as an example of a
ring-based homomorphic scheme, discussing its number theoretic
optimisations.

We present “Ouroboros,” the first blockchain protocol based on proof of stake with rigorous security guarantees. We establish security properties for the protocol comparable to those achieved by the bitcoin blockchain protocol. As the protocol provides a “proof of stake” blockchain discipline, it offers qualitative efficiency advantages over blockchains based on proof of physical resources (e.g., proof of work). We showcase the practicality of our protocol in real world settings by providing experimental results on transaction processing time obtained with a prototype implementation in the Amazon cloud. We also present a novel reward mechanism for incentivizing the protocol and we prove that given this mechanism, honest behavior is an approximate Nash equilibrium, thus neutralizing attacks such as selfish mining. 

Joint work with  Alexander Russell and Bernardo David and Roman Oliynykov

Mathematical methods are increasingly being used to design auctions. Paul Klemperer will talk about some of his own experience which includes designing the U.K.'s mobile phone licence auction that raised £22.5 billion, and a new auction that helped the Bank of England in the financial crisis. (The then-Governor, Mervyn King, described it as "a marvellous application of theoretical economics to a practical problem of vital importance".) He will also discuss further development of the latter auction using convex and "tropical" geometric methods.

Hinke Osinga, University of Auckland
joint work with: Bernd Krauskopf and Stefanie Hittmeyer (University of Auckland)

Dynamical systems of Lorenz type are similar to the famous Lorenz system of just three ordinary differential equations in a well-defined geometric sense. The behaviour of the Lorenz system is organised by a chaotic attractor, known as the butterfly attractor. Under certain conditions, the dynamics is such that a dimension reduction can be applied, which relates the behaviour to that of a one-dimensional non-invertible map. A lot of research has focussed on understanding the dynamics of this one-dimensional map. The study of what this means for the full three-dimensional system has only recently become possible through the use of advanced numerical methods based on the continuation of two-point boundary value problems. Did you know that the chaotic dynamics is organised by a space-filling pancake? We show how similar techniques can help to understand the dynamics of higher-dimensional Lorenz-type systems. Using a similar dimension-reduction technique, a two-dimensional non-invertible map describes the behaviour of five or more ordinary differential equations. Here, a new type of chaotic dynamics is possible, called wild chaos. 

In this talk, we will explain how the counting theorems of Pila and Wilkie lead to a conditional proof of the aforementioned conjecture. In particular, we will explain how to generalise the work of Habegger and Pila on a product of modular curves. 
Habegger and Pila were able to prove that the Zilber-Pink conjecture holds in such a product if the so-called weak complex Ax and large Galois orbits conjectures are true. In fact, around the same time, Pila and Tsimerman proved a stronger statement than the weak complex Ax conjecture, namely, the Ax-Schanuel conjecture for the $j$-function. We will formulate Ax-Schanuel and large Galois orbits conjectures for general Shimura varieties and attempt to imitate the Habegger-Pila strategy. However, we will encounter an additional difficulty in bounding the height of a pre-special subvariety.

This is joint work with Jinbo Ren.
 

 In the first meeting of the seminar we, and all participants who wish to do so, will each briefly introduce ourselves and our research interests. We will decide future talks and papers to read during this meeting.