Challenges and implications of verifiable builds for security-critical open-source software

The majority of computer users download compiled software and run it directly on their machine. Apparently, this is also true for open-sourced software -- most users would not compile the available source, and implicitly trust that the available binaries have been compiled from the published source code (i.e., no backdoor has been inserted in the binary). To verify that the official binaries indeed correspond to the released source, one can compile the source of a given application, and then compare the locally generated binaries with the developer-provided official ones. However, such simple verification is non-trivial to achieve in practice, as modern compilers, and more generally, toolchains used in software packaging, have not been designed with verifiability in mind. Rather, the output of compilers is often dependent on parameters that can be strongly tied to the building environment. In this paper, we analyze a widely-used encryption tool, TrueCrypt, to verify its official binary with the corresponding source. We first manually replicate a close match to the official binaries of sixteen most recent versions of TrueCrypt for Windows up to v7.1a, and then explain the remaining differences that can solely be attributed to non-determinism in the build process. Our analysis provides the missing guarantee on official binaries that they are indeed backdoor-free, and makes audits on TrueCrypt's source code more meaningful. Also, we uncover several sources of non-determinism in TrueCrypt's compilation process; these findings may help create future verifiable build processes.

[1]  Adrian Perrig,et al.  Perspectives: Improving SSH-style Host Authentication with Multi-Path Probing , 2008, USENIX Annual Technical Conference.

[2]  Per Larsen,et al.  SoK: Automated Software Diversity , 2014, 2014 IEEE Symposium on Security and Privacy.

[3]  Michael Franz,et al.  E unibus pluram: massive-scale software diversity as a defense mechanism , 2010, NSPW '10.

[4]  Thomas Lindhqvist,et al.  Trust, but Verify , 2001 .

[5]  G. Carleton,et al.  PROFILE-GUIDED OPTIMIZATIONS , 1998 .

[6]  Francis Sullivan,et al.  Trust but verify , 2002, Computing in Science & Engineering.

[7]  David A. Wheeler,et al.  Fully Countering Trusting Trust through Diverse Double-Compiling , 2010, ArXiv.

[8]  Yuanyuan Zhou,et al.  Designing and Implementing Malicious Hardware , 2008, LEET.

[9]  Security Analysis of TrueCrypt 7 . 0 a with an Attack on the Keyfile Algorithm , 2011 .

[10]  David A. Wheeler,et al.  Countering trusting trust through diverse double-compiling , 2005, 21st Annual Computer Security Applications Conference (ACSAC'05).

[11]  K. Thompson Reflections on trusting trust , 1984, CACM.

[12]  David H. Ackley,et al.  Building diverse computer systems , 1997, Proceedings. The Sixth Workshop on Hot Topics in Operating Systems (Cat. No.97TB100133).

[13]  Narn-Yih Lee,et al.  Threshold-Multisignature Schemes where Suspected Forgery Implies Traceability of Adversarial Shareholders , 1994, EUROCRYPT.