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
Parents
19
Doubly-Efficient zkSNARKs Without Trusted Setup
Riad S. Wahby, Ioanna Tzialla, Abhi Shelat et al. · 2018 · 248 citations
Towards efficient proofs of retrievability
Jia Xu, Ee‐Chien Chang · 2012 · 80 citations
Mercurial Commitments with Applications to Zero-Knowledge Sets
Melissa Chase, Alexander Healy, Anna Lysyanskaya et al. · Journal of Cryptology · 2012 · 45 citations · Full text
On One-way Functions and Kolmogorov Complexity
Rafael Pass · 2020 · 38 citations
1–5 of 19
62
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 62
37
Stanford Medicine
Stanford, United States
2 h-index
5 publications
764 citations

Cornell University
Ithaca, United States
2 h-index
2 publications
76 citations
Fujian University of Technology
Fuzhou, China
2 h-index
4 publications
114 citations

Xidian University
Xi'an, China
2 h-index
2 publications
39 citations
Institute for Infocomm Research
Singapore, Singapore
2 h-index
2 publications
229 citations
University of California, Berkeley
Berkeley, United States
2 h-index
1 publications
29 citations
Wuhan University
Wuhan, China
2 h-index
1 publications
13 citations

Nanjing University of Information Science and Technology
Nanjing, China
2 h-index
5 publications
168 citations
1–8 of 37
Repository · 2 publications · 30 citations
3
h-index
Conference · 1 publications · 15 citations
1
h-index
Conference · 1 publications · 149 citations
1
h-index
CMC · 1 publications · 32 citations
1
h-index
ITETBT · 1 publications · 34 citations
1
h-index
1–5