Asynchronous Secure Computation

Asynchronous Secure Computation is a cryptographic protocol in secure multi-party computation that enables parties to jointly compute a function over their private inputs without revealing them, relying solely on message passing and without assuming a fixed upper bound on message delivery times.

32

Publications

1.7K

Citations

104

Authors

64

Institutions

Publications per year

2017–2026

11

Variants

Asynchronous MpcAsynchronous Secure Multi-party Computation

Authors

104

  1. AP
    Arpita Patra

    Indian Institute of Technology Madras, India

    4 publications · 97 citations

    4

    h-index

  2. CP
    C. Pandu Rangan

    Indian Institute of Technology Madras, India

    2 publications · 71 citations

    2

    h-index

  3. JS
    Jared Saia

    University of New Mexico, United States

    2 publications · 42 citations

    2

    h-index

  4. AM
    Andrew Miller

    University of Illinois Urbana-Champaign, United States

    2 publications · 122 citations

    2

    h-index

  5. MB
    Michael Ben-Or

    Hebrew University of Jerusalem, Israel

    2 publications · 413 citations

    2

    h-index

1–5 of 104

Venues

  1. IEEE Transactions on Dependable and Secure Computing

    TDSC · 2 publications · 25 citations

    2

    h-index

  2. Theoretical Computer Science

    2 publications · 415 citations

    2

    h-index

  3. Journal of the ACM

    JACM · 1 publications · 12 citations

    1

    h-index

  4. Journal of Cryptology

    1 publications · 38 citations

    1

    h-index

  5. IACR Cryptology ePrint Archive

    Repository · 1 publications · 15 citations

    1

    h-index

1–5