( en | de | ru )

 

Disambiguation of "Bitansky, Nir"

Author of the publication

copydeleteadd this publication to your clipboard
PPAD is as Hard as LWE and Iterated Squaring.

, , , , , , and . TCC (2), volume 13748 of Lecture Notes in Computer Science, page 593-622. Springer, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nir Kahn

Nir Oren

Nir Yogev

Nir Levy

Alois Nirschl

 

Other publications of authors with the same name

Batch Proofs are Statistically Hiding., , , , and . IACR Cryptol. ePrint Arch., (2023)Distributional Collision Resistance Beyond One-Way Functions., , , and . CoRR, (2021)On Round Optimal Statistical Zero Knowledge Arguments., and . CRYPTO (3), volume 11694 of Lecture Notes in Computer Science, page 128-156. Springer, (2019)Distributional Collision Resistance Beyond One-Way Functions., , , and . EUROCRYPT (3), volume 11478 of Lecture Notes in Computer Science, page 667-695. Springer, (2019)Characterizing Deterministic-Prover Zero Knowledge., and . TCC (1), volume 12550 of Lecture Notes in Computer Science, page 535-566. Springer, (2020)Indistinguishability Obfuscation from Functional Encryption., and . J. ACM, 65 (6): 39:1-39:37 (2018)Weak Zero-Knowledge Beyond the Black-Box Barrier., and . IACR Cryptology ePrint Archive, (2018)On the impossibility of approximate obfuscation and applications to resettable cryptography., and . STOC, page 241-250. ACM, (2013)On the Cryptographic Hardness of Finding a Nash Equilibrium., , and . FOCS, page 1480-1498. IEEE Computer Society, (2015)From the Impossibility of Obfuscation to a New Non-Black-Box Simulation Technique., and . FOCS, page 223-232. IEEE Computer Society, (2012)