Ron Steinfeld
Artificial Intelligence · 2002–2014
A researcher in the Science corpus: 6 papers; trusts 34 researchers and is trusted by 45 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 63 citations into it; #3,480 of 35,345 by trust here, #9,760 by citations
- Computational Theory and Mathematics — 37 citations into it; #690 of 12,182 by trust here, #2,104 by citations
- Computer Vision and Pattern Recognition — 17 citations into it
- Information Systems — 10 citations into it; #374 of 8,771 by trust here, #1,895 by citations
- Computer Networks and Communications — 9 citations into it; #3,568 of 9,886 by trust here, #4,594 by citations
- Privacy & Security — 6 citations into it
Whom Ron Steinfeld trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Craig Gentry
- Chris Peikert
- Oded Regev
- Daniele Micciancio
- Vadim Lyubashevsky
- Shafi Goldwasser
- W. Hoeffding
- Dan Boneh
- Hugo Krawczyk
- Nigel P. Smart
Who trusts Ron Steinfeld overall
- Vadim Lyubashevsky
- Yarkin Doröz
- Joppe W. Bos
- Wei Dai
- Erdinç Öztürk
- Berk Sunar
- Jintai Ding
- Kristin E. Lauter
- Abbas Acar
- Zvika Brakerski
Papers from Ron Steinfeld's perspective
Ordered by how strongly the researchers Ron Steinfeld trusts endorse each paper. Same corpus, a different order for every researcher.
- Fully homomorphic encryption using ideal lattices
- Trapdoors for hard lattices and new cryptographic constructions
- On lattices, learning with errors, random linear codes, and cryptography
- Predicting Lattice Reduction (International Conference on the Theory and Application of Cryptographic Techniques)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Lossy trapdoor functions and their applications (SIAM journal on computing (Print))
- A fully homomorphic encryption scheme
- On Ideal Lattices and Learning with Errors over Rings
- Public-key cryptosystems from the worst-case shortest vector problem: extended abstract (Symposium on the Theory of Computing)
- Generating Shorter Bases for Hard Random Lattices (Theory of Computing Systems)
Their papers
- Efficient Public Key Encryption Based on Ideal Lattices (2009) — 430 citations
- Making NTRU as Secure as Worst-Case Problems over Ideal Lattices (2011) — 468 citations
- GGHLite: More Efficient Multilinear Maps from Ideal Lattices (2014) — 182 citations
- Making NTRUEncrypt and NTRUSign as Secure as Standard Worst-Case Problems over Ideal Lattices (2013) — 85 citations
- Faster Fully Homomorphic Encryption (2010) — 342 citations
- Formal Proofs for the Security of Signcryption (2002) — 372 citations