Ariel Nof

Artificial Intelligence · 2015–2018

A researcher in the Science corpus: 6 papers; trusts 36 researchers and is trusted by 21 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 50 citations into it; #7,245 of 35,345 by trust here, #9,557 by citations
• Computational Theory and Mathematics — 32 citations into it; #2,704 of 12,182 by trust here, #2,931 by citations
• Privacy & Security — 30 citations into it; #354 of 709 by trust here, #366 by citations
• Information Systems — 15 citations into it; #3,028 of 8,771 by trust here, #2,203 by citations
• Computer Networks and Communications — 12 citations into it

Whom Ariel Nof trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Ran Canetti
2. Ivan Bjerre Damgård
3. Oded Goldreich
4. Donald Beaver
5. Pascal Paillier
6. Yehuda Lindell
7. Johannes Blömer
8. Michael Ben-Or
9. Toshinori Araki
10. Jun Furukawa

Who trusts Ariel Nof overall

1. Assi Barak
2. Toshinori Araki
3. Yehuda Lindell
4. Marcel Keller
5. Sameer Wagh
6. Rahul Rachuri
7. Jun Furukawa
8. David E. Evans
9. Daniel E. Escudero
10. Payman Mohassel

Papers from Ariel Nof's perspective

Ordered by how strongly the researchers Ariel Nof trusts endorse each paper. Same corpus, a different order for every researcher.

1. Fairplay - Secure Two-Party Computation System
2. Fair exchange with a semi-trusted third party (extended abstract)
3. How to share a secret
4. Secure Two-Party Computation is Practical
5. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
6. Security and Composition of Multiparty Cryptographic Protocols (Journal of Cryptology)
7. Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
8. Sharemind: A Framework for Fast Privacy-Preserving Computations
9. Multiparty Computation from Somewhat Homomorphic Encryption
10. Efficient Multiparty Protocols Using Circuit Randomization

Their papers

• High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority (2016) — 470 citations
• High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority (2017) — 190 citations
• Optimized Honest-Majority MPC for Malicious Adversaries — Breaking the 1 Billion-Gate Per Second Barrier (2017) — 139 citations
• A Framework for Constructing Fast MPC over Arithmetic Circuits with Malicious Adversaries and an Honest-Majority (2017) — 110 citations
• Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody (2018) — 225 citations
• Fast Garbling of Circuits Under Standard Assumptions (2015) — 106 citations