( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
PPAD is as Hard as LWE and Iterated Squaring.

, , , , , , и . TCC (2), том 13748 из Lecture Notes in Computer Science, стр. 593-622. Springer, (2022)

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.

Emin Sinan Ömeroglu

Lutful Mannan Osama Omer

Abrehet Mohammed Omer

Lutful Mannan Osama Omer

Osman Hussein Omer

 

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

Publicly Verifiable Non-Interactive Arguments for Delegating Computation, и . Cryptology ePrint Archive, Report 2014/981, (2014)http://eprint.iacr.org/.From Point Obfuscation To 3-round Zero-Knowledge., и . IACR Cryptology ePrint Archive, (2011)The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator., , , , , , и . CRYPTO (2), том 8617 из Lecture Notes in Computer Science, стр. 71-89. Springer, (2014)Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation., , и . TCC (A1), том 9562 из Lecture Notes in Computer Science, стр. 474-502. Springer, (2016)Weak zero-knowledge beyond the black-box barrier., , и . STOC, стр. 1091-1102. ACM, (2019)Incrementally Verifiable Computation via Rate-1 Batch Arguments., и . FOCS, стр. 1045-1056. IEEE, (2022)A system capable of verifiably and privately screening global DNA synthesis., , , , , , , , , и 20 other автор(ы). CoRR, (2024)On the Cryptographic Hardness of Finding a Nash Equilibrium., , и . IACR Cryptology ePrint Archive, (2014)On Removing Graded Encodings from Functional Encryption., , и . IACR Cryptology ePrint Archive, (2016)Point Obfuscation and 3-Round Zero-Knowledge., и . TCC, том 7194 из Lecture Notes in Computer Science, стр. 190-208. Springer, (2012)