Jump to Content

Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds (extended abstract)

Gilles Brassard
Claude Cr\'{e}peau
EUROCRYPT '89: Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology, Springer-Verlag New York, Inc., New York, NY, USA (1990), pp. 192-195

Abstract

Research Areas