Non-interactive zero-knowledge and its applications

Manuel Blum, Paul Feldman, Silvio Micali · 1988

We show that interaction in any zero-knowledge proof can be replaced by sharing a common, short, random string. We use this result to construct the first public-key cryptosystem secure against chosen ciphertext attack.

Read the paper · More papers on PaperTik