Author of the publication

Proofs of Work From Worst-Case Assumptions.

, , , and . CRYPTO (1), volume 10991 of Lecture Notes in Computer Science, page 789-819. Springer, (2018)

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.

 

Other publications of authors with the same name

Survey: Non-malleable code in the split-state model., , and . IACR Cryptol. ePrint Arch., (2022)On Resilience to Computable Tampering.. Columbia University, USA, (2021)Towards Topology-Hiding Computation from Oblivious Transfer., , , and . TCC (1), volume 14369 of Lecture Notes in Computer Science, page 349-379. Springer, (2023)Topology-Hiding Communication from Minimal Assumptions., , , , , , and . TCC (2), volume 12551 of Lecture Notes in Computer Science, page 473-501. Springer, (2020)A Note on the Complexity of Private Simultaneous Messages with Many Parties., and . ITC, volume 230 of LIPIcs, page 7:1-7:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Linear Threshold Secret-Sharing with Binary Reconstruction., , and . ITC, volume 199 of LIPIcs, page 12:1-12:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Randomness Extraction from Somewhat Dependent Sources., , and . Electron. Colloquium Comput. Complex., (2019)Non-Malleable Codes for Decision Trees., , and . IACR Cryptol. ePrint Arch., (2019)New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions and Interaction., , and . IACR Cryptol. ePrint Arch., (2019)Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement., , , and . FOCS, page 458-483. IEEE, (2023)