Can Statistical Zero Knowledge be made Non-interactive? or On the Relationship of SZK and NISZK

We extend the study of non-interactive statistical zero-knowledge proofs. Our main focus is to compare the class NISZK of problems possessing such non-interactive proofs to the class SZK of problems possessing interactive statistical zero-knowledge proofs. Along these lines, we first show that if st...

Cijeli opis

Bibliografski detalji
Glavni autori: Goldreich, Oded, Sahai, Amit, Vadhan, Salil
Izdano: 2023
Online pristup:https://hdl.handle.net/1721.1/149287