Akinori Kawachi
Artificial Intelligence · 2006
A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 4 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 7 citations into it; #19,886 of 35,345 by trust here, #24,417 by citations
Whom Akinori Kawachi trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Akinori Kawachi overall
Papers from Akinori Kawachi's perspective
Ordered by how strongly the researchers Akinori Kawachi trusts endorse each paper. Same corpus, a different order for every researcher.
- Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions (The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.)
- New lattice based cryptographic constructions
- Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices (Theory of Cryptography Conference)
- Generating hard instances of lattice problems (extended abstract)
- Worst-case to average-case reductions based on Gaussian measures
- Probability Inequalities for Sums of Bounded Random Variables
- Collision-Free Hashing from Lattice Problems
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller (IACR Cryptology ePrint Archive)
- Predicting Lattice Reduction (International Conference on the Theory and Application of Cryptographic Techniques)
Their papers
- Multi-bit Cryptosystems Based on Lattice Problems (2006) — 100 citations