Paper 2024/075
Succinct Verification of Compressed Sigma Protocols in the Updatable SRS setting
Abstract
We propose protocols in the Compressed Sigma Protocol framework that achieve a succinct verifier. Towards this, we construct a new inner product argument and cast it in the Compressed Sigma Protocol (CSP) framework as a protocol for opening a committed linear form, achieving logarithmic verification.
We then use our succinct-verifier CSP to construct a zero-knowledge argument for circuit satisfiability (under the discrete logarithm assumption in bilinear groups) in the updatable Structured Reference String (SRS) setting that achieves
Note: The full version of the PKC 2024 paper. Fixed proofs of Lemma 7 and Lemma 8.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A major revision of an IACR publication in PKC 2024
- Keywords
- Zero-KnowledgeSigma-protocolsSuccinct proofs
- Contact author(s)
-
moumitadutta @ iisc ac in
chaya @ iisc ac in
jawalkarp @ iisc ac in - History
- 2024-09-18: last of 2 revisions
- 2024-01-17: received
- See all versions
- Short URL
- https://ia.cr/2024/075
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/075, author = {Moumita Dutta and Chaya Ganesh and Neha Jawalkar}, title = {Succinct Verification of Compressed Sigma Protocols in the Updatable {SRS} setting}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/075}, year = {2024}, url = {https://eprint.iacr.org/2024/075} }