David Cash

Citeras av

	Alla	Sedan 2017
Citat	5707	3649
h-index	21	18
i10-index	27	26

700

350

175

525

20082009201020112012201320142015201620172018201920202021202215 54 82 146 214 218 317 403 520 652 618 693 664 627 395

Offentlig åtkomst

Visa alla

17 artiklar

1 artikel

tillgänglig

inte tillgänglig

Enligt krav från finansiärer

Medförfattare

Eike KiltzProfessor of Computer Science, Ruhr-Universität BochumVerifierad e-postadress på rub.de
Thomas RistenpartAssociate Professor of Computer Science, Cornell TechVerifierad e-postadress på cornell.edu
Chris PeikertProfessor, Computer Science and Engineering, University of MichiganVerifierad e-postadress på alum.mit.edu
Stanislaw JareckiUniversity of California Irvine (UCI)Verifierad e-postadress på uci.edu
Hugo KrawczykAlgorand FoundationVerifierad e-postadress på algorand.foundation
Michael SteinerResearch Scientist, Intel LabsVerifierad e-postadress på acm.org
Marcel RosuGoldman SachsVerifierad e-postadress på gs.com
Paul GrubbsUniversity of MichiganVerifierad e-postadress på umich.edu
Mihir BellareProfessor, Department of Computer Science and Engineering, University of California San Diego (UCSD)Verifierad e-postadress på eng.ucsd.edu
Dennis HofheinzDepartment of Computer Science, ETH ZürichVerifierad e-postadress på inf.ethz.ch
Victor ShoupPrincipal Researcher, DFINITY; Professor, NYU (on leave)Verifierad e-postadress på dfinity.org
Joseph JaegerAssistant Professor, Georgia Institute of TechnologyVerifierad e-postadress på gatech.edu
Amit SahaiSymantec Chair Professor of Computer Science; Professor of Mathematics (by courtesy), UCLAVerifierad e-postadress på cs.ucla.edu
Benny applebaumElectrical Engineering School, Tel-Aviv UniversityVerifierad e-postadress på post.tau.ac.il
Stefano TessaroUniversity of WashingtonVerifierad e-postadress på cs.washington.edu
Daniel WichsNortheastern University, Associate ProfessorVerifierad e-postadress på ccs.neu.edu
Alptekin KüpçüAssociate Professor, Koç UniversityVerifierad e-postadress på ku.edu.tr
Hoeteck WeeResearcher at CNRS / École Normale Supérieure, ParisVerifierad e-postadress på di.ens.fr
Vincent BindschaedlerAssistant Professor at the University of FloridaVerifierad e-postadress på cise.ufl.edu
Yevgeniy DodisProfessor, New York UniversityVerifierad e-postadress på cs.nyu.edu

Följ

David Cash

University of Chicago

Verifierad e-postadress på cs.uchicago.edu - Startsida

Cryptography


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
Bonsai trees, or how to delegate a lattice basis D Cash, D Hofheinz, E Kiltz, C Peikert Journal of cryptology 25 (4), 601-639, 2012	989	2012
Highly-scalable searchable symmetric encryption with support for boolean queries D Cash, S Jarecki, C Jutla, H Krawczyk, MC Roşu, M Steiner Annual cryptology conference, 353-373, 2013	899	2013
Dynamic searchable encryption in very-large databases: Data structures and implementation D Cash, J Jaeger, S Jarecki, C Jutla, H Krawczyk, MC Roşu, M Steiner Cryptology ePrint Archive, 2014	724	2014
Fast cryptographic primitives and circular-secure encryption based on hard learning problems B Applebaum, D Cash, C Peikert, A Sahai Annual International Cryptology Conference, 595-618, 2009	655	2009
Leakage-abuse attacks against searchable encryption D Cash, P Grubbs, J Perry, T Ristenpart Proceedings of the 22nd ACM SIGSAC conference on computer and communications …, 2015	541	2015
The twin Diffie–Hellman problem and applications D Cash, E Kiltz, V Shoup Journal of Cryptology 22 (4), 470-504, 2009	352	2009
Dynamic proofs of retrievability via oblivious RAM D Cash, A Küpçü, D Wichs Journal of Cryptology 30 (1), 22-57, 2017	271	2017
What else is revealed by order-revealing encryption? FB Durak, TM DuBuisson, D Cash Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016	130	2016
Efficient authentication from hard learning problems E Kiltz, K Pietrzak, D Venturi, D Cash, A Jain Journal of Cryptology 30 (4), 1238-1275, 2017	127	2017
The locality of searchable symmetric encryption D Cash, S Tessaro Annual international conference on the theory and applications of …, 2014	126	2014
Pseudorandom functions and permutations provably secure against related-key attacks M Bellare, D Cash Annual Cryptology Conference, 666-684, 2010	126	2010
Cryptography secure against related-key attacks and tampering M Bellare, D Cash, R Miller International Conference on the Theory and Application of Cryptology and …, 2011	121	2011
Cryptographic agility and its relation to circular encryption T Acar, M Belenkiy, M Bellare, D Cash Annual International Conference on the Theory and Applications of …, 2010	84	2010
The tao of inference in privacy-protected databases V Bindschaedler, P Grubbs, D Cash, T Ristenpart, V Shmatikov Cryptology ePrint Archive, 2017	79	2017
Intrusion-resilient key exchange in the bounded retrieval model D Cash, YZ Ding, Y Dodis, W Lee, R Lipton, S Walfish Theory of Cryptography Conference, 479-498, 2007	79	2007
New definitions and separations for circular security D Cash, M Green, S Hohenberger International Workshop on Public Key Cryptography, 540-557, 2012	58	2012
Foundations of non-malleable hash and one-way functions A Boldyreva, D Cash, M Fischlin, B Warinschi International Conference on the Theory and Application of Cryptology and …, 2009	54	2009
Targeted homomorphic attribute-based encryption Z Brakerski, D Cash, R Tsabary, H Wee Theory of Cryptography Conference, 330-360, 2016	53	2016
Minimal information disclosure with efficiently verifiable credentials D Bauer, DM Blough, D Cash Proceedings of the 4th ACM workshop on Digital identity management, 15-24, 2008	46	2008
Reducing the leakage in practical order-revealing encryption D Cash, FH Liu, A O'Neill, C Zhang Cryptology ePrint Archive, 2016	35	2016

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Följ

Citeras av

Medförfattare