Folgen
Nir Bitansky
Nir Bitansky
New York University
Bestätigte E-Mail-Adresse bei nyu.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
6402012
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
4192013
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
3912013
Indistinguishability obfuscation from functional encryption
N Bitansky, V Vaikuntanathan
Journal of the ACM (JACM) 65 (6), 1-37, 2018
2802018
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
1922017
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
1842016
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
1782014
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
1502015
ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
N Bitansky, O Paneth
Theory of Cryptography: 12th Theory of Cryptography Conference, TCC 2015 …, 2015
1402015
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
1382015
On strong simulation and composable point obfuscation
N Bitansky, R Canetti
Journal of cryptology 27 (2), 317-357, 2014
1352014
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
852018
Obfuscation for evasive functions
B Barak, N Bitansky, R Canetti, YT Kalai, O Paneth, A Sahai
Theory of Cryptography Conference, 26-51, 2014
842014
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
802015
Leakage-tolerant interactive protocols
N Bitansky, R Canetti, S Halevi
Theory of Cryptography Conference, 266-284, 2012
782012
On virtual grey box obfuscation for general circuits
N Bitansky, R Canetti, YT Kalai, O Paneth
Algorithmica 79 (4), 1014-1051, 2017
742017
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
742013
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
732012
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
722020
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
702013
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20