Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)


\Zero-knowledge arguments" is a fundamental cryptographic primitive which allows one polynomial-time player to convince another polynomial-time player of the validity of an NP statement, without revealing any additional information in the information-theoretic sense. Despite their practical and theoretical importance, it was only known how to implement zero… (More)
DOI: 10.1007/3-540-48071-4_14


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics