Nir Bitansky

About

Nir Bitansky is a professor at the Khoury College of Computer Science at Northeastern University, with a primary research focus on cryptography. His work encompasses a variety of topics including computing on encrypted data, program obfuscation, lattice-based cryptography, information-theoretic cryptography, and the foundations of cryptography. He is actively involved in the theory and security groups and has contributed to advancing cryptographic techniques and protocols. Prior to his current position, he was a Josef Raviv Memorial Postdoctoral Fellow at IBM Research T.J. Watson from 2011 to 2013. He earned his PhD in Computer Science from New York University in 2011 under the supervision of Yevgeniy Dodis. His academic background also includes a Bachelor's degree in Mathematics and a Master's degree in Computer Science from Stanford University, completed in 2005. His research has been recognized with awards such as the best paper award at STOC 2023, the 2022 faculty research award from J.P. Morgan, the 2018 Sloan Research Fellowship, and the 2018 NSF CAREER Award. His extensive publication record and active participation in cryptography conferences and program committees underscore his significant contributions to the field.

Research topics

• Computer Science
• Algorithm
• Discrete mathematics
• Mathematics
• Programming language
• Quantum mechanics
• Physics
• Philosophy
• Theoretical computer science

Selected publications

• Amplification of Non-interactive Zero Knowledge, Revisited

  Lecture notes in computer science · 2024-01-01 · 5 citations

  book-chapter1st authorCorresponding
  PublisherDOI

• Dot-Product Proofs and Their Applications

  2024-10-27 · 4 citations

  article1st authorCorresponding

  A dot-product proof (DPP) is a simple probabilistic proof system in which the input statement <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\boldsymbol{x}$</tex> and the proof <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\boldsymbol{\pi}$</tex> are vectors over a finite field <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbb{F}$</tex>, and the…

  PublisherDOI

• Succinct Randomized Encodings from Laconic Function Evaluation, Faster and Simpler

  Lecture notes in computer science · 2025-01-01 · 3 citations

  book-chapter1st authorCorresponding
  PublisherDOI

• Constructive Post-Quantum Reductions

  arXiv (Cornell University) · 2022-03-04 · 2 citations

  preprintOpen access1st authorCorresponding

  Is it possible to convert classical cryptographic reductions into post-quantum ones? It is customary to argue that while this is problematic in the interactive setting, non-interactive reductions do carry over. However, when considering quantum auxiliary input, this conversion results in a non-constructive post-quantum reduction that requires duplicating the quantum auxiliary input, which is in general inefficient or even impossible. This violates the win-win premise of provable cryptography: an…

  PublisherOA PDFDOI

• Robust Additive Randomized Encodings from IO and Pseudo-Non-linear Codes

  Lecture notes in computer science · 2024-01-01 · 1 citations

  book-chapter1st authorCorresponding
  PublisherDOI

Frequent coauthors

• Omer Paneth

  55 shared

• Vinod Vaikuntanathan

  53 shared

• Sanjam Garg

  40 shared

• Ran Canetti

  40 shared

• Abhishek Jain

  Johns Hopkins University

  39 shared

• Justin Holmgren

  37 shared

• Rafael Pass

  37 shared

• Sidharth Telang

  Johns Hopkins University

  37 shared

Labs

• Wichs LabPI

Education

• Ph.D.

  MIT

• Other

  Tel Aviv University's School of Computer Science

Awards & honors

• Crypto 2024 Area Chair

Similar researchers at New York University

• Martin Farach-Coltonh-55
• Joseph Bonneauh-41
• Marshall Ballh-11