Skip to main content

New answers tagged

2 votes
Accepted

Languages $L$ that have perfect zero-knowledge that do not have any $AM$ proof system that is perfect or zero-knowledge on $L$

In the statistical zero-knowledge ($\mathsf{SZK}$) setting, several results were established by Okamoto. He demonstrated that Private-coin $\mathsf{SZK}$ is equal to Public-coin $\mathsf{SZK}$ where ...
Mahesh S R's user avatar

Top 50 recent answers are included