More on graph theoretic software watermarks: Implementation,analysis, and attacks |
| |
| Authors: | Christian Collberg Andrew Huntwork Edward Carter Gregg Townsend Michael Stepp |
| |
| Affiliation: | 1. Intensive Care Unit, Hospital Universitario de Canarias, Ofra, s/n, La Laguna 38320, Tenerife, Spain;2. Intensive Care Unit, Hospital Universitario Nuestra Señora Candelaria, Crta Rosario s/n, Santa Cruz Tenerife 38010, Spain;3. Laboratory Deparment, Hospital Universitario de Canarias, Ofra, s/n, La Laguna 38320, Tenerife, Spain;4. Intensive Care Unit, Hospital Clínico Universitario de Valencia, Avda. Blasco Ibáñez no17-19, Valencia 46004, Spain;5. Intensive Care Unit. Hospital Universitario Dr. Negrín, Barranco de la Ballena s/n, Las Palmas de Gran Canaria 35010, Spain;6. Intensive Care Unit, Hospital San Jorge de Huesca, Avenida Martínez de Velasco no36, Huesca 22004, Spain;7. Intensive Care Unit, Hospital Insular, Plaza Dr. Pasteur s/n, Las Palmas de Gran Canaria 35016, Spain;8. Research Unit, Hospital Universitario de Canarias, Ofra, s/n, La Laguna 38320, Tenerife, Spain;2. Departments of Neurology and Feil Family Brain and Mind Research Institute, Weill Cornell Medical College, New York, New York;3. Department of Neurology, Tulane University Medical Center, New Orleans, Louisiana;4. Department of Internal Medicine, Division of Cardiovascular Medicine, Tulane University Medical Center, New Orleans, Louisiana;6. Department of Neurology, Hartford Hospital, Hartford, Connecticut;5. Department of Internal Medicine, Division of Cardiovascular Medicine, Hartford Hospital, Hartford, Connecticut |
| |
| Abstract: | This paper presents an implementation of the watermarking method proposed by Venkatesan et al. in their paper R. Venkatesan, V. Vazirani, S. Sinha, A graph theoretic approach to software watermarking, in: Fourth International Information Hiding Workshop, Pittsburgh, PA, 2001]. An executable program is marked by the addition of code for which the topology of the control-flow graph encodes a watermark. We discuss issues that were identified during construction of an actual implementation that operates on Java bytecode. We present two algorithms for splitting a watermark number into a redundant set of pieces and an algorithm for turning a watermark number into a control-flow graph. We measure the size and time overhead of watermarking, and evaluate the algorithm against a variety of attacks. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
