dc.contributor.author | Wang, Yuyu | |
dc.contributor.author | Pan, Jiaxin | |
dc.date.accessioned | 2023-03-06T12:04:00Z | |
dc.date.available | 2023-03-06T12:04:00Z | |
dc.date.created | 2023-01-19T14:52:06Z | |
dc.date.issued | 2022 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.uri | https://hdl.handle.net/11250/3056022 | |
dc.description.abstract | 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. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Springer | en_US |
dc.rights | Navngivelse 4.0 Internasjonal | * |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/deed.no | * |
dc.title | Unconditionally Secure NIZK in the Fine-Grained Setting | en_US |
dc.title.alternative | Unconditionally Secure NIZK in the Fine-Grained Setting | en_US |
dc.type | Peer reviewed | en_US |
dc.type | Journal article | en_US |
dc.description.version | acceptedVersion | en_US |
dc.source.volume | 13792 | en_US |
dc.source.journal | Lecture Notes in Computer Science (LNCS) | en_US |
dc.identifier.doi | 10.1007/978-3-031-22966-4_15 | |
dc.identifier.cristin | 2110553 | |
dc.relation.project | Norges forskningsråd: 324235 | en_US |
cristin.ispublished | true | |
cristin.fulltext | postprint | |
cristin.qualitycode | 1 | |