Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs. E. Boyle, N. Gilboa, Y. Ishai and A. Nof.
To appear in ASIACRYPT 2020.
An Efficient Passive-to-Active Compiler for Honest-Majority MPC over Rings. M. Abspoel, A. Dalskov, D. Escudero and A. Nof.
PDF
Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography. C. Baum and A. Nof.
PKC 2020.
PDF
Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs. E. Boyle, N. Gilboa, Y. Ishai and A. Nof.
ACM CCS 2019.
PDF
Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody. Y. Lindell and A. Nof.
ACM CCS 2018.
The full version of this paper, with optimizations, is co-authored with Samuel Ranellucci.
PDF
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. K. China, D. Genkin, K. Hamada, D. Ikarashi, R. Kikuchi, Y. Lindell and A. Nof.
CRYPTO 2018 PDF
A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority. Y. Lindell and A. Nof.
ACM CCS 2017.
PDF
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, A. Watzman, and O. Weinstein.
IEEE Security and Privacy Conference 2017.
PDF
High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority. J. Furukawa, Y. Lindell, A. Nof and O. Weinstein.
EUROCRYPT 2017.
PDF
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority. T. Araki, J. Furukawa, Y. Lindell, A. Nof and K. Ohara.
ACM CCS 2016. Recipient of the best-paper award. PDF
Fast Garbling of Circuits Under Standard Assumptions. S. Gueron, Y. Lindell, A. Nof and B. Pinkas.
ACM CCS 2015.
The full version appered in the Journal of Cryptology.
PDF
