Ziyi Guan

Orcid: 0009-0005-2779-7026

Affiliations:
  • MIT, USA
  • École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland (PhD 2026)


According to our database1, Ziyi Guan authored at least 15 papers between 2022 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Accelerating Scientific Research with Gemini: Case Studies and Common Techniques.
CoRR, February, 2026

2025
SNARGs for NP from LWE.
IACR Cryptol. ePrint Arch., 2025

On the Fiat-Shamir Security of Succinct Arguments from Functional Commitments.
IACR Cryptol. ePrint Arch., 2025

All Polynomial Generators Preserve Distance with Mutual Correlated Agreement.
IACR Cryptol. ePrint Arch., 2025

Quantum Rewinding for IOP-Based Succinct Arguments.
Proceedings of the Theory of Cryptography - 23rd International Conference, 2025

Relativized Succinct Arguments in the ROM do not Exist.
Proceedings of the Theory of Cryptography - 23rd International Conference, 2025

Breaking Verifiable Delay Functions in the Random Oracle Model.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Generalised Linial-Nisan Conjecture Is False for DNFs.
Proceedings of the 40th Computational Complexity Conference, 2025

2024
Security Bounds for Proof-Carrying Data from Straightline Extractors.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

Untangling the Security of Kilian's Protocol: Upper and Lower Bounds.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

Quantum and Classical Communication Complexity of Permutation-Invariant Functions.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

On Parallel Repetition of PCPs.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Concrete Security for Succinct Arguments from Vector Commitments.
IACR Cryptol. ePrint Arch., 2023

Depth-3 Circuits for Inner Product.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022
Linear-Time Probabilistic Proofs with Sublinear Verification for Algebraic Automata Over Every Field.
IACR Cryptol. ePrint Arch., 2022


  Loading...