Javni dostop

Reusable Online-Efficient Commitments

N Bitansky, O Paneth, D Shamir

Annual International Cryptology Conference, 3-35, 2024

Zahteve: European Commission

Na voljo nekje: 35

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

Zahteve: US National Science Foundation, US Department of Defense, European Commission

[HTML] acm.org

Indistinguishability obfuscation from functional encryption

N Bitansky, V Vaikuntanathan

Journal of the ACM (JACM) 65 (6), 1-37, 2018

Zahteve: US National Science Foundation, US Department of Defense

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

Zahteve: European Commission

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

Zahteve: US National Science Foundation

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

Zahteve: European Commission

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

Zahteve: European Commission

On strong simulation and composable point obfuscation

N Bitansky, R Canetti

Journal of cryptology 27 (2), 317-357, 2014

Zahteve: European Commission

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

Zahteve: US National Science Foundation, US Department of Defense

On virtual grey box obfuscation for general circuits

N Bitansky, R Canetti, YT Kalai, O Paneth

Algorithmica 79 (4), 1014-1051, 2017

Zahteve: US National Science Foundation

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

Zahteve: US National Science Foundation, US Department of Defense

Verifiable random functions from non-interactive witness-indistinguishable proofs

N Bitansky

Journal of Cryptology 33 (2), 459-493, 2020

Zahteve: US National Science Foundation, US Department of Defense

[PDF] arxiv.org

The impossibility of obfuscation with auxiliary input or a universal simulator

N Bitansky, R Canetti, H Cohn, S Goldwasser, YT Kalai, O Paneth, ...

Advances in Cryptology–CRYPTO 2014: 34th Annual Cryptology Conference, Santa …, 2014

Zahteve: European Commission

[PDF] mit.edu

Structure vs. hardness through the obfuscation lens

N Bitansky, A Degwekar, V Vaikuntanathan

Annual International Cryptology Conference, 696-723, 2017

Zahteve: US National Science Foundation, US Department of Defense

[PDF] acm.org

Weak zero-knowledge beyond the black-box barrier

N Bitansky, D Khurana, O Paneth

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019

Zahteve: US National Science Foundation, US Department of Defense

A note on perfect correctness by derandomization

N Bitansky, V Vaikuntanathan

Journal of Cryptology 35 (3), 18, 2022

Zahteve: US National Science Foundation

[PDF] mit.edu

Indistinguishability obfuscation for RAM programs and succinct randomized encodings

N Bitansky, R Canetti, S Garg, J Holmgren, A Jain, H Lin, R Pass, ...

SIAM Journal on Computing 47 (3), 1123-1210, 2018

Zahteve: US National Science Foundation, US Department of Defense

3-message zero knowledge against human ignorance

N Bitansky, Z Brakerski, Y Kalai, O Paneth, V Vaikuntanathan

Theory of Cryptography Conference, 57-83, 2016

Zahteve: US National Science Foundation

Classical binding for quantum commitments

N Bitansky, Z Brakerski

Theory of Cryptography Conference, 273-298, 2021

Zahteve: European Commission