| Succinct non-interactive arguments via linear interactive proofs N Bitansky, A Chiesa, Y Ishai, O Paneth, R Ostrovsky Theory of Cryptography: 10th Theory of Cryptography Conference, TCC 2013 …, 2013 | 357 | 2013 |
| Protecting obfuscation against algebraic attacks B Barak, S Garg, YT Kalai, O Paneth, A Sahai Advances in Cryptology–EUROCRYPT 2014: 33rd Annual International Conference …, 2014 | 285 | 2014 |
| 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 | 160 | 2014 |
| 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 | 146 | 2016 |
| 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 | 128 | 2015 |
| Reusable fuzzy extractors for low-entropy distributions R Canetti, B Fuller, O Paneth, L Reyzin, A Smith Journal of Cryptology 34, 1-33, 2021 | 125 | 2021 |
| ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation N Bitansky, O Paneth Theory of Cryptography: 12th Theory of Cryptography Conference, TCC 2015 …, 2015 | 125 | 2015 |
| On the achievability of simulation-based security for functional encryption A De Caro, V Iovino, A Jain, A O’Neill, O Paneth, G Persiano Advances in Cryptology–CRYPTO 2013: 33rd Annual Cryptology Conference, Santa …, 2013 | 111 | 2013 |
| Perfect Structure on the Edge of Chaos: Trapdoor Permutations from Indistinguishability Obfuscation N Bitansky, O Paneth, D Wichs Theory of Cryptography: 13th International Conference, TCC 2016-A, Tel Aviv …, 2015 | 74 | 2015 |
| Obfuscation for evasive functions B Barak, N Bitansky, R Canetti, YT Kalai, O Paneth, A Sahai Theory of Cryptography: 11th Theory of Cryptography Conference, TCC 2014 …, 2014 | 71 | 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 | 70 | 2018 |
| 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 | 68 | 2013 |
| Verifiable set operations over outsourced databases R Canetti, O Paneth, D Papadopoulos, N Triandopoulos Public-Key Cryptography–PKC 2014: 17th International Conference on Practice …, 2014 | 67 | 2014 |
| On virtual grey box obfuscation for general circuits N Bitansky, R Canetti, YT Kalai, O Paneth Algorithmica 79 (4), 1014-1051, 2017 | 66 | 2017 |
| 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 | 57 | 2014 |
| Point obfuscation and 3-round zero-knowledge N Bitansky, O Paneth Theory of Cryptography: 9th Theory of Cryptography Conference, TCC 2012 …, 2012 | 55 | 2012 |
| How to delegate computations publicly YT Kalai, O Paneth, L Yang Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 52 | 2019 |
| Delegating RAM computations Y Kalai, O Paneth Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016 | 52 | 2016 |
| From the impossibility of obfuscation to a new non-black-box simulation technique N Bitansky, O Paneth 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 223-232, 2012 | 44 | 2012 |
| On obfuscation with random oracles R Canetti, YT Kalai, O Paneth Cryptology ePrint Archive, 2015 | 37 | 2015 |
