Skip to main content

2019 | OriginalPaper | Buchkapitel

Two Anti-quantum Attack Protocols for Secure Multiparty Computation

verfasst von : Lichao Chen, Zhanli Li, Zhenhua Chen, Yaru Liu

Erschienen in: Trusted Computing and Information Security

Verlag: Springer Singapore

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

search-config
loading …

Abstract

Millionaire problem and private set intersection problem are not only the basic issues in the secure multiparty computation, but also the building block for privacy-preserving cooperative computation. However, so far the existing solutions to the two problems cannot resist the quantum attack, and in the meanwhile are inefficient enough. Aiming at these drawbacks, in this paper we first construct two new 0–1 encoding. Subsequently, using the designed 0–1 encoding, we transform Millionaire problem into the summation problem, and further transform the set intersection problem into the product problem. Lastly, taking advantage of NTRU homomorphic encryption, we propose Protocol 1 for Millionaire problem and Protocol 2 for the secure set intersection problem, respectively. The final analyses indicate that the two protocols designed in this paper are not only secure against the quantum attack but also more efficient compared with the previous schemes, In addition, Protocol 1 has more fine-grained comparing result for any two elements in total order set than the previous; Protocol 2 has a two-fold functionality in that it is not only secure against quantum attacks but also applicable for cloud computing environment.

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 23rd IEEE Symposium on Foundations of Computer Science, Piscataway, pp. 160–164. IEEE (1982) Yao, A.C.: Protocols for secure computations. In: Proceedings of 23rd IEEE Symposium on Foundations of Computer Science, Piscataway, pp. 160–164. IEEE (1982)
2.
Zurück zum Zitat Feng, D.G., Zhang, M., Zhang, Y., et al.: Study on cloud computing security. J. Softw. 22(1), 71–83 (2011). (in Chinese)CrossRef Feng, D.G., Zhang, M., Zhang, Y., et al.: Study on cloud computing security. J. Softw. 22(1), 71–83 (2011). (in Chinese)CrossRef
3.
Zurück zum Zitat Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth Annual ACM Conference on Theory of Computing, Piscataway, pp. 218–229. IEEE Press (1987) Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth Annual ACM Conference on Theory of Computing, Piscataway, pp. 218–229. IEEE Press (1987)
4.
Zurück zum Zitat Goldreich, O.: Foundations of Cryptography: Basic Applications, pp. 599–729. Cambridge University Press, London (2004)MATH Goldreich, O.: Foundations of Cryptography: Basic Applications, pp. 599–729. Cambridge University Press, London (2004)MATH
5.
Zurück zum Zitat Li, Y.P., Chen, M.H., Li, Q.W., et al.: Enabling multilevel trust in privacy preserving data mining. IEEE Trans. Knowl. Data Eng. Inst. Electr. Electron. Eng. 24(9), 1598–1612 (2012) Li, Y.P., Chen, M.H., Li, Q.W., et al.: Enabling multilevel trust in privacy preserving data mining. IEEE Trans. Knowl. Data Eng. Inst. Electr. Electron. Eng. 24(9), 1598–1612 (2012)
6.
Zurück zum Zitat Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proceedings of ACM International Conference oil Management of Data and Symposium on Principles of Database Systems, pp. 439–450. ACM Press, New York (2000) Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proceedings of ACM International Conference oil Management of Data and Symposium on Principles of Database Systems, pp. 439–450. ACM Press, New York (2000)
7.
Zurück zum Zitat Lindell, Y., Pinkas, B.: Secure multiparty computation for privacy-preserving data mining. J. Priv. Confid. 25(2), 761–766 (2009) Lindell, Y., Pinkas, B.: Secure multiparty computation for privacy-preserving data mining. J. Priv. Confid. 25(2), 761–766 (2009)
8.
Zurück zum Zitat Clifton, C., Marks, D.: Security and privacy implications of data mining. In: Proceedings of the ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, pp. 15–19. ACM Press, New York (1996) Clifton, C., Marks, D.: Security and privacy implications of data mining. In: Proceedings of the ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, pp. 15–19. ACM Press, New York (1996)
11.
Zurück zum Zitat Du, W.L., Atallah, M.J.: Privacy-preserving cooperative scientific computations. In: Proceedings of 14th IEEE Computer Security Foundations Workshop Lecture, Piscataway, pp. 273–282. IEEE Press (2001) Du, W.L., Atallah, M.J.: Privacy-preserving cooperative scientific computations. In: Proceedings of 14th IEEE Computer Security Foundations Workshop Lecture, Piscataway, pp. 273–282. IEEE Press (2001)
12.
Zurück zum Zitat Chen, Z.H., Li, S.D., Huang, Q., et al.: Privacy-preserving determination of spatial location relation in cloud computing. Chin. J. Comput. 40(2), 351–363 (2017). (in Chinese)MathSciNet Chen, Z.H., Li, S.D., Huang, Q., et al.: Privacy-preserving determination of spatial location relation in cloud computing. Chin. J. Comput. 40(2), 351–363 (2017). (in Chinese)MathSciNet
14.
Zurück zum Zitat Yao, A.C.: How to generate and exchange secrets. In: Proceedings of 27th Annual Symposium on Foundations of Computer Science (FOCS 1986), pp. 162–167. Institute of Electrical and Electronics Engineers (1986) Yao, A.C.: How to generate and exchange secrets. In: Proceedings of 27th Annual Symposium on Foundations of Computer Science (FOCS 1986), pp. 162–167. Institute of Electrical and Electronics Engineers (1986)
16.
Zurück zum Zitat Ioannidis, I., Grama, A.: An efficient protocol for Yao’s millionaires’ problem. In: Proceedings of the 36th Hawaii International Conference on System Sciences, Hawaii, USA, pp. 6–9 (2003) Ioannidis, I., Grama, A.: An efficient protocol for Yao’s millionaires’ problem. In: Proceedings of the 36th Hawaii International Conference on System Sciences, Hawaii, USA, pp. 6–9 (2003)
17.
18.
Zurück zum Zitat Li, S.D., Wang, D.S.: Efficient secure multiparty computation based on homomorphic encryption. Chin. J. Electron. 41(4), 798–803 (2013). (in Chinese)MathSciNet Li, S.D., Wang, D.S.: Efficient secure multiparty computation based on homomorphic encryption. Chin. J. Electron. 41(4), 798–803 (2013). (in Chinese)MathSciNet
19.
Zurück zum Zitat Zuo, X.J., Li, S.D., Yang, X.L.: An efficient homomorphic encryption based solution to millionaires’ problem. J. Chin. Comput. Syst., 455–459 (2017). (in Chinese) Zuo, X.J., Li, S.D., Yang, X.L.: An efficient homomorphic encryption based solution to millionaires’ problem. J. Chin. Comput. Syst., 455–459 (2017). (in Chinese)
20.
Zurück zum Zitat Pinkas, B., Schneider, T., Zohner, M.: Faster private set intersection based on OT extension. In: USENIX Security 2014, pp. 797–812. USENIX (2014) Pinkas, B., Schneider, T., Zohner, M.: Faster private set intersection based on OT extension. In: USENIX Security 2014, pp. 797–812. USENIX (2014)
22.
Zurück zum Zitat Zhu, G.B., Tan, Y.W., Zhao, Y., et al.: An efficient and secure geometric intersection computation protocol. J. Univ. Electron. Sci. Technol. China 43(5), 781–786 (2014). (in Chinese) Zhu, G.B., Tan, Y.W., Zhao, Y., et al.: An efficient and secure geometric intersection computation protocol. J. Univ. Electron. Sci. Technol. China 43(5), 781–786 (2014). (in Chinese)
23.
Zurück zum Zitat Li, S.D., Dou, J.W., Jia, X.L.: Secure two-party computation for set intersection problem. J. Xian Jiaotong Univ. 40(10), 1091–1093 (2006). (in Chinese)MathSciNetMATH Li, S.D., Dou, J.W., Jia, X.L.: Secure two-party computation for set intersection problem. J. Xian Jiaotong Univ. 40(10), 1091–1093 (2006). (in Chinese)MathSciNetMATH
25.
Zurück zum Zitat Li, S.D., Zhou, S.F., Guo, Y.M., et al.: Secure set computing in cloud environment. J. Softw. 27(6), 1549–1565 (2016). (in Chinese)MathSciNetMATH Li, S.D., Zhou, S.F., Guo, Y.M., et al.: Secure set computing in cloud environment. J. Softw. 27(6), 1549–1565 (2016). (in Chinese)MathSciNetMATH
28.
Zurück zum Zitat Peikert, C.: Lattice cryptography for the internet. In: 6th International Conference on Post-Quantum Cryptograp (PQCrypto 2014), Waterloo, ON, Canada, pp. 197–219 (2014)MATH Peikert, C.: Lattice cryptography for the internet. In: 6th International Conference on Post-Quantum Cryptograp (PQCrypto 2014), Waterloo, ON, Canada, pp. 197–219 (2014)MATH
29.
Zurück zum Zitat Duan, R., Gu, C.X., Zhu, Y.F., et al.: Efficient identity-based fully homomorphic encryption over NTRU. J. Commun. 38(1), 66–75 (2017). (in Chinese) Duan, R., Gu, C.X., Zhu, Y.F., et al.: Efficient identity-based fully homomorphic encryption over NTRU. J. Commun. 38(1), 66–75 (2017). (in Chinese)
30.
Zurück zum Zitat Xia, F., Yang, B., Zhang, M.W., et al.: Secure two-party computation for set intersection and set equality problems based on LWE. J. Electron. Inf. Technol. 34(2), 462–467 (2012). (in Chinese) Xia, F., Yang, B., Zhang, M.W., et al.: Secure two-party computation for set intersection and set equality problems based on LWE. J. Electron. Inf. Technol. 34(2), 462–467 (2012). (in Chinese)
31.
Zurück zum Zitat Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC 2008, Victoria, BC, Canada, pp. 197–206. ACM (2008) Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC 2008, Victoria, BC, Canada, pp. 197–206. ACM (2008)
32.
Zurück zum Zitat López-Alt, A., Tromer, E., Vaikuntanathan, V.: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, pp. 1219–1234. ACM (2012) López-Alt, A., Tromer, E., Vaikuntanathan, V.: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, pp. 1219–1234. ACM (2012)
33.
Zurück zum Zitat Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. Found. Secur. Comput. 4(11), 169–180 (1978)MathSciNet Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. Found. Secur. Comput. 4(11), 169–180 (1978)MathSciNet
Metadaten
Titel
Two Anti-quantum Attack Protocols for Secure Multiparty Computation
verfasst von
Lichao Chen
Zhanli Li
Zhenhua Chen
Yaru Liu
Copyright-Jahr
2019
Verlag
Springer Singapore
DOI
https://doi.org/10.1007/978-981-13-5913-2_21