David Mandell Freeman
Artificial Intelligence · with Boneh · 2009–2011
A researcher in the Science corpus: 4 papers; trusts 47 researchers and is trusted by 24 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 50 citations into it; #6,637 of 35,345 by trust here, #13,163 by citations
- Computational Theory and Mathematics — 22 citations into it
- Information Systems — 22 citations into it; #1,073 of 8,771 by trust here, #3,198 by citations
- Computer Networks and Communications — 16 citations into it; #8,350 of 9,886 by trust here, #9,518 by citations
- Computer Vision and Pattern Recognition — 9 citations into it
- Geometry and Topology — 7 citations into it; #1,173 of 7,422 by trust here, #1,249 by citations
Whom David Mandell Freeman trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Dan Boneh
- Paulo L. Barreto
- Brent Waters
- Craig Gentry
- Ronald Cramer
- Allison Bishop
- Jonathan Katz
- Victor S. Miller
- Michael Naehrig
- Nigel P. Smart
Who trusts David Mandell Freeman overall
- Allison Bishop
- Brent Waters
- Koray Karabina
- Matteo Maffei
- Alex Escala
- Michael Naehrig
- Dan Boneh
- Diego F. Aranha
- Giulio Malavolta
- Shweta Agrawal
Papers from David Mandell Freeman's perspective
Ordered by how strongly the researchers David Mandell Freeman trusts endorse each paper. Same corpus, a different order for every researcher.
- Short Signatures from the Weil Pairing
- Identity-Based Encryption from the Weil Pairing
- Efficient Algorithms for Pairing-Based Cryptosystems (Annual International Cryptology Conference)
- Pairing-Friendly Elliptic Curves of Prime Order
- New Explicit Conditions of Elliptic Curve Traces for FR-Reduction
- Random oracles are practical: a paradigm for designing efficient protocols
- Efficient Identity-Based Encryption Without Random Oracles (International Conference on the Theory and Application of Cryptographic Techniques)
- New Directions in Cryptography
- Conjunctive, Subset, and Range Queries on Encrypted Data (Theory of Cryptography Conference)
- A One Round Protocol for Tripartite Diffie–Hellman (Journal of Cryptology)
Their papers
- Signing a Linear Subspace: Signature Schemes for Network Coding (2009) — 362 citations
- Homomorphic Signatures for Polynomial Functions (2011) — 305 citations
- Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups (2010) — 319 citations
- A Taxonomy of Pairing-Friendly Elliptic Curves (2010) — 546 citations