Abstract

Identifying trusted user plays an important role before initiating secure communication; therefore, a quantum authentication schemes is proposed based on Bell pair. Two trusted party initial shared a common secret key (known as pre-shared key) which only known to them. Various existing protocol uses quantum resources with memory for Authentication process but the storage time of qubits in 3 ns. In proposed protocol, authentication process had done without strong the Bell states by trusted parties. Sending party selects 4 classical bits to form Bell pair in any one of the positions {(1, 2)(3, 4)} or {(1, 3)(2, 4)} based on the consecutive bits in pre-shared key. The receiving party uses the consecutive bits in pre-shared key to decode the information about authentication key using Bell state measurement. Adversary has no knowledge about pre-shared key and guessing incorrect position makes entangle swapping of Bell states. Adversary incorrect position leads to its identification by trusted parties by verifying the authentication key in classical channel. The security of proposed protocol is analyzed under intercept measure and resend attack (IR). In addition, proposed protocol can prevent the adversary to fetch the information about the pre-shared key. Various existing protocol is compared with the proposed one with quantum resources and memory requirement. The proposed protocol is implemented in IBM Quantum Lab, and circuit simulation is shown visually in IBM quantum composer.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.