( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Hierarchy Theorem for Interactive Proofs of Proximity.

, и . ITCS, том 67 из LIPIcs, стр. 39:1-39:43. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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.

Shlomo Ron

Ron Achterrath

Ron Dietrich

Ron Sebastian

Ron Bershan

 

Другие публикации лиц с тем же именем

Arguments of Proximity - Extended Abstract., и . CRYPTO (2), том 9216 из Lecture Notes in Computer Science, стр. 422-442. Springer, (2015)From Obfuscation to the Security of Fiat-Shamir for Proofs., , и . CRYPTO (2), том 10402 из Lecture Notes in Computer Science, стр. 224-251. Springer, (2017)Statistical Difference Beyond the Polarizing Regime., , , и . TCC (2), том 11892 из Lecture Notes in Computer Science, стр. 311-332. Springer, (2019)A Hierarchy Theorem for Interactive Proofs of Proximity., и . ITCS, том 67 из LIPIcs, стр. 39:1-39:43. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Relaxed Locally Correctable Codes., , и . ITCS, том 94 из LIPIcs, стр. 27:1-27:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)PPAD is as Hard as LWE and Iterated Squaring., , , , , , и . IACR Cryptol. ePrint Arch., (2022)Fiat-Shamir From Simpler Assumptions., , , , , и . IACR Cryptol. ePrint Arch., (2018)Fiat-Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)., , и . STOC, стр. 750-760. ACM, (2021)Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract)., , , , , , и . CRYPTO (2), том 8043 из Lecture Notes in Computer Science, стр. 185-202. Springer, (2013)From Laconic Zero-Knowledge to Public-Key Cryptography - Extended Abstract., , , и . CRYPTO (3), том 10993 из Lecture Notes in Computer Science, стр. 674-697. Springer, (2018)