Skip to main content
SpringerLink
Log in

Efficient obfuscation for CNF circuits and applications in cloud computing

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Notes

  1. Stack is an array in data structure with the property “first in first out”.

References

  • 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–58

    Article  Google Scholar 

  • 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:48

    Article  MathSciNet  MATH  Google Scholar 

  • 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, Silverberg A (2003) Applications of multilinear forms to cryptography. Contemp Math 324(1):71–90

    Article  MathSciNet  MATH  Google Scholar 

  • 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, Wu DJ, Zimmerman J (2014) Immunizing multilinear maps against zeroizing attacks. Cryptology ePrint archive, report 2014/930. http://eprint.iacr.org/2014/930

  • Boneh D, Gupta D, Mironov I, Sahai A (2015) Hosting services on an untrusted cloud. Springer, Berlin, pp 404–436

    MATH  Google Scholar 

  • 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

  • Brakerski Z, Gentry C, Halevi S, Lepoint T, Sahai A, Tibouchi M (2015) Cryptanalysis of the quadratic zero-testing of GGH. Cryptology ePrint archive, report 2015/845. http://eprint.iacr.org/2015/845

  • 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–3294

    Article  Google Scholar 

  • 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–2396

    Article  Google Scholar 

  • 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

  • Halevi S (2015) Graded encoding, variations on a scheme. Cryptology ePrint archive, report 2015/866. http://eprint.iacr.org/2015/866

  • 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, Weiss M (2014) Protecting obfuscation against arithmetic attacks. Cryptology ePrint archive, report 2014/878. http://eprint.iacr.org/2014/878

  • 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–291

    Article  Google Scholar 

  • 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

  • Sahai A, Zhandry M (2014) Obfuscating low-rank matrix branching programs. Cryptology ePrint archive, report 2014/773. http://eprint.iacr.org/2014/773

  • 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

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China (Nos. 61379154 and 61672550). The authors are grateful to the anonymous reviewers for their valuable suggestions and comments on this paper.

Author information

Authors and Affiliations

  1. School of Data and Computer Science, Sun Yat-sen University, Guangzhou, 510006, China

    Huang Zhang, Fangguo Zhang & Haibo Tian

  2. Guangdong Key Laboratory of Information Security, Guangzhou, 510006, China

    Huang Zhang, Fangguo Zhang & Haibo Tian

  3. School of Electronic and Communication Engineering, Shenzhen Polytechnic, Shenzhen, 510855, China

    Rong Cheng

Authors
  1. Huang Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fangguo Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rong Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Haibo Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fangguo Zhang.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Informed consent

Informed consent was obtained from all individual participants included in the study.

Additional information

Communicated by V. Loia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, H., Zhang, F., Cheng, R. et al. Efficient obfuscation for CNF circuits and applications in cloud computing. Soft Comput 23, 2061–2072 (2019). https://doi.org/10.1007/s00500-017-2921-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-017-2921-z

Keywords

Search

Navigation