Nir Bitansky

Navedeno

	Vse	Od leta 2020
Navedbe	4623	2406
indeks h	31	22
indeks i10	45	40

500

250

125

375

20112012201320142015201620172018201920202021202220232024202517 47 148 198 258 351 330 399 406 446 421 484 477 481 95

Javni dostop

Prikaži vse

35 člankov

1 članek

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Omer PanethMITPreverjeni e-poštni naslov na mit.edu
Ran CanettiProfessor of Computer Science, Boston UniversityPreverjeni e-poštni naslov na bu.edu
Alessandro ChiesaEPFLPreverjeni e-poštni naslov na epfl.ch
Vinod VaikuntanathanProfessor of Computer Science, Massachusetts Institute of TechnologyPreverjeni e-poštni naslov na csail.mit.edu
Yael Tauman KalaiMicrosoft Research, MITPreverjeni e-poštni naslov na microsoft.com
Huijia (Rachel) LinAssociate Professor at the University of WashingtonPreverjeni e-poštni naslov na cs.washington.edu
Eran TromerBoston UniversityPreverjeni e-poštni naslov na bu.edu
Alon RosenBocconi UniversityPreverjeni e-poštni naslov na unibocconi.it
Shafi Goldwasserprofessor of computer science at UC BerkeleyPreverjeni e-poštni naslov na csail.mit.edu
Yuval IshaiTechnionPreverjeni e-poštni naslov na cs.technion.ac.il
Abhishek JainAssociate Professor, Johns Hopkins UniversityPreverjeni e-poštni naslov na cs.jhu.edu
Sanjam GargUniversity of California, BerkeleyPreverjeni e-poštni naslov na berkeley.edu
Rafail OstrovskyNorman E. Friedman Chair in Knowledge Sciences, Distinguished Prof. of CS & MATHPreverjeni e-poštni naslov na cs.ucla.edu
Daniel WichsNortheastern University, ProfessorPreverjeni e-poštni naslov na ccs.neu.edu
Sidharth TelangCornell UniversityPreverjeni e-poštni naslov na cs.cornell.edu
Rafael PassCornell Tech, Jaobs Technion-Cornell Institute, Technion, Tel-Aviv UniversityPreverjeni e-poštni naslov na cs.cornell.edu
Shai HaleviSenior Principal Applied Scientist, AWS CryptographyPreverjeni e-poštni naslov na alum.mit.edu
Dana Dachman-SoledAssociate Professor, Department of Electrical and Computer Engineering, University of MarylandPreverjeni e-poštni naslov na umd.edu
Akshay DegwekarMITPreverjeni e-poštni naslov na mit.edu
Amit SahaiSymantec Chair Professor of Computer Science; Professor of Mathematics (by courtesy), UCLAPreverjeni e-poštni naslov na cs.ucla.edu

Spremljaj

Nir Bitansky

New York University and Tel Aviv University

Preverjeni e-poštni naslov na nyu.edu - Domača stran

Theoretical Computer Science - Cryptography


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
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	699	2012
Succinct non-interactive arguments via linear interactive proofs N Bitansky, A Chiesa, Y Ishai, R Ostrovsky, O Paneth Journal of Cryptology 35 (3), 15, 2022	455	2022
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	435	2013
Indistinguishability obfuscation from functional encryption N Bitansky, V Vaikuntanathan Journal of the ACM (JACM) 65 (6), 1-37, 2018	308	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	203	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	191	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	184	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	158	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	144	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	140	2015
On strong simulation and composable point obfuscation N Bitansky, R Canetti Journal of cryptology 27 (2), 317-357, 2014	136	2014
Obfuscation for evasive functions B Barak, N Bitansky, R Canetti, YT Kalai, O Paneth, A Sahai Theory of Cryptography Conference, 26-51, 2014	90	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	87	2015
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	86	2018
Leakage-tolerant interactive protocols N Bitansky, R Canetti, S Halevi Theory of Cryptography Conference, 266-284, 2012	84	2012
On virtual grey box obfuscation for general circuits N Bitansky, R Canetti, YT Kalai, O Paneth Algorithmica 79 (4), 1014-1051, 2017	77	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	77	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	76	2012
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	71	2013
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	70	2020

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji