Abstract
Basing security of encryption on NP-hardness is a longstanding challenge in the foundations of cryptography. Under standard complexity-theoretic assumptions, such encryption should be secure even if the adversary had access to a statistical zero-knowledge (SZK) oracle. I will talk about the vulnerability of some public-key schemes to SZK attacks and speculate about the role of statistical-to-computational gaps in building SZK-resilient public-key encryption.