default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAriel Nof
Person information
- affiliation: Bar-Ilan University, Ramat-Gan, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c20]Anders P. K. Dalskov, Daniel Escudero, Ariel Nof:
Fully Secure MPC and zk-FLIOP over Rings: New Constructions, Improvements and Extensions. CRYPTO (8) 2024: 136-169- [i17]Gilad Asharov, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Junichi Tomida:
Secure Statistical Analysis on Multiple Datasets: Join and Group-By. IACR Cryptol. ePrint Arch. 2024: 141 (2024) - [i16]Anders P. K. Dalskov, Daniel Escudero, Ariel Nof:
Fully Secure MPC and zk-FLIOP Over Rings: New Constructions, Improvements and Extensions. IACR Cryptol. ePrint Arch. 2024: 837 (2024) - 2023
- [j3]Koji Chida, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Daniel Genkin, Yehuda Lindell, Ariel Nof:
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. J. Cryptol. 36(3): 15 (2023) - [j2]Jun Furukawa
, Yehuda Lindell, Ariel Nof, Or Weinstein:
High-Throughput Secure Three-Party Computation with an Honest Majority. J. Cryptol. 36(3): 21 (2023) - [c19]Gilad Asharov, Koki Hamada, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Junichi Tomida:
Secure Statistical Analysis on Multiple Datasets: Join and Group-By. CCS 2023: 3298-3312 - 2022
- [c18]Gilad Asharov, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Katsumi Takahashi, Junichi Tomida:
Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters. CCS 2022: 125-138 - [c17]Anders P. K. Dalskov, Daniel Escudero, Ariel Nof:
Fast Fully Secure Multi-Party Computation over Any Ring with Two-Thirds Honest Majority. CCS 2022: 653-666 - [c16]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Secure Multiparty Computation with Sublinear Preprocessing. EUROCRYPT (1) 2022: 427-457 - [c15]Damiano Abram, Ariel Nof, Claudio Orlandi, Peter Scholl, Omer Shlomovits:
Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators. SP 2022: 2554-2572 - [i15]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Sublinear GMW-Style Compiler for MPC with Preprocessing. IACR Cryptol. ePrint Arch. 2022: 261 (2022) - [i14]Anders P. K. Dalskov, Daniel Escudero, Ariel Nof:
Fast Fully Secure Multi-Party Computation over Any Ring with Two-Thirds Honest Majority. IACR Cryptol. ePrint Arch. 2022: 623 (2022) - [i13]Gilad Asharov, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Katsumi Takahashi, Junichi Tomida:
Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters. IACR Cryptol. ePrint Arch. 2022: 1595 (2022) - 2021
- [c14]Mark Abspoel, Anders P. K. Dalskov, Daniel Escudero, Ariel Nof:
An Efficient Passive-to-Active Compiler for Honest-Majority MPC over Rings. ACNS (2) 2021: 122-152 - [c13]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Sublinear GMW-Style Compiler for MPC with Preprocessing. CRYPTO (2) 2021: 457-485 - [c12]Fabrice Benhamouda, Elette Boyle, Niv Gilboa, Shai Halevi, Yuval Ishai, Ariel Nof:
Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation. TCC (2) 2021: 129-161 - [i12]Fabrice Benhamouda, Elette Boyle, Niv Gilboa, Shai Halevi, Yuval Ishai, Ariel Nof:
Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation. IACR Cryptol. ePrint Arch. 2021: 1223 (2021) - [i11]Damiano Abram, Ariel Nof, Claudio Orlandi, Peter Scholl, Omer Shlomovits:
Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators. IACR Cryptol. ePrint Arch. 2021: 1587 (2021) - 2020
- [c11]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs. ASIACRYPT (3) 2020: 244-276 - [c10]Carsten Baum, Ariel Nof:
Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography. Public Key Cryptography (1) 2020: 495-526 - [i10]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2020: 1451 (2020)
2010 – 2019
- 2019
- [c9]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs. CCS 2019: 869-886 - [i9]Carsten Baum, Ariel Nof:
Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography. IACR Cryptol. ePrint Arch. 2019: 532 (2019) - [i8]Mark Abspoel, Anders P. K. Dalskov, Daniel Escudero, Ariel Nof:
An Efficient Passive-to-Active Compiler for Honest-Majority MPC over Rings. IACR Cryptol. ePrint Arch. 2019: 1298 (2019) - [i7]Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2019: 1390 (2019) - 2018
- [j1]Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas:
Fast Garbling of Circuits Under Standard Assumptions. J. Cryptol. 31(3): 798-844 (2018) - [c8]Yehuda Lindell, Ariel Nof:
Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody. CCS 2018: 1837-1854 - [c7]Koji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, Ariel Nof:
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. CRYPTO (3) 2018: 34-64 - [i6]Koji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, Ariel Nof:
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. IACR Cryptol. ePrint Arch. 2018: 570 (2018) - [i5]Yehuda Lindell, Ariel Nof, Samuel Ranellucci:
Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody. IACR Cryptol. ePrint Arch. 2018: 987 (2018) - 2017
- [c6]Yehuda Lindell, Ariel Nof:
A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority. CCS 2017: 259-276 - [c5]Jun Furukawa, Yehuda Lindell, Ariel Nof, Or Weinstein:
High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority. EUROCRYPT (2) 2017: 225-255 - [c4]Toshinori Araki, Assi Barak, Jun Furukawa, Tamar Lichter, Yehuda Lindell, Ariel Nof, Kazuma Ohara, Adi Watzman, Or Weinstein:
Optimized Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second Barrier. IEEE Symposium on Security and Privacy 2017: 843-862 - [i4]Yehuda Lindell, Ariel Nof:
A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority. IACR Cryptol. ePrint Arch. 2017: 816 (2017) - 2016
- [c3]Toshinori Araki, Jun Furukawa, Yehuda Lindell, Ariel Nof, Kazuma Ohara:
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority. CCS 2016: 805-817 - [c2]Toshinori Araki, Assaf Barak, Jun Furukawa, Yehuda Lindell, Ariel Nof, Kazuma Ohara:
DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket Generation. CCS 2016: 1841-1843 - [i3]Toshinori Araki, Jun Furukawa, Yehuda Lindell, Ariel Nof, Kazuma Ohara:
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority. IACR Cryptol. ePrint Arch. 2016: 768 (2016) - [i2]Jun Furukawa, Yehuda Lindell, Ariel Nof, Or Weinstein:
High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority. IACR Cryptol. ePrint Arch. 2016: 944 (2016) - 2015
- [c1]Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas:
Fast Garbling of Circuits Under Standard Assumptions. CCS 2015: 567-578 - [i1]Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas:
Fast Garbling of Circuits Under Standard Assumptions. IACR Cryptol. ePrint Arch. 2015: 751 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
