Skip to main content

A Formal Framework for Property-Driven Obfuscation Strategies

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8070))

Abstract

We study the existence and the characterization of function transformers that minimally or maximally modify a function in order to reveal or conceal a certain property. Based on this general formal framework we develop a strategy for the design of the maximal obfuscating transformation that conceals a given property while revealing the desired observational behaviour.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andéka, H., Greechie, R.J., Strecker, G.E.: On residuated approximations. In: Kreowski, H.-J., Herrlich, H., Preuß, G., Ehrig, H. (eds.) Categorical Methods in Computer Science. LNCS, vol. 393, pp. 333–339. Springer, Heidelberg (1989)

    Google Scholar 

  2. Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1–18. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Collberg, C., Thomborson, C.D., Low, D.: Manufactoring cheap, resilient, and stealthy opaque constructs. In: ACM Symp. on Principles of Programming Languages (POPL 1998), pp. 184–196. ACM Press (1998)

    Google Scholar 

  4. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: ACM Symp. on Principles of Programming Languages (POPL 1977), pp. 238–252. ACM Press (1977)

    Google Scholar 

  5. Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: ACM Symp. Principles of Programming Languages (POPL 1979), pp. 269–282. ACM Press (1979)

    Google Scholar 

  6. Cousot, P., Cousot, R.: Systematic design of program transformation frameworks by abstract interpretation. In: ACM Symp. on Principles of Programming Languages, pp. 178–190. ACM Press (2002)

    Google Scholar 

  7. Dalla Preda, M., Giacobazzi, R.: Control code obfuscation by abstract interpretation. In: Software Engineering and Formal Methods (SCAM 2005), pp. 301–310. IEEE Computer Society (2005)

    Google Scholar 

  8. Dalla Preda, M., Giacobazzi, R.: Semantics-based code obfuscation by abstract interpretation. Journal of Computer Security 17(6), 855–908 (2009)

    Google Scholar 

  9. Giacobazzi, R., Mastroeni, I.: Transforming abstract interpretations by abstract interpretation. In: Alpuente, M., Vidal, G. (eds.) SAS 2008. LNCS, vol. 5079, pp. 1–17. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Giacobazzi, R., Mastroeni, I.: Making abstract interpretation incomplete - modeling the potency of obfuscation. In: Miné, A., Schmidt, D. (eds.) SAS 2012. LNCS, vol. 7460, pp. 129–145. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  11. Giacobazzi, R., Ranzato, F.: Uniform closures: order-theoretically reconstructing logic program semantics and abstract domain refinements. Inform. and Comput. 145(2), 153–190 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  12. Giacobazzi, R., Ranzato, F., Scozzari, F.: Making abstract interpretation complete. Journal of the ACM 47(2), 361–416 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M., Scott, D.S.: A Compendium of Continuous Lattices. Springer (1980)

    Google Scholar 

  14. Janowitz, M.F.: Residuated closure operators. Portug. Math. 26(2), 221–252 (1967)

    MathSciNet  MATH  Google Scholar 

  15. Majumdar, A., Drape, S.J., Thomborson, C.D.: Slicing obfuscations: design, correctness, and evaluation. In: ACM Workshop on Digital Rights Management, pp. 70–81. ACM (2007)

    Google Scholar 

  16. Weiser, M.: Program slicing. In: ICSE 1981: Proceedings of the 5th International Conference on Software Engineering, pp. 439–449. IEEE Press (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dalla Preda, M., Mastroeni, I., Giacobazzi, R. (2013). A Formal Framework for Property-Driven Obfuscation Strategies. In: Gąsieniec, L., Wolter, F. (eds) Fundamentals of Computation Theory. FCT 2013. Lecture Notes in Computer Science, vol 8070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40164-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40164-0_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40163-3

  • Online ISBN: 978-3-642-40164-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics