Yaohua Lu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yaohua Lu has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
Gangyi Ding
School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, People's Republic of China
1 shared publication- Gangyi Ding
School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China
1 shared publication - Gangyi Ding
School of Computer Science, Beijing Institute of Technology, Beijing, China
1 shared publication
Latest Publications
- 14 December 2024
- Published by World Scientific Pub Co Pte Ltd in Modern Physics Letters A
- Vol. 39 (38)
Quantum private set intersection with correlated sum using single photons
Secure multi-party computation (SMC) enables multiple parties to collaboratively perform computational tasks without revealing their private data. A specific application scenario within SMC is Private Set Intersection with Correlated Sum (PSI-CS), where two participating parties compute the sum of associated elements in their intersection while preserving the privacy of their individual sets. This problem arises in various contexts, including calculating conversion amounts between suppliers and platforms, such as advertising conversion amounts and agency business conversion amounts. The paper proposes a protocol that employs quantum single-photon technology to compute the PSI-CS, provides four technical solutions suitable for various scenarios ranging from small to large data volumes, sparse to dense datasets, and without revealing the cardinality of the intersection. Additionally, the method extends to computing the union set with correlated sums. We experimentally validate the proposed protocol, conduct correctness and security analyses, and demonstrate its practical significance and application value. By utilizing single-photon technology, quantum gate operations, and measurements become more accessible, simplifying the protocol’s implementation. Notably, our approach provides unconditional security against quantum computational attacks, representing a substantial improvement in both efficiency and practical applicability compared to classical domain protocols.
- 14 December 2024
- Published by World Scientific Pub Co Pte Ltd in Modern Physics Letters A
- Vol. 39 (38)
Quantum private set intersection with correlated sum using single photons
Secure multi-party computation (SMC) enables multiple parties to collaboratively perform computational tasks without revealing their private data. A specific application scenario within SMC is Private Set Intersection with Correlated Sum (PSI-CS), where two participating parties compute the sum of associated elements in their intersection while preserving the privacy of their individual sets. This problem arises in various contexts, including calculating conversion amounts between suppliers and platforms, such as advertising conversion amounts and agency business conversion amounts. The paper proposes a protocol that employs quantum single-photon technology to compute the PSI-CS, provides four technical solutions suitable for various scenarios ranging from small to large data volumes, sparse to dense datasets, and without revealing the cardinality of the intersection. Additionally, the method extends to computing the union set with correlated sums. We experimentally validate the proposed protocol, conduct correctness and security analyses, and demonstrate its practical significance and application value. By utilizing single-photon technology, quantum gate operations, and measurements become more accessible, simplifying the protocol’s implementation. Notably, our approach provides unconditional security against quantum computational attacks, representing a substantial improvement in both efficiency and practical applicability compared to classical domain protocols.
- Open Access
- 14 August 2024
- Published by IOP Publishing in Physica Scripta
- Vol. 99 (9) , 095111
A novel quantum security multi-party extremum protocol in a d-dimensional quantum system
Secure multi-party extremum computation (SMEC) is a specific application scenario of secure multi-party computation, which allows multiple participants to compute the extremum of data without disclosing private information. The extremum includes maximum, minimum, sum of extremums, and difference of extremums. SMEC has wide applications in financial transactions, market analysis, sports events, healthcare, etc. Current protocol research mainly exists in the classical domain and cannot withstand quantum computing attacks. To address this issue, we propose a novel QSME protocol based on a d-dimensional quantum system, capable of computing the maximum and minimum values among multi-party data under unconditional security, and can compute the sum and difference of extremums without disclosing the maximum and minimum values, to adapt to complex application scenarios. The article proposes a coding method for a d-dimensional quantum system to further enhance security, provides correctness analysis, security analysis, robustness analysis, and comparative analysis, and proposes an experimental method for a d-dimensional quantum system to verify the effectiveness of the protocol, demonstrating strong practicality.
- 14 August 2024
- Published by IOP Publishing in Physica Scripta
- Vol. 99 (9) , 095111
Open AccessA novel quantum security multi-party extremum protocol in a d-dimensional quantum system
Secure multi-party extremum computation (SMEC) is a specific application scenario of secure multi-party computation, which allows multiple participants to compute the extremum of data without disclosing private information. The extremum includes maximum, minimum, sum of extremums, and difference of extremums. SMEC has wide applications in financial transactions, market analysis, sports events, healthcare, etc. Current protocol research mainly exists in the classical domain and cannot withstand quantum computing attacks. To address this issue, we propose a novel QSME protocol based on a d-dimensional quantum system, capable of computing the maximum and minimum values among multi-party data under unconditional security, and can compute the sum and difference of extremums without disclosing the maximum and minimum values, to adapt to complex application scenarios. The article proposes a coding method for a d-dimensional quantum system to further enhance security, provides correctness analysis, security analysis, robustness analysis, and comparative analysis, and proposes an experimental method for a d-dimensional quantum system to verify the effectiveness of the protocol, demonstrating strong practicality.
- Open Access
Quantum Secure Multi-Party Summation with Graph State
Quantum secure multi-party summation (QSMS) is a fundamental problem in quantum secure multi-party computation (QSMC), wherein multiple parties compute the sum of their data without revealing them. This paper proposes a novel QSMS protocol based on graph state, which offers enhanced security, usability, and flexibility compared to existing methods. The protocol leverages the structural advantages of graph state and employs random graph state structures and random encryption gate operations to provide stronger security. Additionally, the stabilizer of the graph state is utilized to detect eavesdroppers and channel noise without the need for decoy bits. The protocol allows for the arbitrary addition and deletion of participants, enabling greater flexibility. Experimental verification is conducted to demonstrate the security, effectiveness, and practicality of the proposed protocols. The correctness and security of the protocols are formally proven. The QSMS method based on graph state introduces new opportunities for QSMC. It highlights the potential of leveraging quantum graph state technology to securely and efficiently solve various multi-party computation problems.
Open AccessQuantum Secure Multi-Party Summation with Graph State
Quantum secure multi-party summation (QSMS) is a fundamental problem in quantum secure multi-party computation (QSMC), wherein multiple parties compute the sum of their data without revealing them. This paper proposes a novel QSMS protocol based on graph state, which offers enhanced security, usability, and flexibility compared to existing methods. The protocol leverages the structural advantages of graph state and employs random graph state structures and random encryption gate operations to provide stronger security. Additionally, the stabilizer of the graph state is utilized to detect eavesdroppers and channel noise without the need for decoy bits. The protocol allows for the arbitrary addition and deletion of participants, enabling greater flexibility. Experimental verification is conducted to demonstrate the security, effectiveness, and practicality of the proposed protocols. The correctness and security of the protocols are formally proven. The QSMS method based on graph state introduces new opportunities for QSMC. It highlights the potential of leveraging quantum graph state technology to securely and efficiently solve various multi-party computation problems.