Demo Data from EDBT 2026 / reviewers in the wild / expert
Duobin Lyu
dblp:397/3436
· DBLP profile ↗
3ranked-venue papers
3as first author
3since 2021 · last 2026
0009-0006-4371-5278ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 2 first-author · 2 since 2021Computer networks · 1 · 1 first-author · 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
1 paper |
Cryptographic protocols and secure computation · 77% Privacy and data protection · 23% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › secure multiparty computation › oblivious computation
oblivious polynomial evaluation |
0.8 | 1 | 2024 | Mompe: Multiparty Oblivious Multivariate Polynomial Evaluation · ICNP 2024 |
Privacy and data protection
privacy-preserving data analysis |
0.8 | 1 | 2024 | Mompe: Multiparty Oblivious Multivariate Polynomial Evaluation · ICNP 2024 |
Cryptographic protocols and secure computation › secure arithmetic
private polynomial computation |
0.8 | 1 | 2024 | Mompe: Multiparty Oblivious Multivariate Polynomial Evaluation · ICNP 2024 |
Cryptographic protocols and secure computation
secure multiparty computation |
0.8 | 1 | 2024 | Mompe: Multiparty Oblivious Multivariate Polynomial Evaluation · ICNP 2024 |
Cryptographic protocols and secure computation › composable security
universally composable security |
0.2 | 1 | 2024 | Mompe: Multiparty Oblivious Multivariate Polynomial Evaluation · ICNP 2024 |
Methods — techniques the papers use, named apart from their topics
universal composability framework · 0.8oblivious polynomial evaluation · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | ESPE: Efficient secure multi-party computation for symmetric polynomial evaluation
Duobin Lyu, Zening Zhao |
J. Inf. Secur. Appl. | 1 |
| 2026 | Malicious secure lightweight private set intersection
Duobin Lyu, Zening Zhao, Zhao Zhao 0002 |
J. Inf. Secur. Appl. | 1 |
| 2024 | Mompe: Multiparty Oblivious Multivariate Polynomial EvaluationabstractThis paper proposes a novel Multiparty Oblivious Multivariate Polynomial Evaluation (MOMPE) protocol, which enables secure multivariate polynomial computation among multiple parties for the first time. Unlike traditional Oblivious Polynomial Evaluation (OPE) protocols limited to two-party secure computation, MOMPE divides participating parties into a sender holding the multivariate polynomial$P$and$n$receivers, each holding a secret value$\alpha_{i}$corresponding to a variable in$P$. Upon completion, the receivers learn$P\left(\alpha_{1}, \alpha_{2}, \ldots, \alpha_{n}\right)$, while the sender learns nothing. Assuming no collusion between the sender and receivers, we demonstrate MOMPE's security under the stringent Universal Composability (UC) framework, ensuring it remains secure in complex multiparty interactive environments. Our implementation and experiments validate MOMPE's performance, showing significantly less time consumption than the state-of-the-art Overdrive protocol for multiparty multivariate polynomial computation, while maintaining similar efficiency to OPE for participating parties. MOMPE has extensive application potential in privacy-preserving machine learning and collaborative data analysis, where multiple parties need to compute and analyze data together while protecting privacy. MOMPE offers a secure and efficient method for parties to utilize data without revealing sensitive information, opening new possibilities for privacy-preserving data collaboration and analysis. Duobin Lyu, Zening Zhao |
ICNP | 1 |