Nir Bitansky

Nir Bitansky is an Associate Professor of Computer Science at New York University. His research focuses on the theory of computation, particularly in cryptography. He holds a Ph.D. in Computer Science from Tel-Aviv University, Israel, and previously served as a postdoctoral researcher at MIT CSAIL. Bitansky's work includes foundational contributions to cryptography, proof systems, and quantum cryptography. He has published extensively in top conferences and journals, including STOC, CRYPTO, and TCC. His research explores the theoretical underpinnings of cryptographic protocols and their applications in secure computation.

Nir Bitansky is a researcher in Theoretical Computer Science with a focus on Cryptography. His work explores advanced cryptographic protocols, including succinct non-interactive arguments of knowledge, indistinguishability obfuscation, and zero-knowledge proofs. He has contributed to the development of secure and efficient cryptographic constructions, such as multi-prover interactive proofs, leakage-tolerant protocols, and verifiable random functions. His research also addresses foundational questions in computational complexity and cryptographic hardness, such as the existence of extractable one-way functions and the cryptographic hardness of finding a Nash equilibrium. Bitansky's publications often intersect with theoretical computer science, emphasizing the interplay between cryptography and complexity theory.