Skip to main content
Erschienen in: Quantum Information Processing 4/2024

01.04.2024

A privacy preserving quantum aggregating technique

verfasst von: Kartick Sutradhar, Ranjitha Venkatesh

Erschienen in: Quantum Information Processing | Ausgabe 4/2024

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Secure quantum multiparty computation is an important field of quantum computing. Many of the preceding aggregation approaches are (nn) 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 (tn) 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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition, 10th edn. Cambridge University Press, New York (2011) Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition, 10th edn. Cambridge University Press, New York (2011)
2.
Zurück zum Zitat Chen, J.-Z., Du Ann, X.-B., Wen, Q.-Y.: Secure multiparty quantum summation. Acta Phys. Sin. 56(11), 6214–6219 (2007)MathSciNetCrossRef Chen, J.-Z., Du Ann, X.-B., Wen, Q.-Y.: Secure multiparty quantum summation. Acta Phys. Sin. 56(11), 6214–6219 (2007)MathSciNetCrossRef
3.
Zurück zum Zitat Chen, X.-B., Gang, X., Yang, Y.-X., Wen, Q.-Y.: An efficient protocol for the secure multi-party quantum summation. Int. J. Theor. Phys. 49(11), 2793–2804 (2010)MathSciNetCrossRef Chen, X.-B., Gang, X., Yang, Y.-X., Wen, Q.-Y.: An efficient protocol for the secure multi-party quantum summation. Int. J. Theor. Phys. 49(11), 2793–2804 (2010)MathSciNetCrossRef
4.
Zurück zum Zitat Zhang, C., Sun, Z., Huang, Y., Long, D.: High-capacity quantum summation with single photons in both polarization and spatial-mode degrees of freedom. Int. J. Theor. Phys. 53(3), 933–941 (2014)CrossRef Zhang, C., Sun, Z., Huang, Y., Long, D.: High-capacity quantum summation with single photons in both polarization and spatial-mode degrees of freedom. Int. J. Theor. Phys. 53(3), 933–941 (2014)CrossRef
5.
Zurück zum Zitat Zhang, C., Sun, Z.-W., Huang, X., Long, D.-Y.: Three-party quantum summation without a trusted third party. Int. J. Quantum Inf. 13(02), 1550011 (2015)MathSciNetCrossRef Zhang, C., Sun, Z.-W., Huang, X., Long, D.-Y.: Three-party quantum summation without a trusted third party. Int. J. Quantum Inf. 13(02), 1550011 (2015)MathSciNetCrossRef
6.
Zurück zum Zitat Shi, R., Yi, M., Zhong, H., Cui, J., Zhang, S.: Secure multiparty quantum computation for summation and multiplication. Sci. Rep. 6, 19655 (2016)ADSCrossRef Shi, R., Yi, M., Zhong, H., Cui, J., Zhang, S.: Secure multiparty quantum computation for summation and multiplication. Sci. Rep. 6, 19655 (2016)ADSCrossRef
7.
Zurück zum Zitat Shi, R.-H., Zhang, S.: Quantum solution to a class of two-party private summation problems. Quantum Inf. Process. 16(9), 225 (2017)ADSMathSciNetCrossRef Shi, R.-H., Zhang, S.: Quantum solution to a class of two-party private summation problems. Quantum Inf. Process. 16(9), 225 (2017)ADSMathSciNetCrossRef
8.
Zurück zum Zitat Zhang, C., Situ, H., Huang, Q., Yang, P.: Multi-party quantum summation without a trusted third party based on single particles. Int. J. Quantum Inf. 15(02), 1750010 (2017)MathSciNetCrossRef Zhang, C., Situ, H., Huang, Q., Yang, P.: Multi-party quantum summation without a trusted third party based on single particles. Int. J. Quantum Inf. 15(02), 1750010 (2017)MathSciNetCrossRef
9.
Zurück zum Zitat Liu, W., Wang, Y.-B., Fan, W.-Q.: An novel protocol for the quantum secure multi-party summation based on two-particle bell states. Int. J. Theor. Phys. 56(9), 2783–2791 (2017)MathSciNetCrossRef Liu, W., Wang, Y.-B., Fan, W.-Q.: An novel protocol for the quantum secure multi-party summation based on two-particle bell states. Int. J. Theor. Phys. 56(9), 2783–2791 (2017)MathSciNetCrossRef
10.
Zurück zum Zitat Yang, H.-Y., Ye, T.-Y.: Secure multi-party quantum summation based on quantum Fourier transform. Quantum Inf. Process. 17(6), 129 (2018)ADSMathSciNetCrossRef Yang, H.-Y., Ye, T.-Y.: Secure multi-party quantum summation based on quantum Fourier transform. Quantum Inf. Process. 17(6), 129 (2018)ADSMathSciNetCrossRef
11.
Zurück zum Zitat Lv, S.-X., Jiao, X.-F., Zhou, P.: Multiparty quantum computation for summation and multiplication with mutually unbiased bases. Int. J. Theor. Phys. 58(2), 1–11 (2019)MathSciNet Lv, S.-X., Jiao, X.-F., Zhou, P.: Multiparty quantum computation for summation and multiplication with mutually unbiased bases. Int. J. Theor. Phys. 58(2), 1–11 (2019)MathSciNet
12.
Zurück zum Zitat Ming-Yi, D.: Multi-party quantum summation within a d-level quantum system. Int. J. Theor. Phys. 59(5), 1638–1643 (2020)MathSciNetCrossRef Ming-Yi, D.: Multi-party quantum summation within a d-level quantum system. Int. J. Theor. Phys. 59(5), 1638–1643 (2020)MathSciNetCrossRef
13.
Zurück zum Zitat Ye, T.-Y., Xu, T.-J.: A lightweight three-user secure quantum summation protocol without a third party based on single-particle states. Quantum Inf. Process. 21(9), 1–15 (2022)ADSMathSciNetCrossRef Ye, T.-Y., Xu, T.-J.: A lightweight three-user secure quantum summation protocol without a third party based on single-particle states. Quantum Inf. Process. 21(9), 1–15 (2022)ADSMathSciNetCrossRef
14.
Zurück zum Zitat Hu, J.-L., Ye, T.-Y.: Three-party secure semiquantum summation without entanglement among quantum user and classical users. Int. J. Theor. Phys. 61(6), 1–11 (2022)MathSciNetCrossRef Hu, J.-L., Ye, T.-Y.: Three-party secure semiquantum summation without entanglement among quantum user and classical users. Int. J. Theor. Phys. 61(6), 1–11 (2022)MathSciNetCrossRef
15.
Zurück zum Zitat Ye, T.-Y., Xu, T.-J., Geng, M.-J., Chen, Y.: Two-party secure semiquantum summation against the collective-dephasing noise. Quantum Inf. Process. 21(3), 1–14 (2022)MathSciNetCrossRef Ye, T.-Y., Xu, T.-J., Geng, M.-J., Chen, Y.: Two-party secure semiquantum summation against the collective-dephasing noise. Quantum Inf. Process. 21(3), 1–14 (2022)MathSciNetCrossRef
16.
Zurück zum Zitat Pan, H.-M.: Cryptanalysis and improvement of three-party semi-quantum summation using single photons. Int. J. Theor. Phys. 61(4), 1–5 (2022)MathSciNetCrossRef Pan, H.-M.: Cryptanalysis and improvement of three-party semi-quantum summation using single photons. Int. J. Theor. Phys. 61(4), 1–5 (2022)MathSciNetCrossRef
18.
Zurück zum Zitat Cheng, S.-T., Wang, C.-Y.: Quantum switching and quantum merge sorting. IEEE Trans. Circuits Syst. I Regul. Pap. 53(2), 316–325 (2006)MathSciNetCrossRef Cheng, S.-T., Wang, C.-Y.: Quantum switching and quantum merge sorting. IEEE Trans. Circuits Syst. I Regul. Pap. 53(2), 316–325 (2006)MathSciNetCrossRef
19.
Zurück zum Zitat Shukla, M.K., Oruc, A.Y.: Multicasting in quantum switching networks. IEEE Trans. Comput. 59(6), 735–747 (2010)MathSciNetCrossRef Shukla, M.K., Oruc, A.Y.: Multicasting in quantum switching networks. IEEE Trans. Comput. 59(6), 735–747 (2010)MathSciNetCrossRef
20.
Zurück zum Zitat Ratan, R., Oruc, A.Y.: Self-routing quantum sparse crossbar packet concentrators. IEEE Trans. Comput. 60(10), 1390–1405 (2010)MathSciNetCrossRef Ratan, R., Oruc, A.Y.: Self-routing quantum sparse crossbar packet concentrators. IEEE Trans. Comput. 60(10), 1390–1405 (2010)MathSciNetCrossRef
21.
Zurück zum Zitat Nakamura, S., Masson, G.M.: Lower bounds on crosspoints in concentrators. IEEE Trans. Comput. 12, 1173–1179 (1982)CrossRef Nakamura, S., Masson, G.M.: Lower bounds on crosspoints in concentrators. IEEE Trans. Comput. 12, 1173–1179 (1982)CrossRef
22.
Zurück zum Zitat Mashhadi, S.: General secret sharing based on quantum Fourier transform. Quantum Inf. Process. 18(4), 1–15 (2019)MathSciNetCrossRef Mashhadi, S.: General secret sharing based on quantum Fourier transform. Quantum Inf. Process. 18(4), 1–15 (2019)MathSciNetCrossRef
23.
Zurück zum Zitat Yi, X., Cao, C., Fan, L., Zhang, R.: Quantum secure multi-party summation protocol based on blind matrix and quantum Fourier transform. Quantum Inf. Process. 20(7), 1–20 (2021)MathSciNetCrossRef Yi, X., Cao, C., Fan, L., Zhang, R.: Quantum secure multi-party summation protocol based on blind matrix and quantum Fourier transform. Quantum Inf. Process. 20(7), 1–20 (2021)MathSciNetCrossRef
24.
Zurück zum Zitat Ye, T.-Y., Hu, J.-L.: Quantum secure multiparty summation based on the phase shifting operation of d-level quantum system and its application. Int. J. Theor. Phys. 60(3), 819–827 (2021)MathSciNetCrossRef Ye, T.-Y., Hu, J.-L.: Quantum secure multiparty summation based on the phase shifting operation of d-level quantum system and its application. Int. J. Theor. Phys. 60(3), 819–827 (2021)MathSciNetCrossRef
25.
Zurück zum Zitat Castelvecchi, D.: IBM’s quantum cloud computer goes commercial. Nat. News 543(7644), 159 (2017)CrossRef Castelvecchi, D.: IBM’s quantum cloud computer goes commercial. Nat. News 543(7644), 159 (2017)CrossRef
26.
Zurück zum Zitat Li, H.-S., Fan, P., Xia, H.-Y., Peng, H., Song, S.: Quantum implementation circuits of quantum signal representation and type conversion. IEEE Trans. Circuits Syst. I Regul. Pap. 66(1), 341–354 (2018)CrossRef Li, H.-S., Fan, P., Xia, H.-Y., Peng, H., Song, S.: Quantum implementation circuits of quantum signal representation and type conversion. IEEE Trans. Circuits Syst. I Regul. Pap. 66(1), 341–354 (2018)CrossRef
27.
Zurück zum Zitat Ju, Y.-L., Tsai, I.-M., Kuo, S.-Y.: Quantum circuit design and analysis for database search applications. IEEE Trans. Circuits Syst. I Regul. Pap. 54(11), 2552–2563 (2007)CrossRef Ju, Y.-L., Tsai, I.-M., Kuo, S.-Y.: Quantum circuit design and analysis for database search applications. IEEE Trans. Circuits Syst. I Regul. Pap. 54(11), 2552–2563 (2007)CrossRef
28.
Zurück zum Zitat Karafyllidis, I.G.: Quantum computer simulator based on the circuit model of quantum computation. IEEE Trans. Circuits Syst. I Regul. Pap. 52(8), 1590–1596 (2005)MathSciNetCrossRef Karafyllidis, I.G.: Quantum computer simulator based on the circuit model of quantum computation. IEEE Trans. Circuits Syst. I Regul. Pap. 52(8), 1590–1596 (2005)MathSciNetCrossRef
29.
Zurück zum Zitat Kong, B.Y., Yoo, H., Park, I.-C.: Efficient sorting architecture for successive–cancellation–list decoding of polar codes. IEEE Trans. Circuits Syst. II Express Br. 63(7), 673–677 (2016) Kong, B.Y., Yoo, H., Park, I.-C.: Efficient sorting architecture for successive–cancellation–list decoding of polar codes. IEEE Trans. Circuits Syst. II Express Br. 63(7), 673–677 (2016)
30.
Zurück zum Zitat Shu, H., Yu, R., Jiang, W., Yang, W.: Efficient implementation of \(k\)-nearest neighbor classifier using vote count circuit. IEEE Trans. Circuits Syst. II Express Br. 61(6), 448–452 (2014) Shu, H., Yu, R., Jiang, W., Yang, W.: Efficient implementation of \(k\)-nearest neighbor classifier using vote count circuit. IEEE Trans. Circuits Syst. II Express Br. 61(6), 448–452 (2014)
Metadaten
Titel
A privacy preserving quantum aggregating technique
verfasst von
Kartick Sutradhar
Ranjitha Venkatesh
Publikationsdatum
01.04.2024
Verlag
Springer US
Erschienen in
Quantum Information Processing / Ausgabe 4/2024
Print ISSN: 1570-0755
Elektronische ISSN: 1573-1332
DOI
https://doi.org/10.1007/s11128-024-04333-w

Weitere Artikel der Ausgabe 4/2024

Quantum Information Processing 4/2024 Zur Ausgabe