Keisuke Tanaka

Artificial Intelligence · 2006–2009

A researcher in the Science corpus: 2 papers; trusts 7 researchers and is trusted by 11 researchers here, as inferred from the citation graph.

Subfields

Whom Keisuke Tanaka trusts overall

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

  1. Oded Regev
  2. Chris Peikert
  3. Daniele Micciancio
  4. Craig Gentry
  5. Vadim Lyubashevsky
  6. Joël Alwen
  7. Amos Fiat

Who trusts Keisuke Tanaka overall

  1. Chris Peikert
  2. Vadim Lyubashevsky
  3. Oded Regev
  4. Damien Stehlé
  5. Craig Gentry
  6. Abbas Acar
  7. Dan Boneh
  8. Jing Ma
  9. Adeline Langlois
  10. Joppe W. Bos

Papers from Keisuke Tanaka's perspective

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

  1. Trapdoors for hard lattices and new cryptographic constructions
  2. Lossy trapdoor functions and their applications (SIAM journal on computing (Print))
  3. New lattice based cryptographic constructions
  4. Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions (The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.)
  5. Public-key cryptosystems from the worst-case shortest vector problem: extended abstract (Symposium on the Theory of Computing)
  6. Generating hard instances of lattice problems (extended abstract)
  7. Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices (Theory of Cryptography Conference)
  8. Generalized Compact Knapsacks Are Collision Resistant (International Colloquium on Automata, Languages and Programming)
  9. A sieve algorithm for the shortest lattice vector problem (Symposium on the Theory of Computing)
  10. Generating Shorter Bases for Hard Random Lattices (Theory of Computing Systems)

Their papers