( en | de | ru )

 

Disambiguation of "Ball, Marshall"

Author of the publication

copydeleteadd this publication to your clipboard
Is Information-Theoretic Topology-Hiding Computation Possible?

, , , , and . TCC (1), volume 11891 of Lecture Notes in Computer Science, page 502-530. Springer, (2019)

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.

Michael Marshall

Jonathan Marshall

Ingrid Marshall

Lisa Marshall

Gerd Marshall

 

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)Topology-Hiding Communication from Minimal Assumptions., , , , , , and . J. Cryptol., 36 (4): 39 (October 2023)Randomness Extraction from Somewhat Dependent Sources., , and . Electron. Colloquium Comput. Complex., (2019)Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement., , , and . FOCS, page 458-483. IEEE, (2023)Extracting Randomness from Samplable Distributions, Revisited., , , and . FOCS, page 1505-1514. IEEE, (2023)