( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Rational arguments: single round delegation with sublinear verification.

, , , и . ITCS, стр. 523-540. ACM, (2014)

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.

Jiong Guo

Guo Cheng

Xinrong Guo

Xin Guo

Baoliang Guo

 

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

Rational Sumchecks., , , и . TCC (A2), том 9563 из Lecture Notes in Computer Science, стр. 319-351. Springer, (2016)Negation-Limited Formulas., и . APPROX-RANDOM, том 40 из LIPIcs, стр. 850-866. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources., , , и . APPROX-RANDOM, том 116 из LIPIcs, стр. 30:1-30:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Extractor Lower Bounds, Revisited., , , , и . APPROX-RANDOM, том 176 из LIPIcs, стр. 1:1-1:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Rational arguments: single round delegation with sublinear verification., , , и . ITCS, стр. 523-540. ACM, (2014)Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange., , , и . J. Cryptol., 35 (1): 1 (2022)Candidate weak pseudorandom functions in AC0 ○ MOD2., , , , и . ITCS, стр. 251-260. ACM, (2014)On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions., , , и . TCC (3), том 14371 из Lecture Notes in Computer Science, стр. 237-270. Springer, (2023)Data structures meet cryptography: 3SUM with preprocessing., , , , и . STOC, стр. 294-307. ACM, (2020)Online Linear Extractors for Independent Sources., , , и . ITC, том 199 из LIPIcs, стр. 14:1-14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)