Yu Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Yu Chen has a total of 64 co-authors. Here are the top co-authors by number of shared publications:
- Cong Zhang
Institute for Advanced Study, Tsinghua University, Beijing, China
5 shared publications - Binbin Tu
Shandong University
4 shared publications - Min Zhang
Shandong University
4 shared publications - Yuyu Wang
University of Electronic Science and Technology of China, Chengdu, China
4 shared publications - Jiang Zhang
State Key Laboratory of Cryptology
3 shared publications - Jiaxin Pan
University of Kassel, Kassel, Germany
3 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 63-77
Breaking the Curse of Dimensionality: Fuzzy PSI without O ((logδ) d ) Overhead
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 63-77
Open AccessBreaking the Curse of Dimensionality: Fuzzy PSI without O ((logδ) d ) Overhead
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1432-1446
Practical Silent Threshold Signatures and Silent Threshold Encryption for Dynamic Committees
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1432-1446
Open AccessPractical Silent Threshold Signatures and Silent Threshold Encryption for Dynamic Committees
- 22 July 2026
- Published by Springer Nature
- p. 297-326
Efficient Sum-Check for High-Degree Polynomials
- 18 July 2026
- Published by Springer Nature
- p. 200-221
Transparent Fully Batchable Polynomial Commitment with Application to Scalable VSS
- 18 July 2026
- Published by Springer Nature
- p. 200-221
Transparent Fully Batchable Polynomial Commitment with Application to Scalable VSS
- 9 May 2026
- Published by Springer Nature
- p. 268-298
k-out-of-n Proofs and Applications to Privacy-Preserving Cryptocurrencies
- 9 May 2026
- Published by Springer Nature
- p. 268-298
k-out-of-n Proofs and Applications to Privacy-Preserving Cryptocurrencies
- Open Access
- 1 January 2026
- Published by Institution of Engineering and Technology (IET) in IET Information Security
- Vol. 2026 (1) , 4013546
Two‐Party Adaptor Signature: New Definition and Efficient Constructions From ECDSA
Adaptor signature (AS) has gained increasing popularity lately due to its widespread adoption in different Blockchain applications such as atomic swaps and payment channels. Two‐party AS enhances the security of the signing key by splitting it into two parts. Erwig et al. (PKC 2021) first define a two‐party AS with aggregatable public keys and instantiate them via a generic transformation from ID‐based signature schemes. However, their definition could not cover two‐party signature with interactive key generation, such as two‐party ECDSA. In this paper, we first propose a generic definition of two‐party ASs that inherently supports interactive key generation. Then, we present efficient constructions of two‐party AS based on ECDSA, which inherit the performance advantages of two‐party ECDSA. Compared to the state‐of‐the‐art work (Malavolta et al., NDSS 2019), experimental results demonstrate that our protocol achieves about 5.6× speedup in the presigning algorithm. In terms of application, we showcase a secure atomic swap protocol that leverages our two‐party ASs to enhance signing key protection and strengthen overall protocol security.
- 1 January 2026
- Published by Institution of Engineering and Technology (IET) in IET Information Security
- Vol. 2026 (1) , 4013546
Open AccessTwo‐Party Adaptor Signature: New Definition and Efficient Constructions From ECDSA
Adaptor signature (AS) has gained increasing popularity lately due to its widespread adoption in different Blockchain applications such as atomic swaps and payment channels. Two‐party AS enhances the security of the signing key by splitting it into two parts. Erwig et al. (PKC 2021) first define a two‐party AS with aggregatable public keys and instantiate them via a generic transformation from ID‐based signature schemes. However, their definition could not cover two‐party signature with interactive key generation, such as two‐party ECDSA. In this paper, we first propose a generic definition of two‐party ASs that inherently supports interactive key generation. Then, we present efficient constructions of two‐party AS based on ECDSA, which inherit the performance advantages of two‐party ECDSA. Compared to the state‐of‐the‐art work (Malavolta et al., NDSS 2019), experimental results demonstrate that our protocol achieves about 5.6× speedup in the presigning algorithm. In terms of application, we showcase a secure atomic swap protocol that leverages our two‐party ASs to enhance signing key protection and strengthen overall protocol security.
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 4079-4093
Multi-Party Private Set Operations from Predicative Zero-Sharing
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 4079-4093
Open AccessMulti-Party Private Set Operations from Predicative Zero-Sharing
- Open Access
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 1434-1447
Unbalanced Private Set Union with Reduced Computation and Communication
Private set union (PSU) is a cryptographic protocol that allows two parties to compute the union of their sets without revealing anything else. Despite some efficient PSU protocols that have been proposed, they mainly focus on the balanced setting, where the sets held by the parties are of similar size. Recently, Tu et al. (CCS 2023) proposed the first unbalanced PSU protocol which achieves sublinear communication complexity in the size of the larger set. In this paper, we are interested in improving the efficiency of the unbalanced PSU protocol. We find that oblivious key-value store (OKVS) data structure plays an essential role in the most recently proposed PSU constructions and formalize unbalanced PSU as an OKVS decoding process with sublinear communication. Our key insight lies in when OKVS satisfies sparsity property, obtaining the necessary decoding information precisely aligns with the batch private information retrieval (BatchPIR) problem. We give two concrete constructions of unbalanced PSU protocols based on different OKVS encoding strategies. The first is based on oblivious PRF (OPRF) and a newly introduced cryptographic protocol called permuted private equality test, while the second is based on re-randomizable public key encryption. Both our two constructions achieve sublinear communication complexity in the size of the larger set. We implement our two unbalanced PSU protocols and compare them with the state-of-the-art unbalanced PSU of Tu et al. Experiments show that our protocols achieve a 1.3-5.6\times speedup in running time and 2.1-11.8× shrinking in communication cost, depending on set sizes and network environments.
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 1434-1447
Open AccessUnbalanced Private Set Union with Reduced Computation and Communication
Private set union (PSU) is a cryptographic protocol that allows two parties to compute the union of their sets without revealing anything else. Despite some efficient PSU protocols that have been proposed, they mainly focus on the balanced setting, where the sets held by the parties are of similar size. Recently, Tu et al. (CCS 2023) proposed the first unbalanced PSU protocol which achieves sublinear communication complexity in the size of the larger set. In this paper, we are interested in improving the efficiency of the unbalanced PSU protocol. We find that oblivious key-value store (OKVS) data structure plays an essential role in the most recently proposed PSU constructions and formalize unbalanced PSU as an OKVS decoding process with sublinear communication. Our key insight lies in when OKVS satisfies sparsity property, obtaining the necessary decoding information precisely aligns with the batch private information retrieval (BatchPIR) problem. We give two concrete constructions of unbalanced PSU protocols based on different OKVS encoding strategies. The first is based on oblivious PRF (OPRF) and a newly introduced cryptographic protocol called permuted private equality test, while the second is based on re-randomizable public key encryption. Both our two constructions achieve sublinear communication complexity in the size of the larger set. We implement our two unbalanced PSU protocols and compare them with the state-of-the-art unbalanced PSU of Tu et al. Experiments show that our protocols achieve a 1.3-5.6\times speedup in running time and 2.1-11.8× shrinking in communication cost, depending on set sizes and network environments.
- 14 April 2024
- Published by Springer Nature
- p. 387-416
Private Set Operations from Multi-query Reverse Private Membership Test
- 14 April 2024
- Published by Springer Nature
- p. 387-416
Private Set Operations from Multi-query Reverse Private Membership Test
- 19 December 2023
- Published by Springer Nature
- p. 208-242
Sigma Protocols from Verifiable Secret Sharing and Their Applications
- 19 December 2023
- Published by Springer Nature
- p. 208-242
Sigma Protocols from Verifiable Secret Sharing and Their Applications