Two Quantum Protocols for Oblivious Set-member Decision Problem

Shi, Ronghua; Mu, Yi; Zhong, Hong; Zhang, Shun

doi:10.1038/srep15914

Cited by 11 publications

(4 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We may also use quantum encryptions combined with classical authenticated keys 20 21 . In addition, we may still ensure the authentication by sharing the entangled quantum resources in advance 22 or using the detecting (or decoy) particle technologies 23 .…”

Section: Resultsmentioning

confidence: 99%

Secure Multiparty Quantum Computation for Summation and Multiplication

Shi

Zhong

et al. 2016

Sci Rep

Self Cite

View full text Add to dashboard Cite

As a fundamental primitive, Secure Multiparty Summation and Multiplication can be used to build complex secure protocols for other multiparty computations, specially, numerical computations. However, there is still lack of systematical and efficient quantum methods to compute Secure Multiparty Summation and Multiplication. In this paper, we present a novel and efficient quantum approach to securely compute the summation and multiplication of multiparty private inputs, respectively. Compared to classical solutions, our proposed approach can ensure the unconditional security and the perfect privacy protection based on the physical principle of quantum mechanics.

show abstract

Section: Resultsmentioning

confidence: 99%

Secure Multiparty Quantum Computation for Summation and Multiplication

Shi

Zhong

et al. 2016

Sci Rep

Self Cite

View full text Add to dashboard Cite

show abstract

“…Finally, like most existing secure multiparty quantum computations, our proposed QSA scheme needs authenticated quantum channels, which can ensure the authenticity of quantum resources and participant identities. In principle, we may combine quantum authentication technologies with classical authentication technologies to implement various authentications in quantum channels [36,38].…”

Section: Proofmentioning

confidence: 99%

A Feasible Quantum Sealed-Bid Auction Scheme Without an Auctioneer

Shi

2022

IEEE Trans. Quantum Eng.

Self Cite

View full text Add to dashboard Cite

We first define a primitive problem of secure multiparty computations, i.e., Secure Multiparty Disjunction (SMD), and present a novel quantum protocol for SMD, which can ensure the information-theoretical security, i.e., the unconditional security. Furthermore, based on the quantum SMD protocol, we design a quantum sealed-bid auction (QSA) scheme without an auctioneer. In the proposed QSA scheme, all bidders can jointly find the winning bidder without the help of an auctioneer, while it can perfectly protect the privacy of non-winning bidders. Proposed quantum SMD protocol and quantum QSA scheme take Bell states as quantum resources and only perform single-particle Pauli operators and two-particle Bell measurements. Finally, we simulate the related quantum protocols in Qiskit and verify the correctness and the feasibility of the proposed protocols.

show abstract

“…The idea can be applied also for purely quantum decision problems e.g. for oblivious setmember decision problem [39]. More advanced tasks one obtains a decision tree often may be characterized with use of a decision tree, which would fit into presented approach.…”

Section: Introductionmentioning

confidence: 99%

Quantum search with prior knowledge

Sadowski

2015

Preprint

View full text Add to dashboard Cite

The aim of this work is to develop a framework for realising quantum network algorithms with the use of prior knowledge about the structure of the network. We seek to obtain computational methods that allows us to locally determine network properties in a quantum superposition and drive the walk behaviour accordingly. In particular, we consider a network that consists of different types of edges, such that the transitions between nodes result in extra edge-dependent phase shift. We combine amplitude amplification and phase estimation to develop an algorithm for exploring such networks. In the layered neural network inspired case we obtain linear increase of the search complexity with exponential growth of the nodes number. We show that in consequence one is able to perform quantum search algorithms with exponential speed-up compared to quantum search that neglects the extra phase shifts.

show abstract

Two Quantum Protocols for Oblivious Set-member Decision Problem

Cited by 11 publications

References 21 publications

Secure Multiparty Quantum Computation for Summation and Multiplication

Secure Multiparty Quantum Computation for Summation and Multiplication

A Feasible Quantum Sealed-Bid Auction Scheme Without an Auctioneer

Quantum search with prior knowledge

Contact Info

Product

Resources

About