Nir Bitansky
Nir Bitansky
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
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
Succinct non-interactive arguments via linear interactive proofs
N Bitansky, A Chiesa, Y Ishai, R Ostrovsky, O Paneth
Theory of Cryptography, 315-333, 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
Indistinguishability obfuscation from functional encryption
N Bitansky, V Vaikuntanathan
Foundations of Computer Science (FOCS), 2015
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
On strong simulation and composable point obfuscation
N Bitansky, R Canetti
Journal of cryptology 27 (2), 317-357, 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
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
ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
N Bitansky, O Paneth
Theory of Cryptography Conference, 401-427, 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
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
Leakage-tolerant interactive protocols
N Bitansky, R Canetti, S Halevi
Theory of Cryptography Conference, 266-284, 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
Perfect structure on the edge of chaos
N Bitansky, O Paneth, D Wichs
Theory of Cryptography Conference, 474-502, 2016
On virtual grey box obfuscation for general circuits
N Bitansky, R Canetti, YT Kalai, O Paneth
Algorithmica 79 (4), 1014-1051, 2017
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
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
From cryptomania to obfustopia through secret-key functional encryption
N Bitansky, R Nishimaki, A Passelegue, D Wichs
Theory of Cryptography, 2016
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
Point Obfuscation and 3-round Zero-Knowledge
N Bitansky, O Paneth
Theory of Cryptography: 9th Theory of Cryptography Conference, Tcc 2012 …, 2012
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20