| Compressed Oblivious Encoding for Homomorphically Encrypted Search | 0 | 0.34 | 2021 |
| Differentially-Private Multi-Party Sketching for Large-Scale Statistics. | 0 | 0.34 | 2020 |
| Multi Authority Access Control in a Cloud EHR System with MA-ABE | 1 | 0.37 | 2019 |
| rORAM - Efficient Range ORAM with O(log2 N) Locality. | 0 | 0.34 | 2019 |
| Privacy in e-Shopping Transactions: Exploring and Addressing the Trade-Offs. | 0 | 0.34 | 2018 |
| A Black-Box Construction of Non-Malleable Encryption from Semantically Secure Encryption. | 3 | 0.37 | 2018 |
| Improved, Black-Box, Non-Malleable Encryption from Semantic Security. | 1 | 0.35 | 2018 |
| Efficient Range ORAM with 핆(log2N) Locality. | 0 | 0.34 | 2018 |
| Deterministic, Stash-Free Write-Only ORAM. | 2 | 0.43 | 2017 |
| POPE: Partial Order-Preserving Encoding. | 0 | 0.34 | 2016 |
| ObliviSync: Practical Oblivious File Backup and Synchronization. | 3 | 0.38 | 2016 |
| Managing Cloud Storage Obliviously. | 0 | 0.34 | 2016 |
| A Practical Oblivious Map Data Structure with Secure Deletion and History Independence | 12 | 0.53 | 2016 |
| Oblivious Secure Deletion with Bounded History Independence | 0 | 0.34 | 2015 |
| Efficient Three-Party Computation from Cut-and-Choose. | 13 | 0.53 | 2014 |
| (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens. | 4 | 0.37 | 2014 |
| Blind Seer: A Scalable Private DBMS | 64 | 1.94 | 2014 |
| Multi-Client Non-Interactive Verifiable Computation. | 23 | 0.72 | 2013 |
| Self-Updatable Encryption: Time Constrained Access Control with Hidden Attributes and Better Efficiency | 9 | 0.53 | 2013 |
| Lossy trapdoor functions from homomorphic reproducible encryption | 3 | 0.42 | 2012 |
| On the security of the "Free-XOR" technique | 30 | 1.12 | 2012 |
| On the centrality of off-line e-cash to concrete partial information games | 0 | 0.34 | 2012 |
| Secure multi-party computation of boolean circuits with applications to privacy in on-line marketplaces | 30 | 1.01 | 2012 |
| (Efficient) Universally Composable Two-Party Computation Using a Minimal Number of Stateless Tokens. | 0 | 0.34 | 2011 |
| BiTR: built-in tamper resilience | 326 | 9.94 | 2011 |
| Simple, Black-Box Constructions of Adaptively Secure Protocols | 36 | 0.97 | 2009 |
| Secure Multi-party Computation Minimizing Online Rounds | 7 | 0.53 | 2009 |
| The Kurosawa--Desmedt key encapsulation is not chosen-ciphertext secure | 17 | 1.19 | 2009 |
| Improved Non-committing Encryption with Applications to Adaptively Secure Protocols | 37 | 1.11 | 2009 |
| Black-box construction of a non-malleable encryption scheme from any semantically secure one | 33 | 1.10 | 2008 |
| Reputation Systems for Anonymous Networks | 48 | 1.77 | 2008 |
| Fair Traceable Multi-Group Signatures | 11 | 0.52 | 2008 |
| Two-party computing with encrypted data | 12 | 0.54 | 2007 |
| Short traceable signatures based on bilinear pairings | 9 | 0.49 | 2006 |
