( en | de | ru )

 

Disambiguation of "Cash, David"

Author of the publication

copydeleteadd this publication to your clipboard
Memory-Tight Reductions.

, , , and . CRYPTO (1), volume 10401 of Lecture Notes in Computer Science, page 101-132. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hannes Cash

Michael Cashmore

Neil Cashman

Allan Richard Cashdan

Eleanor Cashin-Ritaine

 

Other publications of authors with the same name

What Else is Revealed by Order-Revealing Encryption?, , and . ACM Conference on Computer and Communications Security, page 1155-1166. ACM, (2016)Digital Signatures from Strong RSA without Prime Generation., , and . Public Key Cryptography, volume 9020 of Lecture Notes in Computer Science, page 217-235. Springer, (2015)Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions., , , and . CRYPTO (1), volume 12170 of Lecture Notes in Computer Science, page 157-186. Springer, (2020)A Ciphertext-Size Lower Bound for Order-Preserving Encryption with Limited Leakage., and . IACR Cryptology ePrint Archive, (2017)Improved Structured Encryption for SQL Databases via Hybrid Indexing., , and . ACNS (2), volume 12727 of Lecture Notes in Computer Science, page 480-510. Springer, (2021)Reasoning Analytically about Password-Cracking Software., , , , and . IEEE Symposium on Security and Privacy, page 380-397. IEEE, (2019)Targeted Homomorphic Attribute-Based Encryption., , , and . TCC (B2), volume 9986 of Lecture Notes in Computer Science, page 330-360. (2016)Cryptographic Agility and Its Relation to Circular Encryption., , , and . EUROCRYPT, volume 6110 of Lecture Notes in Computer Science, page 403-422. Springer, (2010)Cryptography Secure against Related-Key Attacks and Tampering., , and . ASIACRYPT, volume 7073 of Lecture Notes in Computer Science, page 486-503. Springer, (2011)Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks., and . CRYPTO, volume 6223 of Lecture Notes in Computer Science, page 666-684. Springer, (2010)