Information Hiding

Volume 3727 of the series Lecture Notes in Computer Science pp 357-371

Data Hiding in Compiled Program Binaries for Enhancing Computer System Performance

  • Ashwin SwaminathanAffiliated withDepartment of ECE, University of Maryland
  • , Yinian MaoAffiliated withDepartment of ECE, University of Maryland
  • , Min WuAffiliated withDepartment of ECE, University of Maryland
  • , Krishnan KailasAffiliated withIBM T.J. Watson Research Center

* Final gross prices may vary according to local VAT.

Get Access


Information hiding has been studied in many security applications such as authentication, copyright management and digital forensics. In this work, we introduce a new application where successful information hiding in compiled program binaries could bring system-wide performance improvements. Our goal is to enhance computer system performance by providing additional information to the processor, without changing the instruction set architecture. We first analyze the statistics of typical programs to demonstrate the feasibility of hiding data in them. We then propose several techniques to hide a large amount of data in the operand fields with very low computation and storage requirements during the extraction process. The data embedding is made reversible to recover the original instructions and to ensure the correct execution of the computer program. Our experiments on the SPEC CPU2000 benchmark programs show that up to 110K bits of information can be embedded in large programs with as little as 3K bits of additional run-time memory in the form of a simple look-up table.