Nir Bitansky

Orcid: 0000-0001-8361-6035

According to our database1, Nir Bitansky authored at least 65 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Amplification of Non-Interactive Zero Knowledge, Revisited.
IACR Cryptol. ePrint Arch., 2024

Robust Additive Randomized Encodings from IO and Pseudo-Non-linear Codes.
IACR Cryptol. ePrint Arch., 2024

2023
Bootstrapping Homomorphic Encryption via Functional Encryption.
IACR Cryptol. ePrint Arch., 2023

Non-interactive Universal Arguments.
IACR Cryptol. ePrint Arch., 2023

Batch Proofs are Statistically Hiding.
Electron. Colloquium Comput. Complex., 2023

2022
A Note on Perfect Correctness by Derandomization.
J. Cryptol., 2022

Succinct Non-Interactive Arguments via Linear Interactive Proofs.
J. Cryptol., 2022

Statistically Sender-Private OT from LPN and Derandomization.
IACR Cryptol. ePrint Arch., 2022

PPAD is as Hard as LWE and Iterated Squaring.
IACR Cryptol. ePrint Arch., 2022

Constructive Post-Quantum Reductions.
IACR Cryptol. ePrint Arch., 2022

2021
Structure Versus Hardness Through the Obfuscation Lens.
SIAM J. Comput., 2021

Non-malleable Commitments against Quantum Attacks.
IACR Cryptol. ePrint Arch., 2021

Post-quantum Resettably-Sound Zero Knowledge.
IACR Cryptol. ePrint Arch., 2021

Classical Binding for Quantum Commitments.
IACR Cryptol. ePrint Arch., 2021

2020
From Cryptomania to Obfustopia Through Secret-Key Functional Encryption.
J. Cryptol., 2020

Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs.
J. Cryptol., 2020

On the Cryptographic Hardness of Local Search.
IACR Cryptol. ePrint Arch., 2020

Weakly Extractable One-Way Functions.
IACR Cryptol. ePrint Arch., 2020

Characterizing Deterministic-Prover Zero Knowledge.
IACR Cryptol. ePrint Arch., 2020

2019
Post-Quantum Zero Knowledge in Constant Rounds.
IACR Cryptol. ePrint Arch., 2019

On Round Optimal Statistical Zero Knowledge Arguments.
IACR Cryptol. ePrint Arch., 2019

Distributional Collision Resistance Beyond One-Way Functions.
IACR Cryptol. ePrint Arch., 2019

On Oblivious Amplification of Coin-Tossing Protocols.
IACR Cryptol. ePrint Arch., 2019

On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations.
IACR Cryptol. ePrint Arch., 2019

Weak zero-knowledge beyond the black-box barrier.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings.
SIAM J. Comput., 2018

Indistinguishability Obfuscation from Functional Encryption.
J. ACM, 2018

Weak Zero-Knowledge Beyond the Black-Box Barrier.
IACR Cryptol. ePrint Arch., 2018

One-Message Zero Knowledge and Non-Malleable Commitments.
IACR Cryptol. ePrint Arch., 2018

2017
The Hunting of the SNARK.
J. Cryptol., 2017

Multi-Collision Resistance: A Paradigm for Keyless Hash Functions.
Electron. Colloquium Comput. Complex., 2017

On Virtual Grey Box Obfuscation for General Circuits.
Algorithmica, 2017

2016
On Removing Graded Encodings from Functional Encryption.
IACR Cryptol. ePrint Arch., 2016

3-Message Zero Knowledge Against Human Ignorance.
IACR Cryptol. ePrint Arch., 2016

Structure vs Hardness through the Obfuscation Lens.
Electron. Colloquium Comput. Complex., 2016

Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

2015
Indistinguishability Obfuscation: from Approximate to Exact.
IACR Cryptol. ePrint Arch., 2015

Perfect Structure on the Edge of Chaos.
IACR Cryptol. ePrint Arch., 2015

On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation.
IACR Cryptol. ePrint Arch., 2015

Succinct Randomized Encodings and their Applications.
IACR Cryptol. ePrint Arch., 2015

Time-Lock Puzzles from Randomized Encodings.
IACR Cryptol. ePrint Arch., 2015

On the Cryptographic Hardness of Finding a Nash Equilibrium.
Electron. Colloquium Comput. Complex., 2015

2014
Getting inside the adversary's head: new directions in non- black- box knowledge extraction
PhD thesis, 2014

On Strong Simulation and Composable Point Obfuscation.
J. Cryptol., 2014

ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2014

Succinct Randomized Encodings and their Applications.
IACR Cryptol. ePrint Arch., 2014

On the Existence of Extractable One-Way Functions.
IACR Cryptol. ePrint Arch., 2014

Leakage-Tolerant Computation with Input-Independent Preprocessing.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013
More on the Impossibility of Virtual-Black-Box Obfuscation with Auxiliary Input.
IACR Cryptol. ePrint Arch., 2013

Indistinguishability Obfuscation vs. Auxiliary-Input Extractable Functions: One Must Fall.
IACR Cryptol. ePrint Arch., 2013

How To Construct Extractable One-Way Functions Against Uniform Adversaries.
IACR Cryptol. ePrint Arch., 2013

Obfuscation for Evasive Functions.
IACR Cryptol. ePrint Arch., 2013

Why "Fiat-Shamir for Proofs" Lacks a Proof.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

2012
On the Impossibility of Approximate Obfuscation and Applications to Resettable Cryptography.
IACR Cryptol. ePrint Arch., 2012

Why "Fiat-Shamir for Proofs" Lacks a Proof.
IACR Cryptol. ePrint Arch., 2012

Recursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data.
IACR Cryptol. ePrint Arch., 2012

Succinct Arguments from Multi-Prover Interactive Proofs and their Efficiency Benefits.
IACR Cryptol. ePrint Arch., 2012

Point Obfuscation and 3-Round Zero-Knowledge.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

From the Impossibility of Obfuscation to a New Non-Black-Box Simulation Technique.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
From Point Obfuscation To 3-round Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2011

Leakage Tolerant Interactive Protocols.
IACR Cryptol. ePrint Arch., 2011

Program Obfuscation with Leaky Hardware.
IACR Cryptol. ePrint Arch., 2011

From Extractable Collision Resistance to Succinct Non-Interactive Arguments of Knowledge, and Back Again.
IACR Cryptol. ePrint Arch., 2011


  Loading...