Paulo S. L. M. Barreto

According to our database1, Paulo S. L. M. Barreto authored at least 106 papers between 1999 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Faster Key Compression for Isogeny-Based Cryptosystems.
IEEE Trans. Computers, 2019

Schnorr-based implicit certification: improving the security and efficiency of V2X communications.
IACR Cryptology ePrint Archive, 2019

The Lattice-Based Digital Signature Scheme qTESLA.
IACR Cryptology ePrint Archive, 2019


2018
DAGS: Key encapsulation using dyadic GS codes.
J. Mathematical Cryptology, 2018

A class of safe and efficient binary Edwards curves.
J. Cryptographic Engineering, 2018

qSCMS: Post-quantum certificate provisioning process for V2X.
IACR Cryptology ePrint Archive, 2018

Cryptanalysis of the Wave Signature Scheme.
IACR Cryptology ePrint Archive, 2018

Designing Efficient Dyadic Operations for Cryptographic Applications.
IACR Cryptology ePrint Archive, 2018

DAGS: Reloaded Revisiting Dyadic Key Encapsulation.
IACR Cryptology ePrint Archive, 2018

Faster Isogeny-Based Compressed Key Agreement.
Proceedings of the Post-Quantum Cryptography - 9th International Conference, 2018

2017
Faster isogeny-based compressed key agreement.
IACR Cryptology ePrint Archive, 2017

Faster Cryptographic Hash Function From Supersingular Isogeny Graphs.
IACR Cryptology ePrint Archive, 2017

CAKE: Code-based Algorithm for Key Encapsulation.
IACR Cryptology ePrint Archive, 2017

A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM.
IACR Cryptology ePrint Archive, 2017

DAGS: Key Encapsulation using Dyadic GS Codes.
IACR Cryptology ePrint Archive, 2017

A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM.
CoRR, 2017

CAKE: Code-Based Algorithm for Key Encapsulation.
Proceedings of the Cryptography and Coding - 16th IMA International Conference, 2017

2016
Lyra2: Efficient Password Hashing with High Security against Time-Memory Trade-Offs.
IEEE Trans. Computers, 2016

Shorter hash-based signatures.
Journal of Systems and Software, 2016

Sharper Ring-LWE Signatures.
IACR Cryptology ePrint Archive, 2016

2015
Optimized and Scalable Co-Processor for McEliece with Binary Goppa Codes.
ACM Trans. Embedded Comput. Syst., 2015

Quantum-assisted QD-CFS signatures.
J. Comput. Syst. Sci., 2015

Security issues in Sarkar's e-cash protocol.
Inf. Process. Lett., 2015

Lyra2: Password Hashing Scheme with improved security against time-memory trade-offs.
IACR Cryptology ePrint Archive, 2015

Subgroup security in pairing-based cryptography.
IACR Cryptology ePrint Archive, 2015

Parallelism Level Analysis of Binary Field Multiplication on FPGAs.
Proceedings of the 2015 Brazilian Symposium on Computing Systems Engineering, 2015

Subgroup Security in Pairing-Based Cryptography.
Proceedings of the Progress in Cryptology - LATINCRYPT 2015, 2015

2014
Scaling efficient code-based cryptosystems for embedded platforms.
J. Cryptographic Engineering, 2014

Lyra: password-based key derivation with tunable memory and processing costs.
J. Cryptographic Engineering, 2014

Lyra: Password-Based Key Derivation with Tunable Memory and Processing Costs.
IACR Cryptology ePrint Archive, 2014

Scalable hardware implementation for Quasi-Dyadic Goppa encoder.
Proceedings of the IEEE 5th Latin American Symposium on Circuits and Systems, 2014

A Panorama of Post-quantum Cryptography.
Proceedings of the Open Problems in Mathematics and Computational Science, 2014

2013
Decoding Square-Free Goppa Codes Over $\BBF_{p}$.
IEEE Trans. Information Theory, 2013

SMSCrypto: A lightweight cryptographic framework for secure SMS transmission.
Journal of Systems and Software, 2013

