On the composition of zero-knowledge proof systems

Non-malleable cryptography

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)

Making zero-knowledge provers efficient

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing

Cryptographic defense against traffic analysis

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security

Witness-based cryptographic program checking and robust function sharing

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing