Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Soft Computing
Erschienen in: Soft Computing 6/2019

17.11.2017 | Methodologies and Application

Efficient obfuscation for CNF circuits and applications in cloud computing

verfasst von: Huang Zhang, Fangguo Zhang, Rong Cheng, Haibo Tian

Erschienen in: Soft Computing | Ausgabe 6/2019

Einloggen

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

search-config
loading …

Abstract

With the rapid development of cloud computing, amounts of new concerns for security have been suggested. Cryptographic protocols are useful tools to address the problem emerging in cloud computing. Among those protocols, program obfuscation gradually showed the exclusive advantages that it can provide for cloud computing. In this paper, we present a cloud signing scheme, which can outsource the signing rights of a client to a cloud server securely by applying obfuscation. To improve the efficiency of obfuscation, we construct an obfuscator for all polynomial-size CNF circuits, which has the potential to avoid matrix branching programs and multilinear maps. A new notion of homomorphic encoding schemes, whose functionality is weaker than that of graded encoding schemes, is defined to complete our construction. The obfuscator is proven to be virtual black-box secure in the idealized homomorphic encoding model.
Vorheriger Artikel Vibration control of a structure using sliding-mode hedge-algebras-based controller
Nächster Artikel Modeling and comparison of the series systems with imperfect coverage for an unreliable server

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!

Jetzt informieren

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!

Jetzt informieren

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!

Jetzt informieren
Fußnoten
1
Stack is an array in data structure with the property “first in first out”.
 
