Tim Erhan Güneysu
Artificial Intelligence · 2012–2013
A researcher in the Science corpus: 3 papers; trusts 12 researchers and is trusted by 9 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 42 citations into it; #14,105 of 35,345 by trust here, #19,873 by citations
- Computer Vision and Pattern Recognition — 18 citations into it
- Computational Theory and Mathematics — 12 citations into it; #7,914 of 12,182 by trust here, #8,756 by citations
- Information Systems — 5 citations into it
Whom Tim Erhan Güneysu trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Vadim Lyubashevsky
- Chris Peikert
- Daniele Micciancio
- Sanjeev Arora
- Daniel J. Bernstein
- Craig Gentry
- Nicolas Gama
- Oded Regev
- Rong Ge
- Damien Stehlé
Who trusts Tim Erhan Güneysu overall
- Léo Ducas
- Patrick Longa
- Vadim Lyubashevsky
- Tancrède Lepoint
- Eike Kiltz
- E. Alkım
- Carlos Aguilar Melchor
- Peter Schwabe
- Joppe W. Bos
- Thomas Pöppelmann
Papers from Tim Erhan Güneysu's perspective
Ordered by how strongly the researchers Tim Erhan Güneysu trusts endorse each paper. Same corpus, a different order for every researcher.
- On Ideal Lattices and Learning with Errors over Rings
- Trapdoors for hard lattices and new cryptographic constructions
- Predicting Lattice Reduction (International Conference on the Theory and Application of Cryptographic Techniques)
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller (IACR Cryptology ePrint Archive)
- Lattice Signatures Without Trapdoors (IACR Cryptology ePrint Archive)
- Efficient Public Key Encryption Based on Ideal Lattices (International Conference on the Theory and Application of Cryptology and Information Security)
- Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices (Theory of Cryptography Conference)
- Generalized Compact Knapsacks Are Collision Resistant (International Colloquium on Automata, Languages and Programming)
- Noise-tolerant learning, the parity problem, and the statistical query model (Symposium on the Theory of Computing)
- SWIFFT: A Modest Proposal for FFT Hashing (Fast Software Encryption Workshop)
Their papers
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems (2012) — 361 citations
- Software Speed Records for Lattice-Based Signatures (2013) — 87 citations
- PRINCE - A Low-Latency Block Cipher for Pervasive Computing Applications - Extended Abstract (2012) — 885 citations