Sparse extractor families for all the entropy. - Andrej Bogdanov; Siyao Guo 001 (ITCS, 2013)

Candidate weak pseudorandom functions in AC0 ○ MOD2. - Adi Akavia; Andrej Bogdanov; Siyao Guo 001; Akshay Kamath; Alon Rosen (ITCS, 2014)

Rational arguments: single round delegation with sublinear verification. - Siyao Guo 001; Pavel Hubácek; Alon Rosen; Margarita Vald (ITCS, 2014)

Negation-Limited Formulas. - Siyao Guo 001; Ilan Komargodski (APPROX-RANDOM, 2015)

The Power of Negations in Cryptography. - Siyao Guo 001; Tal Malkin; Igor C. Oliveira 001; Alon Rosen (TCC (1), 2015)

Threshold Secret Sharing Requires a Linear Size Alphabet. - Andrej Bogdanov; Siyao Guo 001; Ilan Komargodski (TCC (B2), 2016)

On the Hardness of Learning with Rounding over Small Modulus. - Andrej Bogdanov; Siyao Guo 001; Daniel Masny; Silas Richelson; Alon Rosen (TCC (A1), 2016)

Rational Sumchecks. - Siyao Guo 001; Pavel Hubácek; Alon Rosen; Margarita Vald (TCC (A2), 2016)

Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited. - Yevgeniy Dodis; Siyao Guo 001; Jonathan Katz (EUROCRYPT (2), 2017)

Testing k-Monotonicity. - Clément L. Canonne; Elena Grigorescu; Siyao Guo 001; Akash Kumar 003; Karl Wimmer (ITCS, 2017)

Complete Classification of Generalized Santha-Vazirani Sources. - Salman Beigi; Andrej Bogdanov; Omid Etesami; Siyao Guo 001 (CoRR, 2017)

Complete Classi fication of Generalized Santha-Vazirani Sources. - Salman Beigi; Andrej Bogdanov; Omid Etesami; Siyao Guo 001 (Electron. Colloquium Comput. Complex., 2017)

Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources. - Salman Beigi; Andrej Bogdanov; Omid Etesami; Siyao Guo 001 (APPROX-RANDOM, 2018)

Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models. - Sandro Coretti; Yevgeniy Dodis; Siyao Guo 001 (CRYPTO (1), 2018)

Random Oracles and Non-uniformity. - Sandro Coretti; Yevgeniy Dodis; Siyao Guo 001; John P. Steinberger (EUROCRYPT (1), 2018)

Non-Malleable Codes for Small-Depth Circuits. - Marshall Ball; Dana Dachman-Soled; Siyao Guo 001; Tal Malkin; Li-Yang Tan (FOCS, 2018)

Non-malleable Codes for Decision Trees. - Marshall Ball; Siyao Guo 001; Daniel Wichs (CRYPTO (1), 2019)

3SUM with Preprocessing: Algorithms, Lower Bounds and Cryptographic Applications. - Alexander Golovnev; Siyao Guo 001; Thibaut Horel; Sunoo Park; Vinod Vaikuntanathan (CoRR, 2019)

Testing k-Monotonicity: The Rise and Fall of Boolean Functions. - Clément L. Canonne; Elena Grigorescu; Siyao Guo 001; Akash Kumar 003; Karl Wimmer (Theory Comput., 2019)

Extractor Lower Bounds, Revisited. - Divesh Aggarwal; Siyao Guo 001; Maciej Obremski; João Ribeiro 002; Noah Stephens-Davidowitz (APPROX-RANDOM, 2020)

Tight Quantum Time-Space Tradeoffs for Function Inversion. - Kai-Min Chung; Siyao Guo 001; Qipeng Liu 001; Luowen Qian (FOCS, 2020)

Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange. - Siyao Guo 001; Pritish Kamath; Alon Rosen; Katerina Sotiraki (Public Key Cryptography (1), 2020)

Data structures meet cryptography: 3SUM with preprocessing. - Alexander Golovnev; Siyao Guo 001; Thibaut Horel; Sunoo Park; Vinod Vaikuntanathan (STOC, 2020)

Online Linear Extractors for Independent Sources. - Yevgeniy Dodis; Siyao Guo 001; Noah Stephens-Davidowitz; Zhiye Xie (ITC, 2021)

No Time to Hash: On Super-Efficient Entropy Accumulation. - Yevgeniy Dodis; Siyao Guo 001; Noah Stephens-Davidowitz; Zhiye Xie (CRYPTO (4), 2021)

Concentration bounds for almost k-wise independence with applications to non-uniform security. - Nick Gravin; Siyao Guo 001; Tsz Chiu Kwok; Pinyan Lu (SODA, 2021)

Unifying Presampling via Concentration Bounds. - Siyao Guo 001; Qian Li 012; Qipeng Liu 001; Jiapeng Zhang (TCC (1), 2021)

On the (im)possibility of branch-and-bound search-to-decision reductions for approximate optimization. - Alexander Golovnev; Siyao Guo 001; Spencer Peters; Noah Stephens-Davidowitz (Electron. Colloquium Comput. Complex., 2021)

No Time to Hash: On Superefficient Entropy Accumulation. - Yevgeniy Dodis; Siyao Guo 001; Noah Stephens-Davidowitz; Zhiye Xie (IACR Cryptol. ePrint Arch., 2021)

Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions. - Akshima; Siyao Guo 001; Qipeng Liu 001 (CRYPTO (3), 2022)

The (Im)possibility of Simple Search-To-Decision Reductions for Approximation Problems. - Alexander Golovnev; Siyao Guo 001; Spencer Peters; Noah Stephens-Davidowitz (APPROX/RANDOM, 2023)

Revisiting Time-Space Tradeoffs for Function Inversion. - Alexander Golovnev; Siyao Guo 001; Spencer Peters; Noah Stephens-Davidowitz (CRYPTO (2), 2023)

On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions. - Akshima; Xiaoqi Duan; Siyao Guo 001; Qipeng Liu 001 (TCC (3), 2023)

Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem. - Akshima; Tyler Besselman; Siyao Guo 001; Zhiye Xie; Yuping Ye (STOC, 2024)

New Distinguishers for Negation-Limited Weak Pseudorandom Functions. - Zhihuai Chen; Siyao Guo 001; Qian Li 012; Chengyu Lin 001; Xiaoming Sun 001 (Theory Comput., 2024)

Direct Sums for Parity Decision Trees. - Tyler Besselman; Mika Göös; Siyao Guo 001; Gilbert Maystre; Weiqiang Yuan 002 (CCC, 2025)

Tight Quantum Time-Space Tradeoffs for Permutation Inversion. - Akshima; Tyler Besselman; Kai-Min Chung; Siyao Guo 001; Tzu-Yi Yang (EUROCRYPT (1), 2026)