2 research outputs found
Continuous variable controlled quantum dialogue and secure multiparty quantum computation
A continuous variable controlled quantum dialogue scheme is proposed. The
scheme is further modified to obtain two other protocols of continuous variable
secure multiparty computation. The first one of these protocols provides a
solution of two party socialist millionaire problem, while the second protocol
provides a solution for a special type of multi-party socialist millionaire
problem which can be viewed as a protocol for multiparty quantum private
comparison. It is shown that the proposed scheme of continuous variable
controlled quantum dialogue can be performed using bipartite entanglement and
can be reduced to obtain several other two and three party cryptographic
schemes in the limiting cases. The security of the proposed scheme and its
advantage over corresponding discrete variable counterpart are also discussed.
Specifically, the ignorance of an eavesdropper in the proposed scheme is shown
to be very high compared with corresponding discrete variable scheme and thus
the present scheme is less prone to information leakage inherent with the
discrete variable quantum dialogue based schemes.It is further established that
the proposed scheme can be viewed as a continuous variable counterpart of
quantum cryptographic switch which allows a supervisor to control the
information transferred between the two legitimate parties to a continuously
varying degree.Comment: Quantum dialogue and its application in the continuous variable
scenario is studied in detai
Efficient Solutions to Two-Party and Multiparty Millionaires’ Problem
The millionaires’ problem is the basis of secure multiparty computation and has many applications. Using a vectorization method and the Paillier encryption scheme, we first propose a secure two-party solution to the millionaires’ problem, which can determine x=y,  xy in one execution. Subsequently, using the vectorization and secret splitting methods, we propose an information-theoretically secure protocol to solve the multiparty millionaires’ problem (a.k.a. secure sorting problem), and this protocol can resist collusion attacks. We analyze the accuracy and security of our protocols in the semihonest model and compare the computational and communication complexities between the proposed protocols and the existing ones