| Functional signatures and pseudorandom functions E Boyle, S Goldwasser, I Ivan International workshop on public key cryptography, 501-519, 2014 | 387 | 2014 |
| Function secret sharing E Boyle, N Gilboa, Y Ishai Annual international conference on the theory and applications of …, 2015 | 206 | 2015 |
| On extractability obfuscation E Boyle, KM Chung, R Pass Theory of cryptography conference, 52-73, 2014 | 201 | 2014 |
| Function secret sharing: Improvements and extensions E Boyle, N Gilboa, Y Ishai Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016 | 142 | 2016 |
| Fully leakage-resilient signatures E Boyle, G Segev, D Wichs Journal of cryptology 26 (3), 513-558, 2013 | 134 | 2013 |
| Breaking the circuit size barrier for secure computation under DDH E Boyle, N Gilboa, Y Ishai Annual International Cryptology Conference, 509-539, 2016 | 122 | 2016 |
| Oblivious parallel RAM and applications E Boyle, KM Chung, R Pass Theory of Cryptography Conference, 175-204, 2016 | 104 | 2016 |
| Efficient pseudorandom correlation generators: Silent OT extension and more E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Scholl Annual International Cryptology Conference, 489-518, 2019 | 103 | 2019 |
| Efficient two-round OT extension and silent non-interactive secure computation E Boyle, G Couteau, N Gilboa, Y Ishai, L Kohl, P Rindal, P Scholl Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications …, 2019 | 88 | 2019 |
| Limits of extractability assumptions with distributional auxiliary input E Boyle, R Pass International Conference on the Theory and Application of Cryptology and …, 2015 | 78 | 2015 |
| Compressing vector OLE E Boyle, G Couteau, N Gilboa, Y Ishai Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications …, 2018 | 71 | 2018 |
| Group-based secure computation: optimizing rounds, communication, and computation E Boyle, N Gilboa, Y Ishai Annual International Conference on the Theory and Applications of …, 2017 | 67 | 2017 |
| Large-scale secure computation: Multi-party computation for (parallel) RAM programs E Boyle, KM Chung, R Pass Annual Cryptology Conference, 742-762, 2015 | 67* | 2015 |
| Communication locality in secure multi-party computation E Boyle, S Goldwasser, S Tessaro Theory of Cryptography Conference, 356-376, 2013 | 66 | 2013 |
| Is there an oblivious ram lower bound? E Boyle, M Naor Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016 | 64 | 2016 |
| Zero-knowledge proofs on secret-shared data via fully linear PCPs D Boneh, E Boyle, H Corrigan-Gibbs, N Gilboa, Y Ishai Annual International Cryptology Conference, 67-97, 2019 | 61 | 2019 |
| Foundations of homomorphic secret sharing E Boyle, N Gilboa, Y Ishai, H Lin, S Tessaro Cryptology ePrint Archive, 2017 | 59 | 2017 |
| Homomorphic secret sharing: optimizations and applications E Boyle, G Couteau, N Gilboa, Y Ishai, M Orrų Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017 | 54 | 2017 |
| Multiparty computation secure against continual memory leakage E Boyle, S Goldwasser, A Jain, YT Kalai Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 53 | 2012 |
| Homomorphic secret sharing from lattices without FHE E Boyle, L Kohl, P Scholl Annual International Conference on the Theory and Applications of …, 2019 | 43 | 2019 |
