Ariel Nof

Affiliations:
  • Bar-Ilan University, Ramat-Gan, Israel


According to our database1, Ariel Nof authored at least 23 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fully Secure MPC and zk-FLIOP Over Rings: New Constructions, Improvements and Extensions.
IACR Cryptol. ePrint Arch., 2024

Secure Statistical Analysis on Multiple Datasets: Join and Group-By.
IACR Cryptol. ePrint Arch., 2024

2023
High-Throughput Secure Three-Party Computation with an Honest Majority.
J. Cryptol., July, 2023

Fast Large-Scale Honest-Majority MPC for Malicious Adversaries.
J. Cryptol., July, 2023

Secure Statistical Analysis on Multiple Datasets: Join and Group-By.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
Fast Fully Secure Multi-Party Computation over Any Ring with Two-Thirds Honest Majority.
IACR Cryptol. ePrint Arch., 2022

Sublinear GMW-Style Compiler for MPC with Preprocessing.
IACR Cryptol. ePrint Arch., 2022

Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters.
IACR Cryptol. ePrint Arch., 2022

Secure Multiparty Computation with Sublinear Preprocessing.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021
Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation.
IACR Cryptol. ePrint Arch., 2021

Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators.
IACR Cryptol. ePrint Arch., 2021

2020
Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2020

2019
Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2019

Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography.
IACR Cryptol. ePrint Arch., 2019

An Efficient Passive-to-Active Compiler for Honest-Majority MPC over Rings.
IACR Cryptol. ePrint Arch., 2019

2018
Fast Garbling of Circuits Under Standard Assumptions.
J. Cryptol., 2018

Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody.
IACR Cryptol. ePrint Arch., 2018

Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority.
IACR Cryptol. ePrint Arch., 2017

Optimized Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second Barrier.
Proceedings of the 2017 IEEE Symposium on Security and Privacy, 2017

2016
High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority.
IACR Cryptol. ePrint Arch., 2016

High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority.
IACR Cryptol. ePrint Arch., 2016

DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket Generation.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016


  Loading...