Paper 2024/185
Vortex: A List Polynomial Commitment and its Application to Arguments of Knowledge
Abstract
A list polynomial commitment scheme (LPC) is a polynomial commitment scheme with a relaxed binding property. Namely, in an LPC setting, a commitment to a function
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Polynomial CommitmentList Polynomial CommitmentSNARKZero-KnowledgeArgument of KnowledgeReed-Solomon Code
- Contact author(s)
-
alexandre belling @ consensys net
azam soleimanian @ consensys net
bogdan ursu @ consensys net - History
- 2024-02-09: approved
- 2024-02-07: received
- See all versions
- Short URL
- https://ia.cr/2024/185
- License
-
CC0
BibTeX
@misc{cryptoeprint:2024/185, author = {Alexandre Belling and Azam Soleimanian and Bogdan Ursu}, title = {Vortex: A List Polynomial Commitment and its Application to Arguments of Knowledge}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/185}, year = {2024}, url = {https://eprint.iacr.org/2024/185} }