| Blazing Fast PSI from Improved OKVS and Subfield VOLE | 0 | 0.34 | 2022 |
| Secret-Shared Joins with Multiplicity from Aggregation Trees | 0 | 0.34 | 2022 |
| Efficient Constructions for Almost-everywhere Secure Computation. | 0 | 0.34 | 2019 |
| Chosen-Ciphertext Secure Fully Homomorphic Encryption. | 11 | 0.50 | 2017 |
| Reducing Depth in Constrained PRFs: From Bit-Fixing to \mathbf NC^1. | 0 | 0.34 | 2016 |
| Information-Theoretic Local Non-malleable Codes and Their Applications. | 9 | 0.48 | 2016 |
| Reducing Multilinear Map Levels in Constrained PRFs and ABE. | 0 | 0.34 | 2015 |
| Constrained Pseudorandom Functions: Verifiable and Delegatable. | 10 | 0.47 | 2014 |
