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

Gilles Brassard, Claude Crépeau, Moti Yung. Everything in NP can be Argued in ::::Perfect:::: Zero-Knowledge in a ::::Bounded:::: Number of Rounds (Extended Abstract). In EUROCRYPT. pages 192-195, 1989. [doi]

Abstract

Abstract is missing.