Nir Bitansky

Citeras av

	Alla	Sedan 2016
Citat	2622	1963
h-index	26	24
i10-index	35	34

480

240

120

360

2011201220132014201520162017201820192020202116 40 138 179 232 350 311 394 414 469 20

Medförfattare

Omer PanethMITVerifierad e-postadress på mit.edu
Ran CanettiProfessor of Computer Science, Boston UniversityVerifierad e-postadress på bu.edu
Alessandro ChiesaUC BerkeleyVerifierad e-postadress på berkeley.edu
Vinod VaikuntanathanAssociate Professor of Computer Science, Massachusetts Institute of TechnologyVerifierad e-postadress på csail.mit.edu
Yael Tauman KalaiMicrosoft Research, MITVerifierad e-postadress på microsoft.com
Huijia (Rachel) LinAssociate Professor at the University of WashingtonVerifierad e-postadress på cs.washington.edu
Alon RosenProfessor of Computer Science, IDC HerzliyaVerifierad e-postadress på idc.ac.il
Eran TromerTel Aviv University + Columbia UniversityVerifierad e-postadress på cs.tau.ac.il
Sanjam GargUniversity of California, BerkeleyVerifierad e-postadress på berkeley.edu
Daniel WichsNortheastern University, Associate ProfessorVerifierad e-postadress på ccs.neu.edu
Abhishek JainAssistant Professor, Johns Hopkins UniversityVerifierad e-postadress på cs.jhu.edu
Rafail OstrovskyProfessor of Computer Science and Professor of Mathematics, UCLAVerifierad e-postadress på cs.ucla.edu
Yuval IshaiVerifierad e-postadress på cs.technion.ac.il
Shai HaleviResearch Fellow, Algorand FoundationVerifierad e-postadress på alum.mit.edu
Sidharth TelangCornell UniversityVerifierad e-postadress på cs.cornell.edu
Dana Dachman-SoledAssociate Professor, Department of Electrical and Computer Engineering, University of MarylandVerifierad e-postadress på umd.edu
Brent WatersUniversity of Texas at AustinVerifierad e-postadress på cs.utexas.edu
Guy RothblumWeizmann Institute of ScienceVerifierad e-postadress på alum.mit.edu
Henry CohnSenior Principal Researcher, Microsoft Research New EnglandVerifierad e-postadress på microsoft.com
Ryo NishimakiNTT Secure Platform LaboratoriesVerifierad e-postadress på hco.ntt.co.jp

Nir Bitansky

Tel Aviv University

Verifierad e-postadress på tau.ac.il - Startsida

Theoretical Computer Science - Cryptography


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again N Bitansky, R Canetti, A Chiesa, E Tromer Proceedings of the 3rd Innovations in Theoretical Computer Science …, 2012	333	2012
Succinct non-interactive arguments via linear interactive proofs N Bitansky, A Chiesa, Y Ishai, R Ostrovsky, O Paneth Theory of Cryptography, 315-333, 2013	235	2013
Recursive composition and bootstrapping for SNARKs and proof-carrying data N Bitansky, R Canetti, A Chiesa, E Tromer Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013	228	2013
Indistinguishability obfuscation from functional encryption N Bitansky, V Vaikuntanathan Journal of the ACM (JACM) 65 (6), 1-37, 2018	175	2018
On the Existence of Extractable One-Way Functions N Bitansky, R Canetti, O Paneth, A Rosen Proceedings of the 46th annual ACM symposium on Symposium on theory of computing, 2014	141*	2014
On strong simulation and composable point obfuscation N Bitansky, R Canetti Journal of cryptology 27 (2), 317-357, 2014	116*	2014
Succinct randomized encodings and their applications N Bitansky, S Garg, H Lin, R Pass, S Telang Proceedings of the 47th annual ACM symposium on Symposium on theory of computing, 2015	112	2015
The hunting of the SNARK N Bitansky, R Canetti, A Chiesa, S Goldwasser, H Lin, A Rubinstein, ... Journal of Cryptology 30 (4), 989-1066, 2017	98	2017
ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation N Bitansky, O Paneth Theory of Cryptography Conference, 401-427, 2015	95	2015
On the cryptographic hardness of finding a nash equilibrium N Bitansky, O Paneth, A Rosen Cryptology ePrint Archive, Report 2014/1029, 2 014. http://eprint. iacr. org, 2015	91	2015
Time-lock puzzles from randomized encodings N Bitansky, S Goldwasser, A Jain, O Paneth, V Vaikuntanathan, B Waters Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016	90	2016
Leakage-tolerant interactive protocols N Bitansky, R Canetti, S Halevi Theory of Cryptography Conference, 266-284, 2012	67	2012
On non-black-box simulation and the impossibility of approximate obfuscation N Bitansky, O Paneth SIAM Journal on Computing 44 (5), 1325-1383, 2015	65*	2015
Perfect structure on the edge of chaos N Bitansky, O Paneth, D Wichs Theory of Cryptography Conference, 474-502, 2016	61	2016
The impossibility of obfuscation with auxiliary input or a universal simulator N Bitansky, R Canetti, H Cohn, S Goldwasser, YT Kalai, O Paneth, ... Annual Cryptology Conference, 71-89, 2014	59*	2014
On virtual grey box obfuscation for general circuits N Bitansky, R Canetti, YT Kalai, O Paneth Algorithmica 79 (4), 1014-1051, 2017	58	2017
Program obfuscation with leaky hardware N Bitansky, R Canetti, S Goldwasser, S Halevi, YT Kalai, GN Rothblum International Conference on the Theory and Application of Cryptology and …, 2011	57	2011
From cryptomania to obfustopia through secret-key functional encryption N Bitansky, R Nishimaki, A Passelegue, D Wichs Journal of Cryptology 33 (2), 357-405, 2020	52	2020
Why “fiat-shamir for proofs” lacks a proof N Bitansky, D Dachman-Soled, S Garg, A Jain, YT Kalai, A López-Alt, ... Theory of cryptography conference, 182-201, 2013	50	2013
Point Obfuscation and 3-round Zero-Knowledge N Bitansky, O Paneth Theory of Cryptography: 9th Theory of Cryptography Conference, Tcc 2012 …, 2012	50	2012

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Ladda upp PDF

Följ den här författaren

Citeras av

Medförfattare