Paper 2024/785
SmartBean: Transparent, Concretely Efficient, Polynomial Commitment Scheme with Logarithmic Verification and Communication Costs that Runs on Any Group
Abstract
We introduce a new, concretely efficient, transparent polynomial commitment scheme with logarithmic verification time and communication cost that can run on any group. Existing group-based polynomial commitment schemes must use less efficient groups, such as class groups of unknown order or pairing-based groups to achieve transparency (no trusted setup), making them expensive to adopt in practice.
We offer the first group-based polynomial commitment scheme that can run on any group s.t. it does not rely on expensive pairing operations or require class groups of unknown order to achieve transparency while still providing logarithmic verifier time and communication cost.
The prover work of our work is dominated by
Metadata
- Available format(s)
- -- withdrawn --
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- zero-knowledgepolynomial commitment
- Contact author(s)
- lusecret @ gmail com
- History
- 2024-06-02: withdrawn
- 2024-05-22: received
- See all versions
- Short URL
- https://ia.cr/2024/785
- License
-
CC BY