Nir, Omer
10  Ergebnisse:
Personensuche X
?
1

Non-interactive Universal Arguments:

, In: Advances in Cryptology – CRYPTO 2023; Lecture Notes in Computer Science,
Bitansky, Nir ; Paneth, Omer ; Shamir, Dana. - p. 132-158 , 2023
 
?
2

XAI for User Classifications:

, In: 2023 International Conference on Advanced Enterprise Information System (AEIS),
Koren, Oded ; Koren, Michal ; Zilberman, Omer. - p. 121-130 , 2023
 
?
3

PPAD is as Hard as LWE and Iterated Squaring:

, In: Theory of Cryptography; Lecture Notes in Computer Science,
 
?
4

Weakly Extractable One-Way Functions:

, In: Theory of Cryptography; Lecture Notes in Computer Science,
Bitansky, Nir ; Eizenstadt, Noa ; Paneth, Omer - p. 596-626 , 2020
 
?
5

On Round Optimal Statistical Zero Knowledge Arguments:

, In: Advances in Cryptology – CRYPTO 2019; Lecture Notes in Computer Science,
Bitansky, Nir ; Paneth, Omer - p. 128-156 , 2019
 
?
6

Weak zero-knowledge beyond the black-box barrier:

, In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing,
Bitansky, Nir ; Khurana, Dakshita ; Paneth, Omer - p. 1091-1102 , 2019
 
?
7

Multi-collision resistance: a paradigm for keyless hash fun..:

, In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing,
 
?
8

Time-Lock Puzzles from Randomized Encodings:

, In: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science,
Bitansky, Nir ; Goldwasser, Shafi ; Jain, Abhishek... - p. 345-356 , 2016
 
?
9

On the existence of extractable one-way functions:

, In: Proceedings of the forty-sixth annual ACM symposium on Theory of computing,
Bitansky, Nir ; Canetti, Ran ; Paneth, Omer. - p. 505-514 , 2014
 
?
10

On the impossibility of approximate obfuscation and applica..:

, In: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing,
Bitansky, Nir ; Paneth, Omer - p. 241-250 , 2013
 
1-10