( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Proofs of Work From Worst-Case Assumptions.

, , , и . CRYPTO (1), том 10991 из Lecture Notes in Computer Science, стр. 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.

Michael Marshall

Jonathan Marshall

Ingrid Marshall

Lisa Marshall

Gerd Marshall

 

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

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