Author of the publication

PPAD is as Hard as LWE and Iterated Squaring.

, , , , , , and . TCC (2), volume 13748 of Lecture Notes in Computer Science, page 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. 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

Correlation Intractability and SNARGs from Sub-exponential DDH., , , , and . IACR Cryptol. ePrint Arch., (2022)Towards Efficiency-Preserving Round Compression in MPC - Do Fewer Rounds Mean More Computation?, , , and . ASIACRYPT (3), volume 12493 of Lecture Notes in Computer Science, page 181-212. Springer, (2020)Non-interactive Batch Arguments for NP from Standard Assumptions., , and . CRYPTO (4), volume 12828 of Lecture Notes in Computer Science, page 394-423. Springer, (2021)Two Round Information-Theoretic MPC with Malicious Security., , , and . IACR Cryptol. ePrint Arch., (2018)Characterizing Deterministic-Prover Zero Knowledge., and . TCC (1), volume 12550 of Lecture Notes in Computer Science, page 535-566. Springer, (2020)Fluid MPC: Secure Multiparty Computation with Dynamic Participants., , , , and . CRYPTO (2), volume 12826 of Lecture Notes in Computer Science, page 94-123. Springer, (2021)Correlation Intractability and SNARGs from Sub-exponential DDH., , , , and . CRYPTO (4), volume 14084 of Lecture Notes in Computer Science, page 635-668. Springer, (2023)PPAD is as Hard as LWE and Iterated Squaring., , , , , , and . TCC (2), volume 13748 of Lecture Notes in Computer Science, page 593-622. Springer, (2022)Oblivious Transfer from Trapdoor Permutations in Minimal Rounds., , , , and . TCC (2), volume 13043 of Lecture Notes in Computer Science, page 518-549. Springer, (2021)SNARGs for $P$ from LWE., , and . FOCS, page 68-79. IEEE, (2021)