Sparse extractor families for all the entropy. - Andrej Bogdanov; Siyao Guo (Electron. Colloquium Comput. Complex., 2012)

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

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

The Power of Negations in Cryptography. - Igor Carboni Oliveira; Siyao Guo; Tal Malkin; Alon Rosen (Electron. Colloquium Comput. Complex., 2015)

On the Hardness of Learning with Rounding over Small Modulus. - Andrej Bogdanov; Siyao Guo; Daniel Masny; Silas Richelson; Alon Rosen (IACR Cryptol. ePrint Arch., 2015)

Rational Sumchecks. - Siyao Guo; Pavel Hubácek; Alon Rosen; Margarita Vald (IACR Cryptol. ePrint Arch., 2015)

Threshold Secret Sharing Requires a Linear Size Alphabet. - Andrej Bogdanov; Siyao Guo; Ilan Komargodski (Electron. Colloquium Comput. Complex., 2016)

Testing k-Monotonicity. - Clément L. Canonne; Elena Grigorescu; Siyao Guo; Akash Kumar 003; Karl Wimmer (Electron. Colloquium Comput. Complex., 2016)

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

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

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

Random Oracles and Non-Uniformity. - Sandro Coretti; Yevgeniy Dodis; Siyao Guo; John P. Steinberger (IACR Cryptol. ePrint Arch., 2017)

Negation-limited formulas. - Siyao Guo; Ilan Komargodski (Theor. Comput. Sci., 2017)

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

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

Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models. - Sandro Coretti; Yevgeniy Dodis; Siyao Guo (IACR Cryptol. ePrint Arch., 2018)

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

Extractor Lower Bounds, Revisited. - Divesh Aggarwal; Siyao Guo; Maciej Obremski; João Ribeiro 002; Noah Stephens-Davidowitz (Electron. Colloquium Comput. Complex., 2019)

Non-Malleable Codes for Decision Trees. - Marshall Ball; Siyao Guo; Daniel Wichs (IACR Cryptol. ePrint Arch., 2019)

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

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

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

Unifying Presampling via Concentration Bounds. - Siyao Guo; Qian Li 012; Qipeng Liu 001; Jiapeng Zhang (IACR Cryptol. ePrint Arch., 2020)

No Time to Hash: On Super-Efficient Entropy Accumulation. - Yevgeniy Dodis; Siyao Guo; 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; Tsz Chiu Kwok; Pinyan Lu (SODA, 2021)

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

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

Online Linear Extractors for Independent Sources. - Yevgeniy Dodis; Siyao Guo; Noah Stephens-Davidowitz; Zhiye Xie (IACR Cryptol. ePrint Arch., 2021)

Revisiting Time-Space Tradeoffs for Function Inversion. - Alexander Golovnev; Siyao Guo; Spencer Peters; Noah Stephens-Davidowitz (Electron. Colloquium Comput. Complex., 2022)

Neural generative model for clustering by separating particularity and commonality. - Wenqing Wang; Junpeng Bao; Siyao Guo (Inf. Sci., 2022)

Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange. - Siyao Guo; Pritish Kamath; Alon Rosen; Katerina Sotiraki (J. Cryptol., 2022)

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

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

Direct Sums for Parity Decision Trees. - Tyler Besselman; Mika Göös; Siyao Guo; Gilbert Maystre; Weiqiang Yuan 002 (Electron. Colloquium Comput. Complex., 2024)

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

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

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