The Realm of the Pairings.
IACR Cryptology ePrint Archive, 2013

A note on high-security general-purpose elliptic curves.
IACR Cryptology ePrint Archive, 2013

Survey and comparison of message authentication solutions on wireless sensor networks.
Ad Hoc Networks, 2013

The Realm of the Pairings.
Proceedings of the Selected Areas in Cryptography - SAC 2013, 2013

MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Revisiting the Security of the ALRED Design and Two of Its Variants: Marvin and LetterSoup.
IEEE Trans. Information Theory, 2012

MDPC-McEliece: New McEliece Variants from Moderate Density Parity-Check Codes.
IACR Cryptology ePrint Archive, 2012

Scaling efficient code-based cryptosystems for embedded platforms
CoRR, 2012

Dynamic method to evaluate code optimization effectiveness.
Proceedings of the Workshop on Software and Compilers for Embedded Systems, 2012

2011
Whirlpool.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

A family of implementation-friendly BN elliptic curves.
Journal of Systems and Software, 2011

One-time signature scheme from syndrome decoding over generic error-correcting codes.
Journal of Systems and Software, 2011

Monoidic Codes in Cryptography.
IACR Cryptology ePrint Archive, 2011

Decoding square-free Goppa codes over $\F_p$
CoRR, 2011

Monoidic Codes in Cryptography.
Proceedings of the Post-Quantum Cryptography - 4th International Workshop, 2011

Comparison of Authenticated-Encryption schemes in Wireless Sensor Networks.
Proceedings of the IEEE 36th Conference on Local Computer Networks, 2011

Key reduction of McEliece's cryptosystem using list decoding.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Signcryption Schemes Based on Bilinear Maps.
Proceedings of the Practical Signcryption, 2010

Signcryption Schemes Based on the Diffie-Hellman Problem.
Proceedings of the Practical Signcryption, 2010

Implementation of Multivariate Quadratic Quasigroup for Wireless Sensor Network.
Trans. Computational Science, 2010

A Family of Implementation-Friendly BN Elliptic Curves.
IACR Cryptology ePrint Archive, 2010

A new one-time signature scheme from syndrome decoding.
IACR Cryptology ePrint Archive, 2010

Decoding square-free Goppa codes over Fp.
IACR Cryptology ePrint Archive, 2010

Whirlwind: a new cryptographic hash function.
Des. Codes Cryptogr., 2010

A survey on key management mechanisms for distributed Wireless Sensor Networks.
Computer Networks, 2010

Revisiting the Security of the Alred Design.
Proceedings of the Information Security - 13th International Conference, 2010

Impact of Operating Systems on Wireless Sensor Networks (Security) Applications and Testbeds.
Proceedings of the 19th International Conference on Computer Communications and Networks, 2010

Quasi-Dyadic CFS Signatures.
Proceedings of the Information Security and Cryptology - 6th International Conference, 2010

2009
Providing Integrity and Authenticity in DICOM Images: A Novel Approach.
IEEE Trans. Information Technology in Biomedicine, 2009

The MARVIN message authentication code and the LETTERSOUP authenticated encryption scheme.
Security and Communication Networks, 2009

Compact McEliece Keys from Goppa Codes.
IACR Cryptology ePrint Archive, 2009

Compact McEliece Keys from Goppa Codes.
Proceedings of the Selected Areas in Cryptography, 16th Annual International Workshop, 2009

2008
Rotation symmetry in algebraically generated cryptographic substitution tables.
Inf. Process. Lett., 2008

The SIP Security Enhanced by Using Pairing-assisted Massey-Omura Signcryption.
IACR Cryptology ePrint Archive, 2008

The CURUPIRA-2 Block Cipher for Constrained Platforms: Specification and Benchmarking.
Proceedings of the 1st International Workshop on Privacy in Location-Based Applications, 2008

On Compressible Pairings and Their Computation.
Proceedings of the Progress in Cryptology, 2008

2007
A flexible processor for the characteristic 3 ηT pairing.
IJHPSA, 2007

