Ben Lynn
Artificial Intelligence · 2001–2003
A researcher in the Science corpus: 5 papers; trusts 19 researchers and is trusted by 117 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 30 citations into it; #1,709 of 35,345 by trust here, #3,440 by citations
- Information Systems — 25 citations into it; #91 of 8,771 by trust here, #193 by citations
- Computational Theory and Mathematics — 10 citations into it; #3,817 of 12,182 by trust here, #2,298 by citations
- Geometry and Topology — 8 citations into it
Whom Ben Lynn trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Antoine Joux
- Dan Boneh
- Jean-Sébastien Coron
- Paulo L. Barreto
- Atsuko Miyaji
- M. Franklin
- Tatsuaki Okamoto
- David Chaum
- Craig Gentry
- Alfred J. Menezes
Who trusts Ben Lynn overall
- Brent Waters
- Dan Boneh
- Xavier Boyen
- Craig Gentry
- Allison Bishop
- Paulo L. Barreto
- Qian Wang
- Shweta Agrawal
- Darrel Hankerson
- Hovav Shacham
Papers from Ben Lynn's perspective
Ordered by how strongly the researchers Ben Lynn trusts endorse each paper. Same corpus, a different order for every researcher.
- Short Signatures from the Weil Pairing
- New Explicit Conditions of Elliptic Curve Traces for FR-Reduction
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Efficient Algorithms for Pairing-Based Cryptosystems (Annual International Cryptology Conference)
- Handbook of Applied Cryptography
- Hierarchical ID-Based Cryptography (International Conference on the Theory and Application of Cryptology and Information Security)
- On the Exact Security of Full Domain Hash (Annual International Cryptology Conference)
- Constructing Elliptic Curves with Prescribed Embedding Degrees (International Conference on Security and Cryptography for Networks)
- Implementing the Tate Pairing (International Workshop on Ant Colony Optimization and Swarm Intelligence)
- A One Round Protocol for Tripartite Diffie–Hellman (Journal of Cryptology)
Their papers
- Short Signatures from the Weil Pairing (2001) — 4,798 citations
- Toward Hierarchical Identity-Based Encryption (2002) — 601 citations
- Aggregate and Verifiably Encrypted Signatures from Bilinear Maps (2003) — 2,058 citations
- Efficient Algorithms for Pairing-Based Cryptosystems (2002) — 1,139 citations
- Constructing Elliptic Curves with Prescribed Embedding Degrees (2002) — 370 citations