default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZiyi Guan 0001
Person information
- affiliation: École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland
Other persons with the same name
- Ziyi Guan — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j2]Ziyi Guan
, Yunqi Huang, Penghui Yao, Zekun Ye:
Quantum and Classical Communication Complexity of Permutation-Invariant Functions. IEEE Trans. Inf. Theory 71(4): 2782-2799 (2025)- [c9]Yaroslav Alekseev, Mika Göös, Ziyi Guan, Gilbert Maystre, Artur Riazanov, Dmitry Sokolov, Weiqiang Yuan:
Generalised Linial-Nisan Conjecture Is False for DNFs. CCC 2025: 29:1-29:13 - [c8]Ziyi Guan, Artur Riazanov, Weiqiang Yuan:
Breaking Verifiable Delay Functions in the Random Oracle Model. CRYPTO (7) 2025: 161-191 - [c7]Annalisa Barbara, Alessandro Chiesa, Ziyi Guan:
Relativized Succinct Arguments in the ROM do not Exist. TCC (1) 2025: 400-416 - [c6]Alessandro Chiesa, Marcel Dall'Agnol, Zijing Di, Ziyi Guan, Nicholas Spooner:
Quantum Rewinding for IOP-Based Succinct Arguments. TCC (3) 2025: 460-479 - [i13]Yaroslav Alekseev, Mika Göös, Ziyi Guan, Gilbert Maystre, Artur Riazanov, Dmitry Sokolov, Weiqiang Yuan:
Generalised Linial-Nisan Conjecture is False for DNFs. Electron. Colloquium Comput. Complex. TR25 (2025) - [i12]Alessandro Chiesa, Ziyi Guan, Christian Knabenhans, Zihan Yu:
On the Fiat-Shamir Security of Succinct Arguments from Functional Commitments. IACR Cryptol. ePrint Arch. 2025: 902 (2025) - [i11]Alessandro Chiesa, Marcel Dall'Agnol, Zijing Di, Ziyi Guan, Nicholas Spooner:
Quantum Rewinding for IOP-Based Succinct Arguments. IACR Cryptol. ePrint Arch. 2025: 947 (2025) - [i10]Sarah Bordage, Alessandro Chiesa, Ziyi Guan, Ignacio Manzur:
All Polynomial Generators Preserve Distance with Mutual Correlated Agreement. IACR Cryptol. ePrint Arch. 2025: 2051 (2025) - 2024
- [j1]Mika Göös, Ziyi Guan, Tiberiu Mosnoi:
Depth-3 circuits for inner product. Inf. Comput. 300: 105192 (2024) - [c5]Alessandro Chiesa, Ziyi Guan, Burcu Yildiz:
On Parallel Repetition of PCPs. ITCS 2024: 34:1-34:14 - [c4]Ziyi Guan, Yunqi Huang, Penghui Yao, Zekun Ye:
Quantum and Classical Communication Complexity of Permutation-Invariant Functions. STACS 2024: 39:1-39:19 - [c3]Alessandro Chiesa, Marcel Dall'Agnol, Ziyi Guan, Nicholas Spooner, Eylon Yogev:
Untangling the Security of Kilian's Protocol: Upper and Lower Bounds. TCC (1) 2024: 158-188 - [c2]Alessandro Chiesa, Ziyi Guan, Shahar Samocha, Eylon Yogev:
Security Bounds for Proof-Carrying Data from Straightline Extractors. TCC (2) 2024: 464-496 - [i9]Ziyi Guan, Yunqi Huang, Penghui Yao, Zekun Ye:
Quantum and Classical Communication Complexity of Permutation-Invariant Functions. CoRR abs/2401.00454 (2024) - [i8]Annalisa Barbara, Alessandro Chiesa, Ziyi Guan:
Relativized Succinct Arguments in the ROM Do Not Exist. IACR Cryptol. ePrint Arch. 2024: 728 (2024) - [i7]Ziyi Guan, Artur Riazanov, Weiqiang Yuan:
Breaking Verifiable Delay Functions in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2024: 766 (2024) - [i6]Alessandro Chiesa, Marcel Dall'Agnol, Ziyi Guan, Nicholas Spooner, Eylon Yogev:
Untangling the Security of Kilian's Protocol: Upper and Lower Bounds. IACR Cryptol. ePrint Arch. 2024: 1434 (2024) - 2023
- [c1]Mika Göös, Ziyi Guan, Tiberiu Mosnoi:
Depth-3 Circuits for Inner Product. MFCS 2023: 51:1-51:12 - [i5]Mika Göös, Ziyi Guan, Tiberiu Mosnoi:
Depth-3 Circuits for Inner Product. Electron. Colloquium Comput. Complex. TR23 (2023) - [i4]Alessandro Chiesa, Ziyi Guan, Shahar Samocha, Eylon Yogev:
Security Bounds for Proof-Carrying Data from Straightline Extractors. IACR Cryptol. ePrint Arch. 2023: 1646 (2023) - [i3]Alessandro Chiesa, Ziyi Guan, Burcu Yildiz:
On Parallel Repetition of PCPs. IACR Cryptol. ePrint Arch. 2023: 1714 (2023) - [i2]Alessandro Chiesa, Marcel Dall'Agnol, Ziyi Guan, Nicholas Spooner:
Concrete Security for Succinct Arguments from Vector Commitments. IACR Cryptol. ePrint Arch. 2023: 1737 (2023) - 2022
- [i1]Jonathan Bootle, Alessandro Chiesa, Ziyi Guan, Siqi Liu:
Linear-Time Probabilistic Proofs with Sublinear Verification for Algebraic Automata Over Every Field. IACR Cryptol. ePrint Arch. 2022: 1056 (2022)
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 2026-01-18 03:14 CET 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:
