Paper 2023/1759

Non-Interactive Zero-Knowledge Functional Proofs

Gongxian Zeng, Peng Cheng Laboratory
Junzuo Lai, Jinan University
Zhengan Huang, Peng Cheng Laboratory
Linru Zhang, Nanyang Technological University
Xiangning Wang, Nanyang Technological University
Kwok-Yan Lam, Nanyang Technological University
Huaxiong Wang, Nanyang Technological University
Jian Weng, Jinan University
Abstract

In this paper, we consider to generalize NIZK by empowering a prover to share a witness in a fine-grained manner with verifiers. Roughly, the prover is able to authorize a verifier to obtain extra information of witness, i.e., besides verifying the truth of the statement, the verifier can additionally obtain certain function of the witness from the accepting proof using a secret functional key provided by the prover. To fulfill these requirements, we introduce a new primitive called \emph{non-interactive zero-knowledge functional proofs (fNIZKs)}, and formalize its security notions. We provide a generic construction of fNIZK for any $\textsf{NP}$ relation $\mathcal{R}$, which enables the prover to share any function of the witness with a verifier. For a widely-used relation about set membership proof (implying range proof), we construct a concrete and efficient fNIZK, through new building blocks (set membership encryption and dual inner-product encryption), which might be of independent interest.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
A minor revision of an IACR publication in ASIACRYPT 2023
Keywords
non-interactive zero knowledge proofset membership proofrange proofinner-product encryption
Contact author(s)
gxzeng @ cs hku hk
laijunzuo @ gmail com
zhahuang sjtu @ gmail com
linru zhang @ ntu edu sg
xiangning wang @ ntu edu sg
kwokyan lam @ ntu edu sg
hxwang @ ntu edu sg
cryptjweng @ gmail com
History
2023-11-14: approved
2023-11-14: received
See all versions
Short URL
https://ia.cr/2023/1759
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2023/1759,
      author = {Gongxian Zeng and Junzuo Lai and Zhengan Huang and Linru Zhang and Xiangning Wang and Kwok-Yan Lam and Huaxiong Wang and Jian Weng},
      title = {Non-Interactive Zero-Knowledge Functional Proofs},
      howpublished = {Cryptology {ePrint} Archive, Paper 2023/1759},
      year = {2023},
      url = {https://eprint.iacr.org/2023/1759}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy