Constant-Round Protocols is an interactive proof system in which the number of communication rounds between the prover and verifier is bounded by a fixed constant, independent of the input size.
55
Publications
3.7K
Citations
89
Authors
55
Institutions
Publications per year
2017–2026
6
Parents
Publications
55
Global-Scale Secure Multiparty Computation
Xiao Wang, Samuel Ranellucci, Jonathan Katz · 2017 · 182 citations
1–5 of 55
Authors
89
- OG
6
h-index
- RP
5
h-index
- AR
5
h-index
- YL
5
h-index
- VG
4
h-index
1–5 of 89
Institutions
55
Weizmann Institute of Science
Rehovot, Israel
9 h-index
10 publications
946 citations
Microsoft (United States)
Redmond, United States
6 h-index
6 publications
338 citations
Microsoft Research (India)
Bengaluru, India
5 h-index
6 publications
301 citations
University of Maryland, College Park
College Park, United States
4 h-index
9 publications
1.2K citations
Cornell University
Ithaca, United States
4 h-index
5 publications
289 citations
Bar-Ilan University
Ramat Gan, Israel
4 h-index
5 publications
166 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
4 publications
464 citations
University of Calgary
Calgary, Canada
3 h-index
3 publications
214 citations
1–8 of 55
Venues
- IACR Cryptology ePrint Archive
Repository · 5 publications · 260 citations
5
h-index
- SIAM Journal on Computing
4 publications · 173 citations
4
h-index
- Journal of Cryptology
4 publications · 695 citations
4
h-index
- Theoretical Computer Science
2 publications · 151 citations
2
h-index
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 2 publications · 58 citations
2
h-index
1–5