David Cash

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

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

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

2023
Structured Encryption for Indirect Addressing.
IACR Cryptol. ePrint Arch., 2023

2022
Encapsulated Search Index: Public-Key, Sub-linear, Distributed, and Delegatable.
IACR Cryptol. ePrint Arch., 2022

2021
Improved Structured Encryption for SQL Databases via Hybrid Indexing.
IACR Cryptol. ePrint Arch., 2021

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

2020
A Lower Bound for One-Round Oblivious RAM.
IACR Cryptol. ePrint Arch., 2020

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

Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions.
IACR Cryptol. ePrint Arch., 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

Parameter-Hiding Order Revealing Encryption.
IACR Cryptol. ePrint Arch., 2018

2017
Efficient Authentication from Hard Learning Problems.
J. Cryptol., 2017

Dynamic Proofs of Retrievability Via Oblivious RAM.
J. Cryptol., 2017

A Ciphertext-Size Lower Bound for Order-Preserving Encryption with Limited Leakage.
IACR Cryptol. ePrint Arch., 2017

Memory-Tight Reductions.
IACR Cryptol. ePrint Arch., 2017

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

2016
What Else is Revealed by Order-Revealing Encryption?
IACR Cryptol. ePrint Arch., 2016

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

Leakage-Abuse Attacks Against Searchable Encryption.
IACR Cryptol. ePrint Arch., 2016

Targeted Homomorphic Attribute Based Encryption.
IACR Cryptol. ePrint Arch., 2016

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

2015
Two-Round Man-in-the-Middle Security from LPN.
IACR Cryptol. ePrint Arch., 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

2014
The Locality of Searchable Symmetric Encryption.
IACR Cryptol. ePrint Arch., 2014

Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation.
IACR Cryptol. ePrint Arch., 2014

2013
Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries.
IACR Cryptol. ePrint Arch., 2013

2012
Bonsai Trees, or How to Delegate a Lattice Basis.
J. Cryptol., 2012

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

2011
Cryptography Secure Against Related-Key Attacks and Tampering.
IACR Cryptol. ePrint Arch., 2011

Ciphers that Securely Encipher their own Keys.
IACR Cryptol. ePrint Arch., 2011

2010
Pseudorandom Functions and Permutations Provably Secure Against Related-Key Attacks.
IACR Cryptol. ePrint Arch., 2010

Cryptographic Agility and its Relation to Circular Encryption.
IACR Cryptol. ePrint Arch., 2010

2009
The Twin Diffie-Hellman Problem and Applications.
J. Cryptol., 2009

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

Foundations of Non-Malleable Hash and One-Way Functions.
IACR Cryptol. ePrint Arch., 2009

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

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...