Nir Bitansky

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 78

Top Venues

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

STOC

TCC (1)

Publications

Nir Bitansky, Sapir Freizeit
Robust Additive Randomized Encodings from IO and Pseudo-Non-linear Codes. IACR Cryptol. ePrint Arch. 2024 (2024)
Nir Bitansky, Ron D. Rothblum, Prahladh Harsha, Yuval Ishai, David J. Wu
Dot-Product Proofs and Their Applications. Electron. Colloquium Comput. Complex. (2024)
Nir Bitansky, Sapir Freizeit
Robust Additive Randomized Encodings from IO and Pseudo-Non-linear Codes. CRYPTO (8) (2024)
Nir Bitansky, Nathan Geier
Amplification of Non-Interactive Zero Knowledge, Revisited. IACR Cryptol. ePrint Arch. 2024 (2024)
Nir Bitansky, Prahladh Harsha, Yuval Ishai, Ron D. Rothblum, David J. Wu
Dot-Product Proofs and Their Applications. IACR Cryptol. ePrint Arch. 2024 (2024)
Nir Bitansky, Nathan Geier
Amplification of Non-interactive Zero Knowledge, Revisited. CRYPTO (9) (2024)
Nir Bitansky, Omer Paneth, Dana Shamir
Reusable Online-Efficient Commitments. CRYPTO (8) (2024)
Nir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, Prashant Nalini Vasudevan
Batch Proofs Are Statistically Hiding. STOC (2024)
Nir Bitansky, Omer Paneth, Dana Shamir, Tomer Solomon
Non-interactive Universal Arguments. CRYPTO (2) (2023)
Nir Bitansky, Chethan Kamath, Omer Paneth, Ron Rothblum, Prashant Nalini Vasudevan
Batch Proofs are Statistically Hiding. IACR Cryptol. ePrint Arch. 2023 (2023)
Nir Bitansky, Chethan Kamath, Omer Paneth, Ron Rothblum, Prashant Nalini Vasudevan
Batch Proofs are Statistically Hiding. Electron. Colloquium Comput. Complex. (2023)
Nir Bitansky, Tomer Solomon
Bootstrapping Homomorphic Encryption via Functional Encryption. IACR Cryptol. ePrint Arch. 2023 (2023)
Nir Bitansky, Tomer Solomon
Bootstrapping Homomorphic Encryption via Functional Encryption. ITCS (2023)
Nir Bitansky, Omer Paneth, Dana Shamir, Tomer Solomon
Non-interactive Universal Arguments. IACR Cryptol. ePrint Arch. 2023 (2023)
Nir Bitansky, Sapir Freizeit
Statistically Sender-Private OT from LPN and Derandomization. IACR Cryptol. ePrint Arch. 2022 (2022)
Nir Bitansky, Vinod Vaikuntanathan
A Note on Perfect Correctness by Derandomization. J. Cryptol. 35 (3) (2022)
Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath, Alex Lombardi, Omer Paneth, Ron D. Rothblum
PPAD is as Hard as LWE and Iterated Squaring. IACR Cryptol. ePrint Arch. 2022 (2022)
Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai
Constructive Post-Quantum Reductions. IACR Cryptol. ePrint Arch. 2022 (2022)
Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth
Succinct Non-Interactive Arguments via Linear Interactive Proofs. J. Cryptol. 35 (3) (2022)
Nir Bitansky, Sapir Freizeit
Statistically Sender-Private OT from LPN and Derandomization. CRYPTO (3) (2022)
Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath, Alex Lombardi, Omer Paneth, Ron D. Rothblum
PPAD is as Hard as LWE and Iterated Squaring. TCC (2) (2022)
Nir Bitansky, Huijia Lin, Omri Shmueli
Non-malleable Commitments Against Quantum Attacks. EUROCRYPT (3) (2022)
Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai
Constructive Post-Quantum Reductions. CRYPTO (3) (2022)
Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai
Constructive Post-Quantum Reductions. CoRR (2022)
Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan
Structure Versus Hardness Through the Obfuscation Lens. SIAM J. Comput. 50 (1) (2021)
Nir Bitansky, Zvika Brakerski
Classical Binding for Quantum Commitments. TCC (1) (2021)
Nir Bitansky, Huijia Lin, Omri Shmueli
Non-malleable Commitments against Quantum Attacks. IACR Cryptol. ePrint Arch. 2021 (2021)
Nir Bitansky, Zvika Brakerski
Classical Binding for Quantum Commitments. IACR Cryptol. ePrint Arch. 2021 (2021)
Nir Bitansky, Michael Kellner, Omri Shmueli
Post-quantum Resettably-Sound Zero Knowledge. IACR Cryptol. ePrint Arch. 2021 (2021)
Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
Distributional Collision Resistance Beyond One-Way Functions. CoRR (2021)
Nir Bitansky, Michael Kellner, Omri Shmueli
Post-quantum Resettably-Sound Zero Knowledge. TCC (1) (2021)
Nir Bitansky
Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs. J. Cryptol. 33 (2) (2020)
Nir Bitansky, Omri Shmueli
Post-quantum zero knowledge in constant rounds. STOC (2020)
Nir Bitansky, Noa Eizenstadt, Omer Paneth
Weakly Extractable One-Way Functions. IACR Cryptol. ePrint Arch. 2020 (2020)
Nir Bitansky, Arka Rai Choudhuri
Characterizing Deterministic-Prover Zero Knowledge. IACR Cryptol. ePrint Arch. 2020 (2020)
Nir Bitansky, Idan Gerichter
On the Cryptographic Hardness of Local Search. ITCS (2020)
Nir Bitansky, Nathan Geier
On Oblivious Amplification of Coin-Tossing Protocols. ITCS (2020)
Nir Bitansky, Idan Gerichter
On the Cryptographic Hardness of Local Search. IACR Cryptol. ePrint Arch. 2020 (2020)
Nir Bitansky, Noa Eizenstadt, Omer Paneth
Weakly Extractable One-Way Functions. TCC (1) (2020)
Nir Bitansky, Arka Rai Choudhuri
Characterizing Deterministic-Prover Zero Knowledge. TCC (1) (2020)
Nir Bitansky, Ryo Nishimaki, Alain Passelègue, Daniel Wichs
From Cryptomania to Obfustopia Through Secret-Key Functional Encryption. J. Cryptol. 33 (2) (2020)
Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
Distributional Collision Resistance Beyond One-Way Functions. IACR Cryptol. ePrint Arch. 2019 (2019)
Nir Bitansky, Omri Shmueli
Post-Quantum Zero Knowledge in Constant Rounds. IACR Cryptol. ePrint Arch. 2019 (2019)
Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
Distributional Collision Resistance Beyond One-Way Functions. EUROCRYPT (3) (2019)
Nir Bitansky, Akshay Degwekar
On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations. IACR Cryptol. ePrint Arch. 2019 (2019)
Nir Bitansky, Omer Paneth
On Round Optimal Statistical Zero Knowledge Arguments. IACR Cryptol. ePrint Arch. 2019 (2019)
Nir Bitansky, Omer Paneth
On Round Optimal Statistical Zero Knowledge Arguments. CRYPTO (3) (2019)
Nir Bitansky, Akshay Degwekar
On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations. TCC (1) (2019)
Nir Bitansky, Nathan Geier
On Oblivious Amplification of Coin-Tossing Protocols. IACR Cryptol. ePrint Arch. 2019 (2019)
Nir Bitansky, Dakshita Khurana, Omer Paneth
Weak zero-knowledge beyond the black-box barrier. STOC (2019)
Nir Bitansky, Omri Shmueli
Post-Quantum Zero Knowledge in Constant Rounds. CoRR (2019)
Nir Bitansky, Vinod Vaikuntanathan
Indistinguishability Obfuscation from Functional Encryption. J. ACM 65 (6) (2018)
Nir Bitansky, Huijia Lin
One-Message Zero Knowledge and Non-Malleable Commitments. IACR Cryptol. ePrint Arch. 2018 (2018)
Nir Bitansky, Huijia Lin
One-Message Zero Knowledge and Non-malleable Commitments. TCC (1) (2018)
Nir Bitansky, Yael Tauman Kalai, Omer Paneth
Multi-collision resistance: a paradigm for keyless hash functions. STOC (2018)
Nir Bitansky, Ran Canetti, Sanjam Garg, Justin Holmgren, Abhishek Jain, Huijia Lin, Rafael Pass, Sidharth Telang, Vinod Vaikuntanathan
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings. SIAM J. Comput. 47 (3) (2018)
Nir Bitansky, Omer Paneth
Weak Zero-Knowledge Beyond the Black-Box Barrier. IACR Cryptol. ePrint Arch. 2018 (2018)
Nir Bitansky, Huijia Lin, Omer Paneth
On Removing Graded Encodings from Functional Encryption. EUROCRYPT (2) (2017)
Nir Bitansky, Ran Canetti, Alessandro Chiesa, Shafi Goldwasser, Huijia Lin, Aviad Rubinstein, Eran Tromer
The Hunting of the SNARK. J. Cryptol. 30 (4) (2017)
Nir Bitansky, Omer Paneth, Yael Tauman Kalai
Multi-Collision Resistance: A Paradigm for Keyless Hash Functions. Electron. Colloquium Comput. Complex. 24 (2017)
Nir Bitansky
Verifiable Random Functions from Non-Interactive Witness-Indistinguishable Proofs. Electron. Colloquium Comput. Complex. 24 (2017)
Nir Bitansky
Verifiable Random Functions from Non-Interactive Witness-Indistinguishable Proofs. IACR Cryptol. ePrint Arch. 2017 (2017)
Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth
On Virtual Grey Box Obfuscation for General Circuits. Algorithmica 79 (4) (2017)
Nir Bitansky, Yael Tauman Kalai, Omer Paneth
Multi-Collision Resistance: A Paradigm for Keyless Hash Functions. IACR Cryptol. ePrint Arch. 2017 (2017)
Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan
Structure vs. Hardness Through the Obfuscation Lens. CRYPTO (1) (2017)
Nir Bitansky
Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs. TCC (2) (2017)
Nir Bitansky, Vinod Vaikuntanathan
A Note on Perfect Correctness by Derandomization. EUROCRYPT (2) (2017)
Nir Bitansky, Huijia Lin, Omer Paneth
On Removing Graded Encodings from Functional Encryption. IACR Cryptol. ePrint Arch. 2016 (2016)
Nir Bitansky, Ryo Nishimaki, Alain Passelègue, Daniel Wichs
From Cryptomania to Obfustopia through Secret-Key Functional Encryption. IACR Cryptol. ePrint Arch. 2016 (2016)
Nir Bitansky, Shafi Goldwasser, Abhishek Jain, Omer Paneth, Vinod Vaikuntanathan, Brent Waters
Time-Lock Puzzles from Randomized Encodings. ITCS (2016)
Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai, Omer Paneth, Vinod Vaikuntanathan
3-Message Zero Knowledge Against Human Ignorance. TCC (B1) (2016)
Nir Bitansky, Vinod Vaikuntanathan
Indistinguishability Obfuscation: From Approximate to Exact. TCC (A1) (2016)
Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan
Structure vs Hardness through the Obfuscation Lens. IACR Cryptol. ePrint Arch. 2016 (2016)
Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan
Structure vs Hardness through the Obfuscation Lens. Electron. Colloquium Comput. Complex. 23 (2016)
Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen
On the Existence of Extractable One-Way Functions. SIAM J. Comput. 45 (5) (2016)
Nir Bitansky, Omer Paneth, Daniel Wichs
Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation. TCC (A1) (2016)
Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai, Omer Paneth, Vinod Vaikuntanathan
3-Message Zero Knowledge Against Human Ignorance. IACR Cryptol. ePrint Arch. 2016 (2016)
Nir Bitansky, Ryo Nishimaki, Alain Passelègue, Daniel Wichs
From Cryptomania to Obfustopia Through Secret-Key Functional Encryption. TCC (B2) (2016)
Nir Bitansky, Omer Paneth
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation. IACR Cryptol. ePrint Arch. 2015 (2015)
Nir Bitansky, Omer Paneth, Alon Rosen
On the Cryptographic Hardness of Finding a Nash Equilibrium. FOCS (2015)
Nir Bitansky, Vinod Vaikuntanathan
Indistinguishability Obfuscation from Functional Encryption. IACR Cryptol. ePrint Arch. 2015 (2015)
Nir Bitansky, Vinod Vaikuntanathan
Indistinguishability Obfuscation from Functional Encryption. FOCS (2015)
Nir Bitansky, Omer Paneth, Daniel Wichs
Perfect Structure on the Edge of Chaos. IACR Cryptol. ePrint Arch. 2015 (2015)
Nir Bitansky, Omer Paneth, Alon Rosen
On the Cryptographic Hardness of Finding a Nash Equilibrium. Electron. Colloquium Comput. Complex. 22 (2015)
Nir Bitansky, Omer Paneth
ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation. TCC (2) (2015)
Nir Bitansky, Omer Paneth
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation. SIAM J. Comput. 44 (5) (2015)
Nir Bitansky, Sanjam Garg, Huijia Lin, Rafael Pass, Sidharth Telang
Succinct Randomized Encodings and their Applications. IACR Cryptol. ePrint Arch. 2015 (2015)
Nir Bitansky, Shafi Goldwasser, Abhishek Jain, Omer Paneth, Vinod Vaikuntanathan, Brent Waters
Time-Lock Puzzles from Randomized Encodings. IACR Cryptol. ePrint Arch. 2015 (2015)
Nir Bitansky, Vinod Vaikuntanathan
Indistinguishability Obfuscation: from Approximate to Exact. IACR Cryptol. ePrint Arch. 2015 (2015)
Nir Bitansky, Vinod Vaikuntanathan
A Note on Perfect Correctness by Derandomization. Electron. Colloquium Comput. Complex. 22 (2015)
Nir Bitansky, Vinod Vaikuntanathan
A Note on Perfect Correctness by Derandomization. IACR Cryptol. ePrint Arch. 2015 (2015)
Nir Bitansky, Sanjam Garg, Huijia Lin, Rafael Pass, Sidharth Telang
Succinct Randomized Encodings and their Applications. STOC (2015)
Nir Bitansky, Ran Canetti
On Strong Simulation and Composable Point Obfuscation. J. Cryptol. 27 (2) (2014)
Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen
On the Existence of Extractable One-Way Functions. IACR Cryptol. ePrint Arch. 2014 (2014)
Nir Bitansky, Ran Canetti, Henry Cohn, Shafi Goldwasser, Yael Tauman Kalai, Omer Paneth, Alon Rosen
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator. CRYPTO (2) (2014)
Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen
On the existence of extractable one-way functions. STOC (2014)
Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth
On Virtual Grey Box Obfuscation for General Circuits. CRYPTO (2) (2014)
Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth
On Virtual Grey Box Obfuscation for General Circuits. IACR Cryptol. ePrint Arch. 2014 (2014)
Boaz Barak, Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth, Amit Sahai
Obfuscation for Evasive Functions. TCC (2014)
Nir Bitansky, Ran Canetti, Alessandro Chiesa, Shafi Goldwasser, Huijia Lin, Aviad Rubinstein, Eran Tromer
The Hunting of the SNARK. IACR Cryptol. ePrint Arch. 2014 (2014)

Nir Bitansky.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Nir Bitansky