Secure Function Evaluation
Secure Function Evaluation is a cryptographic protocol that enables multiple parties to jointly compute a function over their private inputs while revealing nothing beyond the output, distinguishing it from general computation methods by preserving input confidentiality through rigorous security guarantees.
114
Publications
9.1K
Citations
275
Authors
145
Institutions
Publications per year
2017–2026
23
114
Fairplay—a secure two-party computation system
Dahlia Malkhi, Noam Nisan, Benny Pinkas et al. · 2004 · 782 citations
Faster Secure Two-Party Computation Using Garbled Circuits
Yan Huang, David Evans, Jonathan Katz et al. · 2011 · 550 citations · Full text
Foundations of garbled circuits
Mihir Bellare, Viet Tung Hoang, Phillip Rogaway · 2012 · 532 citations
Assaf Ben-David, Noam Nisan, Benny Pinkas · 2008 · 487 citations
1–5 of 114
275
10
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 275
145
Massachusetts Institute of Technology
Cambridge, United States
9 h-index
17 publications
1.8K citations

Technische Universität Darmstadt
Darmstadt, Germany
6 h-index
21 publications
2.9K citations
University of California San Diego
San Diego, United States
5 h-index
11 publications
807 citations
Technion – Israel Institute of Technology
Haifa, Israel
5 h-index
6 publications
392 citations
IIT@MIT
Cambridge, United States
4 h-index
7 publications
647 citations

McGill University
Montreal, Canada
4 h-index
4 publications
351 citations

Aarhus University
Aarhus, Denmark
4 h-index
11 publications
437 citations
University of Florida
Gainesville, United States
4 h-index
15 publications
444 citations
1–8 of 145
Repository · 8 publications · 195 citations
8
h-index
4 publications · 202 citations
4
h-index
Repository · 4 publications · 130 citations
4
h-index
3 publications · 164 citations
3
h-index
2 publications · 115 citations
2
h-index
1–5