On compressible pairings and their computation.
IACR Cryptology ePrint Archive, 2007

Efficient pairing computation on supersingular Abelian varieties.
Des. Codes Cryptogr., 2007

A Reconfigurable Processor for the Cryptographic nT Pairing in Characteristic 3.
Proceedings of the Fourth International Conference on Information Technology: New Generations (ITNG 2007), 2007

2006
Hardware Implementation of the ηT Pairing in Characteristic 3.
IACR Cryptology ePrint Archive, 2006

Demonstrating data possession and uncheatable data transfer.
IACR Cryptology ePrint Archive, 2006

Generating More MNT Elliptic Curves.
Des. Codes Cryptogr., 2006

Efficient Computation of Roots in Finite Fields.
Des. Codes Cryptogr., 2006

2005
On a (Flawed) Proposal to Build More Pairing-Friendly Curves.
IACR Cryptology ePrint Archive, 2005

Efficient hardware for the Tate pairing calculation in characteristic three.
IACR Cryptology ePrint Archive, 2005

Pairing-Friendly Elliptic Curves of Prime Order.
IACR Cryptology ePrint Archive, 2005

Pairing-Friendly Elliptic Curves of Prime Order.
Proceedings of the Selected Areas in Cryptography, 12th International Workshop, 2005

A New Two-Party Identity-Based Authenticated Key Agreement.
Proceedings of the Topics in Cryptology, 2005

Efficient Hardware for the Tate Pairing Calculation in Characteristic Three.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2005, 7th International Workshop, Edinburgh, UK, August 29, 2005

Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps.
Proceedings of the Advances in Cryptology, 2005

2004
Efficient Implementation of Pairing-Based Cryptosystems.
J. Cryptology, 2004

Generating more MNT elliptic curves.
IACR Cryptology ePrint Archive, 2004

Compressed Pairings.
IACR Cryptology ePrint Archive, 2004

A New Two-Party Identity-Based Authenticated Key Agreement.
IACR Cryptology ePrint Archive, 2004

Efficient and Forward-Secure Identity-Based Signcryption.
IACR Cryptology ePrint Archive, 2004

Efficient Pairing Computation on Supersingular Abelian Varieties.
IACR Cryptology ePrint Archive, 2004

A note on efficient computation of cube roots in characteristic 3.
IACR Cryptology ePrint Archive, 2004

Compressed Pairings.
Proceedings of the Advances in Cryptology, 2004

2003
On the Selection of Pairing-Friendly Groups.
IACR Cryptology ePrint Archive, 2003

On the Selection of Pairing-Friendly Groups.
Proceedings of the Selected Areas in Cryptography, 10th Annual International Workshop, 2003

2002
Constructing Elliptic Curves with Prescribed Embedding Degrees.
IACR Cryptology ePrint Archive, 2002

Efficient Algorithms for Pairing-Based Cryptosystems.
IACR Cryptology ePrint Archive, 2002

Constructing Elliptic Curves with Prescribed Embedding Degrees.
Proceedings of the Security in Communication Networks, Third International Conference, 2002

Efficient Algorithms for Pairing-Based Cryptosystems.
Proceedings of the Advances in Cryptology, 2002

2001
SQUARE Attacks on Reduced-Round PES and IDEA Block Ciphers.
IACR Cryptology ePrint Archive, 2001

Fast hashing onto elliptic curves over fields of characteristic 3.
IACR Cryptology ePrint Archive, 2001

Toward a secure public-key blockwise fragile authentication watermarking.
Proceedings of the 2001 International Conference on Image Processing, 2001

Improved SQUARE Attacks against Reduced-Round HIEROCRYPT.
Proceedings of the Fast Software Encryption, 8th International Workshop, 2001

2000
Fast Binary Image Resolution Increasing by K-Nearest Neighbor Learning.
Proceedings of the 2000 International Conference on Image Processing, 2000

1999
Pitfalls in Public Key Watermarking.
Proceedings of the XII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI '99), 1999


  Loading...