Skip to main content
Erschienen in: Quantum Information Processing 1/2016

01.01.2016

An efficient quantum scheme for Private Set Intersection

verfasst von: Run-hua Shi, Yi Mu, Hong Zhong, Jie Cui, Shun Zhang

Erschienen in: Quantum Information Processing | Ausgabe 1/2016

Einloggen

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

search-config
loading …

Abstract

Private Set Intersection allows a client to privately compute set intersection with the collaboration of the server, which is one of the most fundamental and key problems within the multiparty collaborative computation of protecting the privacy of the parties. In this paper, we first present a cheat-sensitive quantum scheme for Private Set Intersection. Compared with classical schemes, our scheme has lower communication complexity, which is independent of the size of the server’s set. Therefore, it is very suitable for big data services in Cloud or large-scale client–server networks.

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 Freedman, M.J., Nissim, K., Pinkas, B.: Efficient Private Matching and Set Intersection. In Proc. of EUROCRYPT, LNCS 3027, (Interlaken, Switzerland, 2004) 1–19 (2004) Freedman, M.J., Nissim, K., Pinkas, B.: Efficient Private Matching and Set Intersection. In Proc. of EUROCRYPT, LNCS 3027, (Interlaken, Switzerland, 2004) 1–19 (2004)
2.
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. Inform. Sci. 275(10), 348–359 (2014)MathSciNetCrossRef Wu, M.E., Chang, S.Y., Lu, C.J., Sun, H.M.: A communication-efficient private matching scheme in Client-Server model. Inform. Sci. 275(10), 348–359 (2014)MathSciNetCrossRef
3.
Zurück zum Zitat De Cristofaro, E., Tsudik, G.: Fast and private computation of cardinality of set intersection and union. In Proceedings of Financial Crypto, LNCS 6052, (Canary Islands, Spain, 2010) pp. 143–159 (2010) De Cristofaro, E., Tsudik, G.: Fast and private computation of cardinality of set intersection and union. In Proceedings of Financial Crypto, LNCS 6052, (Canary Islands, Spain, 2010) pp. 143–159 (2010)
4.
Zurück zum Zitat Zhan, J., Cabrera, L., Osman, G., Shah, R.: Using private matching for securely querying genomic sequences. In Proceedings of IEEE Third International Conference on Privacy, Security, Risk and Trust (passat) and Third International Conference On Social Computing (socialcom), (IEEE 2011) pp. 1163–1168 (2011) Zhan, J., Cabrera, L., Osman, G., Shah, R.: Using private matching for securely querying genomic sequences. In Proceedings of IEEE Third International Conference on Privacy, Security, Risk and Trust (passat) and Third International Conference On Social Computing (socialcom), (IEEE 2011) pp. 1163–1168 (2011)
5.
Zurück zum Zitat Li, Y., Tygar, J., Hellerstein, J.: Private matching. In: Proceedings of Computer Security in the 21st Century, pp 25–50 (2005) Li, Y., Tygar, J., Hellerstein, J.: Private matching. In: Proceedings of Computer Security in the 21st Century, pp 25–50 (2005)
6.
Zurück zum Zitat Chun, J.Y., Hong, D., Jeong, I.R., Lee, D.H.: Privacy-preserving disjunctive normal form operations on distributed sets. Inform. Sci. 231(10), 113–122 (2013)MATHMathSciNetCrossRef Chun, J.Y., Hong, D., Jeong, I.R., Lee, D.H.: Privacy-preserving disjunctive normal form operations on distributed sets. Inform. Sci. 231(10), 113–122 (2013)MATHMathSciNetCrossRef
7.
Zurück zum Zitat Pervez, Z., Awan, A.A., Khattak, A.M., Lee, S., Huh, E.N.: Privacy-aware searching with oblivious term matching for cloud storage. J. Supercomput. 63(2), 538–560 (2013)CrossRef Pervez, Z., Awan, A.A., Khattak, A.M., Lee, S., Huh, E.N.: Privacy-aware searching with oblivious term matching for cloud storage. J. Supercomput. 63(2), 538–560 (2013)CrossRef
8.
Zurück zum Zitat Narayanan, A., Thiagarajan, N., Lakhani, M., Hamburg, M., Boneh, D.: Location privacy via private proximity testing. In Proceedings of the Network and Distributed System Security Symposium (NDSS 2011), (San Diego, CA, USA), (2011) Narayanan, A., Thiagarajan, N., Lakhani, M., Hamburg, M., Boneh, D.: Location privacy via private proximity testing. In Proceedings of the Network and Distributed System Security Symposium (NDSS 2011), (San Diego, CA, USA), (2011)
9.
Zurück zum Zitat Bursztein, E., Hamburg, M., Lagarenne, J., Boneh, D.: Openconflict: preventing real time map hacks in online games. In: Proceedings of IEEE S&P 2011, pp 506–520 (2011) Bursztein, E., Hamburg, M., Lagarenne, J., Boneh, D.: Openconflict: preventing real time map hacks in online games. In: Proceedings of IEEE S&P 2011, pp 506–520 (2011)
10.
Zurück zum Zitat Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Proceedings of Theory of Cryptography Conference (TCC), LNCS 4948, (New York, USA, 2008), pp 155–175 (2008) Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Proceedings of Theory of Cryptography Conference (TCC), LNCS 4948, (New York, USA, 2008), pp 155–175 (2008)
11.
Zurück zum Zitat Liu, L., Cao, Z.: Private matching protocols without error probability. In: Proceedings of the IEEE International Conference on Computer Science and Automation Engineering (CSAE), vol. 4, (IEEE, 2011) pp. 363–366 (2011) Liu, L., Cao, Z.: Private matching protocols without error probability. In: Proceedings of the IEEE International Conference on Computer Science and Automation Engineering (CSAE), vol. 4, (IEEE, 2011) pp. 363–366 (2011)
12.
Zurück zum Zitat Marconi, L., Conti, M., Di Pietro, R.: Cassandra: a probabilistic, efficient, and privacy-preserving solution to compute set intersection. Int. J. Inform. Secur. 10(5), 1–19 (2011) Marconi, L., Conti, M., Di Pietro, R.: Cassandra: a probabilistic, efficient, and privacy-preserving solution to compute set intersection. Int. J. Inform. Secur. 10(5), 1–19 (2011)
13.
Zurück zum Zitat Kerschbaum, F.: Outsourced private set intersection using homomorphic encryption. Proc. ACM ASIACCS 2012, 85–86 (2012) Kerschbaum, F.: Outsourced private set intersection using homomorphic encryption. Proc. ACM ASIACCS 2012, 85–86 (2012)
14.
Zurück zum Zitat Cristofaro, E.D., Tsudik, G.: Experimenting with fast private set intersection. In Proceedings of the 5th International Conference on Trust and Trustworthy Computing (TRUST 2012), LNCS 7344, pp. 55–73 (2012) Cristofaro, E.D., Tsudik, G.: Experimenting with fast private set intersection. In Proceedings of the 5th International Conference on Trust and Trustworthy Computing (TRUST 2012), LNCS 7344, pp. 55–73 (2012)
15.
Zurück zum Zitat Shao, Z.Y., Yan, B.: Private set intersection via public key encryption with keywords search. Secur. Commun. Netw. 8(3), 396–402 (2015)CrossRef Shao, Z.Y., Yan, B.: Private set intersection via public key encryption with keywords search. Secur. Commun. Netw. 8(3), 396–402 (2015)CrossRef
16.
Zurück zum Zitat Barnum, H., Cr’epeau, C., Gottesman, D., Smith, A. and Tapp, A.: Authentication of quantum messages. In: Proceedings of 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 449–458 (2002) Barnum, H., Cr’epeau, C., Gottesman, D., Smith, A. and Tapp, A.: Authentication of quantum messages. In: Proceedings of 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 449–458 (2002)
17.
Zurück zum Zitat Aharonov, D., Ben-Or, M. and Eban, E.: Interactive proofs for quantum computations. In: Proceedings of Innovations in Computer Science, arXiv:0810.5375 (2008) Aharonov, D., Ben-Or, M. and Eban, E.: Interactive proofs for quantum computations. In: Proceedings of Innovations in Computer Science, arXiv:​0810.​5375 (2008)
18.
Zurück zum Zitat Grover, L. K: A fast quantum mechanical algorithm for database search. In: Proceedings of 28th Annual ACM Symposium on Theory of Computing, pp. 212–219 (1996) Grover, L. K: A fast quantum mechanical algorithm for database search. In: Proceedings of 28th Annual ACM Symposium on Theory of Computing, pp. 212–219 (1996)
20.
Zurück zum Zitat Olejnik, L.: Secure quantum private information retrieval using phase-encoded queries. Phys. Rev. A 84(2), 022313 (2011)CrossRefADS Olejnik, L.: Secure quantum private information retrieval using phase-encoded queries. Phys. Rev. A 84(2), 022313 (2011)CrossRefADS
21.
Zurück zum Zitat Li, Y.B., Wen, Q.Y., Li, Z.C., Qin, S.J., Yang, Y.T.: Cheat sensitive quantum bit commitment via pre- and post- selected quantum states. Quantum Inf. Process. 13(1), 141–149 (2014)MATHCrossRefADS Li, Y.B., Wen, Q.Y., Li, Z.C., Qin, S.J., Yang, Y.T.: Cheat sensitive quantum bit commitment via pre- and post- selected quantum states. Quantum Inf. Process. 13(1), 141–149 (2014)MATHCrossRefADS
22.
Zurück zum Zitat Li, Y.B., Qin, S.J., Yuan, Z., Huang, W., Sun, Y.: Quantum private comparison against decoherence noise. Quantum Inf. Process. 12(6), 2191–2205 (2013)MATHMathSciNetCrossRefADS Li, Y.B., Qin, S.J., Yuan, Z., Huang, W., Sun, Y.: Quantum private comparison against decoherence noise. Quantum Inf. Process. 12(6), 2191–2205 (2013)MATHMathSciNetCrossRefADS
23.
Zurück zum Zitat Li, Y.B., Wang, T.Y., Chen, H.Y., Li, M.D., Yang, Y.T.: Fault-tolerate quantum private comparison based on GHZ states and ECC. Int. J. Theory Phys. 52(8), 2818–2825 (2013)MATHMathSciNetCrossRef Li, Y.B., Wang, T.Y., Chen, H.Y., Li, M.D., Yang, Y.T.: Fault-tolerate quantum private comparison based on GHZ states and ECC. Int. J. Theory Phys. 52(8), 2818–2825 (2013)MATHMathSciNetCrossRef
24.
Zurück zum Zitat Yu, K.F., Yang, C.W., Liao, C.H., Hwang, T.: Authenticated semi-quantum key distribution protocol using Bell states. Quantum Inf. Process. 13(6), 1457–1465 (2014)MathSciNetCrossRefADS Yu, K.F., Yang, C.W., Liao, C.H., Hwang, T.: Authenticated semi-quantum key distribution protocol using Bell states. Quantum Inf. Process. 13(6), 1457–1465 (2014)MathSciNetCrossRefADS
25.
Zurück zum Zitat Guan, D.J., Wang, Y.J., Zhuang, E.S.: A practical protocol for three-party authenticated quantum key distribution. Quantum Inf. Process. 13(11), 2355–2374 (2014)MATHMathSciNetCrossRef Guan, D.J., Wang, Y.J., Zhuang, E.S.: A practical protocol for three-party authenticated quantum key distribution. Quantum Inf. Process. 13(11), 2355–2374 (2014)MATHMathSciNetCrossRef
Metadaten
Titel
An efficient quantum scheme for Private Set Intersection
verfasst von
Run-hua Shi
Yi Mu
Hong Zhong
Jie Cui
Shun Zhang
Publikationsdatum
01.01.2016
Verlag
Springer US
Erschienen in
Quantum Information Processing / Ausgabe 1/2016
Print ISSN: 1570-0755
Elektronische ISSN: 1573-1332
DOI
https://doi.org/10.1007/s11128-015-1165-z

Weitere Artikel der Ausgabe 1/2016

Quantum Information Processing 1/2016 Zur Ausgabe

Neuer Inhalt