Succinct non-interactive arguments via linear interactive proofs N Bitansky, A Chiesa, Y Ishai, O Paneth, R Ostrovsky Theory of Cryptography Conference, 315-333, 2013 | 289 | 2013 |

Protecting obfuscation against algebraic attacks B Barak, S Garg, YT Kalai, O Paneth, A Sahai Annual International Conference on the Theory and Applications of …, 2014 | 261 | 2014 |

On the existence of extractable one-way functions N Bitansky, R Canetti, O Paneth, A Rosen SIAM Journal on Computing 45 (5), 1910-1952, 2016 | 138 | 2016 |

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 | 119 | 2016 |

ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation N Bitansky, O Paneth Theory of Cryptography Conference, 401-427, 2015 | 111 | 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 | 103 | 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 Annual Cryptology Conference, 519-535, 2013 | 97 | 2013 |

Reusable fuzzy extractors for low-entropy distributions R Canetti, B Fuller, O Paneth, L Reyzin, A Smith Annual International Conference on the Theory and Applications of …, 2016 | 95 | 2016 |

Perfect structure on the edge of chaos N Bitansky, O Paneth, D Wichs Theory of Cryptography Conference, 474-502, 2016 | 68 | 2016 |

Verifiable set operations over outsourced databases R Canetti, O Paneth, D Papadopoulos, N Triandopoulos International Workshop on Public Key Cryptography, 113-130, 2014 | 63 | 2014 |

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 | 63 | 2013 |

On virtual grey box obfuscation for general circuits N Bitansky, R Canetti, YT Kalai, O Paneth Algorithmica 79 (4), 1014-1051, 2017 | 61 | 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 | 55 | 2014 |

Obfuscation for evasive functions B Barak, N Bitansky, R Canetti, YT Kalai, O Paneth, A Sahai Theory of Cryptography Conference, 26-51, 2014 | 52 | 2014 |

Point obfuscation and 3-round zero-knowledge N Bitansky, O Paneth Theory of Cryptography Conference, 190-208, 2012 | 52 | 2012 |

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 | 48 | 2018 |

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 | 42 | 2012 |

Delegating RAM computations Y Kalai, O Paneth Theory of Cryptography Conference, 91-118, 2016 | 41 | 2016 |

On obfuscation with random oracles R Canetti, YT Kalai, O Paneth Theory of Cryptography Conference, 456-467, 2015 | 31 | 2015 |

Public-coin concurrent zero-knowledge in the global hash model R Canetti, H Lin, O Paneth Theory of Cryptography Conference, 80-99, 2013 | 29 | 2013 |