Paulo L. Barreto

Artificial Intelligence · 2002–2013

A researcher in the Science corpus: 6 papers; trusts 19 researchers and is trusted by 53 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 34 citations into it; #3,314 of 35,345 by trust here, #8,439 by citations
• Information Systems — 28 citations into it; #224 of 8,771 by trust here, #885 by citations
• Computational Theory and Mathematics — 14 citations into it; #6,156 of 12,182 by trust here, #5,239 by citations
• Geometry and Topology — 6 citations into it; #4,527 of 7,422 by trust here, #3,547 by citations

Whom Paulo L. Barreto trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Dan Boneh
2. Atsuko Miyaji
3. Florian Hess
4. M. Franklin
5. Ben Lynn
6. Xavier Boyen
7. Steven D. Galbraith
8. Shafi Goldwasser
9. Jae Choon Cha
10. Liqun Chen

Who trusts Paulo L. Barreto overall

1. David Mandell Freeman
2. Dan Boneh
3. Xavier Boyen
4. Florian Hess
5. Michael Naehrig
6. Eli Ben-Sasson
7. Michael Scott
8. Frederik Vercauteren
9. Helger Lipmaa
10. Hovav Shacham

Papers from Paulo L. Barreto's perspective

Ordered by how strongly the researchers Paulo L. Barreto trusts endorse each paper. Same corpus, a different order for every researcher.

1. Short Signatures from the Weil Pairing
2. Random oracles are practical: a paradigm for designing efficient protocols
3. Efficient Algorithms for Pairing-Based Cryptosystems (Annual International Cryptology Conference)
4. Handbook of Applied Cryptography
5. Efficient Identity-Based Encryption Without Random Oracles (International Conference on the Theory and Application of Cryptographic Techniques)
6. Identity-Based Encryption from the Weil Pairing
7. New Explicit Conditions of Elliptic Curve Traces for FR-Reduction
8. Hierarchical ID-Based Cryptography (International Conference on the Theory and Application of Cryptology and Information Security)
9. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
10. Pairing-Friendly Elliptic Curves of Prime Order

Their papers

• Pairing-Friendly Elliptic Curves of Prime Order (2005) — 1,116 citations
• Efficient Algorithms for Pairing-Based Cryptosystems (2002) — 1,139 citations
• Efficient pairing computation on supersingular Abelian varieties (2007) — 507 citations
• Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps (2005) — 606 citations
• MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes (2013) — 435 citations
• Constructing Elliptic Curves with Prescribed Embedding Degrees (2002) — 370 citations