Michael Scott

Artificial Intelligence · 2002–2010

A researcher in the Science corpus: 5 papers; trusts 20 researchers and is trusted by 32 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 39 citations into it; #6,108 of 35,345 by trust here, #10,207 by citations
• Information Systems — 33 citations into it; #634 of 8,771 by trust here, #1,158 by citations
• Computer Networks and Communications — 15 citations into it
• Geometry and Topology — 8 citations into it; #2,657 of 7,422 by trust here, #1,803 by citations
• Computational Theory and Mathematics — 6 citations into it; #7,169 of 12,182 by trust here, #6,463 by citations

Whom Michael Scott trusts overall

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

1. Paulo L. Barreto
2. Dan Boneh
3. Atsuko Miyaji
4. Florian Hess
5. Victor S. Miller
6. Ben Lynn
7. Steven D. Galbraith
8. M. Franklin
9. Antoine Joux
10. Nigel P. Smart

Who trusts Michael Scott overall

1. Koray Karabina
2. Michael Naehrig
3. David Mandell Freeman
4. Paulo L. Barreto
5. Eli Ben-Sasson
6. Edlyn Teske
7. Frederik Vercauteren
8. Florian Hess
9. Diego F. Aranha
10. Dan Boneh

Papers from Michael Scott's perspective

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

1. Short Signatures from the Weil Pairing
2. Efficient Algorithms for Pairing-Based Cryptosystems (Annual International Cryptology Conference)
3. Identity-Based Encryption from the Weil Pairing
4. Handbook of Applied Cryptography
5. New Explicit Conditions of Elliptic Curve Traces for FR-Reduction
6. Pairing-Friendly Elliptic Curves of Prime Order
7. Constructing Elliptic Curves with Prescribed Embedding Degrees (International Conference on Security and Cryptography for Networks)
8. AND T
9. The Weil Pairing, and Its Efficient Calculation (Journal of Cryptology)
10. Efficient pairing computation on supersingular Abelian varieties (IACR Cryptology ePrint Archive)

Their papers

• Efficient Algorithms for Pairing-Based Cryptosystems (2002) — 1,139 citations
• Efficient pairing computation on supersingular Abelian varieties (2007) — 507 citations
• A Taxonomy of Pairing-Friendly Elliptic Curves (2010) — 546 citations
• NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks (2008) — 313 citations
• Constructing Elliptic Curves with Prescribed Embedding Degrees (2002) — 370 citations