Ariel Nof Postdoc Researcher Department of Computer Science Technion Email: ariel.nof@cs.technion.ac.il

Publications

• White-City: A Framework For Massive MPC with Partial Synchrony and Partially Authenticated Channels.
  I. Eyal, D. Kolegov, A. Manuskin, A. Nof and O. Shlomovits

• Sublinear GMW-Style Compiler for MPC with Preprocessing.
  E. Boyle, N. Gilboa, Y. Ishai and A. Nof.
  To Appear in CRYPTO 2021 (International Conference on Cryptology).

• An Efficient Passive-to-Active Compiler for Honest-Majority MPC over Rings.
  M. Abspoel, A. Dalskov, D. Escudero and A. Nof.
  ACNS 2021 (International Conference on Applied Cryptography and Network Security).
  [PDF]

• Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs.
  E. Boyle, N. Gilboa, Y. Ishai and A. Nof.
  ASIACRYPT 2020 (International Conference on the Theory and Applications of Cryptology and Information Security).
  [PDF]

• Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography.
  C. Baum and A. Nof.
  PKC 2020 (International Conference on Practice and Theory of Public-Key Cryptography).
  [PDF]

• Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs.
  E. Boyle, N. Gilboa, Y. Ishai and A. Nof.
  CCS 2019 (ACM Conference on Computer and Communications Security).
  [PDF]

• Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody.
  Y. Lindell and A. Nof.
  CCS 2018 (ACM Conference on Computer and Communications Security).
  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 (International Conference on Cryptology).
  [PDF]

• A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority.
  Y. Lindell and A. Nof.
  CCS 2017 (ACM Conference on Computer and Communications Security).
  [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 (International Conference on the Theory and Applications of Cryptographic Techniques).
  [PDF]

• High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority.
  T. Araki, J. Furukawa, Y. Lindell, A. Nof and K. Ohara.
  CCS 2016 (ACM Conference on Computer and Communications Security).
  Recipient of the best-paper award.
  [PDF]

• Fast Garbling of Circuits Under Standard Assumptions.
  S. Gueron, Y. Lindell, A. Nof and B. Pinkas.
  CCS 2015 (ACM Conference on Computer and Communications Security).
  The full version appeared in the Journal of Cryptology.
  [PDF]

Program Committees

Teaching