Universally Composable NIZKs: Circuit-Succinct, Non-Malleable and CRS-Updatable

ePrint Report: Universally Composable NIZKs: Circuit-Succinct, Non-Malleable and CRS-Updatable

Behzad Abdolmaleki, Noemi Glaeser, Sebastian Ramacher, Daniel Slamanig

Non-interactive zero-knowledge proofs (NIZKs) and in particular succinct NIZK arguments of knowledge (so called zk-SNARKs) increasingly see real-world adoption in large and complex systems.


A requirement that turns out to be important for NIZKs is ensuring non-malleability of proofs, which can be achieved via the property of simulation extractability (SE). Moreover, many zk-SNARKs require a trusted setup, i.e., a common reference string (CRS), …

adoption called daniel eprint report important knowledge large non report simulation systems world