Answers are grounded in this paper and cite their sources.
This work shows that zero-knowledge proofs can be made non-interactive, suggesting strong security for public-key systems against attacks.
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.
No takes yet. Share an insight, caveat, or question.
Blum et al. (1988) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: