Boomy: Batch Opening Of Multivariate polYnomial commitment
We present Boomy, a multivariate polynomial commitment scheme enabling the proof of the evaluation of multiple points, i.e., batch opening. Boomy is the natural extension of two popular protocols: the univariate polynomial commitment scheme of Kate, Zaverucha and Goldberg[KZG10] and its multivariate counterpart from Papamanthou, Shi and Tamassia[PST13]. Our construction is proven secure under the selective security model. In this paper, we present Boomy's complexity and the applications on which it can have a significant impact. In fact, Boomy is perfectly suited to tackling blockchain problems by greatly improving data availability sampling and shrinking existing challenges. We also present special lower-complexity cases that occur frequently in practical situations.
Authors
- Jérôme Lacan (ORCID: https://orcid.org/0000-0002-3121-4824)
- Thomas Lavaur (ORCID: https://orcid.org/0000-0001-9869-5856)
Institutions
- Université Toulouse III - Paul Sabatier (FR)
- Institut Superieur de l'Aeronautique et de l'Espace (ISAE-SUPAERO) (FR)
Publication Details
- Journal
- IACR Communications in Cryptology
- Published
- 2025-04-08
- DOI
- https://doi.org/10.62056/an5tx4e-
- Primary Topic
- Blockchain Technology Applications and Security
- Type
- article
- Field-Weighted Citation Impact
- 0.00