Constant-round Secure Computation
Constant-Round Secure Computation is a method in secure multi-party computation that achieves a fixed, bounded number of communication rounds independent of the input size, thereby optimizing protocol efficiency while preserving cryptographic security.
62
Publications
5.3K
Citations
115
Authors
71
Institutions
Publications per year
2017–2026
13
62
A practical scheme for non-interactive verifiable secret sharing
Paul Feldman · 1987 · 1.1K citations
The round complexity of secure protocols
Donald Beaver, Silvio Micali, Phillip Rogaway · 1990 · 721 citations · Full text
Bounded-concurrent secure multi-party computation with a dishonest majority
Rafael Pass · 2004 · 184 citations
Global-Scale Secure Multiparty Computation
Xiao Wang, Samuel Ranellucci, Jonathan Katz · 2017 · 182 citations
1–5 of 62
115
9
h-index
8
h-index
5
h-index
4
h-index
4
h-index
1–5 of 115
71
Microsoft (United States)
Redmond, United States
7 h-index
7 publications
369 citations

Weizmann Institute of Science
Rehovot, Israel
6 h-index
9 publications
565 citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
8 publications
3.2K citations

Bar-Ilan University
Ramat Gan, Israel
6 h-index
9 publications
291 citations

Cornell University
Ithaca, United States
5 h-index
7 publications
423 citations
Technion – Israel Institute of Technology
Haifa, Israel
5 h-index
6 publications
316 citations
Microsoft Research (India)
Bengaluru, India
5 h-index
6 publications
301 citations

Harvard University Press
Cambridge, United States
4 h-index
4 publications
919 citations
1–8 of 71
6 publications · 301 citations
6
h-index
Repository · 6 publications · 271 citations
6
h-index
4 publications · 173 citations
4
h-index
PoPETs · 2 publications · 103 citations
2
h-index
1 publications · 10 citations
1
h-index
1–5