Unconditionally Secure NIZK in the Fine-Grained Setting
Peer reviewed, Journal article
Accepted version
Permanent lenke
https://hdl.handle.net/11250/3056022Utgivelsesdato
2022Metadata
Vis full innførselSamlinger
- Institutt for matematiske fag [2486]
- Publikasjoner fra CRIStin - NTNU [38484]
Originalversjon
10.1007/978-3-031-22966-4_15Sammendrag
Non-interactive zero-knowledge (NIZK) proof systems are often constructed based on cryptographic assumptions. In this paper, we propose the first unconditionally secure NIZK system in the AC0
-fine-grained setting. More precisely, our NIZK system has perfect soundness for all adversaries and unconditional zero-knowledge for AC0 adversaries, namely, an AC0 adversary can only break the zero-knowledge property with negligible probability unconditionally. At the core of our construction is an OR-proof system for satisfiability of 1 out of polynomial many statements.