CV Lattes
ORCID
Google Scholar Citations
Universidade Estadual de Campinas (UNICAMP). Instituto de Computação (IC) (Institutional affiliation from the last research proposal) Birthplace: Brazil
Assistant Professor (MS-3.1) at the Institute of Computing of the State University of Campinas (IC-UNICAMP).Bachelor's degree in Computer Science from the Institute of Mathematics and Statistics of the University of São Paulo (IME-USP). MSc in Computer Science from the State University of Campinas (UNICAMP). PhD in Computer Science from the University of Luxembourg. I worked as a postdoctoral researcher at the COSIC laboratory at the university KU Leuven, Belgium. My research is mainly focused on homomorphic encryption and computing over encrypted data. I am also interested in post-quantum cryptography, indistinguishability obfuscation, and related topics. (Source: Lattes Curriculum)
| News published in Agência FAPESP Newsletter about the researcher |
| More itemsLess items |
| TITULO |
| Articles published in other media outlets ( ): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |
Several recent technologies, such as cloud computing, internet of things (IoT) and smart cities, rely on large-scale data collection and data analysis. Encrypting the data protects people's privacy, but many of the functionalities obtained through these technologies become impossible when the data is encrypted. Fully homomorphic encryption (FHE) combines usefulness with privacy by allowin…
Fully homomorphic encryption (FHE) allows a server to compute functions on encrypted data without ever decrypting it, guaranteeing the security and privacy of the client. This technology is valuable for many practical applications, such as private artificial neural networks, and also theoretical applications, such as building new cryptographic primitives. To use FHE, the client generates …
Private information retrieval (PIR) protocols allow a user to retrieve an item from a database stored on a server without revealing what the item is. In more detail, imagine a server that has a database D in clear and a client that wants to download the i-th item from D. The client can encrypt i in some way, generating a ciphertext c, which is then sent to the server. The server then uses…
Fully homomorphic encryption (FHE) allows a server to compute functions on encrypted data without ever decrypting it, guaranteeing the security and privacy of the client. This technology is valuable for many practical applications, such as private artificial neural networks, and also theoretical applications, such as building new cryptographic primitives. To use FHE, the client generates …
(Only some records are available in English at this moment)
| 1 / 1 | Ongoing grants |
| 4 / 4 | Ongoing scholarships in Brazil |
| 5 / 5 | All research grants and scholarships |
| Associated processes | |