Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Efficient Unconditionally Secure Comparison and Privacy Preserving Machine Learning Classification Protocols

Bernardo David, Rafael Dowsley, Raj S. Katti, Anderson C. A. Nascimento

Published Jan 1, 2015• 30 citations
Publisher
DOI
10.1007/978-3-319-26059-4_20

Related papers

An Efficient Privacy-Preserving Comparison Protocol

Tushar Kanti Saha, Takeshi Koshiba

Lecture notes on data engineering and communications technologies•Aug 22, 2017•8 citations

Hybrid Quantum-Classical Computing for Privacy-Preserving Machine Learning on Edge Devices

B. Dinesh, M. Thangamani, B. Paulchamy +3 more

The edge computing environment faces a challenge in maintaining data privacy while performing machine learning tasks. The current solutions for privacy preservation are inefficient or do not provide security guarantees, causing a critical gap in the edge computing environment, which is resource-constrained. The aim of this research work is to design a hybrid quantum-classical computing system that addresses the challenges of privacy preservation and efficiency in machine learning tasks. We design a novel architecture combining variational quantum circuits for secure data encoding with classical neural networks for scalable inference, implemented through federated learning protocols enhanced with quantum differential privacy mechanisms. Experimental evaluation demonstrates a 35% reduction in communication overhead compared to traditional federated learning approaches while maintaining 99.2% classification accuracy across diverse datasets. The quantum-enhanced privacy mechanisms achieve provable security guarantees with information-theoretic bounds, outperforming conventional cryptographic methods by 28% in computational overhead reduction. This hybrid approach establishes a new paradigm for secure and efficient machine learning deployment on edge devices, enabling privacy-preserving artificial intelligence in healthcare, finance, and IoT applications.

IEEE International Conference on Emerging Computing and Intelligent Technologies (ICoECIT)•Jan 28, 2026•0 citations

A Taxonomy of Secure Two-Party Comparison Protocols and Efficient Constructions

Nuttapong Attrapadung, Goichiro Hanaoka, Shinsaku Kiyomoto +2 more

Secure two-party comparison plays a crucial role in many privacy-preserving applications, such as privacy-preserving data mining and machine learning. In particular, the available comparison protocols with the appropriate input/output configuration have a significant impact on the performance of these applications. In this paper, we firstly describe a taxonomy of secure two-party comparison protocols which allows us to describe the different configurations used for these protocols in a systematic manner. This taxonomy leads to a total of 216 types of comparison protocols. We then describe conversions among these types. While these conversions are based on known techniques and have explicitly or implicitly been considered previously, we show that a combination of these conversion techniques can be used to convert a perhaps less-known two-party comparison protocol by Nergiz et al. (IEEE SocialCom 2010) into a very efficient protocol in a configuration where the two parties hold shares of the values being compared, and obtain a share of the comparison result. This setting is often used in multi-party computation protocols, and hence in many privacy-preserving applications as well. We furthermore implement the protocol and measure its performance. Our measurement suggests that the protocol outperforms the previously proposed protocols for this input/output configuration, when off-line pre-computation is not permitted.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Aug 31, 2019•2 citations

Protocol for secure quantum machine learning at a distant place

Jeongho Bang, Seung-Woo Lee, Hyunseok Jeong

arXiv:1504.04929•Quantum Information Processing•Aug 6, 2015•15 citations

A Taxonomy of Secure Two-Party Comparison Protocols and Efficient Constructions

Nuttapong Attrapadung, Goichiro Hanaoka, Shinsaku Kiyomoto +2 more

