Nir Bitansky

Citée par

	Toutes	Depuis 2019
Citations	4363	2571
indice h	30	24
indice i10	44	42

500

250

125

375

201220132014201520162017201820192020202120222023202445 143 193 261 344 330 397 398 441 413 486 471 361

Accès public

Tout afficher

34 articles

1 article

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Omer PanethMITAdresse e-mail validée de mit.edu
Ran CanettiProfessor of Computer Science, Boston UniversityAdresse e-mail validée de bu.edu
Alessandro ChiesaEPFLAdresse e-mail validée de epfl.ch
Vinod VaikuntanathanProfessor of Computer Science, Massachusetts Institute of TechnologyAdresse e-mail validée de csail.mit.edu
Yael Tauman KalaiMicrosoft Research, MITAdresse e-mail validée de microsoft.com
Huijia (Rachel) LinAssociate Professor at the University of WashingtonAdresse e-mail validée de cs.washington.edu
Eran TromerBoston UniversityAdresse e-mail validée de bu.edu
Alon RosenBocconi UniversityAdresse e-mail validée de unibocconi.it
Shafi Goldwasserprofessor of computer science at UC BerkeleyAdresse e-mail validée de csail.mit.edu
Yuval IshaiTechnionAdresse e-mail validée de cs.technion.ac.il
Rafail OstrovskyNorman E. Friedman Chair in Knowledge Sciences, Distinguished Prof. of CS & MATHAdresse e-mail validée de cs.ucla.edu
Abhishek JainAssociate Professor, Johns Hopkins UniversityAdresse e-mail validée de cs.jhu.edu
Sanjam GargUniversity of California, BerkeleyAdresse e-mail validée de berkeley.edu
Daniel WichsNortheastern University, ProfessorAdresse e-mail validée de ccs.neu.edu
Sidharth TelangCornell UniversityAdresse e-mail validée de cs.cornell.edu
Rafael PassTel-Aviv University, Cornell TechAdresse e-mail validée de cs.cornell.edu
Shai HaleviSenior Principal Applied Scientist, AWS CryptographyAdresse e-mail validée de alum.mit.edu
Dana Dachman-SoledAssociate Professor, Department of Electrical and Computer Engineering, University of MarylandAdresse e-mail validée de umd.edu
Akshay DegwekarMITAdresse e-mail validée de mit.edu
Amit SahaiSymantec Chair Professor of Computer Science; Professor of Mathematics (by courtesy), UCLAAdresse e-mail validée de cs.ucla.edu

Suivre

Nir Bitansky

New York University

Adresse e-mail validée de nyu.edu - Page d'accueil

Theoretical Computer Science - Cryptography


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
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	645	2012
Succinct non-interactive arguments via linear interactive proofs N Bitansky, A Chiesa, Y Ishai, R Ostrovsky, O Paneth Theory of Cryptography: 10th Theory of Cryptography Conference, TCC 2013 …, 2013	421	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	394	2013
Indistinguishability obfuscation from functional encryption N Bitansky, V Vaikuntanathan Journal of the ACM (JACM) 65 (6), 1-37, 2018	282	2018
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	193	2017
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	185	2016
On the existence of extractable one-way functions N Bitansky, R Canetti, O Paneth, A Rosen Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014	178	2014
Succinct randomized encodings and their applications N Bitansky, S Garg, H Lin, R Pass, S Telang Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015	150	2015
ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation N Bitansky, O Paneth Theory of Cryptography: 12th Theory of Cryptography Conference, TCC 2015 …, 2015	140	2015
On the cryptographic hardness of finding a Nash equilibrium N Bitansky, O Paneth, A Rosen 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1480-1498, 2015	139	2015
On strong simulation and composable point obfuscation N Bitansky, R Canetti Journal of cryptology 27 (2), 317-357, 2014	135	2014
Multi-collision resistance: a paradigm for keyless hash functions N Bitansky, YT Kalai, O Paneth Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018	85	2018
Obfuscation for evasive functions B Barak, N Bitansky, R Canetti, YT Kalai, O Paneth, A Sahai Theory of Cryptography Conference, 26-51, 2014	84	2014
Perfect Structure on the Edge of Chaos: Trapdoor Permutations from Indistinguishability Obfuscation N Bitansky, O Paneth, D Wichs Theory of Cryptography Conference, 474-502, 2015	80	2015
Leakage-tolerant interactive protocols N Bitansky, R Canetti, S Halevi Theory of Cryptography Conference, 266-284, 2012	78	2012
On virtual grey box obfuscation for general circuits N Bitansky, R Canetti, YT Kalai, O Paneth Algorithmica 79 (4), 1014-1051, 2017	74	2017
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: 10th Theory of Cryptography Conference, TCC 2013 …, 2013	74	2013
Succinct arguments from multi-prover interactive proofs and their efficiency benefits N Bitansky, A Chiesa Advances in Cryptology–CRYPTO 2012: 32nd Annual Cryptology Conference, Santa …, 2012	73	2012
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	72	2020
On the impossibility of approximate obfuscation and applications to resettable cryptography N Bitansky, O Paneth Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013	70	2013

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs