Paper 2016/766
Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions
Abstract
We formalize a cryptographic primitive called functional commitment (FC) which can be viewed as a generalization of vector commitments (VCs), polynomial commitments and many other special kinds of commitment schemes. A non-interactive functional commitment allows committing to a message in such a way that the committer has the flexibility of only revealing a function
Note: In this revised version, we fix errors in the accumulator constructions pointed out to us by Olivier Blazy.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Minor revision. ICALP 2016
- Keywords
- Commitment schemesfunctional commitmentsaccumulatorspairing-basedsimple assumptions
- Contact author(s)
- somindu @ cse iitkgp ac in
- History
- 2024-08-14: last of 2 revisions
- 2016-08-10: received
- See all versions
- Short URL
- https://ia.cr/2016/766
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/766, author = {Benoît Libert and Somindu C. Ramanna and Moti Yung}, title = {Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions}, howpublished = {Cryptology {ePrint} Archive, Paper 2016/766}, year = {2016}, url = {https://eprint.iacr.org/2016/766} }