Anonymous multi-party quantum computation with a third party
- URL: http://arxiv.org/abs/2110.13648v1
- Date: Sat, 23 Oct 2021 14:27:12 GMT
- Title: Anonymous multi-party quantum computation with a third party
- Authors: Zhaoxu Ji, Peiru Fan, Atta Ur Rahman, Huanguo Zhang
- Abstract summary: We show that the protocol is an anonymous multi-party quantum addition protocol rather than a secure multi-party quantum addition protocol.
We propose a new anonymous multiparty quantum protocol based on our original protocol.
- Score: 0.8356765961526955
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We reconsider and modify the second secure multi-party quantum addition
protocol proposed in our original work. We show that the protocol is an
anonymous multi-party quantum addition protocol rather than a secure
multi-party quantum addition protocol. Through small changes, we develop the
protocol to propose, for the first time, anonymous multiparty quantum
computation with a third party, who faithfully executes protocol processes, but
is interested in the identity of the data owners. Further, we propose a new
anonymous multiparty quantum protocol based on our original protocol. We
calculate the success probability of the proposed protocols, which is also a
modification of the success probability of the original protocols.
Related papers
- Towards efficient and secure quantum-classical communication networks [47.27205216718476]
There are two primary approaches to achieving quantum-resistant security: quantum key distribution (QKD) and post-quantum cryptography (PQC)
We introduce the pros and cons of these protocols and explore how they can be combined to achieve a higher level of security and/or improved performance in key distribution.
We hope our discussion inspires further research into the design of hybrid cryptographic protocols for quantum-classical communication networks.
arXiv Detail & Related papers (2024-11-01T23:36:19Z) - Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
We propose a brand new quantum digital signature protocol without a trusted third party only with qubit technology to further improve the security.
We prove that the protocol has information-theoretical unforgeability. Moreover, it satisfies other important secure properties, including asymmetry, undeniability, and expandability.
arXiv Detail & Related papers (2024-10-17T09:49:29Z) - Orthogonal-state-based Measurement Device Independent Quantum Communication [32.244698777387995]
We propose a new protocol of measurement-device-independent quantum secure direct communication and quantum dialogue employing single basis, i.e., Bell basis as decoy qubits for eavesdropping detection.
Our protocols leverage fundamentally distinct resources to close the security loopholes linked to measurement devices, while also effectively doubling the distance for secure direct message transmission.
arXiv Detail & Related papers (2024-09-30T15:57:17Z) - Quantum Two-Way Communication Protocol Beyond Superdense Coding [36.25599253958745]
We introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs.
The proposed protocol gives a 50% increase in both data rate and energy efficiency compared to the classical protocol.
arXiv Detail & Related papers (2023-09-06T08:48:07Z) - Multi-User Entanglement Distribution in Quantum Networks Using Multipath
Routing [55.2480439325792]
We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing.
The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
arXiv Detail & Related papers (2023-03-06T18:06:00Z) - Conference key agreement in a quantum network [67.410870290301]
Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state.
In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
arXiv Detail & Related papers (2022-07-04T18:00:07Z) - Scalable Mediated Semi-quantum Key Distribution [5.548873288570182]
Mediated semi-quantum key distribution (M-SQKD) permits two limited "semi-quantum" or "classical" users to establish a secret key with the help of a third party (TP)
Several protocols have been studied recently for two-party scenarios, but no one has considered M-SQKD for multi-party scenarios.
arXiv Detail & Related papers (2022-05-13T09:21:12Z) - Multi-party Semi-quantum Secret Sharing Protocol based on Measure-flip and Reflect Operations [1.3812010983144802]
Semi-quantum secret sharing (SQSS) protocols serve as fundamental frameworks in quantum secure multi-party computations.
This paper proposes a novel SQSS protocol based on multi-particle GHZ states.
arXiv Detail & Related papers (2021-09-03T08:52:17Z) - Anonymous communication protocol over quantum networks [5.61186040823947]
We propose a W state-based protocol for anonymously transmitting quantum messages in a quantum network.
We develop three sub-protocols using the W state, including the quantum collision detection protocol and the quantum notification protocol.
arXiv Detail & Related papers (2021-07-17T02:51:15Z) - Secure and practical multiparty quantum digital signatures [9.075243529793083]
Quantum digital signatures (QDSs) promise information-theoretic security against repudiation and forgery of messages.
Multiparty protocols have unique advantages in the practical case of more than two receivers when sending a mass message.
Our work compensates for the absence of practical multiparty protocols, which paves the way for future QDS networks.
arXiv Detail & Related papers (2021-04-25T04:47:24Z) - Client-Server Identification Protocols with Quantum PUF [1.4174475093445233]
We propose two identification protocols based on the emerging hardware secure solutions, the quantum Physical Unclonable Functions (qPUFs)
The first protocol allows a low-resource party to prove its identity to a high-resource party and in the second protocol, it is vice-versa.
Unlike existing identification protocols based on Quantum Read-out PUFs which rely on the security against a specific family of attacks, our protocols provide provable exponential security against any Quantum Polynomial-Time adversary with resource-efficient parties.
arXiv Detail & Related papers (2020-06-08T12:35:09Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.