On black-box extension of a non-interactive zero-knowledge proof system for secret equality
K Yamashita, M Tibouchi, M Abe - … on Cryptology in India, Bangalore, India …, 2020 - Springer
A non-interactive zero-knowledge proof system (NIZK) for a composite language (ie, a
language that combines distinct statements by AND or OR) is widely used in cryptographic
applications. The (im) possibility of black-box constructions of such NIZKs has been studied
so far. We extend it to the case of proving equality of a witness behind distinct statements
that often plays a central role in cryptographic constructions as illustrated by the seminal
work by Naor and Yung (STOC, 1990). In this paper, we investigate the impossibility of a …
language that combines distinct statements by AND or OR) is widely used in cryptographic
applications. The (im) possibility of black-box constructions of such NIZKs has been studied
so far. We extend it to the case of proving equality of a witness behind distinct statements
that often plays a central role in cryptographic constructions as illustrated by the seminal
work by Naor and Yung (STOC, 1990). In this paper, we investigate the impossibility of a …
On Black-Box Extension of a Non-Interactive Zero-Knowledge Proof System for Secret Equality
M Abe, M Tibouchi, K Yamashita - (No Title), 2020 - cir.nii.ac.jp
A non-interactive zero-knowledge proof system (NIZK) for a composite language (ie, a
language that combines distinct statements by AND or OR) is widely used in cryptographic
applications. The (im) possibility of black-box constructions of such NIZKs has been studied
so far. We extend it to the case of proving equality of a witness behind distinct statements
that often plays a central role in cryptographic constructions as illustrated by the seminal
work by Naor and Yung (STOC, 1990). In this paper, we investigate the impossibility of a …
language that combines distinct statements by AND or OR) is widely used in cryptographic
applications. The (im) possibility of black-box constructions of such NIZKs has been studied
so far. We extend it to the case of proving equality of a witness behind distinct statements
that often plays a central role in cryptographic constructions as illustrated by the seminal
work by Naor and Yung (STOC, 1990). In this paper, we investigate the impossibility of a …
Showing the best results for this search. See all results