@dblp

Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (Extended Abstract).

, , and . EUROCRYPT, volume 434 of Lecture Notes in Computer Science, page 192-195. Springer, (1989)

Links and resources

Tags