default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNir Bitansky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c53]Nir Bitansky, Omer Paneth, Dana Shamir:
Reusable Online-Efficient Commitments. CRYPTO (8) 2024: 3-35- [c52]Nir Bitansky, Sapir Freizeit:
Robust Additive Randomized Encodings from IO and Pseudo-Non-linear Codes. CRYPTO (8) 2024: 109-135 - [c51]Nir Bitansky
, Nathan Geier:
Amplification of Non-interactive Zero Knowledge, Revisited. CRYPTO (9) 2024: 361-390 - [c50]Nir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, Prashant Nalini Vasudevan:
Batch Proofs Are Statistically Hiding. STOC 2024: 435-443 - [i65]Nir Bitansky, Ron D. Rothblum, Prahladh Harsha, Yuval Ishai, David J. Wu:
Dot-Product Proofs and Their Applications. Electron. Colloquium Comput. Complex. TR24 (2024) - [i64]Nir Bitansky, Nathan Geier:
Amplification of Non-Interactive Zero Knowledge, Revisited. IACR Cryptol. ePrint Arch. 2024: 224 (2024) - [i63]Nir Bitansky, Sapir Freizeit:
Robust Additive Randomized Encodings from IO and Pseudo-Non-linear Codes. IACR Cryptol. ePrint Arch. 2024: 249 (2024) - [i62]Nir Bitansky, Prahladh Harsha, Yuval Ishai, Ron D. Rothblum, David J. Wu:
Dot-Product Proofs and Their Applications. IACR Cryptol. ePrint Arch. 2024: 1138 (2024) - 2023
- [c49]Nir Bitansky, Omer Paneth, Dana Shamir, Tomer Solomon:
Non-interactive Universal Arguments. CRYPTO (2) 2023: 132-158 - [c48]Nir Bitansky, Tomer Solomon:
Bootstrapping Homomorphic Encryption via Functional Encryption. ITCS 2023: 17:1-17:23 - [i61]Nir Bitansky, Chethan Kamath, Omer Paneth, Ron Rothblum, Prashant Nalini Vasudevan:
Batch Proofs are Statistically Hiding. Electron. Colloquium Comput. Complex. TR23 (2023) - [i60]Nir Bitansky, Omer Paneth, Dana Shamir, Tomer Solomon:
Non-interactive Universal Arguments. IACR Cryptol. ePrint Arch. 2023: 458 (2023) - [i59]Nir Bitansky, Chethan Kamath, Omer Paneth, Ron Rothblum, Prashant Nalini Vasudevan:
Batch Proofs are Statistically Hiding. IACR Cryptol. ePrint Arch. 2023: 754 (2023) - [i58]Nir Bitansky, Tomer Solomon:
Bootstrapping Homomorphic Encryption via Functional Encryption. IACR Cryptol. ePrint Arch. 2023: 1376 (2023) - 2022
- [j12]Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth:
Succinct Non-Interactive Arguments via Linear Interactive Proofs. J. Cryptol. 35(3): 15 (2022) - [j11]Nir Bitansky, Vinod Vaikuntanathan:
A Note on Perfect Correctness by Derandomization. J. Cryptol. 35(3): 18 (2022) - [c47]Nir Bitansky, Sapir Freizeit:
Statistically Sender-Private OT from LPN and Derandomization. CRYPTO (3) 2022: 625-653 - [c46]Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai:
Constructive Post-Quantum Reductions. CRYPTO (3) 2022: 654-683 - [c45]Nir Bitansky, Huijia Lin, Omri Shmueli:
Non-malleable Commitments Against Quantum Attacks. EUROCRYPT (3) 2022: 519-550 - [c44]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: 593-622 - [i57]Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai:
Constructive Post-Quantum Reductions. CoRR abs/2203.02314 (2022) - [i56]Nir Bitansky, Sapir Freizeit:
Statistically Sender-Private OT from LPN and Derandomization. IACR Cryptol. ePrint Arch. 2022: 185 (2022) - [i55]Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai:
Constructive Post-Quantum Reductions. IACR Cryptol. ePrint Arch. 2022: 298 (2022) - [i54]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: 1272 (2022) - 2021
- [j10]Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan:
Structure Versus Hardness Through the Obfuscation Lens. SIAM J. Comput. 50(1): 98-144 (2021) - [c43]Nir Bitansky, Michael Kellner, Omri Shmueli:
Post-quantum Resettably-Sound Zero Knowledge. TCC (1) 2021: 62-89 - [c42]Nir Bitansky, Zvika Brakerski:
Classical Binding for Quantum Commitments. TCC (1) 2021: 273-298 - [i53]Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev:
Distributional Collision Resistance Beyond One-Way Functions. CoRR abs/2105.00710 (2021) - [i52]Nir Bitansky, Michael Kellner, Omri Shmueli:
Post-quantum Resettably-Sound Zero Knowledge. IACR Cryptol. ePrint Arch. 2021: 349 (2021) - [i51]Nir Bitansky, Huijia Lin, Omri Shmueli:
Non-malleable Commitments against Quantum Attacks. IACR Cryptol. ePrint Arch. 2021: 920 (2021) - [i50]Nir Bitansky, Zvika Brakerski:
Classical Binding for Quantum Commitments. IACR Cryptol. ePrint Arch. 2021: 1001 (2021) - 2020
- [j9]Nir Bitansky, Ryo Nishimaki, Alain Passelègue, Daniel Wichs:
From Cryptomania to Obfustopia Through Secret-Key Functional Encryption. J. Cryptol. 33(2): 357-405 (2020) - [j8]Nir Bitansky:
Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs. J. Cryptol. 33(2): 459-493 (2020) - [c41]Nir Bitansky, Idan Gerichter:
On the Cryptographic Hardness of Local Search. ITCS 2020: 6:1-6:29 - [c40]Nir Bitansky, Nathan Geier:
On Oblivious Amplification of Coin-Tossing Protocols. ITCS 2020: 30:1-30:13 - [c39]Nir Bitansky, Omri Shmueli:
Post-quantum zero knowledge in constant rounds. STOC 2020: 269-279 - [c38]Nir Bitansky, Arka Rai Choudhuri:
Characterizing Deterministic-Prover Zero Knowledge. TCC (1) 2020: 535-566 - [c37]Nir Bitansky, Noa Eizenstadt, Omer Paneth:
Weakly Extractable One-Way Functions. TCC (1) 2020: 596-626 - [i49]Nir Bitansky, Idan Gerichter:
On the Cryptographic Hardness of Local Search. IACR Cryptol. ePrint Arch. 2020: 13 (2020) - [i48]Nir Bitansky, Arka Rai Choudhuri:
Characterizing Deterministic-Prover Zero Knowledge. IACR Cryptol. ePrint Arch. 2020: 1160 (2020) - [i47]Nir Bitansky, Noa Eizenstadt, Omer Paneth:
Weakly Extractable One-Way Functions. IACR Cryptol. ePrint Arch. 2020: 1421 (2020)
2010 – 2019
- 2019
- [c36]Nir Bitansky, Omer Paneth:
On Round Optimal Statistical Zero Knowledge Arguments. CRYPTO (3) 2019: 128-156 - [c35]Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev:
Distributional Collision Resistance Beyond One-Way Functions. EUROCRYPT (3) 2019: 667-695 - [c34]Nir Bitansky, Dakshita Khurana, Omer Paneth:
Weak zero-knowledge beyond the black-box barrier. STOC 2019: 1091-1102 - [c33]Nir Bitansky, Akshay Degwekar:
On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations. TCC (1) 2019: 422-450 - [i46]Nir Bitansky, Omri Shmueli:
Post-Quantum Zero Knowledge in Constant Rounds. CoRR abs/1912.04769 (2019) - [i45]Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev:
Distributional Collision Resistance Beyond One-Way Functions. IACR Cryptol. ePrint Arch. 2019: 115 (2019) - [i44]Nir Bitansky, Omer Paneth:
On Round Optimal Statistical Zero Knowledge Arguments. IACR Cryptol. ePrint Arch. 2019: 640 (2019) - [i43]Nir Bitansky, Akshay Degwekar:
On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations. IACR Cryptol. ePrint Arch. 2019: 686 (2019) - [i42]Nir Bitansky, Omri Shmueli:
Post-Quantum Zero Knowledge in Constant Rounds. IACR Cryptol. ePrint Arch. 2019: 1279 (2019) - [i41]Nir Bitansky, Nathan Geier:
On Oblivious Amplification of Coin-Tossing Protocols. IACR Cryptol. ePrint Arch. 2019: 1313 (2019) - 2018
- [j7]Nir Bitansky, Vinod Vaikuntanathan:
Indistinguishability Obfuscation from Functional Encryption. J. ACM 65(6): 39:1-39:37 (2018) - [j6]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): 1123-1210 (2018) - [c32]Nir Bitansky, Yael Tauman Kalai, Omer Paneth:
Multi-collision resistance: a paradigm for keyless hash functions. STOC 2018: 671-684 - [c31]Nir Bitansky, Huijia Lin:
One-Message Zero Knowledge and Non-malleable Commitments. TCC (1) 2018: 209-234 - [i40]Nir Bitansky, Huijia Lin:
One-Message Zero Knowledge and Non-Malleable Commitments. IACR Cryptol. ePrint Arch. 2018: 613 (2018) - [i39]Nir Bitansky, Omer Paneth:
Weak Zero-Knowledge Beyond the Black-Box Barrier. IACR Cryptol. ePrint Arch. 2018: 895 (2018) - 2017
- [j5]Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Virtual Grey Box Obfuscation for General Circuits. Algorithmica 79(4): 1014-1051 (2017) - [j4]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Shafi Goldwasser, Huijia Lin, Aviad Rubinstein, Eran Tromer:
The Hunting of the SNARK. J. Cryptol. 30(4): 989-1066 (2017) - [c30]Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan:
Structure vs. Hardness Through the Obfuscation Lens. CRYPTO (1) 2017: 696-723 - [c29]Nir Bitansky, Huijia Lin, Omer Paneth:
On Removing Graded Encodings from Functional Encryption. EUROCRYPT (2) 2017: 3-29 - [c28]Nir Bitansky, Vinod Vaikuntanathan:
A Note on Perfect Correctness by Derandomization. EUROCRYPT (2) 2017: 592-606 - [c27]Nir Bitansky:
Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs. TCC (2) 2017: 567-594 - [i38]Nir Bitansky:
Verifiable Random Functions from Non-Interactive Witness-Indistinguishable Proofs. Electron. Colloquium Comput. Complex. TR17 (2017) - [i37]Nir Bitansky, Omer Paneth, Yael Tauman Kalai:
Multi-Collision Resistance: A Paradigm for Keyless Hash Functions. Electron. Colloquium Comput. Complex. TR17 (2017) - [i36]Nir Bitansky:
Verifiable Random Functions from Non-Interactive Witness-Indistinguishable Proofs. IACR Cryptol. ePrint Arch. 2017: 18 (2017) - [i35]Nir Bitansky, Yael Tauman Kalai, Omer Paneth:
Multi-Collision Resistance: A Paradigm for Keyless Hash Functions. IACR Cryptol. ePrint Arch. 2017: 488 (2017) - 2016
- [j3]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
On the Existence of Extractable One-Way Functions. SIAM J. Comput. 45(5): 1910-1952 (2016) - [c26]Nir Bitansky, Shafi Goldwasser, Abhishek Jain, Omer Paneth, Vinod Vaikuntanathan, Brent Waters:
Time-Lock Puzzles from Randomized Encodings. ITCS 2016: 345-356 - [c25]Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai, Omer Paneth, Vinod Vaikuntanathan:
3-Message Zero Knowledge Against Human Ignorance. TCC (B1) 2016: 57-83 - [c24]Nir Bitansky, Vinod Vaikuntanathan:
Indistinguishability Obfuscation: From Approximate to Exact. TCC (A1) 2016: 67-95 - [c23]Nir Bitansky, Ryo Nishimaki, Alain Passelègue, Daniel Wichs:
From Cryptomania to Obfustopia Through Secret-Key Functional Encryption. TCC (B2) 2016: 391-418 - [c22]Nir Bitansky, Omer Paneth, Daniel Wichs:
Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation. TCC (A1) 2016: 474-502 - [i34]Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan:
Structure vs Hardness through the Obfuscation Lens. Electron. Colloquium Comput. Complex. TR16 (2016) - [i33]Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai, Omer Paneth, Vinod Vaikuntanathan:
3-Message Zero Knowledge Against Human Ignorance. IACR Cryptol. ePrint Arch. 2016: 213 (2016) - [i32]Nir Bitansky, Ryo Nishimaki, Alain Passelègue, Daniel Wichs:
From Cryptomania to Obfustopia through Secret-Key Functional Encryption. IACR Cryptol. ePrint Arch. 2016: 558 (2016) - [i31]Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan:
Structure vs Hardness through the Obfuscation Lens. IACR Cryptol. ePrint Arch. 2016: 574 (2016) - [i30]Nir Bitansky, Huijia Lin, Omer Paneth:
On Removing Graded Encodings from Functional Encryption. IACR Cryptol. ePrint Arch. 2016: 962 (2016) - 2015
- [j2]Nir Bitansky, Omer Paneth:
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation. SIAM J. Comput. 44(5): 1325-1383 (2015) - [c21]Nir Bitansky, Vinod Vaikuntanathan:
Indistinguishability Obfuscation from Functional Encryption. FOCS 2015: 171-190 - [c20]Nir Bitansky, Omer Paneth, Alon Rosen:
On the Cryptographic Hardness of Finding a Nash Equilibrium. FOCS 2015: 1480-1498 - [c19]Nir Bitansky, Sanjam Garg, Huijia Lin, Rafael Pass, Sidharth Telang:
Succinct Randomized Encodings and their Applications. STOC 2015: 439-448 - [c18]Nir Bitansky, Omer Paneth:
ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation. TCC (2) 2015: 401-427 - [i29]Nir Bitansky, Omer Paneth, Alon Rosen:
On the Cryptographic Hardness of Finding a Nash Equilibrium. Electron. Colloquium Comput. Complex. TR15 (2015) - [i28]Nir Bitansky, Vinod Vaikuntanathan:
A Note on Perfect Correctness by Derandomization. Electron. Colloquium Comput. Complex. TR15 (2015) - [i27]Nir Bitansky, Omer Paneth, Daniel Wichs:
Perfect Structure on the Edge of Chaos. IACR Cryptol. ePrint Arch. 2015: 126 (2015) - [i26]Nir Bitansky, Vinod Vaikuntanathan:
Indistinguishability Obfuscation from Functional Encryption. IACR Cryptol. ePrint Arch. 2015: 163 (2015) - [i25]Nir Bitansky, Sanjam Garg, Huijia Lin, Rafael Pass, Sidharth Telang:
Succinct Randomized Encodings and their Applications. IACR Cryptol. ePrint Arch. 2015: 356 (2015) - [i24]Nir Bitansky, Omer Paneth:
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation. IACR Cryptol. ePrint Arch. 2015: 369 (2015) - [i23]Nir Bitansky, Shafi Goldwasser, Abhishek Jain, Omer Paneth, Vinod Vaikuntanathan, Brent Waters:
Time-Lock Puzzles from Randomized Encodings. IACR Cryptol. ePrint Arch. 2015: 514 (2015) - [i22]Nir Bitansky, Vinod Vaikuntanathan:
Indistinguishability Obfuscation: from Approximate to Exact. IACR Cryptol. ePrint Arch. 2015: 704 (2015) - [i21]Nir Bitansky, Vinod Vaikuntanathan:
A Note on Perfect Correctness by Derandomization. IACR Cryptol. ePrint Arch. 2015: 1130 (2015) - 2014
- [b1]Nir Bitansky:
Getting inside the adversary's head: new directions in non- black- box knowledge extraction. Tel Aviv University, Israel, 2014 - [j1]Nir Bitansky, Ran Canetti:
On Strong Simulation and Composable Point Obfuscation. J. Cryptol. 27(2): 317-357 (2014) - [c17]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: 71-89 - [c16]Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Virtual Grey Box Obfuscation for General Circuits. CRYPTO (2) 2014: 108-125 - [c15]Nir Bitansky, Dana Dachman-Soled, Huijia Lin:
Leakage-Tolerant Computation with Input-Independent Preprocessing. CRYPTO (2) 2014: 146-163 - [c14]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
On the existence of extractable one-way functions. STOC 2014: 505-514 - [c13]Boaz Barak, Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Obfuscation for Evasive Functions. TCC 2014: 26-51 - [i20]Nir Bitansky, Omer Paneth:
ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2014: 295 (2014) - [i19]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
On the Existence of Extractable One-Way Functions. IACR Cryptol. ePrint Arch. 2014: 402 (2014) - [i18]Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Virtual Grey Box Obfuscation for General Circuits. IACR Cryptol. ePrint Arch. 2014: 554 (2014) - [i17]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Shafi Goldwasser, Huijia Lin, Aviad Rubinstein, Eran Tromer:
The Hunting of the SNARK. IACR Cryptol. ePrint Arch. 2014: 580 (2014) - [i16]Nir Bitansky, Sanjam Garg, Sidharth Telang:
Succinct Randomized Encodings and their Applications. IACR Cryptol. ePrint Arch. 2014: 771 (2014) - [i15]Nir Bitansky, Omer Paneth, Alon Rosen:
On the Cryptographic Hardness of Finding a Nash Equilibrium. IACR Cryptol. ePrint Arch. 2014: 1029 (2014) - 2013
- [c12]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer:
Recursive composition and bootstrapping for SNARKS and proof-carrying data. STOC 2013: 111-120 - [c11]Nir Bitansky, Omer Paneth:
On the impossibility of approximate obfuscation and applications to resettable cryptography. STOC 2013: 241-250 - [c10]Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth:
Erratum: Succinct Non-interactive Arguments via Linear Interactive Proofs. TCC 2013 - [c9]Nir Bitansky, Dana Dachman-Soled, Sanjam Garg, Abhishek Jain, Yael Tauman Kalai, Adriana López-Alt, Daniel Wichs:
Why "Fiat-Shamir for Proofs" Lacks a Proof. TCC 2013: 182-201 - [c8]Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth:
Succinct Non-interactive Arguments via Linear Interactive Proofs. TCC 2013: 315-333 - [i14]Nir Bitansky, Ran Canetti, Omer Paneth:
How To Construct Extractable One-Way Functions Against Uniform Adversaries. IACR Cryptol. ePrint Arch. 2013: 468 (2013) - [i13]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
Indistinguishability Obfuscation vs. Auxiliary-Input Extractable Functions: One Must Fall. IACR Cryptol. ePrint Arch. 2013: 641 (2013) - [i12]Boaz Barak, Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Obfuscation for Evasive Functions. IACR Cryptol. ePrint Arch. 2013: 668 (2013) - [i11]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
More on the Impossibility of Virtual-Black-Box Obfuscation with Auxiliary Input. IACR Cryptol. ePrint Arch. 2013: 701 (2013) - 2012
- [c7]Nir Bitansky, Alessandro Chiesa:
Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits. CRYPTO 2012: 255-272 - [c6]Nir Bitansky, Omer Paneth:
From the Impossibility of Obfuscation to a New Non-Black-Box Simulation Technique. FOCS 2012: 223-232 - [c5]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer:
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. ITCS 2012: 326-349 - [c4]Nir Bitansky, Omer Paneth:
Point Obfuscation and 3-Round Zero-Knowledge. TCC 2012: 190-208 - [c3]Nir Bitansky, Ran Canetti, Shai Halevi:
Leakage-Tolerant Interactive Protocols. TCC 2012: 266-284 - [i10]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer:
Recursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data. IACR Cryptol. ePrint Arch. 2012: 95 (2012) - [i9]Nir Bitansky, Alessandro Chiesa:
Succinct Arguments from Multi-Prover Interactive Proofs and their Efficiency Benefits. IACR Cryptol. ePrint Arch. 2012: 461 (2012) - [i8]Nir Bitansky, Sanjam Garg, Daniel Wichs:
Why "Fiat-Shamir for Proofs" Lacks a Proof. IACR Cryptol. ePrint Arch. 2012: 705 (2012) - [i7]Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, Omer Paneth:
Succinct Non-Interactive Arguments via Linear Interactive Proofs. IACR Cryptol. ePrint Arch. 2012: 718 (2012) - [i6]Nir Bitansky, Omer Paneth:
On the Impossibility of Approximate Obfuscation and Applications to Resettable Cryptography. IACR Cryptol. ePrint Arch. 2012: 729 (2012) - 2011
- [c2]Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum:
Program Obfuscation with Leaky Hardware. ASIACRYPT 2011: 722-739 - [i5]Nir Bitansky, Ran Canetti, Shai Halevi:
Leakage Tolerant Interactive Protocols. IACR Cryptol. ePrint Arch. 2011: 204 (2011) - [i4]Nir Bitansky, Ran Canetti, Alessandro Chiesa, Eran Tromer:
From Extractable Collision Resistance to Succinct Non-Interactive Arguments of Knowledge, and Back Again. IACR Cryptol. ePrint Arch. 2011: 443 (2011) - [i3]Nir Bitansky, Omer Paneth:
From Point Obfuscation To 3-round Zero-Knowledge. IACR Cryptol. ePrint Arch. 2011: 493 (2011) - [i2]Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum:
Program Obfuscation with Leaky Hardware. IACR Cryptol. ePrint Arch. 2011: 660 (2011) - 2010
- [c1]Nir Bitansky, Ran Canetti:
On Strong Simulation and Composable Point Obfuscation. CRYPTO 2010: 520-537 - [i1]Nir Bitansky, Ran Canetti:
On Strong Simulation and Composable Point Obfuscation. IACR Cryptol. ePrint Arch. 2010: 414 (2010)
Coauthor Index
[c53] [c50] [c49] [i61] [i60] [i59] [j12] [c44] [i54] [c37] [i47] [c36] [c34] [i44] [c32] [i39] [j5] [c29] [i37] [i35] [j3] [c26] [c25] [c22] [i33] [i30] [j2] [c20] [c18] [i29] [i27] [i24] [i23] [c17] [c16] [c14] [c13] [i20] [i19] [i18] [i15] [c11] [c10] [c8] [i14] [i13] [i12] [i11] [c6] [c4] [i7] [i6] [i3]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
