Secure multiparty computation enables collaborative computations across multiple users while preserving individual privacy, which has a wide range of applications in finance, machine learning and healthcare. Secure multiparty computation can be realized using oblivious transfer as a primitive function. In this paper, we present an experimental implementation of a quantum-secure quantum oblivious transfer (QOT) protocol using an adapted quantum key distribution system combined with a bit commitment scheme, surpassing previous approaches only secure in the noisy storage model. We demonstrate the first practical application of the QOT protocol by solving the private set intersection, a prime example of secure multiparty computation, where two parties aim to find common elements in their datasets without revealing any other information. In our experiments, two banks can identify common suspicious accounts without disclosing any other data. This not only proves the experimental functionality of QOT, but also showcases its real-world commercial applications.
Secure multiparty computation enables collaborative computations across multiple users while preserving individual privacy, which has a wide range of applications in finance, machine learning and healthcare. Secure multiparty computation can be realized using oblivious transfer as a primitive function. In this paper, we present an experimental implementation of a quantum-secure quantum oblivious transfer (QOT) protocol using an adapted quantum key distribution system combined with a bit commitment scheme, surpassing previous approaches only secure in the noisy storage model. We demonstrate the first practical application of the QOT protocol by solving the private set intersection, a prime example of secure multiparty computation, where two parties aim to find common elements in their datasets without revealing any other information. In our experiments, two banks can identify common suspicious accounts without disclosing any other data. This not only proves the experimental functionality of QOT, but also showcases its real-world commercial applications.
Motivated by the applications of secure multi-party computation as a privacy-protecting data analysis tool, and identifying oblivious transfer as one of its main practical enablers, we propose a practical realization of randomized quantum oblivious transfer. By using only symmetric cryptography primitives to implement commitments, we construct computationally secure randomized oblivious transfer without the need for public-key cryptography or assumptions imposing limitations on the adversarial devices. We show that the protocol is secure under an indistinguishability-based notion of security and demonstrate an experimental implementation to test its real-world performance. Its security and performance are then compared to both quantum and classical alternatives, showing potential advantages over existing solutions based on the noisy storage model and public-key cryptography.
We present an experimentally feasible implementation of a secure multiparty computation application enabled by quantum oblivious transfer (QOT) on an entanglement-based physical layer. The QOT protocol uses polarization-encoded entangled states to share oblivious keys between two parties with quantum key distribution (QKD) providing authentication. Our system integrates the post-processing for QOT and QKD, both sharing a single physical layer, ensuring efficient key generation and authentication, respectively. Authentication involves hashing messages into a cryptographic context, verifying tags, and replenishing keys. This process uses a parallel QKD pipeline specifically for authentication, not for secure key generation. Oblivious keys are generated over a distance up to 25.8 km with a channel loss of 8.47 dB. In a back-to-back setup, a QOT rate of [Formula: see text] OTs/second is achieved, corresponding to 1 minute and 53 seconds per OT, primarily limited by the entanglement source. Using pre-distributed oblivious keys improved the rate to 0.11 OTs/second, or 9.1 seconds per OT. The considered QOT protocol is statistically correct, computationally secure for an honest receiver, and statistically secure for an honest sender, assuming a computationally hiding, statistically binding commitment. An experimentally feasible use case is demonstrated for privacy-preserving fingerprint matching against no-fly lists for border control. The fingerprint is secret-shared across two sites, ensuring security, while the matching is performed using the MASCOT protocol, supported by QOT. The application required 128 1-out-of-2 OTs, each with message length of 128 bits, with the highest security achieved in 20 minutes and 39 seconds. This work demonstrates the feasibility of QOT in secure quantum communication applications.
We present a new simulation-secure quantum oblivious transfer (QOT) protocol based on one-way functions in the plain model. With a focus on practical implementation, our protocol surpasses prior works in efficiency, promising feasible experimental realization. We address potential experimental errors and their correction, offering analytical expressions to facilitate the analysis of the required quantum resources. Technically, we achieve simulation security for QOT through an e q u i v o c a l and r e l a x e d − e x t r a c t a b l e quantum bit commitment.
Quantum Secure Multiparty Computation (QMPC) is a new way to use cryptography that lets a lot of people work together to compute a function over their private inputs while keeping those inputs secret, even if attackers have quantum computing power. As AI becomes more common in fields like healthcare, banking, and self- driving cars, secure collaborative learning becomes more and more important. But the rise of quantum computers is a big threat to the encryption methods that are commonly used in modern multiparty computation protocols. QMPC is a very secure and scalable way to protect privacy in AI. It does this by combining quantum-safe oblivious transfer (QOT), quantum key distribution (QKD), and quantum oblivious linear evaluation (qOLE). This study shows a full QMPC architecture for AI systems that are both federated and decentralized. It lets you train and use private neural networks and is safe from quantum attacks because it uses safe aggregation and encrypted processing protocols. The architecture lets AI do a lot of things, like private set intersection, federated learning, and collaborative model training, without giving away user data. A thorough security analysis based on postquantum assumptions and the universal composability paradigm makes sure that the system can withstand attackers who are adaptive, colluding, or quantum-capable. When tested against datasets like MNIST and CIFAR-10, the protocol gets results that are as accurate as plaintext models with very little extra work on the computer or network. Experiments show that when the accuracy of the model drops by less than 1%, all data privacy is still protected. This study looks at how QMPC might help make AI safer in sensitive areas like medical diagnostics and financial forecasts, as well as how it might help companies follow data protection laws like GDPR and HIPAA. Auditability and consent procedures are two of the legal and moral issues that need to be thought about. The study also talks about problems with scalability and suggests an ideal communication plan and methods like circuit pruning, quantization, and hybrid classical-quantum communication models. We look at what QMPC could do in relation to secure federated analytics, real-time collaborative robotics, and processing encrypted smart contracts. In conclusion, QMPC for privacy-preserving AI is no longer just a theory; it is now a necessary, possible, and realistic way of doing things in a world that is quickly moving toward quantum supremacy. By using quantum-resistant encryption and distributed machine learning together, QMPC creates a way to get to safe, understandable, and decentralized AI that will work in the future. This study sets the stage for future progress at the crossroads of postquantum security and collaborative intelligence.
Oblivious transfer (OT) and bit commitment (BC) are two-party cryptographic protocols which play crucial roles in the construction of various cryptographic protocols. We propose three practical quantum cryptographic protocols in this paper. We first construct a practical quantum random oblivious transfer (R-OT) protocol based on the fact that non-orthogonal states cannot be reliably distinguished. Then, we construct a fault-tolerant one-out-of-two oblivious transfer ( O T 1 2 ) protocol based on the quantum R-OT protocol. Afterwards, we propose a quantum bit commitment (QBC) protocol which executes the fault-tolerant O T 1 2 several times. Mayers, Lo and Chau (MLC) no-go theorem proves that QBC protocol cannot be unconditionally secure. However, we find that computing the unitary transformation of no-go theorem attack needs so many resources that it is not realistically implementable. We give a definition of physical security for QBC protocols and prove that the practical QBC we proposed is physically secure and can be implemented in the real world.
Quantum cryptography is the field of cryptography that explores the quantum properties of matter. Generally, it aims to develop primitives beyond the reach of classical cryptography and to improve existing classical implementations. Although much of the work in this field covers quantum key distribution (QKD), there have been some crucial steps towards the understanding and development of quantum oblivious transfer (QOT). One can show the similarity between the application structure of both QKD and QOT primitives. Just as QKD protocols allow quantum-safe communication, QOT protocols allow quantum-safe computation. However, the conditions under which QOT is fully quantum-safe have been subject to intense scrutiny and study. In this review article, we survey the work developed around the concept of oblivious transfer within theoretical quantum cryptography. We focus on some proposed protocols and their security requirements. We review the impossibility results that daunt this primitive and discuss several quantum security models under which it is possible to prove QOT security.