| High-throughput semi-honest secure three-party computation with an honest majority T Araki, J Furukawa, Y Lindell, A Nof, K Ohara Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016 | 283 | 2016 |
| High-throughput secure three-party computation for malicious adversaries and an honest majority J Furukawa, Y Lindell, A Nof, O Weinstein Annual international conference on the theory and applications of …, 2017 | 147 | 2017 |
| Optimized honest-majority MPC for malicious adversaries—breaking the 1 billion-gate per second barrier T Araki, A Barak, J Furukawa, T Lichter, Y Lindell, A Nof, K Ohara, ... 2017 IEEE Symposium on Security and Privacy (SP), 843-862, 2017 | 129 | 2017 |
| Fast large-scale honest-majority MPC for malicious adversaries K Chida, D Genkin, K Hamada, D Ikarashi, R Kikuchi, Y Lindell, A Nof Annual International Cryptology Conference, 34-64, 2018 | 117 | 2018 |
| Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody Y Lindell, A Nof Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications …, 2018 | 107 | 2018 |
| Fast garbling of circuits under standard assumptions S Gueron, Y Lindell, A Nof, B Pinkas Journal of Cryptology 31 (3), 798-844, 2018 | 91 | 2018 |
| A framework for constructing fast MPC over arithmetic circuits with malicious adversaries and an honest-majority Y Lindell, A Nof Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017 | 67 | 2017 |
| Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography C Baum, A Nof IACR International Conference on Public-Key Cryptography, 495-526, 2020 | 40 | 2020 |
| Practical fully secure three-party computation via sublinear distributed zero-knowledge proofs E Boyle, N Gilboa, Y Ishai, A Nof Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications …, 2019 | 31 | 2019 |
| Efficient fully secure computation via distributed zero-knowledge proofs E Boyle, N Gilboa, Y Ishai, A Nof International Conference on the Theory and Application of Cryptology and …, 2020 | 20 | 2020 |
| An efficient passive-to-active compiler for honest-majority MPC over rings M Abspoel, A Dalskov, D Escudero, A Nof International Conference on Applied Cryptography and Network Security, 122-152, 2021 | 19 | 2021 |
| High-throughput secure three-party computation of kerberos ticket generation T Araki, A Barak, J Furukawa, Y Lindell, A Nof, K Ohara Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016 | 10 | 2016 |
| Sublinear GMW-Style compiler for MPC with preprocessing E Boyle, N Gilboa, Y Ishai, A Nof Annual International Cryptology Conference, 457-485, 2021 | 5 | 2021 |
| Low-bandwidth threshold ECDSA via pseudorandom correlation generators D Abram, A Nof, C Orlandi, P Scholl, O Shlomovits Cryptology ePrint Archive, 2021 | 3 | 2021 |
| Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation F Benhamouda, E Boyle, N Gilboa, S Halevi, Y Ishai, A Nof Theory of Cryptography Conference, 129-161, 2021 | 1 | 2021 |
| Secure Multiparty Computation with Sublinear Preprocessing E Boyle, N Gilboa, Y Ishai, A Nof Annual International Conference on the Theory and Applications of …, 2022 | | 2022 |
| Fast Fully Secure Multi-Party Computation over Any Ring with Two-Thirds Honest Majority A Dalskov, D Escudero, A Nof Cryptology ePrint Archive, 2022 | | 2022 |
Yehuda LindellCryptographer at Coinbase; Professor of Computer Science, Bar-Ilan University (on leaveVerified email at biu.ac.il
