Name
Affiliation
Papers
NIR BITANSKY
Tel Aviv University, Israel and Boston University
49
Collaborators
Citations 
PageRank 
44
833
31.00
Referers 
Referees 
References 
693
529
1247
Search Limit
100693
Title
Citations
PageRank
Year
Constructive Post-Quantum Reductions.00.342022
Succinct Non-Interactive Arguments via Linear Interactive Proofs00.342022
PPAD is as Hard as LWE and Iterated Squaring.00.342022
A Note on Perfect Correctness by Derandomization00.342022
Post-quantum Resettably-Sound Zero Knowledge00.342021
Structure Versus Hardness Through The Obfuscation Lens00.342021
Classical Binding for Quantum Commitments00.342021
Post-quantum zero knowledge in constant rounds10.362020
On the Cryptographic Hardness of Local Search.00.342020
On Oblivious Amplification of Coin-Tossing Protocols.00.342020
Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs00.342020
On Round Optimal Statistical Zero Knowledge Arguments.00.342019
Distributional Collision Resistance Beyond One-Way Functions.00.342019
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings.20.372018
A Note on Perfect Correctness by Derandomization.20.382017
On Removing Graded Encodings from Functional Encryption.30.362017
Multi-Collision Resistance: A Paradigm for Keyless Hash Functions.80.422017
Structure vs Hardness through the Obfuscation Lens.50.392016
3-Message Zero Knowledge Against Human Ignorance.40.382016
Time-Lock Puzzles From Randomized Encodings240.862016
Indistinguishability Obfuscation: From Approximate to Exact.80.422016
Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation.80.442016
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation.60.412015
Perfect Structure on the Edge of Chaos.180.542015
Indistinguishability Obfuscation from Functional Encryption.601.132015
ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation.270.682014
The Hunting of the SNARK.20.382014
Succinct Randomized Encodings and their Applications.501.012014
On the existence of extractable one-way functions350.842014
On the Cryptographic Hardness of Finding a Nash Equilibrium.270.662014
Leakage-Tolerant Computation with Input-Independent Preprocessing.150.542014
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator.250.822014
On Virtual Grey Box Obfuscation for General Circuits.100.552014
Recursive composition and bootstrapping for SNARKS and proof-carrying data952.362013
Why “fiat-shamir for proofs” lacks a proof120.472013
How To Construct Extractable One-Way Functions Against Uniform Adversaries.20.372013
Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs.10.352013
Indistinguishability Obfuscation vs. Auxiliary-Input Extractable Functions: One Must Fall.130.572013
Succinct non-interactive arguments via linear interactive proofs691.722013
Obfuscation for Evasive Functions.100.522013
On the impossibility of approximate obfuscation and applications to resettable cryptography250.712013
More on the Impossibility of Virtual-Black-Box Obfuscation with Auxiliary Input.60.472013
From the Impossibility of Obfuscation to a New Non-Black-Box Simulation Technique200.632012
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again1323.272012
Leakage-Tolerant interactive protocols410.982012
Succinct Arguments from Multi-Prover Interactive Proofs and their Efficiency Benefits.210.642012
Program obfuscation with leaky hardware200.772011
Point obfuscation and 3-round zero-knowledge00.342011
On Strong Simulation and Composable Point Obfuscation260.852010