Skip to main content
Erschienen in: Quantum Information Processing 9/2017

01.09.2017

Quantum solution to a class of two-party private summation problems

verfasst von: Run-Hua Shi, Shun Zhang

Erschienen in: Quantum Information Processing | Ausgabe 9/2017

Einloggen

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

search-config
loading …

Abstract

In this paper, we define a class of special two-party private summation (S2PPS) problems and present a common quantum solution to S2PPS problems. Compared to related classical solutions, our solution has advantages of higher security and lower communication complexity, and especially it can ensure the fairness of two parties without the help of a third party. Furthermore, we investigate the practical applications of our proposed S2PPS protocol in many privacy-preserving settings with big data sets, including private similarity decision, anonymous authentication, social networks, secure trade negotiation, secure data mining.

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 Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science (FOCS’ 82), p. 160 (1982) Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science (FOCS’ 82), p. 160 (1982)
2.
Zurück zum Zitat Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC’87), p. 218 (1987) Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC’87), p. 218 (1987)
3.
Zurück zum Zitat Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the 27th Annual Symposium on Foundations of Computer Science (FOCS’86), p. 162 (1986) Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the 27th Annual Symposium on Foundations of Computer Science (FOCS’86), p. 162 (1986)
4.
Zurück zum Zitat Lindell, Y., Pinkas, B.: A proof of Yao’s protocol for secure two-party computation. J. Cryptol. 22, 161 (2009)CrossRefMATH Lindell, Y., Pinkas, B.: A proof of Yao’s protocol for secure two-party computation. J. Cryptol. 22, 161 (2009)CrossRefMATH
5.
Zurück zum Zitat Lindell, Y., Pinkas, B.: Secure multiparty computation for privacy-preserving data mining. J. Priv. Confid. 1, 59 (2009) Lindell, Y., Pinkas, B.: Secure multiparty computation for privacy-preserving data mining. J. Priv. Confid. 1, 59 (2009)
7.
Zurück zum Zitat Atallah, M.J., Du, W.: Secure multi-party computational geometry. In: Proceedings of the 7th International Workshop on Algorithms and Data Structures, LNCS 2125, p. 165 (2001) Atallah, M.J., Du, W.: Secure multi-party computational geometry. In: Proceedings of the 7th International Workshop on Algorithms and Data Structures, LNCS 2125, p. 165 (2001)
8.
Zurück zum Zitat Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Proceedings of the Advances in Cryptology—Eurocrypt 2004, LNCS 3027, p. 1 (2004) Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Proceedings of the Advances in Cryptology—Eurocrypt 2004, LNCS 3027, p. 1 (2004)
9.
Zurück zum Zitat Cristofaro, E.D., Gasti, P., Tsudik, G.: Fast and private computation of cardinality of set intersection and union. In: Proceedings of the Cryptology and Network Security, LNCS 7712, p. 218 (2012) Cristofaro, E.D., Gasti, P., Tsudik, G.: Fast and private computation of cardinality of set intersection and union. In: Proceedings of the Cryptology and Network Security, LNCS 7712, p. 218 (2012)
10.
Zurück zum Zitat Wu, M.E., Chang, S.Y., Lu, C.J., Sun, H.M.: A communication-efficient private matching scheme in Client–Server model. Inf. Sci. 275, 348 (2014)MathSciNetCrossRefMATH Wu, M.E., Chang, S.Y., Lu, C.J., Sun, H.M.: A communication-efficient private matching scheme in Client–Server model. Inf. Sci. 275, 348 (2014)MathSciNetCrossRefMATH
11.
Zurück zum Zitat Vaidya, J., Shafiq, B., Fan, W., Mehmood, D., Lorenzi, D.: A random decision tree framework for privacy-preserving data mining. IEEE Trans. Dependable Secur. Comput. 11, 399 (2014)CrossRef Vaidya, J., Shafiq, B., Fan, W., Mehmood, D., Lorenzi, D.: A random decision tree framework for privacy-preserving data mining. IEEE Trans. Dependable Secur. Comput. 11, 399 (2014)CrossRef
12.
Zurück zum Zitat Debnath, S.K., Dutta, R.: Secure and efficient private set intersection cardinality using bloom filter. In: Proceedings of the Information Security, LNCS 9290, p. 209 (2015) Debnath, S.K., Dutta, R.: Secure and efficient private set intersection cardinality using bloom filter. In: Proceedings of the Information Security, LNCS 9290, p. 209 (2015)
13.
Zurück zum Zitat Chan, P., Lucio-Martinez, I., Mo, X.F., Simon, C., Tittel, W.: Performing private database queries in a real-world environment using a quantum protocol. Sci. Rep. 4, 5233 (2014)ADSCrossRef Chan, P., Lucio-Martinez, I., Mo, X.F., Simon, C., Tittel, W.: Performing private database queries in a real-world environment using a quantum protocol. Sci. Rep. 4, 5233 (2014)ADSCrossRef
14.
Zurück zum Zitat Tan, S.H., Kettlewell, J.A., Ouyang, Y.K., Chen, L., Fitzsimons, J.F.: A quantum approach to homomorphic encryption. Sci. Rep. 6, 33467 (2016)ADSCrossRef Tan, S.H., Kettlewell, J.A., Ouyang, Y.K., Chen, L., Fitzsimons, J.F.: A quantum approach to homomorphic encryption. Sci. Rep. 6, 33467 (2016)ADSCrossRef
15.
Zurück zum Zitat Brassard, G.: Modern Cryptology: A Tutorial. Lecture Notes in Computer Science, vol. 325. Springer, New York (1988)MATH Brassard, G.: Modern Cryptology: A Tutorial. Lecture Notes in Computer Science, vol. 325. Springer, New York (1988)MATH
16.
Zurück zum Zitat Shor, P.W.: Algorithms for quantum computation—discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, p. 124 (1994) Shor, P.W.: Algorithms for quantum computation—discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, p. 124 (1994)
17.
Zurück zum Zitat Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, p. 212 (1996) Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, p. 212 (1996)
18.
Zurück zum Zitat Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. In: Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, p. 175 (1984) Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. In: Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, p. 175 (1984)
19.
Zurück zum Zitat Boykin, P.O., Roychowdhury, V.: Optimal encryption of quantum bits. Phys. Rev. A 67, 042317 (2003)ADSCrossRef Boykin, P.O., Roychowdhury, V.: Optimal encryption of quantum bits. Phys. Rev. A 67, 042317 (2003)ADSCrossRef
20.
Zurück zum Zitat Lai, H., Zhang, J., Luo, M.X., Pan, L., Pieprzyk, J., Xiao, F.Y., Orgun, M.A.: Hybrid threshold adaptable quantum secret sharing scheme with reverse Huffman–Fibonacci-tree coding. Sci. Rep. 6, 31350 (2016)ADSCrossRef Lai, H., Zhang, J., Luo, M.X., Pan, L., Pieprzyk, J., Xiao, F.Y., Orgun, M.A.: Hybrid threshold adaptable quantum secret sharing scheme with reverse Huffman–Fibonacci-tree coding. Sci. Rep. 6, 31350 (2016)ADSCrossRef
21.
Zurück zum Zitat Farouk, A., Zakaria, M., Megahed, A., Omara, F.A.: A generalized architecture of quantum secure direct communication for N disjointed users with authentication. Sci. Rep. 5, 16080 (2015)ADSCrossRef Farouk, A., Zakaria, M., Megahed, A., Omara, F.A.: A generalized architecture of quantum secure direct communication for N disjointed users with authentication. Sci. Rep. 5, 16080 (2015)ADSCrossRef
22.
Zurück zum Zitat Wang, T.Y., Cai, X.Q., Ren, Y.L., Zhang, R.L.: Security of quantum digital signatures for classical messages. Sci. Rep. 5, 9231 (2015)CrossRef Wang, T.Y., Cai, X.Q., Ren, Y.L., Zhang, R.L.: Security of quantum digital signatures for classical messages. Sci. Rep. 5, 9231 (2015)CrossRef
23.
Zurück zum Zitat Crépeau, C., Gottesman, D., Smith, A.: Secure multi-party quantum computation. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, p. 643 (2002) Crépeau, C., Gottesman, D., Smith, A.: Secure multi-party quantum computation. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, p. 643 (2002)
24.
Zurück zum Zitat Ben-or, M., Crépeau, C., Gottesman, D., Hassidim, A., Smith, A.: Secure multiparty quantum computation with (only) a strict honest majority. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, p. 249 (2006) Ben-or, M., Crépeau, C., Gottesman, D., Hassidim, A., Smith, A.: Secure multiparty quantum computation with (only) a strict honest majority. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, p. 249 (2006)
25.
Zurück zum Zitat Unruh, D.: Universally composable quantum multi-party computation. In: Proceedings of the Advances in Cryptology—EUROCRYPT 2010, LNCS 6110, p. 486 (2010) Unruh, D.: Universally composable quantum multi-party computation. In: Proceedings of the Advances in Cryptology—EUROCRYPT 2010, LNCS 6110, p. 486 (2010)
26.
Zurück zum Zitat Jakobi, M., Simon, C., Gisin, N., et al.: Practical private database queries based on a quantum key distribution protocol. Phys. Rev. A 83, 022301 (2011)ADSCrossRef Jakobi, M., Simon, C., Gisin, N., et al.: Practical private database queries based on a quantum key distribution protocol. Phys. Rev. A 83, 022301 (2011)ADSCrossRef
27.
Zurück zum Zitat Gao, F., Liu, B., Wen, Q., Chen, H.: Flexible quantum private queries based on quantum key distribution. Opt. Express 20, 17411 (2012)ADSCrossRef Gao, F., Liu, B., Wen, Q., Chen, H.: Flexible quantum private queries based on quantum key distribution. Opt. Express 20, 17411 (2012)ADSCrossRef
28.
Zurück zum Zitat Gao, F., Liu, B., Huang, W., Wen, Q.: Post-processing of the oblivious key in quantum private queries. IEEE. J. Sel. Top. Quantum Electr. 21, 6600111 (2015) Gao, F., Liu, B., Huang, W., Wen, Q.: Post-processing of the oblivious key in quantum private queries. IEEE. J. Sel. Top. Quantum Electr. 21, 6600111 (2015)
29.
Zurück zum Zitat Liu, B., Gao, F., Huang, W., Wen, Q.: QKD-based quantum private query without a failure probability. Sci. China Phys. Mech. Astron. 58, 100301 (2015)CrossRef Liu, B., Gao, F., Huang, W., Wen, Q.: QKD-based quantum private query without a failure probability. Sci. China Phys. Mech. Astron. 58, 100301 (2015)CrossRef
30.
Zurück zum Zitat Wei, C., Wang, T., Gao, F.: Practical quantum private query with better performance in resisting joint-measurement attack. Phys. Rev. A 93, 042318 (2016)ADSCrossRef Wei, C., Wang, T., Gao, F.: Practical quantum private query with better performance in resisting joint-measurement attack. Phys. Rev. A 93, 042318 (2016)ADSCrossRef
31.
Zurück zum Zitat Lo, H.K.: Insecurity of quantum secure computations. Phys. Rev. A 56, 1154 (1997)ADSCrossRef Lo, H.K.: Insecurity of quantum secure computations. Phys. Rev. A 56, 1154 (1997)ADSCrossRef
32.
Zurück zum Zitat Colbeck, R.: Impossibility of secure two-party classical computation. Phys. Rev. A 76, 062308 (2007)ADSCrossRef Colbeck, R.: Impossibility of secure two-party classical computation. Phys. Rev. A 76, 062308 (2007)ADSCrossRef
33.
Zurück zum Zitat Buhrman, H., Christandl, M., Schaffner, C.: Complete insecurity of quantum protocols for classical two-party computation. Phys. Rev. Lett. 109, 160501 (2012)ADSCrossRef Buhrman, H., Christandl, M., Schaffner, C.: Complete insecurity of quantum protocols for classical two-party computation. Phys. Rev. Lett. 109, 160501 (2012)ADSCrossRef
34.
Zurück zum Zitat Hardy, L., Kent, A.: Cheat sensitive quantum bit commitment. Phys. Rev. Lett. 92, 157901 (2004)ADSCrossRef Hardy, L., Kent, A.: Cheat sensitive quantum bit commitment. Phys. Rev. Lett. 92, 157901 (2004)ADSCrossRef
36.
Zurück zum Zitat Olejnik, L.: Secure quantum private information retrieval using phase-encoded queries. Phys. Rev. A 84, 022313 (2011)ADSCrossRef Olejnik, L.: Secure quantum private information retrieval using phase-encoded queries. Phys. Rev. A 84, 022313 (2011)ADSCrossRef
37.
Zurück zum Zitat Shi, R.H., Mu, Y., Zhong, H., Zhang, S.: Quantum oblivious set-member decision protocol. Phys. Rev. A 92, 022309 (2015)ADSCrossRef Shi, R.H., Mu, Y., Zhong, H., Zhang, S.: Quantum oblivious set-member decision protocol. Phys. Rev. A 92, 022309 (2015)ADSCrossRef
38.
Zurück zum Zitat Shi, R.H., Mu, Y., Zhong, H., Cui, J., Zhang, S.: Secure multiparty quantum computation for summation and multiplication. Sci. Rep. 6, 19655 (2016)ADSCrossRef Shi, R.H., Mu, Y., Zhong, H., Cui, J., Zhang, S.: Secure multiparty quantum computation for summation and multiplication. Sci. Rep. 6, 19655 (2016)ADSCrossRef
39.
Zurück zum Zitat Brassard, G., Høyer, P., Tapp, A.: Quantum counting. In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming, LNCS 1443, p. 820 (1998) Brassard, G., Høyer, P., Tapp, A.: Quantum counting. In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming, LNCS 1443, p. 820 (1998)
41.
42.
43.
Zurück zum Zitat Holevo, A.: Probabilistic and Statistical Aspects of Quantum Theory. Publications of the Scuola Normale Superiore. Springer, New York (2011)CrossRef Holevo, A.: Probabilistic and Statistical Aspects of Quantum Theory. Publications of the Scuola Normale Superiore. Springer, New York (2011)CrossRef
Metadaten
Titel
Quantum solution to a class of two-party private summation problems
verfasst von
Run-Hua Shi
Shun Zhang
Publikationsdatum
01.09.2017
Verlag
Springer US
Erschienen in
Quantum Information Processing / Ausgabe 9/2017
Print ISSN: 1570-0755
Elektronische ISSN: 1573-1332
DOI
https://doi.org/10.1007/s11128-017-1676-x

Weitere Artikel der Ausgabe 9/2017

Quantum Information Processing 9/2017 Zur Ausgabe

Neuer Inhalt