# Publications

Amplifying collision-resistance: A complexity-theoretic treatment.” In A. Menezes, editor, Advances in Cryptology (CRYPTO '07), 4622:264-283. Lecture Notes in Computer Science, Springer-Verlag, 2007. Publisher's VersionAbstract CRYPTO2007.pdf

. “Robust PCPs of proximity, shorter PCPs, and applications to coding.” SIAM Journal on Computing: Special Issue on Randomness and Complexity 36, no. 4 (2006): 889-974. Publisher's VersionAbstract SICOMP2006.pdf

. “Using nondeterminism to amplify hardness.” SIAM Journal on Computing: Special Issue on STOC '04 35, no. 4 (2006): 903-931. Publisher's VersionAbstract SICOMP2006.pdf

. “An unconditional study of computational zero knowledge.” SIAM Journal on Computing: Special Issue on Randomness and Complexity 36, no. 4 (2006): 1160-1214. Publisher's VersionAbstract SICOMP2006.pdf

. “Pseudorandom walks in regular digraphs and the RL vs. L problem.” In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC ‘06), 457-466, 2006, 457-466. Publisher's VersionAbstract ACM2006.pdf ECCC2005.pdf

. “Concurrent zero knowledge without complexity assumptions.” In S. Halevi and T. Rabin, eds., Proceedings of the Third Theory of Cryptography Conference (TCC '06), 3876:1-20. New York, NY, USA: Springer Verlag, Lecture Notes in Computer Science, 2006. Publisher's VersionAbstract ECCC2005.pdf TCC2006.pdf

. “Zero knowledge with efficient provers.” In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC ‘06), 287-295. ACM, 2006. Publisher's VersionAbstract STOC2006.pdf

. “Random selection with an adversarial majority.” In Advances in Cryptology—CRYPTO ‘06, C. Dwork, ed. 4117:409–426. Springer Verlag, Lecture Notes in Computer Science, 2006. Publisher's VersionAbstract CRYPTO2006.pdf ECCC-02.2006.pdf FULL-06.2006.pdf

. “Statistical zero-knowledge arguments for NP from any one-way function.” In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS ‘06), 3-13. IEEE, 2006. Publisher's VersionAbstract FOCS2006.pdf

. “Compression of samplable sources.” Computational Complexity: Special Issue on CCC'04 14, no. 3 (2005): 186-227. Publisher's VersionAbstract CC2005.pdf

. “Short PCPs verifiable in polylogarithmic time.” In Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC '05), 120-134, 2005, 120-134. Publisher's VersionAbstract

. “Derandomized squaring of graphs.” In Proceedings of the 8th International Workshop on Randomization and Computation (RANDOM '05), 3624:436-447. Berkeley, CA: Springer Verlag, Lecture Notes in Computer Science, 2005. Publisher's VersionAbstract RANDOM2005.pdf

. “A complete problem for statistical zero knowledge.” Journal of the ACM 50, no. 2 (2003): 196-249.Abstract complete_problem_statistical_zero_knowledge.pdf

. “The power of a pebble: exploring and mapping directed graphs.” Information and Computation 176, no. 1 (2002): 1-21.Abstract power_of_pebble.pdf

. “The complexity of counting in sparse, regular, and planar graphs.” SIAM Journal on Computing 31, no. 2 (2001): 398-427.Abstract complexity_counting_sparse_regular_planar_graphs.pdf

. “ Manipulating statistical difference.” Randomization Methods in Algorithm Design (DIMACS Workshop, December 1997), volume 43 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science 43 (1999): 251-270.Abstract manipulating_statistical_difference.pdf

. “Key management for multicast: Issues and architectures.” Internet RFC 2627, no. June 1999 (1999).Abstract

. “Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge.” Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC ‘98) (1998): 399-408.Abstract honest-verifier_statistical_zero-knowledge.pdf

. “