{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:40:57Z","timestamp":1725536457497},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642032363"},{"type":"electronic","value":"9783642032370"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03237-0_19","type":"book-chapter","created":{"date-parts":[[2009,8,3]],"date-time":"2009-08-03T05:24:37Z","timestamp":1249277077000},"page":"273-292","source":"Crossref","is-referenced-by-count":1,"title":["Creating Transformations for Matrix Obfuscation"],"prefix":"10.1007","author":[{"given":"Stephen","family":"Drape","sequence":"first","affiliation":[]},{"given":"Irina","family":"Voiculescu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","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.\u00a02139, pp. 1\u201318. Springer, Heidelberg (2001)"},{"key":"19_CR2","unstructured":"Berchtold, J.: The Bernstein basis in set-theoretic geometric modelling. PhD thesis, University of Bath (2000)"},{"issue":"1-2","key":"19_CR3","first-page":"49","volume":"13","author":"S. Bernstein","year":"1912","unstructured":"Bernstein, S.: D\u00e9monstration du th\u00e9or\u00e8me de Weierstrass fond\u00e9e sur le calcul des probabilit\u00e9s. Comm. Kharkov Math. Soc.\u00a013(1-2), 49\u2013194 (1912)","journal-title":"Comm. Kharkov Math. Soc."},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/355769.355775","volume":"4","author":"R.P. Brent","year":"1978","unstructured":"Brent, R.P.: A FORTRAN multiple\u2013precision arithmetic package. ACM Transactions on Mathematical Software\u00a04(1), 57\u201370 (1978)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Claessen, K., Hughes, J.: QuickCheck: a lightweight tool for random testing of Haskell programs. ACM SIGPLAN Notices (2000)","DOI":"10.1145\/357766.351266"},{"key":"19_CR6","unstructured":"Collberg, C., Thomborson, C., Low, D.: A taxonomy of obfuscating transformations. Technical Report 148, Department of Computer Science, University of Auckland (July 1997)"},{"key":"19_CR7","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511663079","volume-title":"Data Refinement: Model-Oriented Proof Methods and their Comparison","author":"W.-P. Roever de","year":"1998","unstructured":"de Roever, W.-P., Engelhardt, K.: Data Refinement: Model-Oriented Proof Methods and their Comparison. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (1998)"},{"key":"19_CR8","unstructured":"Drape, S.: Obfuscation of Abstract Data-Types. DPhil thesis, Oxford University Computing Laboratory (2004)"},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.ins.2006.03.012","volume":"177","author":"S. Drape","year":"2007","unstructured":"Drape, S.: Generalising the array split obfuscation. Information Sciences\u00a0177(1), 202\u2013219 (2007)","journal-title":"Information Sciences"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-75496-1_20","volume-title":"Information Security","author":"S. Drape","year":"2007","unstructured":"Drape, S., Thomborson, C., Majumdar, A.: Specifying imperative data obfuscations. In: Garay, J.A., et al. (eds.) ISC 2007. LNCS, vol.\u00a04779, pp. 299\u2013314. Springer, Heidelberg (2007)"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-8396(88)90016-7","volume":"5","author":"R.T. Farouki","year":"1988","unstructured":"Farouki, R.T., Rajan, V.T.: Algorithms for polynomials in Bernstein form. Computer Aided Geometric Design\u00a05, 1\u201326 (1988)","journal-title":"Computer Aided Geometric Design"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-16437-5_5","volume-title":"Interval Mathematics 1985","author":"J. Garloff","year":"1986","unstructured":"Garloff, J.: Convergent bounds for the range of multivariate polynomials. In: Nickel, K. (ed.) Interval Mathematics 1985. LNCS, vol.\u00a0212, pp. 37\u201356. Springer, Heidelberg (1986)"},{"key":"19_CR13","unstructured":"Geisow, A.: Surface Interrogations. PhD thesis, University of East Anglia (1983)"},{"key":"19_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-406-5","volume-title":"Implicit Curves and Surfaces: Mathematics, Data Structures and Algorithms","author":"A. Gomes","year":"2009","unstructured":"Gomes, A., Voiculescu, I., Jorge, J., Wyvill, B., Galbraith, C.: Implicit Curves and Surfaces: Mathematics, Data Structures and Algorithms. Springer, Heidelberg (2009)"},{"key":"19_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"R.A. Horn","year":"1985","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)"},{"key":"19_CR16","unstructured":"LiDIA Group, Darmstadt University of Technology, \n                    \n                      www.cdc.informatik.tu-darmstadt.de\/TI\/LiDIA"},{"key":"19_CR17","volume-title":"Bernstein Polynomials","author":"G.G. Lorentz","year":"1986","unstructured":"Lorentz, G.G.: Bernstein Polynomials. Chelsea Publishing Company, New York (1986)"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/1314276.1314290","volume-title":"DRM 2007: Proceedings of the 2007 ACM workshop on Digital Rights Management","author":"A. Majumdar","year":"2007","unstructured":"Majumdar, A., Drape, S.J., Thomborson, C.D.: Slicing obfuscations: design, correctness, and evaluation. In: DRM 2007: Proceedings of the 2007 ACM workshop on Digital Rights Management, pp. 70\u201381. ACM, New York (2007)"},{"issue":"3","key":"19_CR19","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1109\/9.661615","volume":"43","author":"M. Zettler","year":"1998","unstructured":"Zettler, M., Garloff, J.: Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion. IEEE Transactions on Automatic Control\u00a043(3), 425\u2013431 (1998)","journal-title":"IEEE Transactions on Automatic Control"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03237-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T07:53:29Z","timestamp":1552118009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03237-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642032363","9783642032370"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03237-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}