On the Impossibility of NIZKs for Disjunctive Languages From Commit-and-Prove NIZKs

On the Impossibility of NIZKs for Disjunctive Languages From Commit-and-Prove NIZKs

This paper considers the problem of expanding a language class that can be proven by a non-interactive zero-knowledge proof system (NIZK) in a black-box manner in the common reference string model. Namely, given NIZKs for two languages, <inline-formula> <tex-math notation="LaTeX"&...

Full description

Bibliographic Details
Main Authors: Kyosuke Yamashita, Mehdi Tibouchi, Masayuki Abe
Format: Article
Language:English
Published: IEEE 2021-01-01
Series:IEEE Access
Subjects:
Black-box construction
commit-and-prove
non-interactive zero-knowledge proof system
Online Access:https://ieeexplore.ieee.org/document/9343884/

Internet

https://ieeexplore.ieee.org/document/9343884/

Similar Items