Welcome to the resource topic for 2024/785
Title:
SmartBean: Transparent, Concretely Efficient, Polynomial Commitment Scheme with Logarithmic Verification and Communication Costs that Runs on Any Group
Authors: Frank Y.C. Lu
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 4n \,\mathbb{G} multi-exponentiations, the verifier work is dominated by 4 log n \, \mathbb{G} exponentiations, and the communication cost is 4 log n \, \mathbb{G}. Since our protocol can run on fast groups such as Curve25519, we can easily accelerate the multi-exponentiations with Pippenger’s algorithm. The concrete performance of our work shows a significant improvement over the current state of the art in almost every aspect.
ePrint: https://eprint.iacr.org/2024/785
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .