Yupu Hu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yupu Hu has a total of 83 co-authors. Here are the top co-authors by number of shared publications:
- Baocang Wang
The State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an 710071, China
8 shared publications - Fagen Li
University of Electronic Science and Technology of China
7 shared publications - Fengrong Zhang
School of Cyber Engineering, Xidian University, Xian, China
5 shared publications Ping Wei
Engineering College of APF(Engineering College of APF,Engineering College of the APF),Xi'an,China
5 shared publicationsXiaoyuan Yang
Engineering College of APF(Engineering College of APF,Engineering College of the APF),Xi'an,China
5 shared publicationsXuanwu Zhou
5 shared publications
Latest Publications
- 31 December 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 36 (06) , 867-883
Conditionally accepted sampling: AB15 IO scheme with smaller deviation ratio
Indistinguishable Obfuscation (IO) is a very critical cryptography primitive. It can be used to construct almost any other cryptography schemes. AB15 indistinguishability obfuscation scheme is the first practical scheme. In order to avoid the ideal generator can be searched, authors of AB15 IO scheme set it to a relatively large size (In fact, such ideal generator should be a “small prime”). It causes the ratio of the standard deviation of Gaussian sampling and the size of ideal generator smaller. We call the ratio as “deviation ratio”. In this paper, we point that direct sampling and smaller deviation ratio makes the scheme insecure. A searching attack can reveal hidden coefficients of original boolean circuit from its obfuscator. Firstly, the attacker searches those level-0 encodings of 0, hoping that the code value is 0. Such event happens with probability [ ] or [ ], where [ ] as the deviation ratio. By a series of searching, a weak obfuscator with prime module can be obtained. Then, the attacker can obtain all hidden coefficients of original boolean circuit. Take n as the dimension of independent variable, m as the dimension of coefficient of original boolean circuit. For Simple Obfuscator, searching time is [ ], and the probability that one successfully reveals hidden coefficients of original boolean circuit is about [ ]. For Robust Obfuscator, searching time and success probability are respectively [ ] and [ ]. At last, we present a revised scheme with “conditionally accepted sampling” and smaller deviation ratio. The new scheme avoids above mentioned attack and greatly reduce the size complexity.
- 31 December 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 36 (06) , 867-883
Conditionally accepted sampling: AB15 IO scheme with smaller deviation ratio
Indistinguishable Obfuscation (IO) is a very critical cryptography primitive. It can be used to construct almost any other cryptography schemes. AB15 indistinguishability obfuscation scheme is the first practical scheme. In order to avoid the ideal generator can be searched, authors of AB15 IO scheme set it to a relatively large size (In fact, such ideal generator should be a “small prime”). It causes the ratio of the standard deviation of Gaussian sampling and the size of ideal generator smaller. We call the ratio as “deviation ratio”. In this paper, we point that direct sampling and smaller deviation ratio makes the scheme insecure. A searching attack can reveal hidden coefficients of original boolean circuit from its obfuscator. Firstly, the attacker searches those level-0 encodings of 0, hoping that the code value is 0. Such event happens with probability [ ] or [ ], where [ ] as the deviation ratio. By a series of searching, a weak obfuscator with prime module can be obtained. Then, the attacker can obtain all hidden coefficients of original boolean circuit. Take n as the dimension of independent variable, m as the dimension of coefficient of original boolean circuit. For Simple Obfuscator, searching time is [ ], and the probability that one successfully reveals hidden coefficients of original boolean circuit is about [ ]. For Robust Obfuscator, searching time and success probability are respectively [ ] and [ ]. At last, we present a revised scheme with “conditionally accepted sampling” and smaller deviation ratio. The new scheme avoids above mentioned attack and greatly reduce the size complexity.
- 4 January 2024
- Published by Springer Nature
- p. 387-403
Cloud-Aided Scalable Revocable IBE with Ciphertext Update from Lattices in the Random Oracle Model
- 4 January 2024
- Published by Springer Nature
- p. 387-403
Cloud-Aided Scalable Revocable IBE with Ciphertext Update from Lattices in the Random Oracle Model
- Open Access
- 1 January 2024
- Published by Institution of Engineering and Technology (IET) in IET Information Security
- Vol. 2024 (1)
Dual‐Mode Encryption for UC‐Secure String OT from Learning with Errors
Universal composability (UC) is a primary security flavor for designing oblivious transfer (OT) due to its advantage of arbitrary composition. However, the study of UC‐secure OT over lattices is still far behind compared with constructions over prequantum assumptions. Relying on the learning with errors (LWE) assumption, Quach proposes a dual‐mode encryption scheme (SCN’20) for deriving a two‐round OT whose security is provably UC‐secure in the common reference string (CRS) model. Due to its use of a randomized rounding function proposed by Benhamouda et al. (PKC’18), this OT can only be limited to transmitting single‐bit messages. Therefore, conducting trivial repetitions of Quach’s OT when transmitting multibit strings would be very costly. In this work, we put forward a modified dual‐mode encryption cryptosystem under the decisional LWE assumption, from which we can derive a UC‐secure string OT with both full‐fledged dual‐mode security and better efficiency on transmitting strings. The key technique we adopt is a key reconciliation scheme proposed by Jiang et al. (PKC’20), which is utilized to extend the single‐bit symmetric encryption key (produced by the aforementioned rounding function) to a multibit case. Through a comprehensive performance analysis, we demonstrate that our proposal can indeed strike a balance between security and efficiency.
- 1 January 2024
- Published by Institution of Engineering and Technology (IET) in IET Information Security
- Vol. 2024 (1)
Open AccessDual‐Mode Encryption for UC‐Secure String OT from Learning with Errors
Universal composability (UC) is a primary security flavor for designing oblivious transfer (OT) due to its advantage of arbitrary composition. However, the study of UC‐secure OT over lattices is still far behind compared with constructions over prequantum assumptions. Relying on the learning with errors (LWE) assumption, Quach proposes a dual‐mode encryption scheme (SCN’20) for deriving a two‐round OT whose security is provably UC‐secure in the common reference string (CRS) model. Due to its use of a randomized rounding function proposed by Benhamouda et al. (PKC’18), this OT can only be limited to transmitting single‐bit messages. Therefore, conducting trivial repetitions of Quach’s OT when transmitting multibit strings would be very costly. In this work, we put forward a modified dual‐mode encryption cryptosystem under the decisional LWE assumption, from which we can derive a UC‐secure string OT with both full‐fledged dual‐mode security and better efficiency on transmitting strings. The key technique we adopt is a key reconciliation scheme proposed by Jiang et al. (PKC’20), which is utilized to extend the single‐bit symmetric encryption key (produced by the aforementioned rounding function) to a multibit case. Through a comprehensive performance analysis, we demonstrate that our proposal can indeed strike a balance between security and efficiency.
- 7 November 2022
- Published by Springer Nature
- p. 71-87
Simplified Server-Aided Revocable Identity-Based Encryption from Lattices
- 7 November 2022
- Published by Springer Nature
- p. 71-87
Simplified Server-Aided Revocable Identity-Based Encryption from Lattices
- 26 August 2022
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 90 (10) , 2419-2448
Improved key-recovery attacks on reduced-round WEM-8
- 26 August 2022
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 90 (10) , 2419-2448
Improved key-recovery attacks on reduced-round WEM-8
- Open Access
- 1 February 2022
- Published by Hindawi Limited in Security and Communication Networks
- Vol. 2022, 1-7
Module-LWE-Based Key Exchange Protocol Using Error Reconciliation Mechanism
Lattice-based key exchange protocols have attracted tremendous attention for its post-quantum security. In this work, we construct a Module-LWE-based key exchange protocol using Peikert’s error reconciliation mechanism. Compared with Kyber.KE, our key exchange protocol reduces the total communication cost by 96-byte, i.e., 3.2%6.1%, under the different parameter sets, and without reducing the post-quantum security levels. Moreover, our key exchange protocol slightly reduces the probability of session key agreement failure and the time consumed by modular multiplication of numbers and ring elements by approximately 30%. Thus, the key exchange protocol in this paper is more suitable for the lightweight communication systems.
- 1 February 2022
- Published by Hindawi Limited in Security and Communication Networks
- Vol. 2022, 1-7
Open AccessModule-LWE-Based Key Exchange Protocol Using Error Reconciliation Mechanism
Lattice-based key exchange protocols have attracted tremendous attention for its post-quantum security. In this work, we construct a Module-LWE-based key exchange protocol using Peikert’s error reconciliation mechanism. Compared with Kyber.KE, our key exchange protocol reduces the total communication cost by 96-byte, i.e., 3.2%6.1%, under the different parameter sets, and without reducing the post-quantum security levels. Moreover, our key exchange protocol slightly reduces the probability of session key agreement failure and the time consumed by modular multiplication of numbers and ring elements by approximately 30%. Thus, the key exchange protocol in this paper is more suitable for the lightweight communication systems.
- 7 January 2022
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 15 (2) , 1076-1089
Updatable privacy-preserving $\textit{K}$-nearest neighbor query in location-based s-erviceThe \(\textit{K}\)-nearest neighbor (\(\textit{K}\)-NN) query is an important query in location-based service (LBS), which can query the nearest k points to a given point, and provide some convenient services such as interest recommendations. Hence the privacy protection issue of \(\textit{K}\)-NN query has been a popular research area, protecting the information of queries and the queried results, especially in the information era. However, most of existing schemes fail to consider the privacy protection of location points already stored on servers. Or some schemes support no update of location points. In this paper, we present an updatable and privacy-preserving \(\textit{K}\)-NN query scheme to address the above two issues. Concretely, our scheme utilizes the \(\textit{K}\)D-tree (\(\textit{K}\)-Dimensional tree) to store the location points of data owners in location service provider and encrypts the points with a distributed double-trapdoor public-key cryptosystem. Then, based on the Ciphertext Comparison Protocol and Ciphertext Euclidean Distance Calculation Protocol, our scheme can protect the privacy of location and query contents. Experimental analyses show our proposal supports some new location points for a fixed location service provider. Moreover, the queried results show a high accuracy of more than 95%.- 7 January 2022
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 15 (2) , 1076-1089
Updatable privacy-preserving $\textit{K}$-nearest neighbor query in location-based s-erviceThe \(\textit{K}\)-nearest neighbor (\(\textit{K}\)-NN) query is an important query in location-based service (LBS), which can query the nearest k points to a given point, and provide some convenient services such as interest recommendations. Hence the privacy protection issue of \(\textit{K}\)-NN query has been a popular research area, protecting the information of queries and the queried results, especially in the information era. However, most of existing schemes fail to consider the privacy protection of location points already stored on servers. Or some schemes support no update of location points. In this paper, we present an updatable and privacy-preserving \(\textit{K}\)-NN query scheme to address the above two issues. Concretely, our scheme utilizes the \(\textit{K}\)D-tree (\(\textit{K}\)-Dimensional tree) to store the location points of data owners in location service provider and encrypts the points with a distributed double-trapdoor public-key cryptosystem. Then, based on the Ciphertext Comparison Protocol and Ciphertext Euclidean Distance Calculation Protocol, our scheme can protect the privacy of location and query contents. Experimental analyses show our proposal supports some new location points for a fixed location service provider. Moreover, the queried results show a high accuracy of more than 95%.- 3 January 2022
- Published by Springer Nature in Wireless Networks
- Vol. 28 (1) , 303-317
Privacy-preserving association rule mining based on electronic medical system
Privacy protection during collaborative distributed association rule mining is an important research, which has been widely used in market prediction, medical research and other fields. In medical research, Domadiya et al. (Sadhana 43(8):127, 2018) focused on mining association rules from horizontally distributed healthcare data to diagnose heart disease. They claimed they proposed a more effective privacy-preserving distributed association rule mining (PPDARM) scheme. However, a serious security scrutiny of the scheme is performed, and we find it vulnerable to protect the support of the itemsets from any electronic health record (EHR) system, which is the most important parameter Domadiya et al. tried to protect. In this paper, we first present the cryptanalysis of the PPDARM scheme proposed by Domadiya et al. as well as some revised performance analyses. Then a new PPDARM scheme with less interactions is proposed to avert the shortcomings of Domadiya et al., using the homomorphic properties of the distributed Paillier cryptosystem to accomplish the cooperative computation. Our scheme allows the directed authority (miner) to obtain the final results rather than all cooperative EHR systems, in case of semi-honest but pseudo EHR systems. Moreover, security analysis and performance evaluation demonstrate our proposal is efficient and feasible.
- 3 January 2022
- Published by Springer Nature in Wireless Networks
- Vol. 28 (1) , 303-317
Privacy-preserving association rule mining based on electronic medical system
Privacy protection during collaborative distributed association rule mining is an important research, which has been widely used in market prediction, medical research and other fields. In medical research, Domadiya et al. (Sadhana 43(8):127, 2018) focused on mining association rules from horizontally distributed healthcare data to diagnose heart disease. They claimed they proposed a more effective privacy-preserving distributed association rule mining (PPDARM) scheme. However, a serious security scrutiny of the scheme is performed, and we find it vulnerable to protect the support of the itemsets from any electronic health record (EHR) system, which is the most important parameter Domadiya et al. tried to protect. In this paper, we first present the cryptanalysis of the PPDARM scheme proposed by Domadiya et al. as well as some revised performance analyses. Then a new PPDARM scheme with less interactions is proposed to avert the shortcomings of Domadiya et al., using the homomorphic properties of the distributed Paillier cryptosystem to accomplish the cooperative computation. Our scheme allows the directed authority (miner) to obtain the final results rather than all cooperative EHR systems, in case of semi-honest but pseudo EHR systems. Moreover, security analysis and performance evaluation demonstrate our proposal is efficient and feasible.
- 31 August 2021
- Published by Hindawi Limited in International Journal of Intelligent Systems
- Vol. 37 (1) , 568-595
Privacy‐preserving convolutional neural network prediction with low latency and lightweight users
Convolutional neural networks (CNNs) have excellent and extensive applications in image recognition. With the continuous exploitation of data value and the proliferation of machine learning-as-a-service, convolutional neural network prediction schemes on privacy preservation have been introduced one after another, which makes much more attention focused on the privacy leakage and services offered to be efficient and light. Therefore, how to improve the convolutional neural prediction scheme on the premise of privacy preservation turns out to be an imperative research issue. In this paper, we propose a privacy-preserving convolutional neural network prediction scheme (PCP-LL) that supports low latency and lightweight users. The scheme starts from the perspective of lossless accuracy from underlying networks. First, we construct a secure activation function computing protocol (SActF) utilizing a commodity-based secure comparison protocol, which reduces the complexity and latency during the activation function computing under ciphertexts compared with common schemes. Second, to further support lightweight users, we introduce a secure output layer protocol (SOut) that enables users to obtain the prediction results without extra decryption after simple operations. Then, the scheme adopts the distributed two trapdoors public-key cryptosystem (DT-PKC) to achieve both data and model security, which well avoids security issues especially such as wiretapping by semi-honest participants commonly in secret sharing schemes. Finally, through relevant evaluations, the scheme not only achieves privacy preservation and low latency, but also supports lightweight users.
- 31 August 2021
- Published by Hindawi Limited in International Journal of Intelligent Systems
- Vol. 37 (1) , 568-595
Privacy‐preserving convolutional neural network prediction with low latency and lightweight users
Convolutional neural networks (CNNs) have excellent and extensive applications in image recognition. With the continuous exploitation of data value and the proliferation of machine learning-as-a-service, convolutional neural network prediction schemes on privacy preservation have been introduced one after another, which makes much more attention focused on the privacy leakage and services offered to be efficient and light. Therefore, how to improve the convolutional neural prediction scheme on the premise of privacy preservation turns out to be an imperative research issue. In this paper, we propose a privacy-preserving convolutional neural network prediction scheme (PCP-LL) that supports low latency and lightweight users. The scheme starts from the perspective of lossless accuracy from underlying networks. First, we construct a secure activation function computing protocol (SActF) utilizing a commodity-based secure comparison protocol, which reduces the complexity and latency during the activation function computing under ciphertexts compared with common schemes. Second, to further support lightweight users, we introduce a secure output layer protocol (SOut) that enables users to obtain the prediction results without extra decryption after simple operations. Then, the scheme adopts the distributed two trapdoors public-key cryptosystem (DT-PKC) to achieve both data and model security, which well avoids security issues especially such as wiretapping by semi-honest participants commonly in secret sharing schemes. Finally, through relevant evaluations, the scheme not only achieves privacy preservation and low latency, but also supports lightweight users.
- Open Access
- 28 April 2021
- Published by Wiley in Security and Communication Networks
- Vol. 2021, 1-14
Efficient Private Information Retrieval Protocol with Homomorphically Computing Univariate Polynomials
Private information retrieval (PIR) protocol is a powerful cryptographic tool and has received considerable attention in recent years as it can not only help users to retrieve the needed data from database servers but also protect them from being known by the servers. Although many PIR protocols have been proposed, it remains an open problem to design an efficient PIR protocol whose communication overhead is irrelevant to the database size . In this paper, to answer this open problem, we present a new communication-efficient PIR protocol based on our proposed single-ciphertext fully homomorphic encryption (FHE) scheme, which supports unlimited computations with single variable over a single ciphertext even without access to the secret key. Specifically, our proposed PIR protocol is characterized by combining our single-ciphertext FHE with Lagrange interpolating polynomial technique to achieve better communication efficiency. Security analyses show that the proposed PIR protocol can efficiently protect the privacy of the user and the data in the database. In addition, both theoretical analyses and experimental evaluations are conducted, and the results indicate that our proposed PIR protocol is also more efficient and practical than previously reported ones. To the best of our knowledge, our proposed protocol is the first PIR protocol achieving communication efficiency on the user side, irrelevant to the database size .
- 28 April 2021
- Published by Wiley in Security and Communication Networks
- Vol. 2021, 1-14
Open AccessEfficient Private Information Retrieval Protocol with Homomorphically Computing Univariate Polynomials
Private information retrieval (PIR) protocol is a powerful cryptographic tool and has received considerable attention in recent years as it can not only help users to retrieve the needed data from database servers but also protect them from being known by the servers. Although many PIR protocols have been proposed, it remains an open problem to design an efficient PIR protocol whose communication overhead is irrelevant to the database size . In this paper, to answer this open problem, we present a new communication-efficient PIR protocol based on our proposed single-ciphertext fully homomorphic encryption (FHE) scheme, which supports unlimited computations with single variable over a single ciphertext even without access to the secret key. Specifically, our proposed PIR protocol is characterized by combining our single-ciphertext FHE with Lagrange interpolating polynomial technique to achieve better communication efficiency. Security analyses show that the proposed PIR protocol can efficiently protect the privacy of the user and the data in the database. In addition, both theoretical analyses and experimental evaluations are conducted, and the results indicate that our proposed PIR protocol is also more efficient and practical than previously reported ones. To the best of our knowledge, our proposed protocol is the first PIR protocol achieving communication efficiency on the user side, irrelevant to the database size .