Demo Data from SIGIR 2026 / reviewers in the wild / expert
Yizhou Yao
dblp:229/7704
· DBLP profile ↗
9ranked-venue papers
0as first author
9since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 8 · 8 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
7 papers |
Cryptographic protocols and secure computation · 80% Cryptographic primitives and cryptanalysis · 20% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs |
2.4 | 3 | 2025 | Succinct Line-Point Zero-Knowledge Arguments from Homomorphic Secret Sharing · ASIACRYPT (5) 2025 More Efficient Zero-Knowledge Protocols over $\mathbb {Z}_{2^k}$ via Galois Rings · CRYPTO (9) 2024 Interactive Line-Point Zero-Knowledge with Sublinear Communication and Linear Computation · ASIACRYPT (5) 2024 |
Cryptographic protocols and secure computation › secure computation protocols › correlated randomness
pseudorandom correlation generators |
1.7 | 2 | 2025 | Efficient Pseudorandom Correlation Generators for Any Finite Field · EUROCRYPT (5) 2025 Efficient Pseudorandom Correlation Generators over $\mathbb {Z}/p^k\mathbb {Z}$ · CRYPTO (4) 2025 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
succinct arguments |
1.7 | 2 | 2025 | Polynomial Commitments for Galois Rings and Applications to SNARKs Over $\mathbb {Z}_{2^k}$ · CRYPTO (6) 2025 Succinct Line-Point Zero-Knowledge Arguments from Homomorphic Secret Sharing · ASIACRYPT (5) 2025 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
line-point zero-knowledge |
1.6 | 2 | 2025 | Succinct Line-Point Zero-Knowledge Arguments from Homomorphic Secret Sharing · ASIACRYPT (5) 2025 Interactive Line-Point Zero-Knowledge with Sublinear Communication and Linear Computation · ASIACRYPT (5) 2024 |
Cryptographic primitives and cryptanalysis
finite field |
0.9 | 1 | 2025 | Efficient Pseudorandom Correlation Generators for Any Finite Field · EUROCRYPT (5) 2025 |
Cryptographic protocols and secure computation › secret sharing
homomorphic secret sharing |
0.9 | 1 | 2025 | Succinct Line-Point Zero-Knowledge Arguments from Homomorphic Secret Sharing · ASIACRYPT (5) 2025 |
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic commitments
polynomial commitment |
0.9 | 1 | 2025 | Polynomial Commitments for Galois Rings and Applications to SNARKs Over $\mathbb {Z}_{2^k}$ · CRYPTO (6) 2025 |
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs › non-interactive zero-knowledge proofs
zk-SNARK |
0.9 | 1 | 2025 | Polynomial Commitments for Galois Rings and Applications to SNARKs Over $\mathbb {Z}_{2^k}$ · CRYPTO (6) 2025 |
Cryptographic protocols and secure computation › secure computation protocols
non-interactive secure computation |
0.7 | 1 | 2023 | Amortized NISC over $\mathbb {Z}_{2^k}$ from RMFE · ASIACRYPT (1) 2023 |
Methods — techniques the papers use, named apart from their topics
pseudorandomness · 0.9homomorphic secret sharing · 0.9correlation generation · 0.9sublinear communication · 0.8linear computation · 0.8galois rings · 0.8z_{2^k} arithmetic · 0.7ring embedding · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Faster Pseudorandom Correlation Generators via Walsh-Hadamard Transform
Hongqing Liu 0005, Chaoping Xing, Yizhou Yao, Chen Yuan 0003 |
CRYPTO (8) | 4 |
| 2026 | Engineering application of non-dominated sorting genetic algorithm III: Multi-objective optimization of ultra-high performance concrete for diverse scenarios
Yuqing Wu, Yizhou Yao, Ahmed Nasr, Qingmei Yang, Huiyu Xia |
Eng. Appl. Artif. Intell. | 5 |
| 2025 | Succinct Line-Point Zero-Knowledge Arguments from Homomorphic Secret Sharing
Chaoping Xing, Yizhou Yao, Chen Yuan 0003, Mengmeng Zhou |
ASIACRYPT (5) | 3 |
| 2025 | Polynomial Commitments for Galois Rings and Applications to SNARKs Over $\mathbb {Z}_{2^k}$
Yuhao Jia, Chaoping Xing, Yizhou Yao, Chen Yuan 0003 |
CRYPTO (6) | 4 |
| 2025 | Efficient Pseudorandom Correlation Generators over $\mathbb {Z}/p^k\mathbb {Z}$
Chaoping Xing, Yizhou Yao, Chen Yuan 0003 |
CRYPTO (4) | 3 |
| 2025 | Efficient Pseudorandom Correlation Generators for Any Finite Field
Chaoping Xing, Yizhou Yao, Chen Yuan 0003 |
EUROCRYPT (5) | 3 |
| 2024 | Interactive Line-Point Zero-Knowledge with Sublinear Communication and Linear Computation
Fuchun Lin, Chaoping Xing, Yizhou Yao |
ASIACRYPT (5) | 3 |
| 2024 | More Efficient Zero-Knowledge Protocols over $\mathbb {Z}_{2^k}$ via Galois Rings
Fuchun Lin, Chaoping Xing, Yizhou Yao |
CRYPTO (9) | 3 |
| 2023 | Amortized NISC over $\mathbb {Z}_{2^k}$ from RMFE
Fuchun Lin, Chaoping Xing, Yizhou Yao, Chen Yuan 0003 |
ASIACRYPT (1) | 3 |