arXiv:1702.04420

Quantum Privacy-Preserving Data Analytics

Shenggang Ying, Mingsheng Ying, Yuan Feng

Published Feb 14, 2017• 1 citation

Abstract

Data analytics (such as association rule mining and decision tree mining) can discover useful statistical knowledge from a big data set. But protecting the privacy of the data provider and the data user in the process of analytics is a serious issue. Usually, the privacy of both parties cannot be fully protected simultaneously by a classical algorithm. In this paper, we present a quantum protocol for data mining that can much better protect privacy than the known classical algorithms: (1) if both the data provider and the data user are honest, the data user can know nothing about the database except the statistical results, and the data provider can get nearly no information about the results mined by the data user; (2) if the data user is dishonest and tries to disclose private information of the other, she/he will be detected with a high probability; (3) if the data provider tries to disclose the privacy of the data user, she/he cannot get any useful information since the data user hides his privacy among noises.

DOI: 10.48550/arxiv.1702.04420

Related papers

Quantum Privacy-Preserving Data Mining

Shenggang Ying, Mingsheng Ying, Yuan Feng

Data mining is a key technology in big data analytics and it can discover understandable knowledge (patterns) hidden in large data sets. Association rule is one of the most useful knowledge patterns, and a large number of algorithms have been developed in the data mining literature to generate association rules corresponding to different problems and situations. Privacy becomes a vital issue when data mining is used to sensitive data sets like medical records, commercial data sets and national security. In this Letter, we present a quantum protocol for mining association rules on vertically partitioned databases. The quantum protocol can improve the privacy level preserved by known classical protocols and at the same time it can exponentially reduce the computational complexity and communication cost.

arXiv:1512.04009Dec 13, 20152 citations

Quantum Privacy-Preserving Perceptron

Shenggang Ying, Mingsheng Ying, Yuan Feng

With the extensive applications of machine learning, the issue of private or sensitive data in the training examples becomes more and more serious: during the training process, personal information or habits may be disclosed to unexpected persons or organisations, which can cause serious privacy problems or even financial loss. In this paper, we present a quantum privacy-preserving algorithm for machine learning with perceptron. There are mainly two steps to protect original training examples. Firstly when checking the current classifier, quantum tests are employed to detect data user's possible dishonesty. Secondly when updating the current classifier, private random noise is used to protect the original data. The advantages of our algorithm are: (1) it protects training examples better than the known classical methods; (2) it requires no quantum database and thus is easy to implement.

arXiv:1707.09893Jul 31, 20175 citations

Differential Privacy in Quantum Computation

Li Zhou, Mingsheng Ying

More and more quantum algorithms have been designed for solving problems in machine learning, database search and data analytics. An important problem then arises: how privacy can be protected when these algorithms are used on private data? For classical computing, the notion of differential privacy provides a very useful conceptual framework in which a great number of mechanisms that protect privacy by introducing certain noises into algorithms have been successfully developed. This paper defines a notion of differential privacy for quantum information processing. We carefully examine how the mechanisms using three important types of quantum noise, the amplitude/phase damping and depolarizing, can protect differential privacy. A composition theorem is proved that enables us to combine multiple privacy-preserving operations in quantum information processing.

IEEE Computer Security Foundations Workshop (CSFW)Aug 1, 201768 citations

Quantum Private Queries

Vittorio Giovannetti, Seth Lloyd, Lorenzo Maccone

We propose a cheat sensitive quantum protocol to perform a private search on a classical database which is efficient in terms of communication complexity. It allows a user to retrieve an item from the database provider without revealing which item he or she retrieved: if the provider tries to obtain information on the query, the person querying the database can find it out. The protocol ensures also perfect data privacy of the database: the information that the user can retrieve in a single query is bounded and does not depend on the size of the database. With respect to the known (quantum and classical) strategies for private information retrieval, our protocol displays an exponential reduction in communication complexity and in running-time computational complexity.

arXiv:0708.2992Physical Review LettersJun 10, 2008217 citations

Hybrid Quantum Computing and Decision Tree-Based Data Mining for Improved Data Security

K. Sudharson, N. S. Usha, G. Babu +3 more

Data mining and quantum computing have become potent methods for analyzing massive datasets and gaining insightful conclusions. However, conventional techniques for data mining are susceptible to quantum attacks, necessitating the development of quantum-resistant methods like lattice-based cryptography. This research provides a hybrid strategy for better data analysis and security that blends quantum computing with decision tree-based data mining. The suggested algorithm was tested against various datasets, and the findings indicated that it provided substantial protection against quantum assaults while achieving great accuracy and precision in data analysis. On the datasets tested, the suggested algorithm specifically attained an average precision of 95.3% and an accuracy of 96.5%. Additionally, the algorithm resisted quantum attacks, maintaining accuracy and precision subjected to the most extreme quantum attacks. Overall, the evaluation findings show how effective and efficient the suggested hybrid technique is for data analysis and protection, providing a workable answer for practical post-quantum applications.

International Conference on Computing Communication Control and automationAug 18, 202321 citations

A Quantum Private Query Protocol for Enhancing both User and Database Privacy*

Yi‐Hua Zhou, Xuewei Bai, Lei-Lei Li +2 more

Abstract In order to protect the privacy of query user and database, some QKD-based quantum private query (QPQ) protocols were proposed. Unfortunately some of them cannot resist internal attack from database perfectly; some others can ensure better user privacy but require a reduction of database privacy. In this paper, a novel two-way QPQ protocol is proposed to ensure the privacy of both sides of communication. In our protocol, user makes initial quantum states and derives the key bit by comparing initial quantum state and outcome state returned from database by ctrl or shift mode instead of announcing two non-orthogonal qubits as others which may leak part secret information. In this way, not only the privacy of database be ensured but also user privacy is strengthened. Furthermore, our protocol can also realize the security of loss-tolerance, cheat-sensitive, and resisting JM attack etc.

Communications in Theoretical PhysicsJan 1, 20188 citations