London Lattice Coding & Crypto Meeting

Jump to other IT Society Websites:
Lattice-based approaches are emerging as a common theme in modern cryptography and coding theory. In communications, they are indispensable mathematical tools to construct powerful error-correction codes achieving the capacity of wireless channels. In cryptography, they are used to building lattice-based schemes with provable security, better asymptotic efficiency, resilience against quantum attacks and new functionalities such as fully homomorphic encryption. This meeting — on 26 March 2018 — is aimed at connecting the two communities with a common interest in lattices. It will consist of several talks on related topics, with a format aimed at encouraging interaction.
What
When Mar 26, 2018
from 10:00 AM to 06:30 PM
Where London, UK
Add event to calendar vCal
iCal

Program

10:30 - 12:00 | Carl Bootland: Using non-integral bases to make better use of the plaintext space in homomorphic encryption schemes

13:00 - 14:30 | Thomas Prest: The Rényi Divergence and Security Proofs 

15:00 - 16:30 | Xiaojun Yuan: Fundamental Limits of Compute-Compress-and-Forward

16:45 - 18:15 | Qifu Sun: Lattice partition based physical-layer network coding

Room 611
Department of Electrical and Electronic Engineering
Imperial College London
South Kensington
London SW7 2AZ

Registration

Everyone is welcome. Two caveats:

  1. Speakers are told the audience is somewhat familiar with lattices.
  2. Please send us an email at c.ling@imperial.ac.uk, so that the size of the room fits with the number of participants.

More information about this event…