CryptoDB
Succinct Functional Commitments for Circuits from k-Lin
| Authors: |
|
|---|---|
| Download: |
|
| Presentation: | Slides |
| Conference: | EUROCRYPT 2024 |
| Abstract: | A functional commitment allows a user to commit to an input x and later, open the commitment to an arbitrary function y = f(x). The size of the commitment and the opening should be sublinear in |x| and |f|. In this work, we give the first pairing-based functional commitment for arbitrary circuits where the size of the commitment and the size of the opening consist of a constant number of group elements. Security relies on the standard bilateral k-Lin assumption. This is the first scheme with this level of succinctness from falsifiable bilinear map assumptions (previous approaches required SNARKs for NP). This is also the first functional commitment scheme for general circuits with poly(lambda)-size commitments and openings from any assumption that makes fully black-box use of cryptographic primitives and algorithms. Our construction relies on a new notion of projective chainable commitments which may be of independent interest. |
BibTeX
@inproceedings{eurocrypt-2024-33868,
title={Succinct Functional Commitments for Circuits from k-Lin},
publisher={Springer-Verlag},
doi={10.1007/978-3-031-58723-8_10},
author={Hoeteck Wee and David J. Wu},
year=2024
}