default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Cash
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i28]Archita Agarwal, David Cash, Marilyn George, Seny Kamara, Tarik Moataz, Jaspal Singh:
Updatable Private Set Intersection from Structured Encryption. IACR Cryptol. ePrint Arch. 2024: 1183 (2024)- 2023
- [i27]Ruth Ng, Alexander Hoover, David Cash, Eileen Ee:
Structured Encryption for Indirect Addressing. IACR Cryptol. ePrint Arch. 2023: 1146 (2023) - 2022
- [c33]Erik Aronesty, David Cash, Yevgeniy Dodis, Daniel H. Gallancy, Christopher Higley, Harish Karthikeyan, Oren Tysor:
Encapsulated Search Index: Public-Key, Sub-linear, Distributed, and Delegatable. Public Key Cryptography (2) 2022: 256-285 - [i26]Erik Aronesty, David Cash, Yevgeniy Dodis, Daniel H. Gallancy, Christopher Higley, Harish Karthikeyan, Oren Tysor:
Encapsulated Search Index: Public-Key, Sub-linear, Distributed, and Delegatable. IACR Cryptol. ePrint Arch. 2022: 71 (2022) - 2021
- [c32]David Cash, Ruth Ng, Adam Rivkin:
Improved Structured Encryption for SQL Databases via Hybrid Indexing. ACNS (2) 2021: 480-510 - [c31]Min Xu, Armin Namavari, David Cash, Thomas Ristenpart:
Searching Encrypted Data with Size-Locked Indexes. USENIX Security Symposium 2021: 4025-4042 - [i25]David Cash, Ruth Ng, Adam Rivkin:
Improved Structured Encryption for SQL Databases via Hybrid Indexing. IACR Cryptol. ePrint Arch. 2021: 852 (2021) - 2020
- [c30]Francesca Falzon
, Evangelia Anna Markatou, Akshima, David Cash, Adam Rivkin, Jesse Stern, Roberto Tamassia:
Full Database Reconstruction in Two Dimensions. CCS 2020: 443-460 - [c29]Akshima, David Cash, Andrew Drucker, Hoeteck Wee:
Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions. CRYPTO (1) 2020: 157-186 - [c28]David Cash, Andrew Drucker, Alexander Hoover:
A Lower Bound for One-Round Oblivious RAM. TCC (1) 2020: 457-485 - [i24]Akshima, David Cash, Francesca Falzon, Adam Rivkin, Jesse Stern:
Multidimensional Database Reconstruction from Range Query Access Patterns. IACR Cryptol. ePrint Arch. 2020: 296 (2020) - [i23]Akshima, David Cash, Andrew Drucker, Hoeteck Wee:
Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions. IACR Cryptol. ePrint Arch. 2020: 770 (2020) - [i22]David Cash, Andrew Drucker, Alexander Hoover:
A Lower Bound for One-Round Oblivious RAM. IACR Cryptol. ePrint Arch. 2020: 1195 (2020)
2010 – 2019
- 2019
- [c27]Enze Liu, Amanda Nakanishi, Maximilian Golla, David Cash, Blase Ur:
Reasoning Analytically about Password-Cracking Software. IEEE Symposium on Security and Privacy 2019: 380-397 - 2018
- [j5]Vincent Bindschaedler, Paul Grubbs, David Cash, Thomas Ristenpart, Vitaly Shmatikov:
The Tao of Inference in Privacy-Protected Databases. Proc. VLDB Endow. 11(11): 1715-1728 (2018) - [c26]David Cash, Feng-Hao Liu, Adam O'Neill, Mark Zhandry, Cong Zhang:
Parameter-Hiding Order Revealing Encryption. ASIACRYPT (1) 2018: 181-210 - [c25]David Cash, Cong Zhang:
A Ciphertext-Size Lower Bound for Order-Preserving Encryption with Limited Leakage. TCC (2) 2018: 159-176 - [i21]David Cash, Feng-Hao Liu, Adam O'Neill, Mark Zhandry, Cong Zhang:
Parameter-Hiding Order Revealing Encryption. IACR Cryptol. ePrint Arch. 2018: 698 (2018) - 2017
- [j4]David Cash, Alptekin Küpçü, Daniel Wichs:
Dynamic Proofs of Retrievability Via Oblivious RAM. J. Cryptol. 30(1): 22-57 (2017) - [j3]Eike Kiltz, Krzysztof Pietrzak, Daniele Venturi, David Cash, Abhishek Jain:
Efficient Authentication from Hard Learning Problems. J. Cryptol. 30(4): 1238-1275 (2017) - [c24]Benedikt Auerbach, David Cash, Manuel Fersch, Eike Kiltz:
Memory-Tight Reductions. CRYPTO (1) 2017: 101-132 - [c23]Liang Wang, Paul Grubbs, Jiahui Lu, Vincent Bindschaedler, David Cash, Thomas Ristenpart:
Side-Channel Attacks on Shared Search Indexes. IEEE Symposium on Security and Privacy 2017: 673-692 - [i20]Benedikt Auerbach, David Cash, Manuel Fersch, Eike Kiltz:
Memory-Tight Reductions. IACR Cryptol. ePrint Arch. 2017: 675 (2017) - [i19]Vincent Bindschaedler, Paul Grubbs, David Cash, Thomas Ristenpart, Vitaly Shmatikov:
The Tao of Inference in Privacy-Protected Databases. IACR Cryptol. ePrint Arch. 2017: 1078 (2017) - [i18]David Cash, Cong Zhang:
A Ciphertext-Size Lower Bound for Order-Preserving Encryption with Limited Leakage. IACR Cryptol. ePrint Arch. 2017: 1120 (2017) - 2016
- [c22]F. Betül Durak, Thomas M. DuBuisson, David Cash:
What Else is Revealed by Order-Revealing Encryption? CCS 2016: 1155-1166 - [c21]Cong Zhang, David Cash, Xiuhua Wang, Xiaoqi Yu, Sherman S. M. Chow:
Combiners for Chosen-Ciphertext Security. COCOON 2016: 257-268 - [c20]David Cash, Eike Kiltz, Stefano Tessaro:
Two-Round Man-in-the-Middle Security from LPN. TCC (A1) 2016: 225-248 - [c19]Zvika Brakerski, David Cash, Rotem Tsabary, Hoeteck Wee:
Targeted Homomorphic Attribute-Based Encryption. TCC (B2) 2016: 330-360 - [i17]David Cash, Feng-Hao Liu, Adam O'Neill, Cong Zhang:
Reducing the Leakage in Practical Order-Revealing Encryption. IACR Cryptol. ePrint Arch. 2016: 661 (2016) - [i16]Zvika Brakerski, David Cash, Rotem Tsabary, Hoeteck Wee:
Targeted Homomorphic Attribute Based Encryption. IACR Cryptol. ePrint Arch. 2016: 691 (2016) - [i15]David Cash, Paul Grubbs, Jason Perry, Thomas Ristenpart:
Leakage-Abuse Attacks Against Searchable Encryption. IACR Cryptol. ePrint Arch. 2016: 718 (2016) - [i14]F. Betül Durak, Thomas DuBuisson, David Cash:
What Else is Revealed by Order-Revealing Encryption? IACR Cryptol. ePrint Arch. 2016: 786 (2016) - 2015
- [c18]David Cash, Paul Grubbs, Jason Perry, Thomas Ristenpart:
Leakage-Abuse Attacks Against Searchable Encryption. CCS 2015: 668-679 - [c17]David Cash, Rafael Dowsley, Eike Kiltz:
Digital Signatures from Strong RSA without Prime Generation. Public Key Cryptography 2015: 217-235 - [i13]David Cash, Eike Kiltz, Stefano Tessaro:
Two-Round Man-in-the-Middle Security from LPN. IACR Cryptol. ePrint Arch. 2015: 1220 (2015) - 2014
- [c16]David Cash, Stefano Tessaro:
The Locality of Searchable Symmetric Encryption. EUROCRYPT 2014: 351-368 - [c15]David Cash, Joseph Jaeger, Stanislaw Jarecki, Charanjit S. Jutla, Hugo Krawczyk, Marcel-Catalin Rosu, Michael Steiner:
Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation. NDSS 2014 - [i12]David Cash, Stefano Tessaro:
The Locality of Searchable Symmetric Encryption. IACR Cryptol. ePrint Arch. 2014: 308 (2014) - [i11]David Cash, Joseph Jaeger, Stanislaw Jarecki, Charanjit S. Jutla, Hugo Krawczyk, Marcel-Catalin Rosu, Michael Steiner:
Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation. IACR Cryptol. ePrint Arch. 2014: 853 (2014) - 2013
- [c14]David Cash, Stanislaw Jarecki, Charanjit S. Jutla, Hugo Krawczyk, Marcel-Catalin Rosu, Michael Steiner:
Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries. CRYPTO (1) 2013: 353-373 - [c13]David Cash, Alptekin Küpçü, Daniel Wichs:
Dynamic Proofs of Retrievability via Oblivious RAM. EUROCRYPT 2013: 279-295 - [i10]David Cash, Stanislaw Jarecki, Charanjit S. Jutla, Hugo Krawczyk, Marcel-Catalin Rosu, Michael Steiner:
Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries. IACR Cryptol. ePrint Arch. 2013: 169 (2013) - 2012
- [j2]David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert:
Bonsai Trees, or How to Delegate a Lattice Basis. J. Cryptol. 25(4): 601-639 (2012) - [c12]David Cash, Matthew Green, Susan Hohenberger:
New Definitions and Separations for Circular Security. Public Key Cryptography 2012: 540-557 - [i9]David Cash, Alptekin Küpçü, Daniel Wichs:
Dynamic Proofs of Retrievability via Oblivious RAM. IACR Cryptol. ePrint Arch. 2012: 550 (2012) - 2011
- [c11]Mihir Bellare, David Cash, Rachel Miller:
Cryptography Secure against Related-Key Attacks and Tampering. ASIACRYPT 2011: 486-503 - [c10]Mihir Bellare, David Cash, Sriram Keelveedhi:
Ciphers that securely encipher their own keys. CCS 2011: 423-432 - [c9]Eike Kiltz, Krzysztof Pietrzak, David Cash, Abhishek Jain, Daniele Venturi:
Efficient Authentication from Hard Learning Problems. EUROCRYPT 2011: 7-26 - [i8]Mihir Bellare, David Cash, Rachel Miller:
Cryptography Secure Against Related-Key Attacks and Tampering. IACR Cryptol. ePrint Arch. 2011: 252 (2011) - [i7]Mihir Bellare, David Cash, Sriram Keelveedhi:
Ciphers that Securely Encipher their own Keys. IACR Cryptol. ePrint Arch. 2011: 432 (2011) - 2010
- [c8]Mihir Bellare, David Cash:
Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks. CRYPTO 2010: 666-684 - [c7]Tolga Acar, Mira Belenkiy, Mihir Bellare, David Cash:
Cryptographic Agility and Its Relation to Circular Encryption. EUROCRYPT 2010: 403-422 - [c6]David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert:
Bonsai Trees, or How to Delegate a Lattice Basis. EUROCRYPT 2010: 523-552 - [i6]Tolga Acar, Mira Belenkiy, Mihir Bellare, David Cash:
Cryptographic Agility and its Relation to Circular Encryption. IACR Cryptol. ePrint Arch. 2010: 117 (2010) - [i5]Mihir Bellare, David Cash:
Pseudorandom Functions and Permutations Provably Secure Against Related-Key Attacks. IACR Cryptol. ePrint Arch. 2010: 397 (2010) - [i4]David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert:
Bonsai Trees, or How to Delegate a Lattice Basis. IACR Cryptol. ePrint Arch. 2010: 591 (2010)
2000 – 2009
- 2009
- [j1]David Cash, Eike Kiltz, Victor Shoup:
The Twin Diffie-Hellman Problem and Applications. J. Cryptol. 22(4): 470-504 (2009) - [c5]Alexandra Boldyreva, David Cash, Marc Fischlin, Bogdan Warinschi:
Foundations of Non-malleable Hash and One-Way Functions. ASIACRYPT 2009: 524-541 - [c4]Benny Applebaum, David Cash, Chris Peikert, Amit Sahai:
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems. CRYPTO 2009: 595-618 - [i3]Alexandra Boldyreva, David Cash, Marc Fischlin, Bogdan Warinschi:
Foundations of Non-Malleable Hash and One-Way Functions. IACR Cryptol. ePrint Arch. 2009: 65 (2009) - [i2]David Cash, Dennis Hofheinz, Eike Kiltz:
How to Delegate a Lattice Basis. IACR Cryptol. ePrint Arch. 2009: 351 (2009) - 2008
- [c3]David Bauer, Douglas M. Blough, David Cash:
Minimal information disclosure with efficiently verifiable credentials. Digital Identity Management 2008: 15-24 - [c2]David Cash, Eike Kiltz, Victor Shoup:
The Twin Diffie-Hellman Problem and Applications. EUROCRYPT 2008: 127-145 - [i1]David Cash, Eike Kiltz, Victor Shoup:
The Twin Diffie-Hellman Problem and Applications. IACR Cryptol. ePrint Arch. 2008: 67 (2008) - 2007
- [c1]David Cash, Yan Zong Ding, Yevgeniy Dodis, Wenke Lee, Richard J. Lipton, Shabsi Walfish:
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model. TCC 2007: 479-498
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
