Performance Evaluation of Polynomial Commitments for Erasure Code Based Information Dispersal

Antoine Stevan, Thomas Lavaur, Thomas Lavaur, Jérôme Lacan, Jonathan Detchart, Tanguy Pérennou

2024

Abstract

Erasure coding is a common tool that improves the dependability of distributed storage systems. Basically, to decode data that has been encoded from k source shards into n output shards with an erasure code, a node of the network must download at least k shards and launch the decoding process. However, if one of the shards is intentionally or accidentally modified, the decoding process will reconstruct invalid data. To allow the verification of each shard independently without running the decoding for the whole data, the encoder can add a cryptographic proof to each output shard which certifies its validity. In this paper, we focus on the following commitment-based schemes: KZG+, aPlonK-PC and Semi-AVID-PC. These schemes perform polynomial evaluations in the same way as a Reed-Solomon encoding process. Still, such commitment-based schemes may introduce huge computation times as well as large storage space needs. This paper compares their performance to help designers of distributed storage systems identify the optimal proof depending on constraints like data size, information dispersal and frequency of proof verification against proof generation. We show that in most cases Semi-AVID-PC is the optimal solution, except when the input files and the required amount of verifications are large, where aPlonK-PC is optimal.

Paper Citation

in Harvard Style

Stevan A., Lavaur T., Lacan J., Detchart J. and Pérennou T. (2024). Performance Evaluation of Polynomial Commitments for Erasure Code Based Information Dispersal. In Proceedings of the 10th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP; ISBN 978-989-758-683-5, SciTePress, pages 522-533. DOI: 10.5220/0012377900003648

in Bibtex Style

@conference{icissp24,
author={Antoine Stevan and Thomas Lavaur and Jérôme Lacan and Jonathan Detchart and Tanguy Pérennou},
title={Performance Evaluation of Polynomial Commitments for Erasure Code Based Information Dispersal},
booktitle={Proceedings of the 10th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP},
year={2024},
pages={522-533},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012377900003648},
isbn={978-989-758-683-5},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 10th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP
TI - Performance Evaluation of Polynomial Commitments for Erasure Code Based Information Dispersal
SN - 978-989-758-683-5
AU - Stevan A.
AU - Lavaur T.
AU - Lacan J.
AU - Detchart J.
AU - Pérennou T.
PY - 2024
SP - 522
EP - 533
DO - 10.5220/0012377900003648
PB - SciTePress