Xinyu Feng
Research Subjects
Research Interests
Xinyu Feng has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Cong Li
Peking University
3 shared publications - Qingni Shen
Peking University
3 shared publications - Zhonghai Wu
School of Software and Microelectronics, Peking University, Beijing, China
3 shared publications Anyang Hu
School of Software and Microelectronics, Peking University, Beijing, China
1 shared publicationCong Li
1 shared publication- Hao He
InsightOne Tech Co, Ltd, China
1 shared publication
Latest Publications
- 10 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. PP (15455971) , 1-17
Identity-Based Encryption with Equality Test and Flexible Time-Based Authorization for Cloud Computing
Identity-based encryption with equality test (IBEET) extends identity-based encryption to support the comparison between messages in two distinct ciphertexts associated with different identities. Nevertheless, nearly all of the previous IBEET schemes have the problem that once the trapdoor is sent to the cloud server, it becomes uncontrollable. Meanwhile, the only existing IBEET scheme coping with this problem, namely IBEET with datestamp-based authorization (IBEET-DBA), suffers from the following flaws. (1) A trapdoor merely expresses a single time interval, which is inexpressive. (2) It is inflexible due to only supporting limited types of authorization. (3) It is merely proven secure in the random oracle model, which has been pointed out that it may lead to security risks in practicality. Considering the aforementioned problems, we propose an IBEET with flexible time-based authorization (IBEET-FTBA) scheme, supporting wildcards and putting no constraint on authorization types. We prove our scheme secure against adaptive chosen-ciphertext attacks in the standard model. Subsequently, we give a detailed theoretical analysis of our IBEET-FTBA construction and the main existing IBEET ones. Furthermore, we implement ours and the IBEET-DBA construction as a benchmark, and conduct numerous experiments. Both results demonstrate that ours has better performance in the scenario of multiple time intervals.
- 10 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. PP (15455971) , 1-17
Identity-Based Encryption with Equality Test and Flexible Time-Based Authorization for Cloud Computing
Identity-based encryption with equality test (IBEET) extends identity-based encryption to support the comparison between messages in two distinct ciphertexts associated with different identities. Nevertheless, nearly all of the previous IBEET schemes have the problem that once the trapdoor is sent to the cloud server, it becomes uncontrollable. Meanwhile, the only existing IBEET scheme coping with this problem, namely IBEET with datestamp-based authorization (IBEET-DBA), suffers from the following flaws. (1) A trapdoor merely expresses a single time interval, which is inexpressive. (2) It is inflexible due to only supporting limited types of authorization. (3) It is merely proven secure in the random oracle model, which has been pointed out that it may lead to security risks in practicality. Considering the aforementioned problems, we propose an IBEET with flexible time-based authorization (IBEET-FTBA) scheme, supporting wildcards and putting no constraint on authorization types. We prove our scheme secure against adaptive chosen-ciphertext attacks in the standard model. Subsequently, we give a detailed theoretical analysis of our IBEET-FTBA construction and the main existing IBEET ones. Furthermore, we implement ours and the IBEET-DBA construction as a benchmark, and conduct numerous experiments. Both results demonstrate that ours has better performance in the scenario of multiple time intervals.
- 17 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 3849-3861
Identity-Based Chameleon Hashes in the Standard Model for Mobile Devices
Online/offline identity-based signature (OO-IBS) is a versatile cryptographic tool to provide the message authentication and integrity in mobile devices, since it lightens the computational burden after the signer receiving the message and eliminates the overhead of certificate management. It has several valuable applications, for instance, wireless sensor networks. Identity-based chameleon hash (IB-CH), as an alternative building block to construct OO-IBS, has been explored in numerous literatures. Nevertheless, there still exist two major issues. (1) Nearly all of the previous IB-CH schemes with weak collision-resistance (W-CollRes) are with random oracles, which may lead to security risks in practicality. The only IB-CH scheme in the standard model suffers from the large size of public parameters and inefficient setup process. (2) The only IB-CH scheme without key exposure also relies on random oracles. In this paper, we propose two novel IB-CH schemes in the standard model. The first scheme is adaptive identity, W-CollRes secure and efficient, significantly reducing the computation costs of all algorithms and the size of public parameters compared with the existing scheme in the standard model. The second scheme is the first IB-CH achieving key exposure freeness without random oracles. Both theoretical and experimental analyses demonstrate the good performance of our proposed schemes. Furthermore, we apply our schemes to optimizing the existing generic OO-IBS construction. The optimized generic constructions reduce computational overhead by 50.0% in the online phase and enable the hash value/signature tuple generated in the offline phase to be reusable, respectively.
- 17 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 3849-3861
Identity-Based Chameleon Hashes in the Standard Model for Mobile Devices
Online/offline identity-based signature (OO-IBS) is a versatile cryptographic tool to provide the message authentication and integrity in mobile devices, since it lightens the computational burden after the signer receiving the message and eliminates the overhead of certificate management. It has several valuable applications, for instance, wireless sensor networks. Identity-based chameleon hash (IB-CH), as an alternative building block to construct OO-IBS, has been explored in numerous literatures. Nevertheless, there still exist two major issues. (1) Nearly all of the previous IB-CH schemes with weak collision-resistance (W-CollRes) are with random oracles, which may lead to security risks in practicality. The only IB-CH scheme in the standard model suffers from the large size of public parameters and inefficient setup process. (2) The only IB-CH scheme without key exposure also relies on random oracles. In this paper, we propose two novel IB-CH schemes in the standard model. The first scheme is adaptive identity, W-CollRes secure and efficient, significantly reducing the computation costs of all algorithms and the size of public parameters compared with the existing scheme in the standard model. The second scheme is the first IB-CH achieving key exposure freeness without random oracles. Both theoretical and experimental analyses demonstrate the good performance of our proposed schemes. Furthermore, we apply our schemes to optimizing the existing generic OO-IBS construction. The optimized generic constructions reduce computational overhead by 50.0% in the online phase and enable the hash value/signature tuple generated in the offline phase to be reusable, respectively.
- 27 February 2025
- Published by Elsevier in Computer Networks
- Vol. 262
A lattice-based privacy-preserving decentralized multi-party payment scheme
- 27 February 2025
- Published by Elsevier in Computer Networks
- Vol. 262
A lattice-based privacy-preserving decentralized multi-party payment scheme
- 25 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (4) , 4306-4308
On the Security of Secure Keyword Search and Data Sharing Mechanism for Cloud Computing
Nearly all of the previous attribute-based proxy re-encryption (ABPRE) schemes cannot support keyword search and keyword updating without the aid of private key generator (PKG) simultaneously. To resolve this problem, recently in IEEE Transactions on Dependable and Secure Computing (doi: 10.1109/TDSC.2020.2963978), Ge et al. proposed a ciphertext-policy ABPRE scheme with keyword search, dubbed CPAB-KSDS, which supports keyword updating without communicating with PKG. It also achieves indistinguishability against chosen-ciphertext attack (IND-CCA) security and indistinguishability against chosen-keyword attack (INDCKA) security in the random oracle model. In this paper, we carefully analyze the security of Ge et al.’s CPAB-KSDS scheme and find that they did not give a correct reduction from IND-CKA security of theirs to the underlying cryptographic assumption. Furthermore, we also give a concrete attack on IND-CKA security of the CPAB-KSDS scheme. Therefore, it fails to achieve IND-CKA security they claimed, which is an essential security requirement for the encryption scheme with keyword search.
- 25 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 21 (4) , 4306-4308
On the Security of Secure Keyword Search and Data Sharing Mechanism for Cloud Computing
Nearly all of the previous attribute-based proxy re-encryption (ABPRE) schemes cannot support keyword search and keyword updating without the aid of private key generator (PKG) simultaneously. To resolve this problem, recently in IEEE Transactions on Dependable and Secure Computing (doi: 10.1109/TDSC.2020.2963978), Ge et al. proposed a ciphertext-policy ABPRE scheme with keyword search, dubbed CPAB-KSDS, which supports keyword updating without communicating with PKG. It also achieves indistinguishability against chosen-ciphertext attack (IND-CCA) security and indistinguishability against chosen-keyword attack (INDCKA) security in the random oracle model. In this paper, we carefully analyze the security of Ge et al.’s CPAB-KSDS scheme and find that they did not give a correct reduction from IND-CKA security of theirs to the underlying cryptographic assumption. Furthermore, we also give a concrete attack on IND-CKA security of the CPAB-KSDS scheme. Therefore, it fails to achieve IND-CKA security they claimed, which is an essential security requirement for the encryption scheme with keyword search.
- Open Access
- 9 December 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 18 (3) , 1-20
EFMVFL: An Efficient and Flexible Multi-party Vertical Federated Learning without a Third Party
Federated learning (FL) is a machine learning setting which allows multiple participants collaboratively to train a model under the orchestration of a server without disclosing their local data. Vertical federated learning (VFL) is a special structure in FL. It handles the situation where participants have the same ID space but different feature spaces. In order to guarantee the security and privacy of the local data of each participant, homomorphic encryption (HE) is often used to transmit intermediate parameters or data during the training process. In most VFL frameworks, a trusted third-party server is necessary because the plaintexts of the parameters need to be revealed for the computation. However, it is hard to find such a credible entity in the real world. Existing methods for solving this problem are either communication-intensive or unsuitable for multi-party scenarios. By combining secret sharing (SS) and HE, we propose a novel VFL framework without any trusted third parties called EFMVFL. It allows intermediate parameters to be transmitted among multiple parties without revealing the plaintexts. EFMVFL is applicable to generalized linear models (GLMs) and supports flexible expansion to multiple participants. Extensive experiments under Logistic Regression and Poisson Regression show that our framework is outstanding in communication (reduced by 3.2×– 6.8×) and efficiency (accelerated by 1.6×– 3.1×).
- 9 December 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 18 (3) , 1-20
Open AccessEFMVFL: An Efficient and Flexible Multi-party Vertical Federated Learning without a Third Party
Federated learning (FL) is a machine learning setting which allows multiple participants collaboratively to train a model under the orchestration of a server without disclosing their local data. Vertical federated learning (VFL) is a special structure in FL. It handles the situation where participants have the same ID space but different feature spaces. In order to guarantee the security and privacy of the local data of each participant, homomorphic encryption (HE) is often used to transmit intermediate parameters or data during the training process. In most VFL frameworks, a trusted third-party server is necessary because the plaintexts of the parameters need to be revealed for the computation. However, it is hard to find such a credible entity in the real world. Existing methods for solving this problem are either communication-intensive or unsuitable for multi-party scenarios. By combining secret sharing (SS) and HE, we propose a novel VFL framework without any trusted third parties called EFMVFL. It allows intermediate parameters to be transmitted among multiple parties without revealing the plaintexts. EFMVFL is applicable to generalized linear models (GLMs) and supports flexible expansion to multiple participants. Extensive experiments under Logistic Regression and Poisson Regression show that our framework is outstanding in communication (reduced by 3.2×– 6.8×) and efficiency (accelerated by 1.6×– 3.1×).
- 19 July 2019
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 34 (4) , 901-923
A Lightweight Dynamic Enforcement of Privacy Protection for Android
- 19 July 2019
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 34 (4) , 901-923
A Lightweight Dynamic Enforcement of Privacy Protection for Android
- Open Access
- 16 June 2013
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 48 (6) , 459-470
Modular verification of linearizability with non-fixed linearization points
Locating linearization points (LPs) is an intuitive approach for proving linearizability, but it is difficult to apply the idea in Hoare-style logic for formal program verification, especially for verifying algorithms whose LPs cannot be statically located in the code. In this paper, we propose a program logic with a lightweight instrumentation mechanism which can verify algorithms with non-fixed LPs, including the most challenging ones that use the helping mechanism to achieve lock-freedom (as in HSY elimination-based stack), or have LPs depending on unpredictable future executions (as in the lazy set algorithm), or involve both features. We also develop a thread-local simulation as the meta-theory of our logic, and show it implies contextual refinement, which is equivalent to linearizability. Using our logic we have successfully verified various classic algorithms, some of which are used in the java.util.concurrent package.
- 16 June 2013
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 48 (6) , 459-470
Open AccessModular verification of linearizability with non-fixed linearization points
Locating linearization points (LPs) is an intuitive approach for proving linearizability, but it is difficult to apply the idea in Hoare-style logic for formal program verification, especially for verifying algorithms whose LPs cannot be statically located in the code. In this paper, we propose a program logic with a lightweight instrumentation mechanism which can verify algorithms with non-fixed LPs, including the most challenging ones that use the helping mechanism to achieve lock-freedom (as in HSY elimination-based stack), or have LPs depending on unpredictable future executions (as in the lazy set algorithm), or involve both features. We also develop a thread-local simulation as the meta-theory of our logic, and show it implies contextual refinement, which is equivalent to linearizability. Using our logic we have successfully verified various classic algorithms, some of which are used in the java.util.concurrent package.
- 25 September 2008
- Published by Springer Nature
- p. 54-69
Combining Domain-Specific and Foundational Logics to Verify Complete Software Systems
- 25 September 2008
- Published by Springer Nature
- p. 54-69
Combining Domain-Specific and Foundational Logics to Verify Complete Software Systems