A privacy preserving quantum aggregating technique

Secure quantum multiparty computation is an important field of quantum computing. Many of the preceding aggregation approaches are (n, n) threshold-dependent strategies, where n denotes the total number of participants. The previous aggregating techniques cannot aggregate the secret effectively if one participant is dishonest. This paper presents a quantum technique for secure aggregation. This technique is (t, n) threshold-dependent scheme, where t is the threshold number of participants. We used the properties of quantum mechanics to provide security in quantum aggregation. This technique can compute the aggregation of secrets securely with less computation and communication costs. The proposed aggregation technique is efficient and secure as compared to existing techniques. The simulation results of the proposed technique ensure correctness and practicality.