2018
-
Exploring Crypto Dark Matter: New Simple PRF Candidates and Their Applications
TCC 2018 | ENS Lyon | Oxford University | slides
- Non-Trivially Efficient Constructions in Obfustopia
SCN 2018 | slides
- Order-Revealing Encryption
SCN 2018 | slides
2017
-
Non-Trivially Efficient Constructions in Obfustopia
ENS Lyon
- Private Circuits for Multiplication
University of California, San Diego | slides
- Private Multiplication over Finite Fields
Crypto 2017 | video (short version at Crypto)
2016
-
From Cryptomania to Obfustopia through Secret-Key Functional
Encryption
TCC 2016B | DIMACS/CEF Workshop on Cryptography and Software Obfuscation |
slides | video (long version in Stanford)
- Randomness Complexity of Private Circuits for Multiplication
Paris Crypto Day | Séminaire CCA | slides
| video (short version by Adrian Thillard at Eurocrypt 2016)
2015
- An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security
Crypto 2015 | Université de Rennes | Stanford
University | slides
| video (short version at Crypto)
2014
- Related-Key Security for Pseudoradom Functions Beyond the Linear Barrier
Crypto 2014 | Journées C2 | slides | video (short version at Crypto) | video (short version at JC2 in french)