CryptoDB
Concretely Efficient Lattice-based Polynomial Commitment from Standard Assumptions
| Authors: |
|
|---|---|
| Download: |
|
| Conference: | CRYPTO 2024 |
| Abstract: | Polynomial commitment is a crucial cryptographic primitive in constructing zkSNARKs. Most practical constructions to date are either vulnerable against quantum adversaries or lack homomorphic properties, which are essential for recursive proof composition and proof batching. Recently, lattice-based constructions have drawn attention for their potential to achieve all the desirable properties, though they often suffer from concrete inefficiency or rely on newly introduced assumptions requiring further cryptanalysis. In this paper, we propose a novel construction of a polynomial commitment scheme based on standard lattice-based assumptions. Our scheme achieves a square-root proof size and verification complexity, ensuring concrete efficiency in proof size, proof generation, and verification. Additionally, it features a transparent setup and publicly verifiability. When compared with Brakedown (CRYPTO 2023), a recent code-based construction, our scheme offers comparable performance across all metrics. Furthermore, its proof size is approximately 4.1 times smaller than SLAP (EUROCRYPT 2024), a recent lattice-based construction. |
BibTeX
@inproceedings{crypto-2024-34291,
title={Concretely Efficient Lattice-based Polynomial Commitment from Standard Assumptions},
publisher={Springer-Verlag},
doi={10.1007/978-3-031-68403-6_13},
author={Intak Hwang and Jinyeong Seo and Yongsoo Song},
year=2024
}