Boolean Circuit Evaluation
Boolean Circuit Evaluation is a formal computational method in Secure Multi-Party Computation that enables mutually distrustful parties to jointly compute a function represented as a Boolean circuit while preserving input privacy, by evaluating the circuit through secret-shared or garbled inputs without revealing intermediate values.
353
Publications
19.1K
Citations
684
Authors
333
Institutions
Publications per year
2017–2026
50
353
Minimization of Boolean Functions*
E.J. McCluskey · Bell System Technical Journal · 1956 · 1.2K citations
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits
Sanjam Garg, Craig Gentry, Shai Halevi et al. · 2013 · 1.1K citations
Fairplay—a secure two-party computation system
Dahlia Malkhi, Noam Nisan, Benny Pinkas et al. · 2004 · 782 citations
Assaf Ben-David, Noam Nisan, Benny Pinkas · 2008 · 487 citations
1–5 of 353
684
9
h-index
7
h-index
6
h-index
5
h-index
5
h-index
1–5 of 684
333

Chinese Academy of Sciences
Beijing, China
10 h-index
19 publications
638 citations
Princeton University
Princeton, United States
9 h-index
13 publications
833 citations

Indian Statistical Institute
Kolkata, India
9 h-index
15 publications
543 citations
Carnegie Mellon University
Pittsburgh, United States
8 h-index
14 publications
989 citations
The University of Texas at Austin
Austin, United States
8 h-index
15 publications
1.8K citations

Technische Universität Darmstadt
Darmstadt, Germany
7 h-index
19 publications
1K citations

Centre National de la Recherche Scientifique
Paris, France
6 h-index
11 publications
385 citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
9 publications
434 citations
1–8 of 333
14 publications · 794 citations
11
h-index
Repository · 9 publications · 291 citations
9
h-index
8 publications · 404 citations
8
h-index
7 publications · 280 citations
7
h-index
6 publications · 362 citations
6
h-index
1–5