David Cash

Orcid: 0009-0005-4230-658X

According to our database1, David Cash authored at least 39 papers between 2007 and 2025.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Structured Encryption for Indirect Addressing.
IACR Commun. Cryptol., 2025

2024
Updatable Private Set Intersection from Structured Encryption.
IACR Cryptol. ePrint Arch., 2024

2022
Encapsulated Search Index: Public-Key, Sub-linear, Distributed, and Delegatable.
Proceedings of the Public-Key Cryptography - PKC 2022, 2022

2021
Searching Encrypted Data with Size-Locked Indexes.
Proceedings of the 30th USENIX Security Symposium, 2021

Improved Structured Encryption for SQL Databases via Hybrid Indexing.
Proceedings of the Applied Cryptography and Network Security, 2021

2020
Multidimensional Database Reconstruction from Range Query Access Patterns.
IACR Cryptol. ePrint Arch., 2020

A Lower Bound for One-Round Oblivious RAM.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Full Database Reconstruction in Two Dimensions.
Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019
Reasoning Analytically about Password-Cracking Software.
Proceedings of the 2019 IEEE Symposium on Security and Privacy, 2019

2018
The Tao of Inference in Privacy-Protected Databases.
Proc. VLDB Endow., 2018

A Ciphertext-Size Lower Bound for Order-Preserving Encryption with Limited Leakage.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Parameter-Hiding Order Revealing Encryption.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
Side-Channel Attacks on Shared Search Indexes.
Proceedings of the 2017 IEEE Symposium on Security and Privacy, 2017

Memory-Tight Reductions.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
Reducing the Leakage in Practical Order-Revealing Encryption.
IACR Cryptol. ePrint Arch., 2016

Two-Round Man-in-the-Middle Security from LPN.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Targeted Homomorphic Attribute-Based Encryption.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Combiners for Chosen-Ciphertext Security.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

What Else is Revealed by Order-Revealing Encryption?
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Digital Signatures from Strong RSA without Prime Generation.
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

Leakage-Abuse Attacks Against Searchable Encryption.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation.
Proceedings of the 21st Annual Network and Distributed System Security Symposium, 2014

The Locality of Searchable Symmetric Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013
Dynamic Proofs of Retrievability via Oblivious RAM.
Proceedings of the Advances in Cryptology, 2013

Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
New Definitions and Separations for Circular Security.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

2011
Efficient Authentication from Hard Learning Problems.
Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Ciphers that securely encipher their own keys.
Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

Cryptography Secure against Related-Key Attacks and Tampering.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010
Bonsai Trees, or How to Delegate a Lattice Basis.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Cryptographic Agility and Its Relation to Circular Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks.
Proceedings of the Advances in Cryptology, 2010

2009
How to Delegate a Lattice Basis.
IACR Cryptol. ePrint Arch., 2009

Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems.
Proceedings of the Advances in Cryptology, 2009

Foundations of Non-malleable Hash and One-Way Functions.
Proceedings of the Advances in Cryptology, 2009

2008
The Twin Diffie-Hellman Problem and Applications.
Proceedings of the Advances in Cryptology, 2008

Minimal information disclosure with efficiently verifiable credentials.
Proceedings of the 4th Workshop on Digital Identity Management, 2008

2007
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model.
Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007


  Loading...