Resume

Relevant Work

[ 02/2023 ] – Ongoing
Meta
Cryptographer

• Co Tech Lead of Meta's cryptography infrastructure team. 

• Maintainer of Meta's cryptography library. 

• Responsible for defining Meta's post-quantum cryptography migration.

• Contributor to various PQC standardization processes. 

[ 07/2020 ] – [ 02/2023 ]
Google
Cryptographer

• As part of Alphabet’s PQC Working Group, I was responsible for defining and implementing the Post Quantum Cryptography migration strategy for the company. This includes identifying projects that were good candidates for early PC adoption, recommendations of PQC deployment strategies, selection of algorithms, development of preliminary implementations, code review, and more. Example: enablement of PQC in Google’s internal communication protocol.

• Contributor to various PQC standardization processes. Co-submitter of BIKE and Classic McElice (NIST PQC Standardization Process), co-Editor of ISO/IEC 14888-4, and co-author of IETF draft on JOSE/COSE encoding for PQC signatures.

• Tech Lead for storage encryption technologies for the whole company, including the implementation and evaluation/definition of cryptographic mechanisms used by the various petabyte scale Google’s storage systems.

• Maintainer of Tink Crypto library, including the enablement of some PQC experimental implementations.

• Member of the ISE-Crypto leadership team, responsible for reviewing and approving the usage of crypto in any Alphabet products and internal technologies.

[ 03/2015 ] – [ 07/2020 ]
Intel
Research Scientist (Cryptographer)

• Research focused on Post-Quantum Cryptography (e.g., Hash-Based Signatures, Code-Based Cryptography, Lattice-Based Cryptography, Isogeny Based Cryptography and Multivariate-Quadratic Crypto) and lightweight cryptography (lightweight block ciphers, hash functions, authentication, attestation mechanisms, etc).

• Contributor to international standardization efforts on Cryptography. Served as expert member of the USA delegation for ISO/IEC JTC1 SC27 (IT Security techniques) Work Group 2 (Cryptography and security mechanisms) and expert member of the INCITS (the central U.S. forum dedicated to creating technology standards) on Cyber Security (CS1).

• Architect and maintainer of Intel's TinyCrypt, a small-footprint cryptography library targeting constrained devices written in C. Implemented the following cryptographic algorithms in TinyCrypt: AES-128, SHA-256, CBC mode, CCM mode, CMAC mode, CTR mode, EC-DH key exchange, EC-DSA signatures, HMAC-SHA256 and HMAC-PRNG. TinyCrypt is currently used in several open-source projects, including the Zephyr Operation System and the Intel System Studio.

• Member of the SAFE-Crypto core team, which is responsible for evaluating and approving the usage of cryptography in any mechanism at Intel.

Education

[ 10/2010 ] – [ 12/2013 ]
Sorbonne  Universites - Univ. Paris VI
PhD Degree (Computer Science)

• Subject: Public-key cryptography based on error-correcting codes.

• Problem Statement: The main hindrance for the practical use of public-key code-based cryptography was its huge public-key sizes (hundreds of kilobytes for reasonable security levels).

• Main results: Proposition of two different approaches that significantly reduce the public-key size of code-based cryptosystems. One is based on the use of algebraic codes (Quasi-Dyadic Goppa Codes) and another on the use of graph-based codes (Quasi-Cyclic Moderate-Density Parity-Check Codes). In summary, both proposals managed to reduce the public-key size to values comparable to those presented by the RSA scheme, a cryptosystem largely used in practice. Moreover the QC-MDPC proposal strengthens the security-proof of the standard code-based cryptosystems by using codes free of algebraic structure.

• Complementary results

  • Extension of the Quasi-Dyadic Goppa proposal for: 1) digital signature scheme; 2) codes defined over finite fields of characteristics greater than two.

  • New decoding algorithm for square-free Goppa codes.

  • Extension of the Quasi-Cyclic MDPC proposal for cyclic-symmetric codes.

  • Preliminary results on the possibility of using random linear codes to instantiate public-key code-based cryptosystems.

• Awards: Best PhD Thesis on Information Security awarded by the Brazilian's Computer Science Society. 

[ 01/2009 ] – [ 10/2010 ]
University of Sao Paulo (USP)
MSc. Electrical Engineering

• Proposal of a new family of linear codes (Quasi-Dyadic Goppa Codes) that considerably reduced McEliece cryptosystem's public key size.

[ 01/2005 ] – [ 12/2008 ]
University of Sao Paulo (USP)
BSc. Computer Science