Randomized Oblivious Transfer for Secure Multiparty Computation in the Quantum Setting

Costa, Bruno Sielly Jales; Branco, Patrícia; Goulão, Manuel; Lemus, Mariano; Mateus, Paulo

doi:10.3390/e23081001

Cited by 9 publications

(4 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The F COM functionality can be replaced by the commitment protocol π COM presented in [55] which is computationally UC-secure in the Common Reference String (CRS) model. As analyzed in [56] (Theorem 3. ), the protocol π COM computationally quantum-UC realizes F COM in the CRS model.…”

Section: Ideal Functionalitiesmentioning

confidence: 99%

Quantum Universally Composable Oblivious Linear Evaluation

Santos¹,

Mateus²,

Vlachou³

2022

Preprint

Self Cite

View full text Add to dashboard Cite

Oblivious linear evaluation is a generalization of oblivious transfer, whereby two distrustful parties obliviously compute a linear function, f (x) = ax + b, i.e., each one provides their inputs that remain unknown to the other, in order to compute the output f (x) that becomes known to only one of them. From both a structural and a security point-of-view, oblivious linear evaluation is fundamental for arithmeticbased secure multi-party computation protocols. In the classical case it is known that oblivious linear evaluation can be generated based on oblivious transfer, and quantum counterparts of these protocols can, in principle, be constructed as straightforward extensions based on quantum oblivious transfer. Here, we present the first, to the best of our knowledge, quantum protocol for oblivious linear evaluation that, furthermore, does not rely on quantum oblivious transfer. We start by presenting a semi-honest protocol and then we extend it to the malicious setting employing a commit-and-open strategy. Our protocol uses high-dimensional quantum states to obliviously compute the linear function, f (x), on Galois Fields of prime dimension, GF (d) ∼ = Z d , or prime-power dimension, GF (d M ). These constructions utilize the existence of a complete set of mutually unbiased bases in prime-power dimension Hilbert spaces and their linear behaviour upon the Heisenberg-Weyl operators. We also generalize our protocol to achieve vector oblivious linear evaluation, where several instances of oblivious linear evaluation are generated, thus making the protocol more efficient. We prove the protocols to have static security in the framework of quantum universal composability.

show abstract

Section: Ideal Functionalitiesmentioning

confidence: 99%

Quantum Universally Composable Oblivious Linear Evaluation

Santos¹,

Mateus²,

Vlachou³

2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…As an important part of quantum cryptography and popular research area, quantum secure multiparty computation * Authors to whom any correspondence should be addressed. [1][2][3][4][5][6][7] has attracted a lot of scientific attention from the research community in recent years. It needs to accomplish the task that two or more users in a mutually untrusted distributed network can cooperate to compute some agreed function and obtain the computation result without revealing their private data.…”

Section: Introductionmentioning

confidence: 99%

Measurement-device-independent quantum secure multiparty summation based on entanglement swapping

Sun,

Fan,

Cao

et al. 2023

Laser Phys. Lett.

View full text Add to dashboard Cite

In this paper, we propose a measurement-device-independent (MDI) quantum secure multiparty summation protocol based on entanglement swapping. The protocol is capable of providing a secure modulo-2 summation method for n parties. Our protocol uses Bell states as the information vehicle and establishes encryption through entanglement swapping, and each party encodes the information orderly to complete the summation process through the simple single-qubit operation. In contrast to previous protocols, there is no pre-shared private key sequence and key storage process in our protocol, which helps to reduce the possibility of information leakage in transmission. Our protocol supports multiple summations by n participants, which improves quantum resource utilization. The protocol can be implemented with linear-optical devices. Furthermore, it can resist multiple attack modes including the intercept-resend attack, entangle-and-measure attack, dishonest third-party attack, and parties’ attack. Most significantly, the protocol enables to eliminate all side-channel attacks against detectors based on the MDI principle. Therefore, the protocol has advantages of high security, high efficiency, and good feasibility.

show abstract

“…In recent years, secure multiparty computation technology has been introduced by many scholars to the traditional fields of scientific computing, data mining, computational geometry, information retrieval and statistical analysis. Thus, new research directions, such as the correlation of protecting private information [6], privacy preserving cooperative scientific computations [7][8][9], Privacy Preserving Data Mining (PPDM) [10,11], Privacy Preserving Computation Geometry (PPCG for short) [12][13][14][15], Private Information Retrieval (PIR) [16], Privacy Preserving Statistical Analysis (PPSA) [17], and the question of preserving the data ranking of private information [18][19][20], and secure multiparty quantum computation [21,22] are generated, thus solving some important security application problems.…”

Section: Introductionmentioning

confidence: 99%

Collaborative calculation and application of interreal and real interval relations to protect privacy

Lu²,

Sun³

2021

PLoS ONE

View full text Add to dashboard Cite

The determination of the relation between a number and a numerical interval is one of the core problems in the scientific calculation of privacy protection. The calculation of the relationship between two numbers and a numerical interval to protect privacy is also the basic problem of collaborative computing. It is widely used in data queries, location search and other fields. At present, most of the solutions are still fundamentally limited to the integer level, and there are few solutions at the real number level. To solve these problems, this paper first uses Bernoulli inequality generalization and a monotonic function property to extend the solution to the real number level and designs two new protocols based on the homomorphic encryption scheme, which can not only protect the data privacy of both parties involved in the calculation, but also extend the number domain to real numbers. In addition, this paper designs a solution to the confidential cooperative determination problem between real numbers by using the sign function and homomorphism multiplication. Theoretical analysis shows that the proposed solution is safe and efficient. Finally, some extension applications based on this protocol are given.

show abstract

Randomized Oblivious Transfer for Secure Multiparty Computation in the Quantum Setting

Cited by 9 publications

References 36 publications

Quantum Universally Composable Oblivious Linear Evaluation

Quantum Universally Composable Oblivious Linear Evaluation

Measurement-device-independent quantum secure multiparty summation based on entanglement swapping

Collaborative calculation and application of interreal and real interval relations to protect privacy

Contact Info

Product

Resources

About