Literatur
Ananth P, Gupta D, Ishai Y, Sahai A (2014) Optimizing obfuscation: avoiding Barrington’s theorem. In: ACM conference on computer and communications security—CCS 2014, ACM, New York, NY, USA, CCS ’14, pp 646–658
Armbrust M, Fox A, Griffith R, Joseph AD, Katz R, Konwinski A, Lee G, Patterson D, Rabkin A, Stoica I, Zaharia M (2010) A view of cloud computing. Commun ACM 53(4):50–58CrossRef
Badrinarayanan S, Miles E, Sahai A, Zhandry M (2016) Post-zeroizing obfuscation: new mathematical tools, and the case of evasive circuits. In: Advances in cryptology—EUROCRYPT 2016. Springer, Berlin Heidelberg, pp 764–791
Barak B, Goldreich O, Impagliazzo R, Rudich S, Sahai A, Vadhan S, Yang K (2001) On the (im)possibility of obfuscating programs. In: Advances in cryptology—CRYPTO 2001. Springer, Berlin Heidelberg, pp 1–18
Barak B, Goldreich O, Impagliazzo R, Rudich S, Sahai A, Vadhan S, Yang K (2012) On the (im)possibility of obfuscating programs. J ACM 59(2):6:1–6:48MathSciNetCrossRefMATH
Barak B, Garg S, Kalai YT, Paneth O, Sahai A (2014) Protecting obfuscation against algebraic attacks. In: Nguyen PQ, Oswald E (eds) Advances in cryptology—EUROCRYPT 2014. Springer, Berlin, pp 221–238
Barrington DA (1986) Bounded-width polynomial-size branching programs recognize exactly those languages in NC\(^1\). In: ACM symposium on theory of computing—STOC 1986. ACM, pp 1–5
Boneh D, Sahai A, Waters B (2011) Functional encryption: definitions and challenges. In: Theory of cryptography–TCC 2011. Springer, Berlin Heidelberg, pp 253–273
Boneh D, Gupta D, Mironov I, Sahai A (2015) Hosting services on an untrusted cloud. Springer, Berlin, pp 404–436MATH
Brakerski Z, Rothblum GN (2013) Obfuscating conjunctions. In: Advances in cryptology—CRYPTO 2013. Springer, Berlin Heidelberg, pp 416–434
Brakerski Z, Rothblum GN (2014a) Black-box obfuscation for d-CNFs. In: Innovations in theoretical computer science—ITCS 2014. ACM, pp 235–250
Brakerski Z, Rothblum GN (2014) Virtual black-box obfuscation for all circuits via generic graded encoding. In: Theory of cryptography—TCC 2014. Springer, Berlin Heidelberg, pp 1–25
Chen X, Li J, Huang X, Li J, Xiang Y, Wong DS (2014a) Secure outsourced attribute-based signatures. IEEE Trans Parallel Distrib Syst 25(12):3285–3294CrossRef
Chen X, Li J, Ma J, Tang Q, Lou W (2014b) New algorithms for secure outsourcing of modular exponentiations. IEEE Trans Parallel Distrib Syst 25(9):2386–2396CrossRef
Cheng R, Yan J, Guan C, Zhang F, Ren K (2015) Verifiable searchable symmetric encryption from indistinguishability obfuscation. In: ACM symposium on information, computer and communications security—ASIACCS 2015, ASIA CCS ’15. ACM, New York, NY, USA, pp 621–626
Cheon JH, Han K, Lee C, Ryu H, Stehlé D (2015) Cryptanalysis of the multilinear map over the integers. In: Advances in cryptology—EUROCRYPT 2015. Springer, Berlin Heidelberg, pp 3–12
Cheon JH, Fouque PA, Lee C, Minaud B, Ryu H (2016) Cryptanalysis of the new CLT multilinear map over the integers. In: Advances in cryptology—EUROCRYPT 2016. Springer, Berlin Heidelberg, pp 509–536
Coron JS, Lepoint T, Tibouchi M (2013) Practical multilinear maps over the integers. In: Canetti R, Garay JA (eds) Advances in cryptology—CRYPTO 2013, pp 476–493
Coron JS, Gentry C, Halevi S, Lepoint T, Maji HK, Miles E, Raykova M, Sahai A, Tibouchi M (2015) Zeroizing without low-level zeroes: new mmap attacks and their limitations. In: Advances in cryptology—CRYPTO 2015. Springer, Berlin Heidelberg, pp 247–266
Coron JS, Lepoint T, Tibouchi M (2015) New multilinear maps over the integers. In: Advances in cryptology—CRYPTO 2015. Springer, Berlin Heidelberg, pp 267–286
Curtmola R, Garay J, Kamara S, Ostrovsky R (2006) Searchable symmetric encryption: Improved definitions and efficient constructions. In: ACM Conference on computer and communications security—CCS 2006, CCS ’06. ACM, New York, NY, USA, pp 79–88
Diffie W, Hellman ME (1976) Multiuser cryptographic techniques. In: Proceedings of the national computer conference and exposition, 7–10 June 1976, AFIPS ’76. ACM, New York, NY, USA, pp 109–112
Garg S, Gentry C, Halevi S (2013) Candidate multilinear maps from ideal lattices. In: Advances in cryptology—EUROCRYPT 2013. Springer, Berlin Heidelberg, pp 1–17
Garg S, Gentry C, Halevi S, Raykova M, Sahai A, Waters B (2013b) Candidate indistinguishability obfuscation and functional encryption for all circuits. In: Symposium on foundations of computer science—FOCS 2013, FOCS 2003, pp 40–49
Garg S, Miles E, Mukherjee P, Sahai A, Srinivasan A, Zhandry M (2016) Secure obfuscation in a weak multilinear map model. In: Theory of cryptography—TCC 2016. Springer, Berlin Heidelberg, pp 241–268
Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: ACM symposium on theory of computing—STOC 2009. ACM, pp 169–178
Gentry C, Gorbunov S, Halevi S (2015) Graph-induced multilinear maps from lattices. In: Theory of cryptography—TCC 2015. Springer, Berlin Heidelberg, pp 498–527
Guan C, Ren K, Zhang F, Kerschbaum F, Yu J (2015) Symmetric-key based proofs of retrievability supporting public verification. In: Computer security—ESORICS 2015. Springer International Publishing, pp 203–223
Hada S (2000) Zero-knowledge and code obfuscation. In: Advances in cryptology—ASIACRYPT 2000. Springer, Berlin Heidelberg, pp 443–457
Hu Y, Jia H (2016) Cryptanalysis of GGH map. In: Advances in cryptology—EUROCRYPT 2016. Springer, Berlin Heidelberg, pp 537–565
Miles E, Sahai A, Zhandry M (2016) Annihilation attacks for multilinear maps: cryptanalysis of indistinguishability obfuscation over ggh13. In: Advances in cryptology—CRYPTO 2016. Springer, Berlin Heidelberg, pp 629–658
Mowbray M, Pearson S, Shen Y (2012) Enhancing privacy in cloud computing via policy-based obfuscation. J Supercomput 61(2):267–291CrossRef
Pass R, Seth K, Telang S (2014) Indistinguishability obfuscation from semantically-secure multilinear encodings. In: Advances in cryptology—CRYPTO 2014. Springer, Berlin Heidelberg, pp 500–517
Shoup V (1997) Lower bounds for discrete logarithms and related problems. In: Advances in cryptology—EUROCRYPT 1997. Springer, Berlin Heidelberg, pp 256–266
Zimmerman J (2015) How to obfuscate programs directly. In: Advances in cryptology—EUROCRYPT 2015. Springer, Berlin Heidelberg, pp 439–467
Metadaten
Titel
Efficient obfuscation for CNF circuits and applications in cloud computing
verfasst von
Huang Zhang
Fangguo Zhang
Rong Cheng
Haibo Tian
Publikationsdatum
17.11.2017
Verlag
Springer Berlin Heidelberg
Erschienen in
Soft Computing / Ausgabe 6/2019
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-017-2921-z

Weitere Artikel der Ausgabe 6/2019

Soft Computing 6/2019 Zur Ausgabe

Focus

Sensitivity analysis for image represented by fuzzy function

Methodologies and Application

A new approach to construct similarity measure for intuitionistic fuzzy sets

Focus

Design of meteorological pattern classification system based on FCM-based radial basis function neural networks using meteorological radar data

Methodologies and Application

Vibration control of a structure using sliding-mode hedge-algebras-based controller

Methodologies and Application

Modeling and comparison of the series systems with imperfect coverage for an unreliable server

Methodologies and Application

Complete image fusion method based on fuzzy transforms