I have been involved with several research and software projects, mostly related to cryptography and combinatorics.
We study how digital certification can be explored to guarantee integrity and authenticity of data from metrological equipments. We currently work in partnership with INMETRO on a project that aims to reduce the number of frauds on gas stations by using digital signatures.
I am particularly interested in exploring the fascinating area of combinatorics, and my research is usually motivated by interesting problems in cryptography.
Fault tolerance in cryptographic applications using Cover-Free Families (PhD Thesis)
A cover-free family is a set system with n subsets of a t-set, where the union of any d subsets does not contain any other. They have several applications in cryptography, and we mainly explore the ones related to digital signatures. We propose new constructions of these families to allow for fault-tolerance in both static and dynamic applications.
Partial data integrity using combinatorial group testing (master's thesis)
Combinatorial group testing allows us to identify defective elements in a set of elements while performing a small number of tests. We use this technique to create a digital signature scheme that allows us to identify modifications in signed data without invalidating the entire signature.
New constructions of Cover-Free Families and applications in a pandemic screening (paper)
We focus on new CFFs with applications to a pandemic scenario, where several tests need to be performed with limited resources. We show we can model communities of people with high-contacts using hypergraphs and we give constructions of what we call structure-aware cover-free families, which uses the structure of the hypergraphs. We revisit old CFF constructions, boosting the number of defectives they can identify by taking the hypergraph structure into account. We also provide new constructions based on hypergraph parameters.
New constructions of Difference Sets (post-doc research)
A Difference Set D is a subset of a group G such that every non-identity element of G can be represented as a product d1 d2-1 of two elements d1 and d2 of D. They have some interesting applications in coding theory and cryptography. In the past few years, we have been exploring new ways of constructing these objects.
I have worked with medical systems on two different occasions. The first one was a project to provide a reliable, flexible, and secure authentication for the telemedicine system used in the State of Santa Catarina (Brazil). The second was a study on private verification of access of medical data using searchable encryption techniques.
As part of a team at LabSEC (UFSC), we developed several Public Key Infrastructure software for educational purposes. These projects focused on exploring new approaches to make digital certificates accessible to students and staff at Brazilian universities.