| On the hardness of learning with rounding over small modulus A Bogdanov, S Guo, D Masny, S Richelson, A Rosen Theory of Cryptography: 13th International Conference, TCC 2016-A, Tel Aviv …, 2015 | 119 | 2015 |
| Fixing cracks in the concrete: Random oracles with auxiliary input, revisited Y Dodis, S Guo, J Katz Advances in Cryptology–EUROCRYPT 2017: 36th Annual International Conference …, 2017 | 67 | 2017 |
| Random oracles and non-uniformity S Coretti, Y Dodis, S Guo, J Steinberger Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018 | 58 | 2018 |
| Candidate weak pseudorandom functions in AC0 ○ MOD2 A Akavia, A Bogdanov, S Guo, A Kamath, A Rosen Proceedings of the 5th conference on Innovations in theoretical computer …, 2014 | 54 | 2014 |
| Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models S Coretti, Y Dodis, S Guo Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018 | 43 | 2018 |
| Non-malleable codes for small-depth circuits M Ball, D Dachman-Soled, S Guo, T Malkin, LY Tan 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 40 | 2018 |
| Rational arguments: single round delegation with sublinear verification S Guo, P Hubáček, A Rosen, M Vald Proceedings of the 5th conference on Innovations in theoretical computer …, 2014 | 39 | 2014 |
| The power of negations in cryptography S Guo, T Malkin, IC Oliveira, A Rosen Theory of Cryptography: 12th Theory of Cryptography Conference, TCC 2015 …, 2015 | 34 | 2015 |
| Threshold secret sharing requires a linear size alphabet A Bogdanov, S Guo, I Komargodski Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016 | 29 | 2016 |
| Rational sumchecks S Guo, P Hubáček, A Rosen, M Vald Theory of Cryptography: 13th International Conference, TCC 2016-A, Tel Aviv …, 2015 | 28 | 2015 |
| Tight quantum time-space tradeoffs for function inversion KM Chung, S Guo, Q Liu, L Qian 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 23 | 2020 |
| Non-malleable codes for decision trees M Ball, S Guo, D Wichs Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology …, 2019 | 21 | 2019 |
| Data structures meet cryptography: 3SUM with preprocessing A Golovnev, S Guo, T Horel, S Park, V Vaikuntanathan Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing …, 2020 | 20* | 2020 |
| Testing -Monotonicity: The Rise and Fall of Boolean Functions CL Canonne, E Grigorescu, S Guo, A Kumar, K Wimmer Theory of Computing 15 (1), 1-55, 2019 | 19* | 2019 |
| Sparse extractor families for all the entropy A Bogdanov, S Guo Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013 | 13 | 2013 |
| Negation-limited formulas S Guo, I Komargodski Theoretical Computer Science 660, 75-85, 2017 | 10 | 2017 |
| Limits on the Efficiency of (Ring) LWE-Based Non-interactive Key Exchange S Guo, P Kamath, A Rosen, K Sotiraki Journal of Cryptology 35 (1), 1, 2022 | 7 | 2022 |
| Unifying presampling via concentration bounds S Guo, Q Li, Q Liu, J Zhang Theory of Cryptography: 19th International Conference, TCC 2021, Raleigh, NC …, 2021 | 7 | 2021 |
| Optimal deterministic extractors for generalized Santha-Vazirani sources S Beigi, A Bogdanov, O Etesami, S Guo Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2018 | 6* | 2018 |
| Concentration bounds for almost k-wise independence with applications to non-uniform security N Gravin, S Guo, TC Kwok, P Lu Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 4 | 2021 |
Andrej BogdanovChinese University of Hong KongVerified email at cse.cuhk.edu.hk
