Author of the publication

The Fewest Clues Problem.

, , , , and . FUN, volume 49 of LIPIcs, page 12:1-12:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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

One-Way Functions Imply Secure Computation in a Quantum World., , , and . CoRR, (2020)Does Fiat-Shamir Require a Cryptographic Hash Function?, , , and . CRYPTO (4), volume 12828 of Lecture Notes in Computer Science, page 334-363. Springer, (2021)On the Round Complexity of Secure Quantum Computation., , , and . CRYPTO (1), volume 12825 of Lecture Notes in Computer Science, page 406-435. Springer, (2021)A One-Query Lower Bound for Unitary Synthesis and Breaking Quantum Cryptography., , and . STOC, page 979-990. ACM, (2024)Quantum Security and Fiat-Shamir for Cryptographic Protocols. Princeton University, USA, (2021)One-Way Functions Imply Secure Computation in a Quantum World., , , and . CRYPTO (1), volume 12825 of Lecture Notes in Computer Science, page 467-496. Springer, (2021)The Fewest Clues Problem., , , , and . FUN, volume 49 of LIPIcs, page 12:1-12:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)A one-query lower bound for unitary synthesis and breaking quantum cryptography., , and . CoRR, (2023)Commitments to Quantum States., , , and . STOC, page 1579-1588. ACM, (2023)New Techniques for Obfuscating Conjunctions., , , and . EUROCRYPT (3), volume 11478 of Lecture Notes in Computer Science, page 636-666. Springer, (2019)