| Improved Stock Market Structure Using Cryptography. | 0 | 0.34 | 2022 |
| Secure Storage with Deduplication. | 0 | 0.34 | 2022 |
| Inflation-Tracking Proof-of-Work Crypto-Currencies. | 0 | 0.34 | 2021 |
| Efficient Searchable Symmetric Encryption for Join Queries. | 0 | 0.34 | 2021 |
| Improved (Almost) Tightly-Secure Simulation-Sound QA-NIZK with Applications. | 0 | 0.34 | 2018 |
| Authenticated Encryption Mode IAPM using SHA-3's Public Random Permutation. | 0 | 0.34 | 2018 |
| Obfuscation using Tensor Products. | 0 | 0.34 | 2018 |
| Improved Structure Preserving Signatures under Standard Bilinear Assumptions. | 6 | 0.41 | 2017 |
| Smooth NIZK Arguments with Applications to Asymmetric UC-PAKE. | 0 | 0.34 | 2016 |
| Weak Ideal Functionalities for Designing Random Oracles with Applications to Fugue. | 0 | 0.34 | 2015 |
| Dual-System Simulation-Soundness with Applications to UC-PAKE and More. | 0 | 0.34 | 2015 |
| Upending Stock Market Structure Using Secure Multi-Party Computation. | 1 | 0.34 | 2015 |
| Private Database Access With HE-over-ORAM Architecture. | 17 | 0.58 | 2015 |
| Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation. | 0 | 0.34 | 2014 |
| The Hash Function "Fugue". | 0 | 0.34 | 2014 |
| Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries. | 220 | 5.96 | 2013 |
| Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces. | 17 | 0.57 | 2013 |
| Optimizing ORAM and Using it Efficiently for Secure Computation. | 74 | 1.89 | 2013 |
| Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces | 50 | 1.23 | 2013 |
| PayTree: "Amortized Signature" for Flexible Micro-Payments. | 29 | 4.80 | 2012 |
| Decision Procedures for Simulatability. | 2 | 0.36 | 2012 |
| On the Circuit Complexity of Composite Galois Field Transformations. | 0 | 0.34 | 2012 |
| Universally Composable Security Analysis of OAuth v2.0. | 20 | 1.06 | 2011 |
| A Completeness Theorem for Pseudo-Linear Functions with Applications to UC Security | 1 | 0.35 | 2010 |
| Provably Good Codes for Hash Function Design | 4 | 0.80 | 2009 |
| Encryption Modes with Almost Free Message Integrity | 123 | 30.35 | 2008 |
| Utility Sampling for Trust Metrics in PKI. | 0 | 0.34 | 2007 |
| PRF domain extension using DAGs | 9 | 0.71 | 2006 |
| A Simple Biased Distribution for Dinur's Construction | 0 | 0.34 | 2006 |
| A Simple and Provably Good Code for SHA Message Expansion | 8 | 0.75 | 2005 |
| Is SHA-1 conceptually sound? | 4 | 0.46 | 2005 |
| A Matching Lower Bound on the Minimum Weight of SHA-1 Expansion Code | 8 | 0.73 | 2005 |
| Testing Low-Degree Polynomials over Prime Fields | 32 | 1.38 | 2004 |
| Lower Bound on Linear Authenticated Encryption | 0 | 0.34 | 2003 |
| Scream: A Software-Efficient Stream Cipher | 31 | 2.81 | 2002 |
| Parallelizable Authentication Trees | 16 | 0.95 | 2002 |
| Tight Lower Bound on Linear Authenticated Encryption. | 1 | 1.70 | 2002 |
| Cryptanalysis of Stream Ciphers with Linear Masking | 66 | 6.08 | 2002 |
| On model checking for the µ-calculus and its fragments | 20 | 0.98 | 2001 |
| Efficient Rijndael Encryption Implementation with Composite Field Arithmetic | 100 | 16.53 | 2001 |
| IBM Comments | 0 | 0.34 | 2000 |
| Secure distributed storage and retrieval | 53 | 6.09 | 2000 |
| The Complexity of Tree Automata and Logics of Programs | 179 | 18.37 | 1999 |
| Towards Sound Approaches to Counteract Power-Analysis Attacks | 327 | 40.00 | 1999 |
| On Finding Small Solutions of Modular Multivariate Polynomial Equations | 16 | 2.94 | 1998 |
| Generalized Birthday Arracks on Unbalanced Feistel Networks | 12 | 0.79 | 1998 |
| Determinization and memoryless winning strategies | 6 | 0.80 | 1997 |
| A Methodology for Designing Proof Rules for Fair Parallel Programs | 1 | 0.35 | 1997 |
| On Model-Checking for Fragments of µ-Calculus | 146 | 11.51 | 1993 |
| Finding extremal sets in less than quadratic time | 15 | 1.32 | 1993 |
