Paper 2023/1599 Original: eprint.iacr.org/2023/1599 ↗
Boomy: Batch Opening Of Multivariate polYnomial commitment
Abstract
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~\cite{AC:KatZavGol10} and its multivariate counterpart from Papamanthou, Shi and Tamassia~\cite{papamanthou2013signatures}. 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 data availability problems, shrinking existing challenges. We also present special lower-complexity cases that occur frequently in practical situations.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2025-04-24: last updated
- 2023-10-16: published
- Short URL
- https://ia.cr/2023/1599
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2023/1599,
author = {Thomas Lavaur and Jérôme Lacan},
title = {Boomy: Batch Opening Of Multivariate polYnomial commitment},
howpublished = {Cryptology {ePrint} Archive, Paper 2023/1599},
year = {2023},
url = {https://eprint.iacr.org/2023/1599}
}