Skip to main content

2019 | OriginalPaper | Buchkapitel

A Verifiable Fully Homomorphic Encryption Scheme

verfasst von : Ruwei Huang, Zhikun Li, Jianan Zhao

Erschienen in: Security, Privacy, and Anonymity in Computation, Communication, and Storage

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

With development of cloud computing, how to keep privacy and compute outsourcing data effectively at the same time is highly significant in practice. Homomorphic encryption is a common method to support ciphertext calculation, but most schemes do not provide fully homomorphic properties. Some fully homomorphic encryption schemes feature complicated design, high computational complexity and no practicability. Some cloud service providers are not trustable and return incorrect computational results due to resource saving or other malicious behaviors. Therefore, this paper proposes a verifiable fully homomorphic encryption scheme VFHES. VFHES implements fully homomorphic encryption based on the principle of the matrix computing principle and matrix blinding technology and supports to verify correctness of the computational results. Security analysis proves that VFHES is privacy-safe and verifiable. The performance analysis and experimental results show that VFHES is practicable and effective.

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 Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the Annual ACM Symposium on Theory of Computing, Bethesda, pp. 169–178. ACM (2009) Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the Annual ACM Symposium on Theory of Computing, Bethesda, pp. 169–178. ACM (2009)
3.
Zurück zum Zitat Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: Foundations of Computer Science, CA, pp. 97–106. IEEE (2011) Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: Foundations of Computer Science, CA, pp. 97–106. IEEE (2011)
4.
Zurück zum Zitat Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled)fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 309–325. ACM Press, New York (2012) Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled)fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 309–325. ACM Press, New York (2012)
7.
Zurück zum Zitat Jin, F., Zhu, Y., Luo, X.: Verifiable fully homomorphic encryption scheme. In: International Conference on Consumer Electronics, Communications and Networks, Yichang, pp. 743–746. IEEE (2012) Jin, F., Zhu, Y., Luo, X.: Verifiable fully homomorphic encryption scheme. In: International Conference on Consumer Electronics, Communications and Networks, Yichang, pp. 743–746. IEEE (2012)
8.
Zurück zum Zitat Zhou, J., Cao, Z., Dong, X., et al.: EVOC: more efficient verifiable outsourced computation from any one-way trapdoor function. In: IEEE International Conference on Communications, pp. 7444–7449. IEEE (2015) Zhou, J., Cao, Z., Dong, X., et al.: EVOC: more efficient verifiable outsourced computation from any one-way trapdoor function. In: IEEE International Conference on Communications, pp. 7444–7449. IEEE (2015)
9.
Zurück zum Zitat Ahmed, E.Y., El Kettani, M.D.E.C.: A verifiable fully homomorphic encryption scheme to secure big data in cloud computing. In: International Conference on Wireless Networks and Mobile Communications, Rabat, pp. 1–5. IEEE (2017) Ahmed, E.Y., El Kettani, M.D.E.C.: A verifiable fully homomorphic encryption scheme to secure big data in cloud computing. In: International Conference on Wireless Networks and Mobile Communications, Rabat, pp. 1–5. IEEE (2017)
10.
Zurück zum Zitat Zhao, Q., Zeng, Q., Liu, X., Xu, H.: Verifiable computation using re-randomizable garbled circuits. J. Softw. 30(2), 399–415 (2019) Zhao, Q., Zeng, Q., Liu, X., Xu, H.: Verifiable computation using re-randomizable garbled circuits. J. Softw. 30(2), 399–415 (2019)
11.
Zurück zum Zitat Xu, J., Wei, L.W., Zhang, Y.: Dynamic fully homomorphic encryption-based Merkle tree for lightweight streaming authenticated data structures. J. Netw. Comput. Appl. 107, 113–124 (2018)CrossRef Xu, J., Wei, L.W., Zhang, Y.: Dynamic fully homomorphic encryption-based Merkle tree for lightweight streaming authenticated data structures. J. Netw. Comput. Appl. 107, 113–124 (2018)CrossRef
Metadaten
Titel
A Verifiable Fully Homomorphic Encryption Scheme
verfasst von
Ruwei Huang
Zhikun Li
Jianan Zhao
Copyright-Jahr
2019
DOI
https://doi.org/10.1007/978-3-030-24907-6_31