Quantum multi-party private set union protocol based on least common multiple and Shor's algorithm.

Private set union (PSU) allows several parties to obtain the union of their private sets without disclosing each party's private information. Existing PSU protocols often have polynomial complexity for the complete set size or complicated process. In this paper, a quantum multi-party PSU protocol based on least common multiple (LCM) and Shor's algorithm is proposed, which enables the union of multiple sets to be computed all at once. In order to increase the one-time success probability of the protocol, we first improved Shor's period-finding algorithm, which is used in LCM computation and integer factoring. Each party's private set is encoded into an integer obtained by multiplying several prime numbers, thus the PSU problem is transformed into an LCM problem. The LCM of these integers is computed by using the improved Shor's period-finding algorithm, and then factored to derived the union set. We prove the correctness of the proposed protocol, and its unconditional security against semi-honest attacks. Complexity analysis shows that our protocol has logarithmic complexity for the complete set size. [ABSTRACT FROM AUTHOR]