default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSiyao Guo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Akshima, Siyao Guo, Qipeng Liu:
Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions. J. Cryptol. 37(2): 10 (2024)- [c28]Akshima
, Tyler Besselman, Siyao Guo, Zhiye Xie, Yuping Ye:
Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem. STOC 2024: 1739-1749 - [i34]Akshima, Tyler Besselman, Siyao Guo, Zhiye Xie, Yuping Ye:
Tight Time-Space Tradeoffs for the Decisional Diffie-Hellman Problem. IACR Cryptol. ePrint Arch. 2024: 1171 (2024) - 2023
- [c27]Alexander Golovnev, Siyao Guo, Spencer Peters, Noah Stephens-Davidowitz:
The (Im)possibility of Simple Search-To-Decision Reductions for Approximation Problems. APPROX/RANDOM 2023: 10:1-10:20 - [c26]Alexander Golovnev, Siyao Guo, Spencer Peters, Noah Stephens-Davidowitz:
Revisiting Time-Space Tradeoffs for Function Inversion. CRYPTO (2) 2023: 453-481 - [c25]Akshima, Xiaoqi Duan, Siyao Guo, Qipeng Liu:
On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions. TCC (3) 2023: 237-270 - [i33]Akshima, Xiaoqi Duan, Siyao Guo, Qipeng Liu:
On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions. IACR Cryptol. ePrint Arch. 2023: 1444 (2023) - 2022
- [j5]Wenqing Wang, Junpeng Bao, Siyao Guo:
Neural generative model for clustering by separating particularity and commonality. Inf. Sci. 589: 813-826 (2022) - [j4]Siyao Guo, Pritish Kamath, Alon Rosen, Katerina Sotiraki:
Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange. J. Cryptol. 35(1): 1 (2022) - [c24]Akshima, Siyao Guo, Qipeng Liu:
Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions. CRYPTO (3) 2022: 192-221 - [i32]Zhihuai Chen, Siyao Guo, Qian Li, Chengyu Lin, Xiaoming Sun:
New Distinguishers for Negation-Limited Weak Pseudorandom Functions. CoRR abs/2203.12246 (2022) - [i31]Alexander Golovnev, Siyao Guo, Spencer Peters, Noah Stephens-Davidowitz:
Revisiting Time-Space Tradeoffs for Function Inversion. Electron. Colloquium Comput. Complex. TR22 (2022) - [i30]Akshima, Siyao Guo, Qipeng Liu:
Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash Functions. IACR Cryptol. ePrint Arch. 2022: 885 (2022) - 2021
- [c23]Yevgeniy Dodis, Siyao Guo, Noah Stephens-Davidowitz, Zhiye Xie:
Online Linear Extractors for Independent Sources. ITC 2021: 14:1-14:14 - [c22]Yevgeniy Dodis, Siyao Guo, Noah Stephens-Davidowitz, Zhiye Xie:
No Time to Hash: On Super-Efficient Entropy Accumulation. CRYPTO (4) 2021: 548-576 - [c21]Nick Gravin, Siyao Guo, Tsz Chiu Kwok, Pinyan Lu:
Concentration bounds for almost k-wise independence with applications to non-uniform security. SODA 2021: 2404-2423 - [c20]Siyao Guo, Qian Li, Qipeng Liu, Jiapeng Zhang:
Unifying Presampling via Concentration Bounds. TCC (1) 2021: 177-208 - [i29]Alexander Golovnev, Siyao Guo, Spencer Peters, Noah Stephens-Davidowitz:
On the (im)possibility of branch-and-bound search-to-decision reductions for approximate optimization. Electron. Colloquium Comput. Complex. TR21 (2021) - [i28]Yevgeniy Dodis, Siyao Guo, Noah Stephens-Davidowitz, Zhiye Xie:
No Time to Hash: On Superefficient Entropy Accumulation. IACR Cryptol. ePrint Arch. 2021: 523 (2021) - [i27]Yevgeniy Dodis, Siyao Guo, Noah Stephens-Davidowitz, Zhiye Xie:
Online Linear Extractors for Independent Sources. IACR Cryptol. ePrint Arch. 2021: 1002 (2021) - 2020
- [j3]Andrej Bogdanov, Siyao Guo, Ilan Komargodski:
Threshold Secret Sharing Requires a Linear-Size Alphabet. Theory Comput. 16: 1-18 (2020) - [c19]Divesh Aggarwal, Siyao Guo, Maciej Obremski, João Ribeiro, Noah Stephens-Davidowitz:
Extractor Lower Bounds, Revisited. APPROX-RANDOM 2020: 1:1-1:20 - [c18]Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian:
Tight Quantum Time-Space Tradeoffs for Function Inversion. FOCS 2020: 673-684 - [c17]Siyao Guo, Pritish Kamath, Alon Rosen, Katerina Sotiraki:
Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange. Public Key Cryptography (1) 2020: 374-395 - [c16]Alexander Golovnev, Siyao Guo, Thibaut Horel, Sunoo Park, Vinod Vaikuntanathan:
Data structures meet cryptography: 3SUM with preprocessing. STOC 2020: 294-307 - [i26]Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian:
Tight Quantum Time-Space Tradeoffs for Function Inversion. CoRR abs/2006.05650 (2020) - [i25]Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian:
Tight Quantum Time-Space Tradeoffs for Function Inversion. Electron. Colloquium Comput. Complex. TR20 (2020) - [i24]Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian:
Tight Quantum Time-Space Tradeoffs for Function Inversion. IACR Cryptol. ePrint Arch. 2020: 693 (2020) - [i23]Siyao Guo, Pritish Kamath, Alon Rosen, Katerina Sotiraki:
Limits on the Efficiency of (Ring) LWE based Non-Interactive Key Exchange. IACR Cryptol. ePrint Arch. 2020: 1555 (2020) - [i22]Siyao Guo, Qian Li, Qipeng Liu, Jiapeng Zhang:
Unifying Presampling via Concentration Bounds. IACR Cryptol. ePrint Arch. 2020: 1589 (2020)
2010 – 2019
- 2019
- [j2]Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer:
Testing k-Monotonicity: The Rise and Fall of Boolean Functions. Theory Comput. 15: 1-55 (2019) - [c15]Marshall Ball, Siyao Guo, Daniel Wichs:
Non-malleable Codes for Decision Trees. CRYPTO (1) 2019: 413-434 - [i21]Alexander Golovnev, Siyao Guo, Thibaut Horel, Sunoo Park, Vinod Vaikuntanathan:
3SUM with Preprocessing: Algorithms, Lower Bounds and Cryptographic Applications. CoRR abs/1907.08355 (2019) - [i20]Divesh Aggarwal, Siyao Guo, Maciej Obremski, João Ribeiro, Noah Stephens-Davidowitz:
Extractor Lower Bounds, Revisited. Electron. Colloquium Comput. Complex. TR19 (2019) - [i19]Marshall Ball, Siyao Guo, Daniel Wichs:
Non-Malleable Codes for Decision Trees. IACR Cryptol. ePrint Arch. 2019: 379 (2019) - 2018
- [c14]Salman Beigi, Andrej Bogdanov, Omid Etesami, Siyao Guo:
Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources. APPROX-RANDOM 2018: 30:1-30:15 - [c13]Sandro Coretti, Yevgeniy Dodis, Siyao Guo:
Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models. CRYPTO (1) 2018: 693-721 - [c12]Sandro Coretti, Yevgeniy Dodis, Siyao Guo, John P. Steinberger:
Random Oracles and Non-uniformity. EUROCRYPT (1) 2018: 227-258 - [c11]Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan:
Non-Malleable Codes for Small-Depth Circuits. FOCS 2018: 826-837 - [i18]Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan:
Non-Malleable Codes for Small-Depth Circuits. CoRR abs/1802.07673 (2018) - [i17]Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan:
Non-Malleable Codes for Small-Depth Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - [i16]Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan:
Non-Malleable Codes for Small-Depth Circuits. IACR Cryptol. ePrint Arch. 2018: 207 (2018) - [i15]Sandro Coretti, Yevgeniy Dodis, Siyao Guo:
Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models. IACR Cryptol. ePrint Arch. 2018: 226 (2018) - 2017
- [j1]Siyao Guo, Ilan Komargodski:
Negation-limited formulas. Theor. Comput. Sci. 660: 75-85 (2017) - [c10]Yevgeniy Dodis, Siyao Guo, Jonathan Katz:
Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited. EUROCRYPT (2) 2017: 473-495 - [c9]Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer:
Testing k-Monotonicity. ITCS 2017: 29:1-29:21 - [i14]Salman Beigi, Andrej Bogdanov, Omid Etesami, Siyao Guo:
Complete Classification of Generalized Santha-Vazirani Sources. CoRR abs/1709.03053 (2017) - [i13]Salman Beigi, Andrej Bogdanov, Omid Etesami, Siyao Guo:
Complete Classi fication of Generalized Santha-Vazirani Sources. Electron. Colloquium Comput. Complex. TR17 (2017) - [i12]Sandro Coretti, Yevgeniy Dodis, Siyao Guo, John P. Steinberger:
Random Oracles and Non-Uniformity. IACR Cryptol. ePrint Arch. 2017: 937 (2017) - 2016
- [c8]Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen:
On the Hardness of Learning with Rounding over Small Modulus. TCC (A1) 2016: 209-224 - [c7]Siyao Guo, Pavel Hubácek, Alon Rosen, Margarita Vald:
Rational Sumchecks. TCC (A2) 2016: 319-351 - [c6]Andrej Bogdanov, Siyao Guo, Ilan Komargodski:
Threshold Secret Sharing Requires a Linear Size Alphabet. TCC (B2) 2016: 471-484 - [i11]Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer:
Testing k-Monotonicity. CoRR abs/1609.00265 (2016) - [i10]Andrej Bogdanov, Siyao Guo, Ilan Komargodski:
Threshold Secret Sharing Requires a Linear Size Alphabet. Electron. Colloquium Comput. Complex. TR16 (2016) - [i9]Clément L. Canonne, Elena Grigorescu, Siyao Guo, Akash Kumar, Karl Wimmer:
Testing k-Monotonicity. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c5]Siyao Guo, Ilan Komargodski:
Negation-Limited Formulas. APPROX-RANDOM 2015: 850-866 - [c4]Siyao Guo, Tal Malkin, Igor C. Oliveira, Alon Rosen:
The Power of Negations in Cryptography. TCC (1) 2015: 36-65 - [i8]Siyao Guo, Ilan Komargodski:
Negation-Limited Formulas. Electron. Colloquium Comput. Complex. TR15 (2015) - [i7]Igor Carboni Oliveira, Siyao Guo, Tal Malkin, Alon Rosen:
The Power of Negations in Cryptography. Electron. Colloquium Comput. Complex. TR15 (2015) - [i6]Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen:
On the Hardness of Learning with Rounding over Small Modulus. IACR Cryptol. ePrint Arch. 2015: 769 (2015) - [i5]Siyao Guo, Pavel Hubácek, Alon Rosen, Margarita Vald:
Rational Sumchecks. IACR Cryptol. ePrint Arch. 2015: 1058 (2015) - 2014
- [c3]Adi Akavia, Andrej Bogdanov, Siyao Guo, Akshay Kamath, Alon Rosen:
Candidate weak pseudorandom functions in AC0 ○ MOD2. ITCS 2014: 251-260 - [c2]Siyao Guo, Pavel Hubácek, Alon Rosen, Margarita Vald:
Rational arguments: single round delegation with sublinear verification. ITCS 2014: 523-540 - [i4]Adi Akavia, Andrej Bogdanov, Siyao Guo, Akshay Kamath, Alon Rosen:
Candidate weak pseudorandom functions in AC0 ○ MOD2. Electron. Colloquium Comput. Complex. TR14 (2014) - [i3]Siyao Guo, Tal Malkin, Igor C. Oliveira, Alon Rosen:
The Power of Negations in Cryptography. IACR Cryptol. ePrint Arch. 2014: 902 (2014) - 2013
- [c1]Andrej Bogdanov, Siyao Guo:
Sparse extractor families for all the entropy. ITCS 2013: 553-560 - 2012
- [i2]Andrej Bogdanov, Siyao Guo:
Sparse extractor families for all the entropy. CoRR abs/1207.6260 (2012) - [i1]Andrej Bogdanov, Siyao Guo:
Sparse extractor families for all the entropy. Electron. Colloquium Comput. Complex. TR12 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
