Polynomial Commitments ∗ Aniket
@inproceedings{Kate2010PolynomialC,
title={Polynomial Commitments ∗ Aniket},
author={Kate and Gregory M. Zaverucha and I. Goldberg},
year={2010}
}We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial with a short string that can be used by a verifier to confirm claimed evaluations of the committed polynomial. Although the homomorphic commitment schemes in the literature can be used to achieve this goal, the sizes of their commitments are linear in the degree of the committed polynomial. On the other hand… CONTINUE READING
References
Publications referenced by this paper.
SHOWING 1-10 OF 44 REFERENCES
Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Computer Science
- EUROCRYPT
- 2005
- 1,243
- PDF
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
- Computer Science
- CRYPTO
- 1991
- 2,008
- PDF
A practical scheme for non-interactive verifiable secret sharing
- Computer Science
- 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
- 1987
- 1,025
- PDF
Safeguarding cryptographic keys
- Computer Science
- 1979 International Workshop on Managing Requirements Knowledge (MARK)
- 1979
- 2,259
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Computer Science
- CRYPTO
- 2005
- 964
- PDF
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
- Computer Science
- CRYPTO
- 2002
- 735
- PDF

