Simple proof of security of the multiparty prepare and measure QKD

Nilesh, Kumar

doi:10.1007/s11128-022-03691-7

Cited by 3 publications

(3 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Step 5: Alice and Bob perform a shared hash function H on their binary secret information to obtain a binary sequence of the specified length. The hash function H is described as Equation (8).…”

Section: Qpc Protocol Descriptionmentioning

confidence: 99%

“…QPC has potential applications in a variety of fields, including secure online voting, financial transactions, and data sharing between government agencies. However, the majority of QPC protocols have a common feature that the protocols need to perform QKD [8] and then encrypt and compare secret information. Using QKD to avoid possible security risks can make the protocol simpler and easier at the physical implementation level; nevertheless, this type of QPC protocol has room for improvement in quantum efficiency and utilization of quantum resources [9].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Quantum Private Comparison without Sharing a Key

Li,

Che,

Wang

et al. 2023

Entropy

View full text Add to dashboard Cite

Quantum private comparison (QPC) allows at least two users to compare the equality of their secret information, for which the security is based on the properties of quantum mechanics. To improve the use of quantum resources and the efficiency of private comparison, a new QPC protocol based on GHZ-like states is proposed. The protocol adopts unitary operations to encode the secret information instead of performing quantum key distribution (QKD), which can reduce the amount of computation required to perform QKD and improve the utilization of quantum resources. The decoy photon technique used to detect channel eavesdropping ensures that the protocol is resistant to external attacks. The quantum efficiency of the protocol reaches 66%. Compared with many previous QPC schemes, the proposed protocol does not need to share a key and has advantages in quantum efficiency and quantum resources.

show abstract

Section: Qpc Protocol Descriptionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Efficient Quantum Private Comparison without Sharing a Key

Li,

Che,

Wang

et al. 2023

Entropy

View full text Add to dashboard Cite

show abstract

“…Several QCKA protocols have been proposed, most of which utilize a multipartite quantum entanglement state such as a Greenberger-Horne-Zeilinger (GHZ) state [2][3][4][5][6][7][8]. The central node generates a multipartite entangled state and sends one photon in the entangled state to each party.…”

Section: Introductionmentioning

confidence: 99%

Quantum conference key agreement based on differential-phase-shift quantum key distribution

Inoue,

Honjo

2024

Quantum Inf Process

View full text Add to dashboard Cite

A quantum conference key agreement (QCKA) protocol based on differential-phase-shift quantum key distribution is presented, which provides a common secret key for secure communication between more than two parties. In the proposed protocol, one party simultaneously broadcasts a weak coherent pulse train with {0, π} phases to multiple parties that measure the phase differences between adjacent pulses using a delay interferometer followed by photon detectors, and the transmitter and receivers share secret key bits from the coincident counts in the receivers. The system setup and operation are simpler than those of conventional QCKA schemes that use a multipartite quantum entanglement state. The key creation performance is evaluated by considering the eavesdropping probability. The results indicate that the proposed scheme offers better performance than the conventional entanglement-based QCKA system.

show abstract

Quantum Blockchain Based on Dimensional Lifting Generalized Gram-Schmidt Procedure

Nilesh

Panigrahi

2022

IEEE Access

View full text Add to dashboard Cite

The advancement of quantum computers undermines the security of classical blockchain, necessitating either a post-quantum upgrade of the existing architecture or creation of an inherently quantum blockchain. Here we propose a practically realizable model of a fully quantum blockchain based on a generalized Gram-Schmidt procedure utilizing dimensional lifting. In this model, information of transactions stored in a multi-qubit state are subsequently encoded using the generalized Gram-Schmidt process. The chain is generated as a result of the reliance of orthogonalized state on the sequence of states preceding it. Various forking scenarios and their countermeasures are considered for the proposed model. It is shown to be secure even against quantum computing attacks using the no-cloning theorem and nondemocratic nature of Generalized Gram-Schmidt orthogonalization. Finally, we outline a framework for a quantum token built on the same architecture as our blockchain.

show abstract

Simple proof of security of the multiparty prepare and measure QKD

Cited by 3 publications

References 38 publications

Efficient Quantum Private Comparison without Sharing a Key

Efficient Quantum Private Comparison without Sharing a Key

Quantum conference key agreement based on differential-phase-shift quantum key distribution

Quantum Blockchain Based on Dimensional Lifting Generalized Gram-Schmidt Procedure

Contact Info

Product

Resources

About