David Cash
Artificial Intelligence · 2009–2015
A researcher in the Science corpus: 5 papers; trusts 23 researchers and is trusted by 26 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 82 citations into it; #5,797 of 35,345 by trust here, #6,911 by citations
- Computational Theory and Mathematics — 43 citations into it; #2,835 of 12,182 by trust here, #1,437 by citations
- Computer Vision and Pattern Recognition — 28 citations into it; #7,257 of 21,575 by trust here, #9,305 by citations
- Information Systems — 21 citations into it
- Computer Networks and Communications — 10 citations into it
Whom David Cash trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Dan Boneh
- Craig Gentry
- Brent Waters
- Oded Regev
- Chris Peikert
- Seny Kamara
- Daniele Micciancio
- Xavier Boyen
- Melissa Chase
- Mihir Bellare
Who trusts David Cash overall
- Vadim Lyubashevsky
- Chris Peikert
- Raphael Bost
- Dan Boneh
- Zhihua Xia
- Shweta Agrawal
- Richard Lindner
- Zvika Brakerski
- Allison Bishop
- Muhammad Naveed
Papers from David Cash's perspective
Ordered by how strongly the researchers David Cash trusts endorse each paper. Same corpus, a different order for every researcher.
- Random oracles are practical: a paradigm for designing efficient protocols
- Public Key Encryption with Keyword Search (International Conference on the Theory and Application of Cryptographic Techniques)
- Fully homomorphic encryption using ideal lattices
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Chosen-Ciphertext Security from Identity-Based Encryption (SIAM journal on computing (Print))
- Secure Indexes (IACR Cryptology ePrint Archive)
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles) (Annual International Cryptology Conference)
- Efficient Identity-Based Encryption Without Random Oracles (International Conference on the Theory and Application of Cryptographic Techniques)
- On lattices, learning with errors, random linear codes, and cryptography
- Hierarchical ID-Based Cryptography (International Conference on the Theory and Application of Cryptology and Information Security)
Their papers
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems (2009) — 656 citations
- Bonsai Trees, or How to Delegate a Lattice Basis (2010) — 949 citations
- Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation (2014) — 791 citations
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries (2013) — 961 citations
- Leakage-Abuse Attacks Against Searchable Encryption (2015) — 678 citations