Polynomial Commitment Schemes

Polynomial Commitment Schemes is a cryptographic primitive that enables a prover to commit to a polynomial in such a way that the commitment can later be opened and verified with respect to specific evaluations, while ensuring binding and succinctness properties essential for zero-knowledge proof systems.

19

Publications

857

Citations

62

Authors

37

Institutions

Publications per year

2017–2026

14

Authors

62

  1. CH
    Chenchen Han

    Westlake University, China

    2 publications · 57 citations

    2

    h-index

  2. BF
    Ben Fisch

    Stanford University, United States

    2 publications · 30 citations

    2

    h-index

  3. LR
    Leonid Reyzin

    Boston University, United States

    1 publications · 45 citations

    1

    h-index

  4. JW
    Jin Wang

    Changsha University of Science and Technology, China

    1 publications · 32 citations

    1

    h-index

  5. JJ
    Jiajia Jiang

    Nanjing University of Aeronautics and Astronautics, China

    1 publications · 26 citations

    1

    h-index

1–5 of 62

Venues

  1. IACR Cryptology ePrint Archive

    Repository · 2 publications · 30 citations

    3

    h-index

  2. 1

    h-index

  3. 1

    h-index

  4. 1

    h-index

  5. IEEE Transactions on Emerging Topics in Computing

    ITETBT · 1 publications · 34 citations

    1

    h-index

1–5