( en | de | ru )

 

Disambiguation of "Pass, Rafael"

Author of the publication

copydeleteadd this publication to your clipboard
Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions?

, , and . EUROCRYPT (3), volume 12107 of Lecture Notes in Computer Science, page 599-619. Springer, (2020)

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.

Rafael Pass

Albert Pass

Albert Pass

Bruno Pass

Rita Paß

 

Other publications of authors with the same name

Decision Theory with Resource-Bounded Agents., , and . Top. Cogn. Sci., 6 (2): 245-257 (2014)Sequential Equilibrium in Games of Imperfect Recall., and . ACM Trans. Economics and Comput., 9 (4): 22:1-22:26 (2021)Unprovability of Leakage-Resilient Cryptography Beyond the Information-Theoretic Limit.. IACR Cryptol. ePrint Arch., (2021)On One-way Functions and the Worst-case Hardness of Time-Bounded Kolmogorov Complexity., and . IACR Cryptol. ePrint Arch., (2023)A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland., and . IACR Cryptology ePrint Archive, (2019)A tutorial on concurrent zero-knowledge.. Providing Sound Foundations for Cryptography, ACM, (2019)Parallelizable Delegation from LWE., , and . TCC (2), volume 13748 of Lecture Notes in Computer Science, page 623-652. Springer, (2022)Paradoxes in Fair Computer-Aided Decision Making., and . AIES, page 85-90. ACM, (2019)Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexity., and . STOC, page 722-735. ACM, (2021)Non-malleable Codes for Bounded Parallel-Time Tampering., , and . CRYPTO (3), volume 12827 of Lecture Notes in Computer Science, page 535-565. Springer, (2021)