Description
We live in an era of "Big Data", wherein a deluge of data is being generated, collected, and stored all around us. In order to protect this data, we need to encrypt it. This raises a fundamentally new challenge in cryptography: Can we encrypt data while enabling fine-grained access control and selective computation, as is necessary to protect big, complex data? In this talk, I will present my work on functional encryption which addresses this challenge, using mostly pictures, some basic math, and perhaps a few equations.
Prochains exposés
-
Post-Quantum Public-Key Pseudorandom Correlation Functions for OT
Orateur : Mahshid Riahinia - ENS, CNRS
Public-Key Pseudorandom Correlation Functions (PK-PCF) are an exciting recent primitive introduced to enable fast secure computation. Despite significant advances in the group-based setting, success in the post-quantum regime has been much more limited. In this talk, I will introduce an efficient lattice-based PK-PCF for the string OT correlation. At the heart of our result lie several technical[…] -
Predicting Module-Lattice Reduction
Orateur : Paola de Perthuis - CWI
Is module-lattice reduction better than unstructured lattice reduction? This question was highlighted as `Q8' in the Kyber NIST standardization submission (Avanzi et al., 2021), as potentially affecting the concrete security of Kyber and other module-lattice-based schemes. Foundational works on module-lattice reduction (Lee, Pellet-Mary, Stehlé, and Wallet, ASIACRYPT 2019; Mukherjee and Stephens[…]-
Cryptography
-