Arbitrated quantum signature protocol with boson sampling-based random unitary encryption

Abstract

For signing quantum messages, the arbitrated quantum signature (AQS) has been widely investigated to date. However, most of the existing AQS protocols are susceptible to different aspects of disavowal and forgery attacks due to the use of quantum one time pad (QOTP) encryption featuring the encryption manner with qubit by qubit and the commutative property of Pauli operations. We develop an AQS protocol with boson sampling-based random unitary encryption. The unique encryption is used to encrypt the message copy (ciphertext) to produce the signature, which can circumvent the drawbacks of the QOTP encryption and stand against the signer Alice's disavowal and the verifier Bob's forgery attacks including existential forgery under known message attacks. The employment of a random array via the public board can prevent Bob's repudiation attacks on the receipt and the integrality of the signature. The quantum walk-based teleportation is applied to teleport the message copy from Alice to Bob, which can avoid preparing the essential entanglement resource beforehand. Security analyses and discussions show that our AQS protocol is with impossibility of disavowal from Alice and Bob and impossibility of forgery from anyone.

Multi-party semi-quantum private comparison based on the maximally entangled GHZ-type states

“…In 1984, Bennett and Brassard [2] applied quantum mechanics to classical cryptography and proposed the first quantum key distribution protocol. Since then, various quantum cryptography protocols have been proposed, such as quantum key distribution (QKD) [2][3][4][5][6], quantum dialogue (QD) [7,8], quantum summation [9,10], quantum encryption (QPQ) [11,12], quantum signature [13][14][15][16].…”

An Unbiased Quantum Random Number Generator Based on Boson Sampling

“…The application of Boson sampling has attracted the attention of researchers, e.g. Boson sampling-based one-way function [28] , Boson sampling-based random unitary encryption [29] and Boson sampling-based hash function [30] have been proposed respectively. The branches of applications of Boson sampling shorten the research process of solving practical problems with Boson sampling.…”

Computational indistinguishability and boson sampling*

“…The primary objective of all of these implementations has been the demonstration of advantage of quantum computers over their classical counterparts, leaving aside other possible applications of BS, such as the ones discussed in Refs. [29,30,31,32,33,34,35,36,37].…”