The SCEAS System
| |||||||

## Search the dblp DataBase
Paulo S. L. M. Barreto:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Paulo S. L. M. Barreto, Benoît Libert, Noel McCullagh, Jean-Jacques Quisquater
**Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps.**[Citation Graph (0, 0)][DBLP] ASIACRYPT, 2005, pp:515-532 [Conf] - Tim Kerins, William P. Marnane, Emanuel M. Popovici, Paulo S. L. M. Barreto
**Efficient Hardware for the Tate Pairing Calculation in Characteristic Three.**[Citation Graph (0, 0)][DBLP] CHES, 2005, pp:412-426 [Conf] - Paulo S. L. M. Barreto, Hae Yong Kim, Ben Lynn, Michael Scott
**Efficient Algorithms for Pairing-Based Cryptosystems.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2002, pp:354-368 [Conf] - Michael Scott, Paulo S. L. M. Barreto
**Compressed Pairings.**[Citation Graph (0, 0)][DBLP] CRYPTO, 2004, pp:140-156 [Conf] - Noel McCullagh, Paulo S. L. M. Barreto
**A New Two-Party Identity-Based Authenticated Key Agreement.**[Citation Graph (0, 0)][DBLP] CT-RSA, 2005, pp:262-274 [Conf] - Paulo S. L. M. Barreto, Vincent Rijmen, Jorge Nakahara Jr., Bart Preneel, Joos Vandewalle, Hae Yong Kim
**Improved SQUARE Attacks against Reduced-Round HIEROCRYPT.**[Citation Graph (0, 0)][DBLP] FSE, 2001, pp:165-173 [Conf] - Paulo S. L. M. Barreto, Hae Yong Kim, Vincent Rijmen
**Toward a secure public-key blockwise fragile authentication watermarking.**[Citation Graph (0, 0)][DBLP] ICIP (2), 2001, pp:494-497 [Conf] - Hae Yong Kim, Paulo S. L. M. Barreto
**Fast Binary Image Resolution Increasing by K-Nearest Neighbor Learning.**[Citation Graph (0, 0)][DBLP] ICIP, 2000, pp:- [Conf] - Robert Ronan, Colm O'Eigeartaigh, Colin C. Murphy, Tim Kerins, Paulo S. L. M. Barreto
**A Reconfigurable Processor for the Cryptographic nT Pairing in Characteristic 3.**[Citation Graph (0, 0)][DBLP] ITNG, 2007, pp:11-16 [Conf] - Paulo S. L. M. Barreto, Ben Lynn, Michael Scott
**On the Selection of Pairing-Friendly Groups.**[Citation Graph (0, 0)][DBLP] Selected Areas in Cryptography, 2003, pp:17-25 [Conf] - Paulo S. L. M. Barreto, Michael Naehrig
**Pairing-Friendly Elliptic Curves of Prime Order.**[Citation Graph (0, 0)][DBLP] Selected Areas in Cryptography, 2005, pp:319-331 [Conf] - Paulo S. L. M. Barreto, Ben Lynn, Michael Scott
**Constructing Elliptic Curves with Prescribed Embedding Degrees.**[Citation Graph (0, 0)][DBLP] SCN, 2002, pp:257-267 [Conf] - Paulo S. L. M. Barreto, Hae Yong Kim
**Pitfalls in Public Key Watermarking.**[Citation Graph (0, 0)][DBLP] SIBGRAPI, 1999, pp:241-0 [Conf] - Michael Scott, Paulo S. L. M. Barreto
**Generating More MNT Elliptic Curves.**[Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2006, v:38, n:2, pp:209-217 [Journal] - Paulo S. L. M. Barreto, José Felipe Voloch
**Efficient Computation of Roots in Finite Fields.**[Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2006, v:39, n:2, pp:275-280 [Journal] - Paulo S. L. M. Barreto, Ben Lynn, Michael Scott
**Efficient Implementation of Pairing-Based Cryptosystems.**[Citation Graph (0, 0)][DBLP] J. Cryptology, 2004, v:17, n:4, pp:321-334 [Journal] - Paulo S. L. M. Barreto, Steven D. Galbraith, Colm O'Eigeartaigh, Michael Scott
**Efficient pairing computation on supersingular Abelian varieties.**[Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2007, v:42, n:3, pp:239-271 [Journal] **The CURUPIRA-2 Block Cipher for Constrained Platforms: Specification and Benchmarking.**[Citation Graph (, )][DBLP]**Compact McEliece Keys from Goppa Codes.**[Citation Graph (, )][DBLP]**On Compressible Pairings and Their Computation.**[Citation Graph (, )][DBLP]
Search in 0.123secs, Finished in 0.124secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |