Private Function Evaluation
Private Function Evaluation is a cryptographic protocol that enables parties to jointly compute a function over their private inputs without revealing those inputs, distinguished by allowing the function itself to remain private from all participants.
49
Publications
8.6K
Citations
119
Authors
70
Institutions
Publications per year
2017–2026
16
Parents
49
Protocols for secure computations
Andrew Chi-Chih Yao · 1982 · 3K citations
Protocols for secure computations
Andrew Chi-Chih Yao · Foundations of Computer Science · 1982 · 2.7K citations
Foundations of garbled circuits
Mihir Bellare, Viet Tung Hoang, Phillip Rogaway · 2012 · 532 citations
Efficient Batched Oblivious PRF with Applications to Private Set Intersection
Vladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek et al. · 2016 · 355 citations · Full text
Delegatable pseudorandom functions and applications
Aggelos Kiayias, Stavros Papadopoulos, Nikos Triandopoulos et al. · 2013 · 348 citations
1–5 of 49
119
7
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 119
70

Technische Universität Darmstadt
Darmstadt, Germany
5 h-index
17 publications
525 citations
University of California San Diego
San Diego, United States
3 h-index
5 publications
713 citations
Nokia (United States)
Coppell, United States
3 h-index
3 publications
139 citations
Technion – Israel Institute of Technology
Haifa, Israel
3 h-index
6 publications
353 citations

University of Toronto
Toronto, Canada
2 h-index
8 publications
92 citations
University of Tsukuba
Tsukuba, Japan
2 h-index
4 publications
115 citations

University of Calgary
Calgary, Canada
2 h-index
2 publications
32 citations
ShanghaiTech University
Shanghai, China
2 h-index
2 publications
32 citations
1–8 of 70
Repository · 4 publications · 81 citations
4
h-index
Repository · 2 publications · 91 citations
2
h-index
2 publications · 134 citations
2
h-index
2 publications · 107 citations
2
h-index
2 publications · 32 citations
2
h-index
1–5