Giulio Malavolta(UC Berkeley and CMU, USA)
hosted by Gilles Barthe
"Compactness in Cryptography"
The communication complexity of secure protocols is a fundamental question of the theory of computation and has important repercussions in the development of real-life systems. As an example,the recent surge in popularity of cryptocurrencies has been enabled and accompanied by advancements in the construction of more compact cryptographic machinery. In this talk we discuss how to meet the boundaries of compactness in cryptography and how to exploit succinct communication to construct systems with new surprising properties. Specifically, we consider the problem of computing functions on encrypted data: We show how to construct a fully-homomorphic encryption scheme with message-to-ciphertext ratio (i.e. rate) of 1 – o(1), which is optimal. Along the way, we survey the implication of cryptographic compactness in different contexts, such as proof systems, scalable blockchains, and fair algorithms.
Bio: Giulio Malavolta is currently a postdoc with a joint appointment at UC Berkeley and CMU. Prior to that he was a research fellow at the Simons Institute for the Theory of Computing and he completed his PhD at Friedrich-Alexander Universitat Erlangen-Nurnberg in 2019. His research interest spans the theory and the applications of cryptography and computer security and his work was published in leading venues in cryptography (CRYPTO, EUROCRYPT), theory of computation (FOCS) , and system security (S&P, CCS, NDSS).
|Time:||Tuesday, 25.02.2020, 10:00|
|Place:||SB E 1 5 room 029|
|Video:||videocast to KL room 111|