Antoine Joux
Artificial Intelligence · 2000–2012
A researcher in the Science corpus: 4 papers; trusts 12 researchers and is trusted by 84 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 10 citations into it; #2,067 of 35,345 by trust here, #10,798 by citations
- Information Systems — 7 citations into it; #124 of 8,771 by trust here, #1,815 by citations
Whom Antoine Joux trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Dan Boneh
- Jean-Charles Faugère
- M. Franklin
- Paulo L. Barreto
- David A. Wagner
- Ben Lynn
- Atsuko Miyaji
- Ran Canetti
- Steven D. Galbraith
- Nicolas T. Courtois
Who trusts Antoine Joux overall
- Dan Boneh
- Xavier Boyen
- Florian Hess
- Wenbo Mao
- Jonathan Katz
- Ben Lynn
- Fangguo Zhang
- Koray Karabina
- Steven D. Galbraith
- Liqun Chen
Papers from Antoine Joux's perspective
Ordered by how strongly the researchers Antoine Joux 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
- Efficient Algorithms for Pairing-Based Cryptosystems (Annual International Cryptology Conference)
- Implementing the Tate Pairing (International Workshop on Ant Colony Optimization and Swarm Intelligence)
- Identity-Based Encryption from the Weil Pairing
- Constructing Elliptic Curves with Prescribed Embedding Degrees (International Conference on Security and Cryptography for Networks)
- The random oracle methodology, revisited (JACM)
- On lattices, learning with errors, random linear codes, and cryptography
- Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations (International Conference on the Theory and Application of Cryptographic Techniques)
- Handbook of Applied Cryptography
Their papers
- A One Round Protocol for Tripartite Diffie–Hellman (2000) — 1,581 citations
- Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases (2003) — 461 citations
- Decoding Random Binary Linear Codes in 2n/20: How 1+1=0 Improves Information Set Decoding (2012) — 441 citations
- Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions (2004) — 457 citations