Jun Furukawa

Artificial Intelligence · 2001–2018

A researcher in the Science corpus: 5 papers; trusts 18 researchers and is trusted by 27 researchers here, as inferred from the citation graph.

Subfields

• Artificial Intelligence — 32 citations into it; #6,166 of 35,345 by trust here, #9,275 by citations
• Computational Theory and Mathematics — 21 citations into it; #4,619 of 12,182 by trust here, #3,681 by citations
• Privacy & Security — 17 citations into it; #347 of 709 by trust here, #366 by citations
• Information Systems — 13 citations into it; #2,821 of 8,771 by trust here, #2,260 by citations
• Computer Networks and Communications — 7 citations into it; #1,819 of 9,886 by trust here, #4,405 by citations

Whom Jun Furukawa trusts overall

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

1. Donald Beaver
2. Oded Goldreich
3. Ran Canetti
4. Silvio Micali
5. Ivan Bjerre Damgård
6. Michael Ben-Or
7. Yehuda Lindell
8. Toshinori Araki
9. Samee Zahur
10. Shafi Goldwasser

Who trusts Jun Furukawa overall

1. Jens Groth
2. David Isaac Wolinsky
3. Yehuda Lindell
4. Assi Barak
5. Toshinori Araki
6. Henry Corrigan-Gibbs
7. Stephanie Bayer
8. Marcel Keller
9. Sameer Wagh
10. Ari Juels

Papers from Jun Furukawa's perspective

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

1. Fairplay - Secure Two-Party Computation System
2. How to share a secret
3. Fair exchange with a semi-trusted third party (extended abstract)
4. Unconditionally Secure Constant Round Multi-Party Computation for Equality, Comparison, Bits and Exponentiation
5. Sharemind: A Framework for Fast Privacy-Preserving Computations
6. The round complexity of secure protocols
7. Multiparty Computation from Somewhat Homomorphic Encryption
8. Billion-Gate Secure Computation with Malicious Adversaries
9. Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits
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
• Generalizing the SPDZ Compiler For Other Protocols (2018) — 55 citations
• An Efficient Scheme for Proving a Shuffle (2001) — 339 citations