A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
This paper considers the problem of expanding a language class that can be proven by a noninteractive zero-knowledge proof system (NIZK) in a black-box manner in the common reference string model. Namely, given NIZKs for two languages, L 0 and L 1 , can we construct an NIZK for L 0 ∨ L 1 in a black-box manner? NIZKs for disjunctive languages have a large number of applications, such as electronic voting. Therefore, such a black-box construction may enable the efficient constructions of suchdoi:10.1109/access.2021.3056078 fatcat:htytik67lzcfhc3zd3uhbomo2i