About Me

I am a faculty member (senior lecturer, aka, assistant professor) at the Department of Computer Science, and a member of the Applied Cryptography and Cyber Security Research Center at Bar-Ilan University.

Between 2019 and 2022, I was a postdoc in the Department of Computer Science at the Technion, hosted by Prof. Yuval Yishai. I completed my Ph.D. in 2019 working in the Applied Cryptography and Cyber Security Research Center at Bar-Ilan University, under the supervision of Prof. Yehuda Lindell. I received my M.Sc. from the Department of Computer Science, Bar-Ilan University, under the supervision of Prof. Yehuda Lindell.

My research interests are in applied cryptography, with a focus on secure multiparty computation (MPC).

Publications

Fast PCGs for Batch-Authenticated Multiplication Triples E. Boyle, N. Gilboa, M. Hamilis, Y. Ishai and A. Nof.
CRYPTO 2026
Dishonest-Majority Secure Computation via PIR-Authenticated Multiplication Triples E. Boyle, N. Gilboa, M. Hamilis, Y. Ishai and A. Nof.
CRYPTO 2026
PDF
Scaling Fully Secure MPC via Robust Recursive Search and Gap Amplification M. Hamilis and A. Nof
PKC 2026
PDF
Trout: Two-Round Threshold ECDSA from Class Groups H. Dahari-Garbian, A. Nof and L. Parker.
ACM CCS 2025
PDF
Preprocessing for Life: Dishonest-Majority MPC with a Trusted or Untrusted Dealer E. Boyle, N. Gilboa, M. Hamilis, Y. Ishai and A. Nof.
IEEE Symposium on Security and Privacy 2025
PDF
Fully Secure MPC and zk-FLIOP over Rings: New Constructions, Improvements and Extensions A. Dalskov, D. Escudero and A. Nof.
CRYPTO 2024
PDF
Secure Statistical Analysis on Multiple Datasets: Join and Group-By G. Asharov, K. Hamada, R. Kikuchi, A. Nof, B. Pinkas, and J. Tomida.
ACM CCS 2023
PDF
Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters G. Asharov, K. Hamada, D. Ikarashi, R. Kikuchi, A. Nof, B. Pinkas, K. Takahashi and J. Tomida.
ACM CCS 2022
PDF
Fast Fully Secure Multi-Party Computation over Any Ring with Two-Thirds Honest Majority A. Dalskov, D. Escudero and A. Nof.
ACM CCS 2022
PDF
Secure Multiparty Computation with Sublinear Preprocessing. E. Boyle, N. Gilboa, Y. Ishai and A. Nof.
EUROCRYPT 2022
Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators. D. Abram, A. Nof, C. Orlandi, P. Scholl and O. Shlomovits.
IEEE Symposium on Security and Privacy 2022
PDF
Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation. F. Benhamouda, E. Boyle, N. Gilboa, S. Halevi, Y. Ishai and A. Nof.
TCC 2021
PDF
Sublinear GMW-Style Compiler for MPC with Preprocessing. E. Boyle, N. Gilboa, Y. Ishai and A. Nof.
CRYPTO 2021
PDF
An Efficient Passive-to-Active Compiler for Honest-Majority MPC over Rings. M. Abspoel, A. Dalskov, D. Escudero and A. Nof.
ACNS 2021
PDF
Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs. E. Boyle, N. Gilboa, Y. Ishai and A. Nof.
ASIACRYPT 2020
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
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 Symposium on Security and Privacy 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 (Best Paper Award)
PDF
Fast Garbling of Circuits Under Standard Assumptions. S. Gueron, Y. Lindell, A. Nof and B. Pinkas.
ACM CCS 2015
PDF

Teaching

Current Teaching

  • The Theory behind Blockchain (89-606), Bar-Ilan University: 2025
  • Seminar: Topics in Security (89-4031), Bar-Ilan University: 2025
  • Secure Coding and Cyber Security (89-509), Bar-Ilan University: 2022-2025

Past Teaching

  • Seminar: Topics in Cryptography (89-4013), Bar-Ilan University: 2022, 2023
  • Data Structures (371-1-0341), Ben-Gurion University: 2021
  • Introduction to Cryptography (83-458), Bar-Ilan University: 2019
  • Discrete Mathematics (89-198), Bar-Ilan University: 2015-2018 (Teaching Assistant)

Program Committees

CRYPTO 2025, LATINCRYPT 2025, EUROCRYPT 2024, ASIACRYPT 2023, ACNS 2022, ACISP 2021, CSCML 2021, ACM CCS 2020, CSCML 2020.