Abstract
Computational forensic engineering is the process of identification of the tool or algorithm that was used to produce a particular output or solution by examining the structural properties of the output. We introduce a new Relative Generic Forensic Engineering (RGFE) technique that has several advantages over the previously proposed approaches. The new RGFE technique not only performs more accurate identification of the tool used but also provides the identification with a level of confidence. Additionally, we introduce a generic formulation (integer linear programming formulation) which enables rapid application of the RGFE approach to a variety of problems that can be formulated as 0-1 integer linear programs.
The key innovations of the RGFE technique include the development of a simulated annealing-based (SA) CART classification technique and a generic property formulation technique that facilitates property reuse. We introduce instance properties which enable an enhanced classification of problem instances leading to a higher accuracy of algorithm identification. Finally, the single most important innovation, property calibration, interprets the value for a given algorithm for a given property relative to the values for other algorithms. We demonstrated the effectiveness of the RGFE technique on the boolean satisfiability (SAT) and graph coloring (GC) problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Qu, G., Potkonjak, M.: Intellectual Property Protection in VLSI Design: Theory and Practice. Kluwer, Dordrecht (2003)
Breiman, L., et al.: Classification and Regression Trees. Chapman and Hall, Boca Raton (1993)
Kirkpatrick, S., et al.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Wong, J., Kirovski, D., Potkonjak, M.: Non-parametrical statistical computational forensic techniques for intellectual property protection. In: 4th International Information Hiding Workshop, pp. 71–86 (2001)
Marques-Silva, J., Sakallah, K.: Boolean satisfiability in electronic design automation. In: Cliques, Coloring, and Satisfiability (2000)
Hamzaoglu, I., Patel, J.: New techniques for deterministic test pattern generation. In: IEEE VLSI Test Symposium (1998)
Zhang, H.: Sato: An efficient propositional prover. In: McCune, W. (ed.) CADE 1997. LNCS (LNAI), vol. 1249, pp. 272–275. Springer, Heidelberg (1997)
Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisability problems. In: AAAI, pp. 440–446 (1992)
Marques-Silva, J., Sakallah, K.: Grasp: a search algorithm for propositional satisfiability. Transactions on Computers 48, 506–521 (1999)
Selman, B., Kautz, H.: Domain-independent extensions to gsat: Solving large structured satisfiability problems. In: International Conference on Artificial Intelligence, pp. 290–295 (1993)
SATLIB: The satisfiability library (2004), http://www.satlib.org
Brelaz, D.: New methods to color the vertices of a graph. Comm. of the ACM 22, 251–256 (1979)
Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Journal of Computing 39, 345–351 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wong, J.L., Potkonjak, M. (2004). Relative Generic Computational Forensic Techniques. In: Fridrich, J. (eds) Information Hiding. IH 2004. Lecture Notes in Computer Science, vol 3200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30114-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-30114-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24207-9
Online ISBN: 978-3-540-30114-1
eBook Packages: Computer ScienceComputer Science (R0)