( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the (In)security of Kilian-Based SNARGs.

, , , , и . TCC (2), том 11892 из Lecture Notes in Computer Science, стр. 522-551. 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.

Alessandro Fermi

Yuzhao Ma

Characterization of higher order modes in optical fibers. Uni Erlangen-Nürnberg, (2009)

Tsie Ma

Jingxiang Ma

Lan Ma

 

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

A one-query lower bound for unitary synthesis and breaking quantum cryptography., , и . IACR Cryptol. ePrint Arch., (2023)One-Way Functions Imply Secure Computation in a Quantum World., , , и . CRYPTO (1), том 12825 из Lecture Notes in Computer Science, стр. 467-496. Springer, (2021)The Fewest Clues Problem., , , , и . FUN, том 49 из LIPIcs, стр. 12:1-12:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Preventing Zeroizing Attacks on GGH15., , , и . IACR Cryptology ePrint Archive, (2018)You Should Be Scared of German Ghost., , , и . J. Inf. Process., 23 (3): 293-298 (2015)The fewest clues problem., , , , и . Theor. Comput. Sci., (2018)One-Way Functions Imply Secure Computation in a Quantum World., , , и . IACR Cryptol. ePrint Arch., (2020)Does Fiat-Shamir Require a Cryptographic Hash Function?, , , и . CRYPTO (4), том 12828 из Lecture Notes in Computer Science, стр. 334-363. Springer, (2021)On the Round Complexity of Secure Quantum Computation., , , и . CRYPTO (1), том 12825 из Lecture Notes in Computer Science, стр. 406-435. Springer, (2021)A One-Query Lower Bound for Unitary Synthesis and Breaking Quantum Cryptography., , и . STOC, стр. 979-990. ACM, (2024)