Benoît Libert homepage

Senior Researcher (DR2) at CNRS
Ecole Normale Supérieure de Lyon
AriC Team, LIP laboratory
46 Allée d'Italie
69364 Lyon Cedex 07
France
email: benoit.libert at ens-lyon.fr
Phone: +33.426.23.39.32
Ph.D. in Cryptography (February 2006) at the UCL Crypto Group.
Habilitation à diriger des recherches (May 2015) at ENS de Lyon.
Previously F.N.R.S. post-doctoral researcher, scientific collaborator at the UCL Crypto Group and researcher at Technicolor Research & Innovation.
Previously involved in the ERC project LattAC led by Damien Stehlé.
Previously coordinator of the PALSE project "Towards practical enhanced asymmetric encryption schemes" (2014-2016).
Involved in the ANR project ALAMBIC (2016-2020).
Coordinator of the H2020 project PROMETHEUS (2018-2021).

Supervision

Current and past students and post-docs
  • Thomas Peters (PhD student, UCL, 2010-2014; main supervisor was Olivier Pereira).
  • Sanjay Bhattacherjee (Post-doc, PALSE project, ENS Lyon, 2015-2016).
  • Somindu Ramanna (Post-doc, PALSE project, ENS Lyon, 2015-2016).
  • Junqing Gong (Post-doc, ENS Lyon, 2017-Present).
  • Alonso Gonzalez (Post-doc, ENS Lyon, 2017-Present).
  • Fabrice Mouhartem (PhD student, ENS Lyon, 2015-2018).
  • Chen Qian (PhD student, IRISA, 2016-Present).
  • Radu Titiu (PhD student, ENS de Lyon, 2017-Present).

    • Internships
  • Nicolas Bernard (2nd year student, ENS Lyon, UCL, June-August 2003).
  • Elie de Panafieu (MPRI student, ENS Cachan, UCL, June-July 2009).
  • Saurabh Yadav (2nd year student, IIT Delhi, ENS Lyon, July-August 2014).
  • Laura Chira (3rd year student, Univ. of Cluj, ENS Lyon, July-September 2014).
  • Fabrice Mouhartem (M2 student, ENS Lyon, February-June 2015).
  • Balthazar Bauer (M2 student, MPRI, March-August 2016).
  • Chen Qian (M2 student, MPRI, March-August 2016).

    • Publications

    Journal Papers
  • Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang, Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption, in Theoretical Computer Science, to appear.
  • Benoît Libert, Marc Joye, Moti Yung, Born and Raised Distributively: Fully Distributed Non-Interactive Adaptively Secure Threshold Signatures with Short Shares, in Theoretical Computer Science, vol. 645, pp. 1-24, 2016
  • Fabrice Ben Hamouda, Marc Joye and Benoît Libert, A Framework for Privacy-Preserving Aggregation of Time-Series Data, in ACM Transactions on Information and System Security (ACM-TISSEC), vol. 18(3), pp. 10:1-10:21, 2016.
  • Fabrice Ben Hamouda, Javier Herranz, Marc Joye and Benoît Libert, Efficient Cryptosystems from 2^k-th Power Residue Symbols, in Journal of Cryptology, vol. 30(2), pp. 519-549, 2017.
  • Benoît Libert, Thomas Peters, Marc Joye and Moti Yung, Linearly Homomorphic Structure-Preserving Signatures and their Applications, in Designs, Codes & Cryptography, vol. 77(2-3), pp. 441-477, 2015.
  • Benoît Libert, Moti Yung, Adaptively Secure Non-Interactive Threshold Cryptosystems, in Theoretical Computer Science, vol. 478, pp. 76-100, 2013.
  • Nuttapong Attrapadung, Javier Herranz, Fabien Laguillaumie, Benoît Libert, Elie de Panafieu, Carla Ràfols, Attribute-Based Encryption Schemes with Constant-Size Ciphertexts, in Theoretical Computer Science, vol. 422, pp. 15-38, 2012.
  • Nuttapong Attrapadung, Benoît Libert, Functional Encryption for Public-Attribute Inner Products: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation, in Journal of Mathematical Cryptology, October 2011, vol. 5, n°2, pp. 115-158.
  • Benoît Libert, Damien Vergnaud, Towards Practical Black-Box Accountable Authority IBE: Weak Black-Box Traceability with Short Ciphertexts and Private Keys, in IEEE Trans. on Information Theory, October 2011, vol. 57, n°10, pp. 7189-7204.
  • Benoît Libert, Moti Yung, Efficient Traceable Signatures in the Standard Model, in Theoretical Computer Science, March 2011, vol. 412, n° 12-14, pp. 1220-1242.
  • Benoît Libert, Damien Vergnaud, Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption, in IEEE Trans. on Information Theory, March 2011, vol. 57, n° 3, pp. 1786-1802.
  • Benoît Libert, Jean-Jacques Quisquater, Moti Yung, Key Evolution Systems in Untrusted Update Environments, in ACM Transactions on Information and System Security (ACM-TISSEC), Vol. 13 Issue 4, December 2010.
    • Conference Papers
  • Benoît Libert, Chen Qian, Lossy Algebraic Filters With Short Tags, in PKC 2019, LNCS series, to appear.
  • Benoît Libert, Khoa Nguyen, Benjamin Hong Meng Tan, Huaxiong Wang, Zero-Knowledge Elementary Databases with More Expressive Queries, in PKC 2019, LNCS series, to appear.
  • Benoît Libert, Damien Stehlé, Radu Titiu, Adaptively Secure Distributed PRFs from LWE, in Theory of Cryptography Conference 2018 (TCC'18), LNCS 11240, pp. 391-421, 2018. Full version.
  • Benoît Libert, Thomas Peters, Chen Qian, Logarithmic-Size Ring Signatures With Tight Security from the DDH Assumption, in ESORICS 2018, LNCS 11099, pp. 288-308, 2018. Full version.
  • Junqing Gong, Benoît Libert, Somindu C. Ramanna, Compact IBBE and Fuzzy IBE from Simple Assumptions, in Security and Cryptography for Networks (SCN 2018), LNCS series, to appear, 2018. Full version.
  • Benoît Libert, San Ling, Khoa Nguyen, Huaxiong Wang, Lattice-Based Zero-Knowledge Arguments for Integer Relations, in Crypto 2018, LNCS 10992, pp. 700-732, 2018. Full version.
  • Benoît Libert, San Ling, Khoa Nguyen, Huaxiong Wang, Zero-Knowledge Arguments for Lattice-Based PRFs and Applications to E-Cash, in Asiacrypt 2017, LNCS 10626, pp. 304-335, 2017. Full version.
  • Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang, Adaptive Oblivious Transfer with Access Control from Lattice Assumptions, in Asiacrypt 2017, LNCS 10624, pp. 533-563, 2017. Full version.
  • Benoît Libert, Amin Sakzad, Damien Stehlé, Ron Steinfeld, All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE, in Crypto 2017, LNCS 10403, pp. 332--364, 2017. Full version.
  • Benoît Libert, Thomas Peters, Chen Qian, Structure-Preserving Chosen-Ciphertext Security With Shorter Verifiable Ciphertexts, in PKC 2017, LNCS 10174, pp. 247--276, 2017. Full version.
  • Marc Joye, Benoît Libert, Encoding-Free ElGamal-type Encryption Schemes on Elliptic Curves, in CT-RSA 2017, LNCS 10159, 2017. Proceedings version. Copyright Springer.
  • Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang, Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption, in Asiacrypt 2016, LNCS 10032, pp. 101--131, 2016. Full version.
  • Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang, Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions, in Asiacrypt 2016, LNCS 10032, pp. 373--403, 2016. Full version.
  • Jie Chen, Benoît Libert and Somindu C. Ramanna, Non-Zero Inner Product Encryption with Short Ciphertexts and Private Keys, in Security and Cryptography for Networks (SCN 2016), LNCS 9841, pp. 23--41, 2016. Full version.
  • Shweta Agrawal, Benoît Libert, Damien Stehlé, Fully Secure Functional Encryption for Inner Products from Standard Assumptions, in Crypto 2016, LNCS 9816, pp. 333--362, 2016. Full version.
  • Benoît Libert, Somindu C. Ramanna, Moti Yung, Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions, 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016) -- Track A, to appear, 2016. Full version.
  • Benoît Libert, Fabrice Mouhartem, Khoa Nguyen, A Lattice-Based Group Signature Scheme with Message-Dependent Opening, in Applied Cryptography and Network Security (ACNS 2016), LNCS 9696,pp. 137-155, 2016. Full version.
  • Benoît Libert, Fabrice Mouhartem, Thomas Peters, Moti Yung, Practical "Signatures with Efficient Protocols" from Simple Assumptions, in ACM Asia Conference on Computer and Communications Security (AsiaCCS 2016), ACM Press, pp. 511-522, 2016. Full version.
  • Benoît Libert, San Ling, Khoa Nguyen, Huaxiong Wang, Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors, in Eurocrypt 2016, LNCS 9666, pp. 1-31, 2016. Full version.
  • Benoît Libert, Thomas Peters, Marc Joye, Moti Yung, Compactly Hiding Linear Spans: Tightly Secure Constant-Size Simulation-Sound QA-NIZK Proofs and Applications, in Asiacrypt 2015, LNCS 9452, pp. 681-707, 2015. Full version.
  • Benoît Libert, Thomas Peters, Moti Yung, Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions, in Crypto 2015, LNCS 9216, pp. 296-316, 2015. Full version.
  • Benoît Libert, Marc Joye, Moti Yung, Thomas Peters, Secure Efficient History-Hiding Append-Only Signatures in the Standard Model, in PKC 2015, LNCS 9020, pp. 450-473, 2015. Full version.
  • Benoît Libert, Marc Joye, Moti Yung, Thomas Peters, Concise Multi-Challenge CCA-Secure Encryption and Signatures with Almost Tight Security, in Asiacrypt 2014 (2), LNCS 8874, pp. 1-21, 2014. Full version.
  • Benoît Libert, Marc Joye, Moti Yung, Born and Raised Distributively: Fully Distributed Non-Interactive Adaptively Secure Threshold Signatures with Short Shares, in ACM Symposium on Principles of Distributed Computing (PODC 2014), ACM Press, pp. 303-312, 2014. Full version.
  • Benoît Libert, Thomas Peters, Marc Joye, Moti Yung, Non-Malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures, in Eurocrypt 2014, LNCS 8441, pp. 514-532, 2014. Full version.
  • Benoît Libert, Moti Yung, Marc Joye, Thomas Peters, Traceable Group Encryption, in Public Key Cryptography 2014 (PKC'14), LNCS 8383, pp. 592-610, 2014. Full version.
  • Alex Escala, Javier Herranz, Benoît Libert, Carla Ràfols, Identity-based lossy trapdoor functions: new definitions, hierarchical extensions, and implications, in Public Key Cryptography 2014 (PKC'14), LNCS 8383, pp. 239-256, 2014. Full version.
  • Benoît Libert, Marc Joye, Group Signatures with Message-Dependent Opening in the Standard Model, in CT-RSA 2014, LNCS 8366, pp. 286-306, 2014. Full version.
  • Fabien Laguillaumie, Adeline Langlois, Benoît Libert, Damien Stehlé, Lattice-Based Group Signatures with Logarithmic Signature Size, in Asiacrypt 2013, LNCS 8270, pp. 41-61, 2013. Full version.
  • Benoît Libert, Thomas Peters, Marc Joye, Moti Yung, Linearly Homomorphic Structure-Preserving Signatures and Their Applications, in Crypto 2013, LNCS 8043, pp. 289-307, 2013. Full version.
  • Marc Joye, Benoît Libert, Efficient Cryptosystems from 2^k-th Power Residue Symbols, in Eurocrypt 2013, LNCS 7881, pp. 72-92, 2013. Full version.
  • Marc Joye, Benoît Libert, A Scalable Scheme for Privacy-Preserving Aggregation of Time Series Data, in Financial Cryptography and Data Security 2013 (FC'13), LNCS 7859, pp. 111-125, 2013.
  • Nuttapong Attrapadung, Benoît Libert, Thomas Peters, Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures, in Public Key Cryptography 2013 (PKC'13), LNCS 7778, pp. 386-404, 2013. Full version.
  • Pooya Farshim, Benoît Libert, Kenneth G. Paterson, Elizabeth A. Quaglia, Robust Encryption Revisited, in Public Key Cryptography 2013 (PKC'13), LNCS 7778, pp. 352-368, 2013. Full version.
  • Nuttapong Attrapadung, Benoît Libert, Thomas Peters, Computing on Authenticated Data: New Privacy Definitions and Constructions, in Asiacrypt 2012, LNCS 7658, pp. 367-385, 2012. Full version
  • Benoît Libert, Thomas Peters, Moti Yung, Group Signatures with Almost-for-free Revocation, in Crypto 2012, LNCS 7417, pp. 571-589, 2012. Full version
  • Malika Izabachène, Benoît Libert, Divisible E-Cash in the Standard Model, in 5th International Conference on Pairing-Based Cryptography (Pairing'12), LNCS series, to appear, 2012.
  • Benoît Libert, Kenneth G. Paterson, Elizabeth A. Quaglia, Anonymous Broadcast Encryption: Adaptive Security and Efficient Constructions in the Standard Model, in Public Key Cryptography 2012 (PKC'12), LNCS 7293, pp. 206-224, 2012. Full version
  • Benoît Libert, Thomas Peters, Moti Yung, Scalable Group Signatures with Revocation, in Eurocrypt 2012, LNCS 7323, pp. 609-627, 2012. Full version
  • Benoît Libert, Moti Yung, Non-Interactive CCA-Secure Threshold Cryptosystems with Adaptive Security: New Framework and Constructions, in Theory of Cryptography Conference 2012 (TCC'12), LNCS 7194, pp. 75-93, 2012. Full version
  • Javier Herranz, Fabien Laguillaumie, Benoît Libert, Carla Ràfols, Short Attribute-Based Signatures for Threshold Predicates, in CT-RSA 2012, LNCS 7178, pp. 51-67, 2012. Full version
  • Malika Izabachène, Benoît Libert, Damien Vergnaud, Block-wise P-Signatures and Non-Interactive Anonymous Credentials with Efficient Attributes, in 13th IMA International Conference on Cryptography and Coding 2011 (IMACC 2011), LNCS 7089, pp. 431-450, 2011.
  • Brett Hemenway, Benoît Libert, Rafail Ostrovsky, Damien Vergnaud, Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen-Ciphertext Security, in Asiacrypt 2011, LNCS 7073, pp. 70-88, 2011. Full version
  • Marc Fischlin, Benoît Libert, Mark Manulis, Non-interactive and Re-Usable Universally Composable String Commitments with Adaptive Security, in Asiacrypt 2011, LNCS 7073, pp. 468-485, 2011.
  • Benoît Libert, Moti Yung, Adaptively Secure Non-Interactive Threshold Cryptosystems, in ICALP 2011 - Track C, LNCS 6756, pp. 588-600, Springer, 2011. Full version
  • Nuttapong Attrapadung, Benoît Libert, Elie de Panafieu, Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts, in Public Key Cryptography 2011 (PKC'11), LNCS 6571, pp. 90-108, 2011. Full version
  • Nuttapong Attrapadung, Benoît Libert, Homomorphic Network Coding Signatures in the Standard Model, in Public Key Cryptography 2011 (PKC'11), LNCS 6571, pp. 17-34, 2011. Copyright Springer.
  • Benoît Libert, Moti Yung, Efficient Completely Non-Malleable Public Key Encryption, in ICALP 2010 - Track A, LNCS 6198, pp. 127-139, 2010.
  • David Galindo, Benoît Libert, Marc Fischlin, Georg Fuchsbauer, Anja Lehmann, Mark Manulis, Dominique Schröder, Public Key Encryption with Non-Interactive Opening: New Constructions and Stronger Definitions, in Africacrypt 2010, LNCS 6055, pp. 333-350, 2010.
  • Nuttapong Attrapadung, Benoît Libert, Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation, in Public Key Cryptography 2010 (PKC'10), LNCS 6056, pp. 384-402, 2010. Full version
  • Benoît Libert, Moti Yung, Dynamic Fully Forward-Secure Group Signatures, in 5th ACM Symposium on Information, Computer and Communications Security (AsiaCCS'10), pp. 70-81, 2010.
  • Benoît Libert, Moti Yung, Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs, in Theory of Cryptography Conference 2010 (TCC'10), LNCS 5978, pp. 499-517, 2010. Full version
  • Benoît Libert, Damien Vergnaud, Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model, in 8th International Conference on Cryptology and Network Security (CANS'09), LNCS 5888, pp. 498-517, 2009.
  • Julien Cathalo, Benoît Libert, Moti Yung, Group Encryption: Non-Interactive Realization in the Standard Model, in Asiacrypt 2009, LNCS 5912, pp. 179-196, 2009. Full version
  • Benoît Libert, Moti Yung, Efficient Traceable Signatures in the Standard Model, in 3rd International Conference on Pairing-Based Cryptography (Pairing'09), LNCS 5671, pp. 187-205, 2009. Full version
  • Benoît Libert, Damien Vergnaud, Adaptive-ID Secure Revocable Identity-Based Encryption, in CT-RSA 2009, LNCS 5473, pp. 1-15, 2009.
  • Benoît Libert, Damien Vergnaud, Towards Black-Box Accountable Authority IBE with Short Ciphertexts and Private Keys, in Public Key Cryptography 2009 (PKC'09), LNCS 5443, pp. 235-255, 2009. Full version.
  • Benoît Libert, Damien Vergnaud, Multi-Use Unidirectional Proxy Re-Signatures, in 15th ACM Conference on Computer and Communications Security (ACM CCS'08), 2008.
  • Benoît Libert, Damien Vergnaud, Tracing Malicious Proxies in Proxy Re-Encryption , in 2nd International Conference on Pairing-Based Cryptography (Pairing'08), LNCS 5209, pp. 332-353, 2008. Copyright Springer.
  • Benoît Libert, Damien Vergnaud, Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption, in Public Key Cryptography 2008 (PKC'08), LNCS 4939, pp. 360-379, 2008. Full version.
  • Alexander W. Dent, Benoît Libert, Kenneth G. Paterson, Certificateless Encryption Schemes Strongly Secure in the Standard Model, in Public Key Cryptography 2008 (PKC'08), LNCS 4939, pp. 344-359, 2008. Full version.
  • Benoît Libert, Jean-Jacques Quisquater, Moti Yung, Forward-Secure Signatures in Untrusted Update Environments: Efficient and Generic Constructions , in 14th ACM Conference on Computer and Communications Security (ACM CCS'07). Copyright ACM.
  • Benoît Libert, Jean-Jacques Quisquater, Practical Time Capsule Signatures in the Standard Model from Bilinear Maps , in 1st International Conference on Pairing Based Cryptography (Pairing'07), LNCS 4575, pp. 23-38. Copyright Springer.
  • Benoît Libert, Jean-Jacques Quisquater, Moti Yung, Parallel Key-Insulated Public Key Encryption Without Random Oracles, in Public Key Cryptography 2007 (PKC'07), LNCS 4450, pp. 298-314. Copyright IACR.
  • Benoît Libert, Jean-Jacques Quisquater, Moti Yung, Efficient Intrusion-Resilient Signatures Without Random Oracles, in 2nd SKLOIS Conference on Information Security and Cryptology (Inscrypt) 2006, LNCS 4318, pp. 27-41, 2006. Copyright Springer.
  • Fabien Laguillaumie, Benoît Libert, Jean-Jacques Quisquater, Universal Designated Verifier Signatures Without Random Oracles or Non-Black Box Assumptions, in Security and Cryptography for Networks (SCN'06), LNCS 4116, pp. 63-77, 2006. Copyright Springer.
  • Benoît Libert, Jean-Jacques Quisquater, On Constructing Certificateless Cryptosystems from Identity Based Encryption, in Public Key Cryptography 2006 (PKC'06), LNCS 3958, pp. 474-490, 2006. Copyright IACR.
  • Julien Cathalo, Benoît Libert, Jean-Jacques Quisquater, Efficient and Non-Interactive Timed-Release Encryption. In Information and Communications Security 2005 (ICICS'05), LNCS 3783, pp. 291-303, Springer, 2005.
  • Paulo S.L.M. Barreto, Benoît Libert, Noel McCullagh, Jean-Jacques Quisquater, Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps. In Asiacrypt 2005, LNCS 3788, pp. 515-532. Copyright IACR.
  • Benoît Libert, Jean-Jacques Quisquater, Identity Based Encryption Without Redundancy. In Applied Cryptography and Network Security (ACNS) 2005, LNCS 3531, pp. 285-300, Springer, 2005.
  • Benoît Libert, Jean-Jacques Quisquater, Improved Signcryption from q-Diffie-Hellman Problems. In Security in Communication Networks 2004 (SCN'04), LNCS 3352, pp. 220-235, Spinger-Verlag, 2004. Updated version.
  • Julien Cathalo, Benoît Libert, Jean-Jacques Quisquater, Cryptanalysis of a Verifiably Committed Signature Scheme based on GPS and RSA, in Information Security Conference (ISC) 2004, LNCS 3225, pp. 52-60, Springer-Verlag, 2004. Copyright Springer.
  • Benoît Libert, Jean-Jacques Quisquater, Efficient Signcryption with Key Privacy from Gap-Diffie-Hellman Groups, In Public Key Cryptography 2004 (PKC'04), LNCS 2947, pp. 187-200, Spinger-Verlag, 2004. Updated version.
  • Benoît Libert, Jean-Jacques Quisquater, Identity Based Undeniable Signatures, In Cryptographer's Track - RSA 2004, LNCS 2964, pp. 112-125, Springer-Verlag, 2004. Updated version available here.
  • Benoît Libert, Jean-Jacques Quisquater, Efficient revocation and threshold pairing based cryptosystems, in 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003), pp. 163-171, 2003. Copyright ACM.
  • Benoît Libert, Jean-Jacques Quisquater, New identity based signcryption schemes from pairings, 2003 IEEE Information Theory Workshop. Copyright IEEE.
    • PhD Thesis
    Benoît Libert. New Secure Applications of Bilinear Maps in Cryptography. PhD Thesis, Université Catholique de Louvain, January 2006. [pdf]
    HDR Thesis
    Benoît Libert. Applications of Structure-Preserving Cryptography and Pairing-Based NIZK Proofs. Habilitation à diriger des recherches, ENS Lyon, May 2015. [Short version] [Full version]

    Activities

    Program committees
  • Security and Cryptography for Networks (SCN) 2018
  • Theory of Cryptography Conference (TCC) 2017
  • ACM-CCS 2014, 2015 and 2016
  • Asiacrypt 2013 and 2018
  • Africacrypt 2014 and 2016
  • ESORICS 2013
  • Financial Cryptography 2013
  • International Workshop on Security (IWSEC) 2012
  • Eurocrypt 2011, 2012, 2015 and 2017
  • 4th and 5th International Conference on Pairing-Based Cryptography (Pairing 2010 and 2012)
  • 1st International Conference on Cryptology and Information security in Latin America (Latincrypt 2010)
  • Applied Cryptography and Network Security (ACNS) 2010, 2012 and 2018
  • Public Key Cryptography (PKC) 2010, 2013, 2015, 2016 and 2019
  • Information Security Conference (ISC) 2009 and 2013
  • 7th, 8th and 11th International Conference on Cryptology and Network Security (CANS 2008, 2009 and 2012)
  • 13th Australasian Conference on Information Security and Privacy (ACISP 2008)
  • International Conference on Provable Security 2007, 2010, 2011 and 2012 (ProvSec'07, '10, '11 and '12)
  • 3rd, 4th and 5th Information Security Practice and Experience Conference (ISPEC'07, '08, '09 and '10)
  • 2nd, 3rd and 4th SKLOIS Conference on Information Security and Cryptology (Inscrypt'06, '07 and '08)
  • 1st International Workshop on Information Security (IS'06), in conjunction with OTM Workshops 2006.
  • Applied Cryptography and Information Security (ACIS'06)
    • Teaching
  • Computer science and privacy (ENS Lyon, M2, 1st semester 2015-2016 and 2016-2017), with Frédéric Prost.
  • Advanced cryptographic primitives (ENS Lyon, M2, 1st semester 2014-2015 and 2015-2016), with Damien Stehlé.
  • Cryptologie à clé publique, Master Pro course, ISFA (Université de Lyon 1, January 2015), with Fabien Laguillaumie.
  • Cryptography (ENS Lyon, M1, 2nd semester 2014-2015, 2015-2016 and 2016-2017), with Damien Stehlé.

    • Links

  • UCL's call for papers page
    • PGP key

    Last modified: 01/14/19