Ariel Nof

Senior Lecturer

Department of Computer Science
Bar-Ilan University

Building 503, Room 106
Email: ariel.nof@biu.ac.il

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

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 cryptography, with a focus on secure multiparty computation.

Publications

See my records at:

Google Scholar

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 (ACM Conference on Computer and Communications Security).

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 (ACM Conference on Computer and Communications Security).
[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 (ACM Conference on Computer and Communications Security).
[PDF]

Secure Multiparty Computation with Sublinear Preprocessing.
E. Boyle, N. Gilboa, Y. Ishai and A. Nof.
EUROCRYPT 2022 (International Conference on the Theory and Applications of Cryptology).

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 (Theory of Cryptography Conference).
[PDF]

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

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.
ACM 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.
ACM CCS 2018 (ACM Conference on Computer and Communications Security).
A 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).
The full version appeared in the Journal of Cryptology
[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 (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 Symposium on Security and Privacy 2017.
A combined of this paper together with this paper and this paper appeared in the Journal of Cryptology
[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.
ACM 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.
ACM CCS 2015 (ACM Conference on Computer and Communications Security).
A full version appeared in the Journal of Cryptology.
[PDF]

Program Committees

EUROCRYPT 2024
ASIACRYPT 2023
ACNS 2022
ACISP 2021, CSCML 2021
ACM CCS 2020, CSCML 2020

Teaching

Secure Coding and Cyber Security (89-509) (Department of Computer Science, Bar-Ilan University): 2023 (The course material is available on Moodle for registered users).

Data Structures (371-1-0341) (School of Electrical and Computer Engineering, Ben-Gurion University): 2021 (The course material is available on Moodle for registered users).

Seminar: Topics in Applied Cryptography (89-4371) (Department of Computer Science, Bar-Ilan University): 2019

Introduction to Cryptography (83-458) (Faculty of Engineering, Bar-Ilan University): 2019

I was a teaching assistant in the following courses:

Discrete Mathematics (89-198) (Department of Computer Science, Bar-Ilan University): 2015, 2016, 2017, 2018