On the Possibility of One-Message Weak Zero-Knowledge

Abstract. We investigate whether it is possible to obtain any meaningful type of zero-knowledge proofs using a one-message (i.e., noninteractive) proof system. We show that, under reasonable (although not standard) assumptions, there exists a one-message proof system for every language in NP that satisfies the following relaxed form of zero knowledge:

• Type: Conference
• Year: 2004
• Where: TCC
• Authors: Boaz Barak, Rafael Pass
• Keywords: Cryptography, Meaningful Type, Proof System, TCC 2004, Zero-knowledge Proofs