| Circuit-PSI With Linear Complexity via Relaxed Batch OPPRF. | 1 | 0.34 | 2022 |
| SiRnn: A Math Library for Secure RNN Inference | 1 | 0.35 | 2021 |
| Efficient Linear Multiparty PSI and Extensions to Circuit/Quorum PSI | 0 | 0.34 | 2021 |
| Adaptive Extractors And Their Application To Leakage Resilient Secret Sharing | 0 | 0.34 | 2021 |
| Blockene: A High-Throughput Blockchain Over Mobile Devices | 0 | 0.34 | 2020 |
| Universally Composable Secure Computation with Corrupted Tokens. | 0 | 0.34 | 2019 |
| SecureNN: 3-Party Secure Computation for Neural Network Training. | 10 | 0.52 | 2019 |
| EzPC: Programmable and Efficient Secure Two-Party Computation for Machine Learning | 4 | 0.40 | 2019 |
| CrypTFlow: Secure TensorFlow Inference | 3 | 0.42 | 2019 |
| SecureNN: Efficient and Private Neural Network Training. | 1 | 0.36 | 2018 |
| HOP: Hardware makes Obfuscation Practical. | 7 | 0.42 | 2017 |
| Universally Composable Secure Two and Multi-party Computation in the Corruptible Tamper-Proof Hardware Token Model. | 0 | 0.34 | 2017 |
| EzPC: Programmable, Efficient, and Scalable Secure Two-Party Computation. | 2 | 0.36 | 2017 |
| Efficient, Constant-Round and Actively Secure MPC: Beyond the Three-Party Case. | 2 | 0.36 | 2017 |
| Block-wise Non-Malleable Codes. | 0 | 0.34 | 2016 |
| Information-Theoretic Local Non-malleable Codes and Their Applications. | 9 | 0.48 | 2016 |
| Big Data Analytics over Encrypted Datasets with Seabed. | 10 | 0.47 | 2016 |
| Reducing Multilinear Map Levels in Constrained PRFs and ABE. | 0 | 0.34 | 2015 |
| The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults | 9 | 0.48 | 2015 |
| Functional Encryption: Decentralised and Delegatable. | 2 | 0.36 | 2015 |
| Constrained Pseudorandom Functions: Verifiable and Delegatable. | 10 | 0.47 | 2014 |
| Optimally Resilient and Adaptively Secure Multi-Party Computation with Low Communication Locality. | 3 | 0.36 | 2014 |
| Locally Updatable and Locally Decodable Codes. | 16 | 0.86 | 2014 |
| Almost-Everywhere Secure Computation with Edge Corruptions. | 4 | 0.41 | 2012 |
| Edge fault tolerance on sparse networks | 4 | 0.39 | 2012 |
| Functional re-encryption and collusion-resistant obfuscation | 18 | 0.76 | 2012 |
| Hardness Preserving Constructions of Pseudorandom Functions, Revisited. | 1 | 0.35 | 2012 |
| Position-Based Quantum Cryptography | 4 | 0.57 | 2011 |
| Collusion Resistant Obfuscation and Functional Re-encryption. | 1 | 0.37 | 2011 |
| Position-Based Quantum Cryptography: Impossibility and Constructions | 8 | 0.60 | 2010 |
| Privacy amplification with asymptotically optimal entropy loss | 9 | 0.58 | 2010 |
| Improved fault tolerance and secure computation on sparse networks | 9 | 0.47 | 2010 |
| A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks | 94 | 2.66 | 2009 |
| A Secure Cryptographic Token Interface | 18 | 1.04 | 2009 |
| New constructions for UC secure computation using tamper-proof hardware | 49 | 1.25 | 2008 |
| Public-key encryption with efficient amortized updates | 7 | 0.61 | 2008 |
| Ring signatures of sub-linear size without random oracles | 51 | 1.40 | 2007 |
| Covert Multi-Party Computation | 5 | 0.57 | 2007 |
| Improved algorithms for optimal embeddings | 3 | 0.44 | 2006 |
