The third London Crypto Day is a day of cryptography talks in the London area, aimed at introducing the cryptographers in the area to each other and building a network of folks working in similar areas in and around London. There'll be lots of interesting talks and plenty of time to meet and get to know other attendees, both from academia and industry.
A quick preview of some of the topics that will come up on the day:
Tiziano Santoro (Google) will introduce Project Oak, a new project exploring meaningful control of data in distributed systems and enabling provably private and secure data storage, processing, and exchange.
Ioana Boureanu (Surrey) will talk about the insecurities in existing solutions for transparent proxying over TLS. Then, she will give an intuition of how to achieve provable security in this type of middlebox-based construction and the challenges that remain.
Kenny Paterson (RHUL/ETH Zurich) will talk about new ways to generate composite numbers that pass the Miller-Rabin test, and the consequences this has for protocols which don't validate their parameters thoroughly enough. You won't believe what OpenSSL used to do!
Thalia Laing (HP Inc) will talk about her experience of moving from academia to industry and highlight challenges and differences met along the way.
Kevin Lewi and Ilya Maykov (Facebook) will talk about how Facebook handles the large-scale propagation of updates securely, using a lattice-based homomorphic hash function to help provide integrity without sacrificing efficiency.
Thyla van der Merwe (Mozilla) will talk about CRLite, a system designed to proactively push all TLS certificate revocations to browsers. Born in academia, being implemented in industry - will the union succeed? And are we truly on the road to a more robust Web PKI?
Cas Cremers (CISPA Helmholtz Center for Information Security) will talk about strong security guarantees in modern secure messaging protocols: why you want them, how you might get them in theory, and why you are probably not getting them in practice.