|
Yanbo Chen 「陈彦伯」 I am a fourth-year Ph.D. student in Computer Science at the University of Ottawa, advised by Andrej Bogdanov. My research interests are mainly in cryptography. During my Ph.D. studies, I visited Julian Loss at CISPA in the summer of 2025. Before I came to Ottawa, I spent one semester at the Chinese University of Hong Kong. I received my B.Sc. in Computer Science in 2021 from Fudan University, where I also worked for one year as a research assistant, host by Yunlei Zhao. Email: ychen918 AT uottawa.ca Program Committee: PKC 2026. |
|
PublicationsNew Imperfect High Threshold and Slice Secret Sharing Schemes Partially Non-Interactive Two-Round Threshold and Multi-Signatures with Tighter and Adaptive Security Tightly and Adaptively Secure Two-Round Threshold Signatures from DDH Schnorr Signatures and MuSig2 are Jointly Secure, Even in Deterministic Wallets Adaptively Secure (Aggregatable) PVSS from Standard Assumptions Three-Move Blind Signatures in Pairing-Free Groups Earpicks: Tightly Secure Two-Round Multi- and Threshold Signatures Adaptively Secure Partially Non-Interactive Threshold Schnorr Signatures in the AGM Round-Efficient Adaptively Secure Threshold Signatures with Rewinding Dazzle: Improved Adaptive Threshold Signatures from DDH DualMS: Efficient Lattice-Based Two-Round Multi-Signature with Trapdoor-Free Simulation Half-Aggregation of Schnorr Signatures with Tight Reductions |
TeachingCSI 2101: Discrete Structures (Winter 2026), at uOttawa. Teaching assistant. CSI 4103/5138: Great Algorithms (Fall 2025), at uOttawa. Corrector. CSI 2101: Discrete Structures (Winter 2025), at uOttawa. Teaching assistant. CSI 4103/5138: Great Algorithms (Fall 2024), at uOttawa. Corrector. CSI 2101: Discrete Structures (Winter 2024), at uOttawa. Teaching assistant. CSCI 3130: Formal Languages and Automata Theory (Fall 2022), at CUHK. Teaching assistant. |