Siyao Guo

According to our database1, Siyao Guo authored at least 35 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions.
J. Cryptol., June, 2024

2023
On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions.
IACR Cryptol. ePrint Arch., 2023

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

2022
Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange.
J. Cryptol., 2022

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

Revisiting Time-Space Tradeoffs for Function Inversion.
Electron. Colloquium Comput. Complex., 2022

New Distinguishers for Negation-Limited Weak Pseudorandom Functions.
CoRR, 2022

2021
Online Linear Extractors for Independent Sources.
IACR Cryptol. ePrint Arch., 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

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

2020
Threshold Secret Sharing Requires a Linear-Size Alphabet.
Theory Comput., 2020

Unifying Presampling via Concentration Bounds.
IACR Cryptol. ePrint Arch., 2020

Tight Quantum Time-Space Tradeoffs for Function Inversion.
Electron. Colloquium Comput. Complex., 2020

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

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

Non-Malleable Codes for Decision Trees.
IACR Cryptol. ePrint Arch., 2019

Extractor Lower Bounds, Revisited.
Electron. Colloquium Comput. Complex., 2019

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

2018
Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models.
IACR Cryptol. ePrint Arch., 2018

Non-Malleable Codes for Small-Depth Circuits.
Electron. Colloquium Comput. Complex., 2018

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

2017
Negation-limited formulas.
Theor. Comput. Sci., 2017

Random Oracles and Non-Uniformity.
IACR Cryptol. ePrint Arch., 2017

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

Complete Classification of Generalized Santha-Vazirani Sources.
CoRR, 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
Testing k-Monotonicity.
Electron. Colloquium Comput. Complex., 2016

2015
Rational Sumchecks.
IACR Cryptol. ePrint Arch., 2015

On the Hardness of Learning with Rounding over Small Modulus.
IACR Cryptol. ePrint Arch., 2015

The Power of Negations in Cryptography.
Electron. Colloquium Comput. Complex., 2015

2014
Candidate weak pseudorandom functions in AC<sup>0</sup> ○ MOD<sub>2</sub>.
Electron. Colloquium Comput. Complex., 2014

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

2012
Sparse extractor families for all the entropy.
Electron. Colloquium Comput. Complex., 2012


  Loading...