Vis enkel innførsel

dc.contributor.authorWang, Yuyu
dc.contributor.authorPan, Jiaxin
dc.date.accessioned2023-02-28T07:33:39Z
dc.date.available2023-02-28T07:33:39Z
dc.date.created2022-12-03T22:29:34Z
dc.date.issued2022
dc.identifier.issn0302-9743
dc.identifier.urihttps://hdl.handle.net/11250/3054442
dc.description.abstractWe construct the first non-interactive zero-knowledge (NIZK) proof systems in the fine-grained setting where adversaries’ resources are bounded and honest users have no more resources than an adversary. More concretely, our setting is the NC1-fine-grained setting, namely, all parties (including adversaries and honest participants) are in NC1 . Our NIZK systems are for circuit satisfiability (SAT) under the worst-case assumption, NC1⊊⊕L/poly . As technical contributions, we propose two approaches to construct NIZKs in the NC1-fine-grained setting. In stark contrast to the classical Fiat-Shamir transformation, both our approaches start with a simple Σ -protocol and transform it into NIZKs for circuit SAT without random oracles. Additionally, our second approach firstly proposes a fully homomorphic encryption (FHE) scheme in the fine-grained setting, which was not known before, as a building block. Compared with the first approach, the resulting NIZK only supports circuits with constant multiplicative depth, while its proof size is independent of the statement circuit size. Extending our approaches, we obtain two NIZK systems in the uniform reference string model and two non-interactive zaps (namely, non-interactive witness-indistinguishability proof systems in the plain model). While the previous constructions from Ball, Dachman-Soled, and Kulkarni (CRYPTO 2020) require provers to run in polynomial-time, our constructions are the first one with provers in NC1.en_US
dc.language.isoengen_US
dc.publisherSpringeren_US
dc.titleNon-Interactive Zero-Knowledge Proofs with Fine-Grained Securityen_US
dc.title.alternativeNon-Interactive Zero-Knowledge Proofs with Fine-Grained Securityen_US
dc.typePeer revieweden_US
dc.typeJournal articleen_US
dc.description.versionacceptedVersionen_US
dc.source.journalLecture Notes in Computer Science (LNCS)en_US
dc.identifier.doi10.1007/978-3-031-07085-3_11
dc.identifier.cristin2088202
dc.relation.projectNorges forskningsråd: 324235en_US
cristin.ispublishedtrue
cristin.fulltextpostprint
cristin.qualitycode1


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel