default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
- Ariel Nof
![[0009-0007-4852-083X]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0009-0007-4852-083X")
Bar-Ilan University, Ramat-Gan, Israel
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 41 matches
- 2024
- 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 - 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) - 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
- 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) - Jun Furukawa, Yehuda Lindell, Ariel Nof, Or Weinstein:
High-Throughput Secure Three-Party Computation with an Honest Majority. J. Cryptol. 36(3): 21 (2023) - 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
- 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 - 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 - Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Secure Multiparty Computation with Sublinear Preprocessing. EUROCRYPT (1) 2022: 427-457 - Damiano Abram, Ariel Nof, Claudio Orlandi, Peter Scholl, Omer Shlomovits:
Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators. SP 2022: 2554-2572 - 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) - Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Sublinear GMW-Style Compiler for MPC with Preprocessing. IACR Cryptol. ePrint Arch. 2022: 261 (2022) - 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) - 2021
- 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 - Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Sublinear GMW-Style Compiler for MPC with Preprocessing. CRYPTO (2) 2021: 457-485 - 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 - 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) - 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) - 2020
- Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs. ASIACRYPT (3) 2020: 244-276 - 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 - Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2020: 1451 (2020) - 2019
- Elette Boyle, Niv Gilboa, Yuval Ishai, Ariel Nof:
Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs. CCS 2019: 869-886 - 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) - 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) - 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
- Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas:
Fast Garbling of Circuits Under Standard Assumptions. J. Cryptol. 31(3): 798-844 (2018) - Yehuda Lindell, Ariel Nof:
Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody. CCS 2018: 1837-1854 - 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 - 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) - 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)
skipping 11 more matches
loading more results 
failed to load more results, please try again later
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.
retrieved on 2024-09-24 16:10 CEST from data curated 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:
