Siyao Guo

Orcid: 0009-0008-3664-3928

According to our database1, Siyao Guo authored at least 37 papers between 2013 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Direct Sums for Parity Decision Trees.
Proceedings of the 40th Computational Complexity Conference, 2025

2024
New Distinguishers for Negation-Limited Weak Pseudorandom Functions.
Theory Comput., 2024

Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Revisiting Time-Space Tradeoffs for Function Inversion.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

The (Im)possibility of Simple Search-To-Decision Reductions for Approximation Problems.
Proceedings of the Approximation, 2023

2022
Neural generative model for clustering by separating particularity and commonality.
Inf. Sci., 2022

Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
No Time to Hash: On Superefficient Entropy Accumulation.
IACR Cryptol. ePrint Arch., 2021

On the (im)possibility of branch-and-bound search-to-decision reductions for approximate optimization.
Electron. Colloquium Comput. Complex., 2021

Unifying Presampling via Concentration Bounds.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Concentration bounds for almost <i>k</i>-wise independence with applications to non-uniform security.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

No Time to Hash: On Super-Efficient Entropy Accumulation.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Online Linear Extractors for Independent Sources.
Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

2020
Data structures meet cryptography: 3SUM with preprocessing.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

Tight Quantum Time-Space Tradeoffs for Function Inversion.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Extractor Lower Bounds, Revisited.
Proceedings of the Approximation, 2020

2019
Testing k-Monotonicity: The Rise and Fall of Boolean Functions.
Theory Comput., 2019

3SUM with Preprocessing: Algorithms, Lower Bounds and Cryptographic Applications.
CoRR, 2019

Non-malleable Codes for Decision Trees.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
Non-Malleable Codes for Small-Depth Circuits.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Random Oracles and Non-uniformity.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources.
Proceedings of the Approximation, 2018

2017
Complete Classi fication of Generalized Santha-Vazirani Sources.
Electron. Colloquium Comput. Complex., 2017

Complete Classification of Generalized Santha-Vazirani Sources.
CoRR, 2017

Testing k-Monotonicity.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

2016
Rational Sumchecks.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

On the Hardness of Learning with Rounding over Small Modulus.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Threshold Secret Sharing Requires a Linear Size Alphabet.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

2015
The Power of Negations in Cryptography.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Negation-Limited Formulas.
Proceedings of the Approximation, 2015

2014
Rational arguments: single round delegation with sublinear verification.
Proceedings of the Innovations in Theoretical Computer Science, 2014

Candidate weak pseudorandom functions in AC<sup>0</sup> ○ MOD<sub>2</sub>.
Proceedings of the Innovations in Theoretical Computer Science, 2014

2013
Sparse extractor families for all the entropy.
Proceedings of the Innovations in Theoretical Computer Science, 2013


  Loading...