| Authentication in the Bounded Storage Model. | 0 | 0.34 | 2022 |
| On the Worst-Case Inefficiency of CGKA. | 0 | 0.34 | 2022 |
| Encapsulated Search Index: Public-Key, Sub-linear, Distributed, and Delegatable. | 0 | 0.34 | 2022 |
| Updatable Public Key Encryption in the Standard Model. | 0 | 0.34 | 2022 |
| On Seedless PRNGs and Premature Next. | 0 | 0.34 | 2022 |
| Multicast Key Agreement, Revisited. | 0 | 0.34 | 2021 |
| Online Linear Extractors for Independent Sources. | 0 | 0.34 | 2021 |
| Seedless Fruit Is the Sweetest: Random Number Generation, Revisited | 0 | 0.34 | 2019 |
| Random Oracles and Non-Uniformity. | 6 | 0.41 | 2018 |
| The Double Ratchet: Security Notions, Proofs, and Modularization for the Signal Protocol. | 0 | 0.34 | 2018 |
| Provable Security of (Tweakable) Block Ciphers Based on Substitution-Permutation Networks. | 1 | 0.34 | 2018 |
| Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models. | 0 | 0.34 | 2018 |
| Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited. | 7 | 0.44 | 2017 |
| A New Distribution-Sensitive Secure Sketch and Popularity-Proportional Hashing. | 1 | 0.34 | 2017 |
| Basic Cryptography On Biometrics And Other Noisy Data | 0 | 0.34 | 2017 |
| Provable Security of Substitution-Permutation Networks. | 0 | 0.34 | 2017 |
| Indifferentiability of Confusion-Diffusion Networks. | 3 | 0.37 | 2016 |
| Non-Malleable Encryption: Simpler, Shorter, Stronger. | 15 | 0.57 | 2016 |
| Spooky Encryption and its Applications. | 15 | 0.57 | 2016 |
| Interactive Coding for Interactive Proofs. | 3 | 0.37 | 2016 |
| Indifferentiability of Confusion-Diffusion Networks. | 0 | 0.34 | 2015 |
| Interactive Encryption and Message Authentication. | 0 | 0.34 | 2014 |
| Non-malleable Reductions and Applications. | 32 | 1.05 | 2014 |
| Key Derivation Without Entropy Waste. | 2 | 0.37 | 2014 |
| Interactive Coding for Interactive Proofs. | 0 | 0.34 | 2014 |
| Privacy Amplification and Nonmalleable Extractors Via Character Sums. | 14 | 0.58 | 2014 |
| Privacy With Imperfect Randomness | 1 | 0.35 | 2014 |
| Overcoming weak expectations. | 25 | 0.98 | 2013 |
| Non-malleable codes from additive combinatorics | 29 | 1.05 | 2013 |
| Interactive Encryption, Message Authentication, and Anonymous Key Exchange. | 1 | 0.37 | 2013 |
| On the instantiability of hash-and-sign RSA signatures | 14 | 0.52 | 2012 |
| Counterexamples to hardness amplification beyond negligible | 4 | 0.39 | 2012 |
| Randomness condensers for efficiently samplable, seed-dependent sources | 15 | 0.59 | 2012 |
| Differential Privacy with Imperfect Randomness. | 3 | 0.40 | 2012 |
| Beating Shannon requires BOTH efficient adversaries AND non-zero advantage. | 0 | 0.34 | 2012 |
| Message authentication, revisited | 17 | 0.65 | 2012 |
| Shannon impossibility, revisited | 3 | 0.43 | 2012 |
| Storing Secrets on Continually Leaky Devices | 44 | 1.01 | 2011 |
| Privacy Amplification and Non-malleable Extractors via Character Sums | 14 | 0.70 | 2011 |
| Domain extension for MACs beyond the birthday barrier | 19 | 0.63 | 2011 |
| Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets | 85 | 3.03 | 2010 |
| Efficient Public-Key Cryptography in the Presence of Key Leakage. | 84 | 1.72 | 2010 |
| Changing base without losing space | 24 | 0.87 | 2010 |
| A domain extender for the ideal cipher | 20 | 0.63 | 2010 |
| Leakage-resilient pseudorandom functions and side-channel attacks on Feistel networks | 26 | 0.89 | 2010 |
| Salvaging Merkle-Damgård for Practical Applications | 52 | 1.39 | 2009 |
| Public-Key encryption in the bounded-retrieval model | 106 | 2.45 | 2009 |
| Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6 | 26 | 1.03 | 2009 |
| Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model | 147 | 3.68 | 2009 |
| Security Amplification for InteractiveCryptographic Primitives | 1 | 0.37 | 2009 |
