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

Authors

115

  1. RP
    Rafael Pass

    Cornell University, United States

    9 publications · 825 citations

    9

    h-index

  2. AR
    Alon Rosen

    Technion – Israel Institute of Technology, Israel

    8 publications · 650 citations

    8

    h-index

  3. VG
    Vipul Goyal

    Microsoft Research (India), India

    5 publications · 304 citations

    5

    h-index

  4. HL
    Huijia Lin

    Cornell University, United States

    4 publications · 232 citations

    4

    h-index

  5. YL
    Yehuda Lindell

    Bar-Ilan University, Israel

    4 publications · 295 citations

    4

    h-index

1–5 of 115

Venues

  1. Journal of Cryptology

    6 publications · 301 citations

    6

    h-index

  2. IACR Cryptology ePrint Archive

    Repository · 6 publications · 271 citations

    6

    h-index

  3. SIAM Journal on Computing

    4 publications · 173 citations

    4

    h-index

  4. Proceedings on Privacy Enhancing Technologies

    PoPETs · 2 publications · 103 citations

    2

    h-index

  5. 1

    h-index

1–5