Secure two-party comparison plays a crucial role in many privacy-preserving applications, such as privacy-preserving data mining and machine learning. In particular, the available comparison protocols with the appropriate input/output configuration have a significant impact on the performance of these applications. In this paper, we firstly describe a taxonomy of secure two-party comparison protocols which allows us to describe the different configurations used for these protocols in a systematic manner. This taxonomy leads to a total of 216 types of comparison protocols.We then describe conversions among these types. While these conversions are based on known techniques and have explicitly or implicitly been considered previously, we show that a combination of these conversion techniques can be used to convert a perhaps less-known two-party comparison protocol by Nergiz et al. (IEEE SocialCom 2010) into a very efficient protocol in a configuration where the two parties hold shares of the values being compared, and obtain a share of the comparison result. This setting is often used in multi-party computation protocols, and hence in many privacy-preserving applications as well. We furthermore implement the protocol and measure its performance. Our measurement suggests that the protocol outperforms the previously proposed protocols for this input/output configuration, when off-line pre-computation is not permitted.

Conference on Privacy, Security and Trust•Aug 1, 2017•10 citations

Privacy-Preserving Cryptographic Protocols

Keith B. Frikken, Mikhail J. Atallah

Auerbach Publications eBooks•Dec 22, 2007•0 citations
The edge computing environment faces a challenge in maintaining data privacy while performing machine learning tasks. The current solutions for privacy preservation are inefficient or do not provide security guarantees, causing a critical gap in the edge computing environment, which is resource-constrained. The aim of this research work is to design a hybrid quantum-classical computing system that addresses the challenges of privacy preservation and efficiency in machine learning tasks. We design a novel architecture combining variational quantum circuits for secure data encoding with classical neural networks for scalable inference, implemented through federated learning protocols enhanced with quantum differential privacy mechanisms. Experimental evaluation demonstrates a 35% reduction in communication overhead compared to traditional federated learning approaches while maintaining 99.2% classification accuracy across diverse datasets. The quantum-enhanced privacy mechanisms achieve provable security guarantees with information-theoretic bounds, outperforming conventional cryptographic methods by 28% in computational overhead reduction. This hybrid approach establishes a new paradigm for secure and efficient machine learning deployment on edge devices, enabling privacy-preserving artificial intelligence in healthcare, finance, and IoT applications.
Secure two-party comparison plays a crucial role in many privacy-preserving applications, such as privacy-preserving data mining and machine learning. In particular, the available comparison protocols with the appropriate input/output configuration have a significant impact on the performance of these applications. In this paper, we firstly describe a taxonomy of secure two-party comparison protocols which allows us to describe the different configurations used for these protocols in a systematic manner. This taxonomy leads to a total of 216 types of comparison protocols. We then describe conversions among these types. While these conversions are based on known techniques and have explicitly or implicitly been considered previously, we show that a combination of these conversion techniques can be used to convert a perhaps less-known two-party comparison protocol by Nergiz et al. (IEEE SocialCom 2010) into a very efficient protocol in a configuration where the two parties hold shares of the values being compared, and obtain a share of the comparison result. This setting is often used in multi-party computation protocols, and hence in many privacy-preserving applications as well. We furthermore implement the protocol and measure its performance. Our measurement suggests that the protocol outperforms the previously proposed protocols for this input/output configuration, when off-line pre-computation is not permitted.
Secure two-party comparison plays a crucial role in many privacy-preserving applications, such as privacy-preserving data mining and machine learning. In particular, the available comparison protocols with the appropriate input/output configuration have a significant impact on the performance of these applications. In this paper, we firstly describe a taxonomy of secure two-party comparison protocols which allows us to describe the different configurations used for these protocols in a systematic manner. This taxonomy leads to a total of 216 types of comparison protocols.We then describe conversions among these types. While these conversions are based on known techniques and have explicitly or implicitly been considered previously, we show that a combination of these conversion techniques can be used to convert a perhaps less-known two-party comparison protocol by Nergiz et al. (IEEE SocialCom 2010) into a very efficient protocol in a configuration where the two parties hold shares of the values being compared, and obtain a share of the comparison result. This setting is often used in multi-party computation protocols, and hence in many privacy-preserving applications as well. We furthermore implement the protocol and measure its performance. Our measurement suggests that the protocol outperforms the previously proposed protocols for this input/output configuration, when off-line pre-computation is not permitted.