CryptoDB
Optimizing and Implementing Fischlin's Transform for UC-Secure Zero Knowledge
NOTE: imports for ToSC and TCHES are no longer functioning.
| Authors: |
|
|---|---|
| Download: | |
| Abstract: | Fischlin's transform (CRYPTO 2005) is an alternative to the Fiat-Shamir transform that enables straight-line extraction when proving knowledge. In this work we focus on the problem of using the Fischlin transform to construct UC-secure zero-knowledge from Sigma protocols, since UC security – that guarantees security under general concurrent composition – requires straight-line (non-rewinding) simulators. We provide a slightly simplified transform that is much easier to understand, and present algorithmic and implementation optimizations that significantly improve the running time. It appears that the main obstacles to the use of Fischlin in practice is its computational cost and implementation complexity (with multiple parameters that need to be chosen). We provide clear guidelines and a simple methodology for choosing parameters, and show that with our optimizations the running-time is far lower than expected. For just one example, on a 2023 MacBook, the cost of proving the knowledge of discrete log with Fischlin is only 0.41ms (on a single core). This is 15 times slower than plain Fiat-Shamir on the same machine, which is a significant multiple but objectively not significant in many applications. We also extend the transform so that it can be applied to batch proofs, and show how this can be much more efficient than individually proving each statement. We hope that this paper will both encourage and help practitioners implement the Fischlin transform where relevant. |
BibTeX
@article{cic-2024-34404,
title={Optimizing and Implementing Fischlin's Transform for UC-Secure Zero Knowledge},
journal={cic},
publisher={International Association for Cryptologic Research},
volume={1, Issue 2},
url={https://cic.iacr.org//p/1/2/11},
doi={10.62056/a66chey6b},
author={Yi-Hsiu Chen and Yehuda Lindell},
year=2024
}