This application claims the priority of PCT/GB03/02326 filed May 28, 2003and British Application GB 0212318.0 filed on May 28, 2002, the contents of which are hereby incorporated by reference.
This invention relates to an apparatus providing tamper evidence for executable code stored on removable media. This apparatus forms an element in a platform security architecture.
Platform security covers the philosophy, architecture and implementation of platform defence mechanisms against malicious or badly written code. These defence mechanisms prevent such code from causing harm. Malicious code generally has two components: a payload mechanism that does the damage and a propagation mechanism to help it spread. They are usually classified as follows:
Security threats encompass (a) a potential breach of confidentiality, integrity or availability of services or data in the value chain and integrity of services and (b) compromise of service function. Threats are classified into the following categories:
Hence, mobile wireless devices offer very considerable challenges to the designer of a platform security architecture. One critical aspect of this challenge is that mobile wireless devices will regularly install programs on removable storage devices. The main motivation is to provide extra storage that the wireless device user can change, based on which set of programs he/she wishes to use. A well-known example is the usage of floppy diskettes or memory cards in personal computer environments. The removable storage device might, in principle, be tampered with in some way when not plugged into the mobile wireless device and the programs stored on the device would hence lose their integrity. It is vital that, in all circumstances, a wireless device is confident in the integrity of executable code, including when a removable storage device is to be re-inserted (e.g. that no malicious alterations to override security features have been made and no viruses introduced etc).
To date, there have however been no efficient proposals for ensuring the integrity of executable code which has been transferred off from a mobile wireless device and is being returned to the original device.
In a first aspect of the present invention, there is a mobile wireless device operable to install native executable code on a removable medium, in which the device is programmed to calculate and store a digest (a digest is a value generated from the full content of the code using an algorithm guaranteeing that the same value cannot be regenerate if the content has changed) of this code into a persistent non-removable store inside the device. Native code is composed of instructions directly executed by a CPU on a device.
When the removable medium is plugged back, and when the executable is invoked, the device recalculates a digest from the code it wants to load from the removable medium and compares it with the one stored inside the persistent non-removable store. If they do not match, the executable has been tampered with and therefore cannot be trusted by the device. The digest is accessible only by components in the Trusted Computing Base (see later) so is itself secure. The digest may be a hash or other unique and representative value that can be recomputed from the entire executable.
This approach differs from conventional watermarking, in which a hash is derived from a media file and then inserted back into the file, modifying it imperceptibly.
In one implementation, the digest as well as the executable's ‘capability’ are securely stored on the device. A ‘capability’ can be thought of as an access token that corresponds to a permission to undertake a sensitive action. (The purpose of the capability model is to control access to sensitive system resources.) At load time, the loader verifies the hash before loading. If the verification fails, the executable will not be loaded. If the executable is unknown (no associated digest), the executable is loaded with no capability (i.e no access rights to sensitive resources) and no identity (no access rights to data that is private to an identified operating system process). If the verification succeeds, then the executable is loaded and the stored capability assigned to the newly loaded code.
The present invention allows users to share memory cards and other forms of removable medium between devices without restriction. It also allows each user to keep the privileges he/she has granted to applications stored on these cards independent from the medium and other users' choices.
The present invention will be described with reference to the security architecture of the Symbian OS object oriented operating system, designed for single user wireless devices. The Symbian OS operating system has been developed for mobile wireless devices by Symbian Ltd, of London United Kingdom. defences. In a similar fashion, it employs simple and staggered layers of security above and beyond the installation perimeter. The key threats that the model is trying to address are those that are linked with unauthorised access to user data and to system services, in particular the phone stack. The phone stack is especially important in the context of a smart phone because it will be controlling a permanent data connection to the phone network. There are two key design drivers lying behind the model:
The main concept of the capability model described below is to control what a process can do rather than what a user can do. This approach is quite different to well-known operating systems as Windows NT and Unix. The main reasons are:
A trusted computing base (TCB) is a basic architectural requirement for robust platform security. The trusted computing base consists of a number of architectural elements that cannot be subverted and that guarantee the integrity of the device. It is important to keep this base as small as possible and to apply the principle of least privilege to ensure system servers and applications do not have to be given privileges they do not need to function. On closed devices, the TCB consists of the kernel, loader and file server; on open devices the software installer is also required. All these processes are system-wide trusted and have therefore full access to the device. This trusted core would run with a “root” capability not available to other platform code (see section 2.1).
There is one other important element to maintain the integrity of the trusted computing base that is outside the scope of the present invention, namely the hardware. In particular, with devices that hold trusted computing base functionality in flash ROM, it is necessary to provide a secure boot loader to ensure that it is not possible to subvert the trusted computing base with a malicious ROM image.
1.2 Trusted Computing Environment
Beyond the core, other system components would be granted restricted orthogonal system capability and would constitute the Trusted Computing Environment (TCE); they would include system servers such as socket, phone and window servers. For instance the window server would not be granted the capability of phone stack access and the phone server would not be granted the capability of direct access to keyboard events. It is strongly recommended to give as few system capabilities as possible to a software component to limit potential damage by any misuse of these privileges.
The TCB ensures the integrity of the full system as each element of the TCE ensures the integrity of one service. The TCE cannot exist without a TCB but the TCB can exist by itself to guarantee a safe “sand box” for each process.
2 Process Capabilities
A capability can be thought of as an access token that corresponds to a permission to undertake a sensitive action. The purpose of the capability model is to control access to sensitive system resources. The most important resource that requires access control is the kernel executive itself and a system capability (see section 2.1) is required by a client to access certain functionality through the kernel API. All other resources reside in user-side servers accessed via IPC [Inter Process Communication]. A small set of basic capabilities would be defined to police specific client actions on the servers. For example, possession of a make calls capability would allow a client to use the phone server. It would be the responsibility of the corresponding server to police client access to the resources that the capability represents. Capabilities would also be associated with each library (DLL) and program (EXE) and combined by the loader at run time to produce net process capabilities that would be held by the kernel. For open devices, third party software would be assigned capabilities either during software installation based on the certificate used to sign their installation packages or post software installation by the user,. The policing of capabilities would be managed between the loader, the kernel and affected servers but would be kernel-mediated through the IPC mechanism.
The key features of the process capability model are:
As examples, we can name:
2.2 User-Exposed Capabilities: Mapping Real-World Permissions
The process of generating capabilities can be difficult. One has first to identify those accesses that require policing and then to map those requirements into something that is meaningful for a user. In addition, more capabilities means greater complexity and complexity is widely recognised as being the chief enemy of security. A solution based on capabilities should therefore seek to minimise the overall number deployed. The following capabilities map fairly broadly onto the main threats which are unauthorised access to system services (eg. the phone stack) and preserving the confidentiality/integrity of user data.
PhoneNetwork. “Can access phone network services and potentially spend user money”
Root and system capabilities are mandatory; if not granted to an executable, the user of the device cannot decide to do it. Their strict control ensures the integrity of the Trusted Computing Platform. However the way servers check user-exposed capabilities or interpret them may be fully flexible and even user-discretionary.
2.3 Assigning Capabilities to a Process
The association of a run-time capability with a process involves the loader. In essence, it transforms the static capability settings associated with individual libraries and programs into a run-time capability that the kernel holds and can be queried through a kernel user library API. The loader applies the following rules:
It has to be noted that:
These rules
The examples below show how these rules are applied in the cases of statically and dynamically loaded libraries respectively.
2.3.1 Examples for Linked DLLs
Today, files stored on removable media are completely unprotected. They are fully accessible and can be modified. When a removable medium is plugged back in the device, no checks are performed to ensure the integrity of the system. Risks associated with this fact may be seen as low because possession of the medium is needed for subversion. However a malicious user may install malware and damage not her device but use it as a weapon against network operators, for instance. Today without platform security, the only protection is to implement a loader that refuses to load code from removable media. However in the long term, more memory space will be required to store more applications and this strategy will prevent users buying software for their device and potentially might discourage them to buy open platforms if they could not take advantage of it.
2.4.1.2 Data Confidentiality
Threats on data confidentiality ate real but limited only to data contained on the stolen removable medium. Most of the threats can be already prevented without the support of platform security:
The proposed invention aims not only to prevent current threats but also to keep the interoperability and code distribution uses of removable media.
No platform security architecture can prevent the modification of removable media when off the wireless device. Even with a password-protected removable medium, an authorised user can alter it. Therefore, the best Platform Security can provide is a tamper evidence mechanism for known executables and a secure execution of unknown code
2.4.2.1 Software Installer
At install time, when an application package has to be stored on a removable medium:
At de-install time, the software installer removes the executables from the removable medium if present and destroys the associated file created at installation step 4
For preformatted removable media (files already installed), a lighter version of the application package must be provided too in order to let the Software Installer perform steps 1 to 3. The present invention does not specify any apparatus for detecting new applications on pre-formatted removable media; a possible option may be to detect the presence of new applications at the time of insertion of the removable medium in the wireless device and to consider the removal of a pre-formatted removable medium as the de-installation of applications it contains.
2.4.2.2 Loader
At load time, the loader identifies an executable to load from a removable medium. It looks at the corresponding HASH file: the hash in a TCB-restricted area of a permanent file system (e.g. that cannot be removed).
The hashing process must be independent of the removable medium. What has to be achieved is to authenticate a piece of code, not the removable medium it comes from. The preferred implementation uses SHA-1 as it is reasonably secure and fast for use in a wireless device.
2.4.3 Use Cases
2.4.3.1 Actors
E1-Invalid signature
E2—Hashes mismatch
E1-U does not accepts
E1—U does not accepts
E2—Hashes mismatch
E2—U does not confirm
These use cases show that even with Platform Security, the flexibility provided by removable media is kept:
Number | Date | Country | Kind |
---|---|---|---|
0212318.0 | May 2002 | GB | national |
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/GB03/02326 | 5/28/2003 | WO | 00 | 11/24/2004 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO03/100583 | 12/4/2003 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
4975950 | Lentz | Dec 1990 | A |
5359659 | Rosenthal | Oct 1994 | A |
5495518 | Hayashi | Feb 1996 | A |
5572590 | Chess | Nov 1996 | A |
5883956 | Le et al. | Mar 1999 | A |
5944821 | Angelo | Aug 1999 | A |
5954817 | Janssen et al. | Sep 1999 | A |
6026293 | Osborn | Feb 2000 | A |
6085299 | Angelo et al. | Jul 2000 | A |
6253324 | Field et al. | Jun 2001 | B1 |
6438600 | Greenfield et al. | Aug 2002 | B1 |
6463535 | Drews | Oct 2002 | B1 |
6567917 | Ziese | May 2003 | B1 |
6609199 | DeTreville | Aug 2003 | B1 |
6615404 | Garfunkel et al. | Sep 2003 | B1 |
6651171 | England et al. | Nov 2003 | B1 |
6681329 | Fetkovich et al. | Jan 2004 | B1 |
6707915 | Jobst et al. | Mar 2004 | B1 |
6754548 | Yoshii et al. | Jun 2004 | B1 |
6782477 | McCarroll | Aug 2004 | B2 |
6802006 | Bodrov | Oct 2004 | B1 |
6880083 | Korn | Apr 2005 | B1 |
6892301 | Hansmann et al. | May 2005 | B1 |
7003672 | Angelo et al. | Feb 2006 | B2 |
7043636 | Smeets | May 2006 | B2 |
7055029 | Collins et al. | May 2006 | B2 |
7092911 | Yokota et al. | Aug 2006 | B2 |
7131036 | Wray et al. | Oct 2006 | B2 |
7201662 | LeMay et al. | Apr 2007 | B2 |
7225333 | Peinado et al. | May 2007 | B2 |
7275160 | Pearson et al. | Sep 2007 | B2 |
7376625 | Koskela et al. | May 2008 | B2 |
7437563 | Vaha-Sipila | Oct 2008 | B2 |
7502941 | Michael et al. | Mar 2009 | B2 |
7882352 | Dive-Reclus et al. | Feb 2011 | B2 |
20020002673 | Narin | Jan 2002 | A1 |
20020013910 | Edery et al. | Jan 2002 | A1 |
20020023032 | Pearson et al. | Feb 2002 | A1 |
20020026584 | Skubic et al. | Feb 2002 | A1 |
20030005246 | Peinado | Jan 2003 | A1 |
20030009687 | Ferchau et al. | Jan 2003 | A1 |
20030028807 | Lawman et al. | Feb 2003 | A1 |
20030120943 | Hughes | Jun 2003 | A1 |
20030182561 | Challener et al. | Sep 2003 | A1 |
20030216172 | LeMay et al. | Nov 2003 | A1 |
20030226040 | Challener et al. | Dec 2003 | A1 |
20040111618 | Vaha-Sipila | Jun 2004 | A1 |
20040199508 | Radatti | Oct 2004 | A1 |
20050091501 | Osthoff et al. | Apr 2005 | A1 |
20050166064 | Dive-Reclus et al. | Jul 2005 | A1 |
20050204127 | Dive-Reclus et al. | Sep 2005 | A1 |
20060053426 | Dive-Reclus et al. | Mar 2006 | A1 |
Number | Date | Country |
---|---|---|
0 754 999 | Jan 1997 | EP |
0813133 | Dec 1997 | EP |
1 041 573 | Oct 2000 | EP |
1 041 573 | Oct 2000 | EP |
1 081 577 | Mar 2001 | EP |
1 081 577 | Mar 2001 | EP |
1 168 172 | Jan 2002 | EP |
2 330 031 | Apr 1999 | GB |
2001 067794 | Mar 2001 | JP |
2001-067794 | Mar 2001 | JP |
2001 075868 | Mar 2001 | JP |
2001-075868 | Mar 2001 | JP |
2001-147898 | May 2001 | JP |
2001-147898 | May 2001 | JP |
2002-023704 | Jan 2002 | JP |
2002-023704 | Jan 2002 | JP |
2002 023704 | Jan 2002 | JP |
WO 0018162 | Mar 2000 | WO |
WO 0105155 | Jan 2001 | WO |
WO 0105155 | Jan 2001 | WO |
WO 0233525 | Apr 2002 | WO |
Number | Date | Country | |
---|---|---|---|
20050216907 A1 | Sep 2005 | US |