Jefferson E. Ricardini

Jefferson E. Ricardini
University of São Paulo | USP · Departamento de Engenharia de Computação e Sistemas Digitais (PCS) (POLI)

Master of Science - computer engineering

About

18
Publications
4,479
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
191
Citations
Education
February 2014 - April 2019
University of São Paulo
Field of study
  • computer engineering - Cryptography
February 2012 - February 2014
University of São Paulo
Field of study
  • computer engineering - Cryptography
February 2007 - November 2010
Universidade Nove de Julho
Field of study
  • Computer science

Publications

Publications (18)
Technical Report
Full-text available
In this note we describe some general-purpose, high-efficiency elliptic curves tailored for security levels beyond 2 128 . For completeness, we also include legacy-level curves at standard security levels. The choice of curves was made to facilitate state-of-the-art implementation tech-niques.
Conference Paper
Full-text available
Bilinear maps, or pairings, initially proposed in a cryptologic context for cryptanalytic purposes, proved afterward to be an amazingly flexible and useful tool for the construction of cryptosystems with unique features. Yet, they are notoriously hard to implement efficiently, so that their effective deployment requires a careful choice of paramete...
Article
Modern vehicular security architectures provision authorized vehicles with multiple short-term pseudonym certificates, so users can avoid tracking by rotating among certificates when signing messages. The large number of certificates in the system, however, makes revocation via Certificate Revocation Lists (CRLs) complex and/or inefficient. Two pos...
Chapter
We present qTESLA, a post-quantum provably-secure digital signature scheme that exhibits several attractive features such as simplicity, strong security guarantees against quantum adversaries, and built-in protection against certain side-channel and fault attacks. qTESLA—selected for round 2 of NIST’s post-quantum cryptography standardization proje...
Article
In the implicit certification model, the process of verifying the validity of the signer's public key is combined with the verification of the signature itself. When compared to traditional, explicit certificates, the main advantage of the implicit approach lies in the shorter public key validation data. This property is particularly important in r...
Article
Vehicular communication (V2X) technologies are expected to become common in the future, providing better efficiency and safety in transportation. This envisioned large-scale deployment, however, critically depends on addressing some issues. In special, to prevent abuse by drivers, messages exchanged among authorized vehicles must be authenticated....
Chapter
In this paper we revisit some of the main aspects of the DAGS Key Encapsulation Mechanism, one of the code-based candidates to NIST’s standardization call for the key exchange/encryption functionalities. In particular, we modify the algorithms for key generation, encapsulation and decapsulation to fit an alternative KEM framework, and we present a...
Article
Full-text available
Code-based cryptography is one of the main areas of interest for NIST’s Post-Quantum Cryptography Standardization call. In this paper, we introduce DAGS, a Key Encapsulation Mechanism (KEM) based on quasi-dyadic generalized Srivastava codes. The scheme is proved to be IND-CCA secure in both random oracle model and quantum random oracle model. We be...
Article
Full-text available
Vehicular communication (V2X) technologies allow vehicles to exchange information about the road conditions and their own status, and thereby enhance transportation safety and efficiency. For broader deployment, however, such technologies are expected to address security and privacy concerns, preventing abuse by users and by the system’s entities....
Article
Public key cryptography is an extremely active research area. New protocols, primitives and attacks are often proposed. Some public key cryptographic primitives tend to be extremely prolific in terms of flexibility, efficiency and security. One of the most flexible cryptographic class of primitives is the lattice-based cryptography. Among the main...
Chapter
In 1994, Peter Shor published a quantum algorithm capable of factoring large integers and computing discrete logarithms in Abelian groups in polynomial time. Since these computational problems provide the security basis of conventional asymmetric cryptosystems (e.g., RSA, ECC), information encrypted under such schemes today may well become insecure...
Chapter
Full-text available
Resumo Em 1997, Peter Shor publicou um algoritmo quântico capaz de fatorar inteiros grandes e de calcular logaritmos discretos em corpos finitos em tempo hábil. Tais problemas estão na base da segurança de técnicas convencionais de criptografia assimétrica (e.g. RSA, ECC). Isso significa que uma informação criptografada nos dias de hoje não necessa...

Network

Cited By

Projects

Projects (2)
Project
Develop efficient and secure implementations of cryptography.