{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:11:35Z","timestamp":1773655895843,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319303024","type":"print"},{"value":"9783319303031","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-30303-1_11","type":"book-chapter","created":{"date-parts":[[2016,2,24]],"date-time":"2016-02-24T05:41:07Z","timestamp":1456292467000},"page":"174-192","source":"Crossref","is-referenced-by-count":6,"title":["Evaluating Obfuscation Security: A Quantitative Approach"],"prefix":"10.1007","author":[{"given":"Rabih","family":"Mohsen","sequence":"first","affiliation":[]},{"given":"Alexandre Miranda","family":"Pinto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,25]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Anckaert, B., Madou, M., De Sutter, B., De Bus, B., De Bosschere, K., Preneel, B.: Program obfuscation: a quantitative approach. In: Proceedings of QoP 2007, pp. 15\u201320. ACM Press, New York, USA, October 2007","DOI":"10.1145\/1314257.1314263"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"B Barak","year":"2001","unstructured":"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\u201318. Springer, Heidelberg (2001)"},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/32.481535","volume":"22","author":"LC Briand","year":"1996","unstructured":"Briand, L.C., Morasca, S., Basili, V.R.: Property-based software engineering measurement. IEEE Trans. Softw. Eng. 22(1), 68\u201386 (1996)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Ceccato, M., Capiluppi, A., Falcarin, P., Boldyreff, C.: A large study on the effect of code obfuscation on the quality of java code. Empirical Softw. Eng. 1\u201339 (2014)","DOI":"10.1007\/s10664-014-9321-0"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Ceccato, M., Di Penta, M., Nagra, J., Falcarin, P., Ricca, F., Torchiano, M., Tonella, P.: The effectiveness of source code obfuscation: an experimental assessment. In: ICPC, pp. 178\u2013187 (2009)","DOI":"10.1109\/ICPC.2009.5090041"},{"key":"11_CR6","unstructured":"Collberg, C., Thomborson, C., Low, D.: A taxonomy of obfuscating transformations (1997)"},{"key":"11_CR7","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2006","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, Hoboken (2006)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Garg, S., Raykova, M., Gentry, C., Sahai, A., Halevi, S., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: FOCS (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Hamilton, J., Danicic, S.: An evaluation of current java bytecode decompilers. In: SCAM 2009, pp. 129\u2013136. IEEE Computer Society, Washington, DC, USA (2009)","DOI":"10.1109\/SCAM.2009.24"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Jbara, A., Feitelson, D.G.: On the effect of code regularity on comprehension. In: Proceedings of the 22nd International Conference on Program Comprehension, ICPC, pp. 189\u2013200. ACM, New York, NY, USA (2014)","DOI":"10.1145\/2597008.2597140"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/18.481775","volume":"42","author":"JC Kieffer","year":"1996","unstructured":"Kieffer, J.C., Yang, E.H.: Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity. IEEE Trans. Inf. Theor. 42(1), 29\u201339 (1996)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"11_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M Li","year":"2008","unstructured":"Li, M., Vitnyi, P.M.B.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer, Heiderlberg (2008)","edition":"3"},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1109\/TSE.1976.233837","volume":"2","author":"TJ McCabe","year":"1976","unstructured":"McCabe, T.J.: A complexity measure. IEEE Trans. Softw. Eng. 2(4), 308\u2013320 (1976)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Mohsen, R., Pinto, A.M.: Algorithmic information theory for obfuscation security. In: SECRYPT 2015 - Proceedings of the 12th International Conference on Security and Cryptography, Colmar, Alsace, France, pp. 76\u201387, 20\u201322 July 2015","DOI":"10.5220\/0005548200760087"},{"issue":"6","key":"11_CR15","doi-asserted-by":"crossref","first-page":"855","DOI":"10.3233\/JCS-2009-0345","volume":"17","author":"M Dalla Preda","year":"2009","unstructured":"Dalla Preda, M., Giacobazzi, R.: Semantics-based code obfuscation by abstract interpretation. J. Comput. Secur. 17(6), 855\u2013908 (2009)","journal-title":"J. Comput. Secur."},{"issue":"3","key":"11_CR16","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0164-1212(92)90114-Y","volume":"17","author":"J Tian","year":"1992","unstructured":"Tian, J., Zelkowitz, M.V.: A formal program complexity model and its application. J. Syst. Softw. 17(3), 253\u2013266 (1992)","journal-title":"J. Syst. Softw."},{"issue":"9","key":"11_CR17","doi-asserted-by":"publisher","first-page":"1357","DOI":"10.1109\/32.6178","volume":"14","author":"EJ Weyuker","year":"1988","unstructured":"Weyuker, E.J.: Evaluating software complexity measures. IEEE Trans. Softw. Eng. 14(9), 1357\u20131365 (1988)","journal-title":"IEEE Trans. Softw. Eng."}],"container-title":["Lecture Notes in Computer Science","Foundations and Practice of Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30303-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:26:56Z","timestamp":1559388416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30303-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319303024","9783319303031"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30303-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}