| Bonsai trees, or how to delegate a lattice basis D Cash, D Hofheinz, E Kiltz, C Peikert Journal of cryptology 25, 601-639, 2012 | 1102 | 2012 |
| Highly-scalable searchable symmetric encryption with support for boolean queries D Cash, S Jarecki, C Jutla, H Krawczyk, MC Roşu, M Steiner Advances in Cryptology–CRYPTO 2013: 33rd Annual Cryptology Conference, Santa …, 2013 | 1052 | 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 NDSS Symposium, 2014 | 856 | 2014 |
| Fast cryptographic primitives and circular-secure encryption based on hard learning problems B Applebaum, D Cash, C Peikert, A Sahai Advances in Cryptology-CRYPTO 2009: 29th Annual International Cryptology …, 2009 | 775 | 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 | 705 | 2015 |
| The twin Diffie–Hellman problem and applications D Cash, E Kiltz, V Shoup Journal of Cryptology 22, 470-504, 2009 | 393 | 2009 |
| Dynamic proofs of retrievability via oblivious RAM D Cash, A Küpçü, D Wichs Journal of Cryptology 30, 22-57, 2017 | 316 | 2017 |
| The locality of searchable symmetric encryption D Cash, S Tessaro Advances in Cryptology–EUROCRYPT 2014: 33rd Annual International Conference …, 2014 | 158 | 2014 |
| 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 | 150 | 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 | 133 | 2017 |
| Cryptography secure against related-key attacks and tampering M Bellare, D Cash, R Miller Advances in Cryptology–ASIACRYPT 2011: 17th International Conference on the …, 2011 | 131 | 2011 |
| Pseudorandom functions and permutations provably secure against related-key attacks M Bellare, D Cash Annual Cryptology Conference, 666-684, 2010 | 130 | 2010 |
| The tao of inference in privacy-protected databases V Bindschaedler, P Grubbs, D Cash, T Ristenpart, V Shmatikov Cryptology ePrint Archive, 2017 | 105 | 2017 |
| Cryptographic agility and its relation to circular encryption T Acar, M Belenkiy, M Bellare, D Cash Advances in Cryptology–EUROCRYPT 2010: 29th Annual International Conference …, 2010 | 89 | 2010 |
| Intrusion-resilient key exchange in the bounded retrieval model D Cash, YZ Ding, Y Dodis, W Lee, R Lipton, S Walfish Theory of Cryptography: 4th Theory of Cryptography Conference, TCC 2007 …, 2007 | 82 | 2007 |
| How to delegate a lattice basis D Cash, D Hofheinz, E Kiltz Cryptology ePrint Archive, 2009 | 81 | 2009 |
| New definitions and separations for circular security D Cash, M Green, S Hohenberger International Workshop on Public Key Cryptography, 540-557, 2012 | 61 | 2012 |
| Targeted homomorphic attribute-based encryption Z Brakerski, D Cash, R Tsabary, H Wee Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016 | 59 | 2016 |
| 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 | 57 | 2009 |
| 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 | 50 | 2008 |
Eike KiltzProfessor of Computer Science, Ruhr-Universität Bochum在 rub.de 的电子邮件经过验证
