Dutta, M and Ganesh, C and Jawalkar, N (2024) Succinct Verification of Compressed Sigma Protocols in the Updatable SRS Setting. In: 27th IACR International Conference on Practice and Theory of Public Key Cryptography, PKC 2024, 15 April 2024through 17 April 2024, Sydney, pp. 305-336.
|
PDF
lec_not_com_sci_14602_2024.pdf - Published Version Download (778kB) | Preview |
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 O(logn) proof size and O(logn) verification complexity. Our circuit zero-knowledge protocol has concretely better proof/prover/verifier complexity compared to the state-of-the-art protocol in the updatable setting under the same assumption. Our techniques of achieving verifier-succinctness in the compression framework is of independent interest. We then show a commitment scheme for committing to group elements using a structured commitment key. We construct protocols to open a committed homomorphism on a committed vector with verifier succinctness in the designated verifier setting. This has applications in making the verifier in compressed sigma protocols for bilinear group arithmetic circuits, succinct. © International Association for Cryptologic Research 2024.
| Item Type: | Conference Paper |
|---|---|
| Publication: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Publisher: | Springer Science and Business Media Deutschland GmbH |
| Additional Information: | The copyright for this article belongs to authors. |
| Keywords: | Bilinear groups; Circuit satisfiability; Discrete logarithms; Inner product; Protocol framework; Sigma protocols; State-of-the art protocols; Verification complexity; Zero knowledge; Zero-knowledge protocols, Cryptography |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 29 Aug 2024 06:12 |
| Last Modified: | 29 Aug 2024 06:12 |
| URI: | http://eprints.iisc.ac.in/id/eprint/84840 |
Actions (login required)
 |
View Item |
