Method of improving computer security through sandboxing
Abstract
This record has no abstract on file.
Term
Term ended
Projected expiry passed 21 June 2025, 1.3 years ago.
- Priority
- Filed
- Published
- Projected expiry
- Today
39 claims: 5 independent, 34 dependent
- 1Claims of equivalent WO 2006012197 A2 CLAIMS What is claimed is:1. A method of improving security of a processing system comprising: at least one of executing and accessing a suspect file in a sandbox virtual machine.
- 14An article comprising:a storage medium having a plurality of machine readable instructions, wherein when the instructions are executed by a processor, the instructions provide for improving security of a processing system by at least one of executing and accessing a suspect file in a sandbox virtual machine.
- 27A processing system comprising:a virtual machine monitor to identify and mark files that are suspect;and a sandbox virtual machine to at least one of execute and access a suspect file.
- 32A processing system comprising:a sandbox virtual machine to at least one of execute and access a suspect file;and a policy enforcer virtual machine to identify and mark files that are suspect, and to enforce a sandbox policy defining allowable actions to be taken by the sandbox virtual machine during at least one of execution and accessing of the suspect file.
- 36A method of improving security of a processing system comprising:identifying files to be marked as suspect;marking the identified files;accepting a request to at least one of execute and access a file by a user virtual machine;at least one of executing and accessing the file in the user virtual machine when the file is not marked as suspect;and creating a sandbox virtual machine and at least one of executing and accessing the file in the sandbox virtual machine according to a policy when the file is marked as suspect.
Independent claims5
42 paragraphs in 4 sections, as filed
Description of equivalent WO 2006012197 A2
Method of Improving Computer Security through
Sandboxing
BACKGROUND
1. FIELD
The present invention relates generally to computer security and, more specifically, to using virilization techniques to improve the security of a computing platform.
2. DESCRIPTION
Computer viruses are a common problem for computer users. One typical mode of attack is to send an electronic mail message (e-mail) containing a file attachment to an unsuspecting user's computer. The file attachment contains malicious attack code, and the e-mail may contain some inducement for the user to launch the file attachment. When the user clicks on the file attachment, the attack code embedded in the file is executed. The attack code accesses an address book and sends the file attachment in an e-mail to addresses found in the address book. The attack code may then try to modify files on the user's computer or obtain other files and mail them back to the attackers.
Propagation of such an attack is rapid. Once one unsuspecting user launches the file attachment, the virus quickly spreads to other unsuspecting users, who then perpetuate the problem. Such viruses have been known to overwhelm computer networks and cause millions of dollars of damage to network operators, companies, and users.
Techniques exist to detect viruses and purge them from affected computers. However, such techniques often are used only after the virus has been detected and many computers have been infected. New methods are desired that will slow down the propagation of computer viruses and other malicious code, thus allowing the virus detectors to detect and delete the viruses before the damage becomes widespread.
Along with improving the ability to detect and slow such attacks it is also desired to prevent or limit damage to users' systems and access to users' data. The ideal world in which users would never run suspicious files will never exist, so a practical solution must recognize this and attempt to prevent or limit the program from damaging the user's system and accessing the user's data.
BRIEF DESCRIPTION OF THE DRAWINGS
The features and advantages of the present invention will become apparent from the following detailed description of the present invention in which:
Figure 1 illustrates one embodiment of a virtual machine environment, in which one embodiment of the present invention may operate;
Figure 2 is a diagram of a user virtual machine interacting with a sandbox virtual machine according to an embodiment of the present invention;
Figure 3 is a flow diagram illustrating usage of a sandbox virtual machine according to an embodiment of the present invention; and
Figure 4 is a diagram illustrating a virtual machine environment according to an embodiment of the present invention. DETAILED DESCRIPTION
An embodiment of the present invention is a method of using sandboxing to improve the security of a computing platform. Recent advances in virtualization give a computing platform the ability to run multiple virtual machines of protected computing environments so that execution of one environment will not interfere with the execution of another environment. Embodiments of the present invention use virtualization to create a sandbox virtual machine that is isolated from the rest of the computing platform. The sandbox may be used to open suspect files or execute suspect application programs so that if there is attack code in the suspect files or application programs, the attack will be contained in the sandbox. The attack code may then be dealt with according to prescribed policies. By accessing the suspect files only in the sandbox, further propagation of the attack code may be diminished and the attack may be more easily detected.
References in the specification to "one embodiment" or "an embodiment" of the present invention mean that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, the appearances of the phrase "in one embodiment" appearing in various places throughout the specification are not necessarily all referring to the same embodiment.
Some portions of the detailed descriptions that follow are presented in terms of algorithms and symbolic representations of operations on data bits within a computer system's registers or memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of operations leading to a desired result. The operations are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.
It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussions, it is appreciated that throughout the present invention, discussions utilizing terms such as "processing" or "computing" or "calculating" or "determining" or the like, may refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer-system memories or registers or other such information storage, transmission or display devices.
In the following detailed description of the embodiments, reference is made to the accompanying drawings that show, by way of illustration, specific embodiments in which the invention may be practiced. In the drawings, like numerals describe substantially similar components throughout the several views. These embodiments are described in sufficient detail to enable those skilled in the art to practice the invention. Other embodiments may be utilized and structural, logical, and electrical changes may be made without departing from the scope of the present invention. Moreover, it is to be understood that the various embodiments of the invention, although different, are not necessarily mutually exclusive. For example, a particular feature, structure, or characteristic described in one embodiment may be included within other embodiments. The following detailed description is, therefore, not to be taken in a limiting sense, and the scope of the present invention is defined only by the appended claims, along with the full scope of equivalents to which such claims are entitled.
In some embodiments, the present invention may be provided as a computer program product or software which may include a machine or computer-readable medium having stored thereon instructions which may be used to program a computer (or other electronic devices) to perform a process according to the present invention. In other embodiments, steps of the present invention might be performed by specific hardware components that contain hardwired logic for performing the steps, or by any combination of programmed computer components and custom hardware components.
Thus, a machine-readable medium may include any mechanism for storing or transmitting information in a form readable by a machine (e.g., a computer), but is not limited to, floppy diskettes, optical disks, Compact Disc, Read-Only Memory (CD-ROMs), and magneto-optical disks, Read¬ only Memory (ROMs), Random Access Memory (RAM), Erasable Programmable Read-Only Memory (EPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), magnetic or optical cards, flash memory, a transmission over the Internet, electrical, optical, acoustical or other forms of propagated signals (e.g., carrier waves, infrared signals, digital signals, etc.) or the like.
Figure 1 illustrates one embodiment of a virtual machine environment for a processing system 100, in which the present invention may operate. In this embodiment, bare platform hardware 116 comprises a computing platform, which may be capable, for example, of executing a standard operating system (OS) and a virtual machine monitor (VMM), such as a VMM 112.
The VMM 112, though typically implemented in software, may emulate and export a bare machine interface to higher level software. Such higher level software may comprise a standard or real-time OS, or may be a highly stripped down operating environment with limited operating system functionality that may not include traditional OS facilities, etc. The software may also include a version of firmware such as a BIOS. Alternatively, for example, the VMM 112 may be run within, on top of, or in parallel with another VMM. VMMs may be implemented, for example, in hardware, software, or firmware, or by a combination of various techniques.
The processing system 100 may be any one of a personal computer (PC), mainframe, handheld device, portable computer, set-top box, or any other computing system. The platform hardware 116 includes a processor 118 and memory 120.
Processor 118 can be any type of processor capable of executing software, such as a microprocessor, digital signal processor, microcontroller, or the like. The processor 118 may include microcode, programmable logic or hard-coded logic for performing the execution of method embodiments of the present invention. Although Figure 1 shows only one such processor 118, there may be one or more processors in the system, and each processor may run the same VMM, different VMMs, multiple VMMs, or no VMMs.
Memory 120 can be a hard disk, a floppy disk, random access memory (RAM), read only memory (ROM), flash memory, any combination of the above devices, or any other type of machine medium readable by processor 118. Memory 120 may store instructions and/or data for performing the execution of method embodiments of the present invention.
The VMM 112 presents to other software (i.e., "guest" software) the abstraction of one or more virtual machines (VMs), which may provide the same or different abstractions to the various guests. Figure 1 shows two VMs, virtual machine #1 102 and virtual machine #N 114, although in any given system any number of virtual machines may be implemented. The guest software running on each VM may include a guest OS such as guest OS #1 104 or OS #J 106 and various guest software applications 107, 108, 109 and 110. Each of the guest OSs 104 and 106 expect to access physical resources (e.g., processor registers, memory and I/O devices) within the VMs 102 and 114 on which the guest OS 104 or 106 is running and to perform other functions. For example, the guest OS may expect to have access to all registers, caches, structures, I/O devices, memory and the like, according to the architecture of the processor and platform presented in the VM. The resources that can be accessed by the guest software may either be classified as "privileged" or "non-privileged." For privileged resources, the VMM 112 facilitates functionality desired by guest software while retaining ultimate control over these privileged resources. Non-privileged resources do not need to be controlled by the VMM 112 and can be accessed by guest software.
Further, each guest OS expects to handle various events such as exceptions (e.g., page faults, general protection faults, etc.), interrupts (e.g., hardware interrupts, software interrupts), and platform events (e.g., initialization (INIT) and system management interrupts (SMIs)). Some of these events are "privileged" because they must be handled by the VMM 112 to ensure proper operation of VMs 102 and 114 and for protection from and among guest software.
When a privileged event occurs or guest software attempts to access a privileged resource, control may be transferred to the VMM 112. The transfer of control from guest software to the VMM 112 is referred to herein as a VM exit. After facilitating the resource access or handling the event appropriately, the VMM 112 may return control to guest software. The transfer of control from the VMM 112 to guest software is referred to as a VM entry.
In one embodiment, the processor 118 controls the operation of the VMs 102 and 114 in accordance with data stored in a virtual machine control structure (VMCS) 124. The VMCS 124 is a structure that may contain the state of guest software, the state of the VMM 112, execution control information indicating how the VMM 112 wishes to control operation of guest software, information controlling transitions between the VMM 112 and a VM, etc. The processor 118 reads information from the VMCS 124 to determine the execution environment of the VM and to constrain its behavior. In one embodiment, the VMCS is stored in memory 120. In some embodiments, multiple VMCS structures are used to support multiple VMs.
As used herein, a sandbox is an execution environment in which the code executing in the environment is restricted from some functionality. In embodiments of the present invention, a sandbox may allow code to execute, but the code may be quarantined so that the code cannot damage or access any of the computing platform outside of the sandbox. A file that is suspected of being malicious should be opened in a sandbox, so that if the file is malicious, the damage it might cause will be limited or prevented. In addition, a sandbox may be monitored for suspicious activity occurring, such as that during the opening of files or executing of code. In one embodiment, a sandbox may be implemented as a virtual machine.
Figure 2 is a diagram of a user virtual machine interacting with a sandbox virtual machine according to an embodiment of the present invention. In one example, a user may cause the execution of one or applications in a user virtual machine 200. For example, one application 202 may be an e-mail program. The user's computer may receive an e- mail that contains a file attachment 204. When the user clicks on the file attachment, instead of opening the file in the user virtual machine 200, the attachment 204 may be opened in a sandbox virtual machine 206 by another copy of the application 202, or perhaps by another program (not shown). The user may still be able to view the attachment as presented by the sandbox virtual machine, but the rest of the computing platform hosting the sandbox virtual machine may be protected from operations that occur in the sandbox. That is, the sandbox virtual machine may prevent certain specified operations from affecting files or other system resources outside of the sandbox. Thus, if the file attachment contains attack code that tries to distribute the attack to other users by accessing the address book of the e- mail application, the distribution will not be successful from the sandbox if the sandbox prevents the application from sending e-mails. Figure 3 is a flow diagram 300 illustrating usage of a sandbox virtual machine according to an embodiment of the present invention. At block 302, an entity of the processing system identifies files that should be marked as suspect. In one embodiment, the entity may be the virtual machine manager (VMM). The user may also participate in the decision to mark files. In another embodiment, a special virtual machine may be running to perform sandbox management operations. A suspect file may be any file that is not yet trusted by the processing system. Upon entry into a processing system, a file or application program may be evaluated according to a predetermined file identification policy as to whether it should be marked as suspect or not. One example policy is that all files or applications not created on the processing system should be marked as suspect when they are received and first stored in the processing system. Another policy may be that if the file or application was digitally signed by a trusted signature key, then the file or application would not be identified as suspect, otherwise it would be considered suspect. These policies are merely illustrative, and other methods of identifying suspect files and applications may be used without departing from the scope of the present invention.
At block 304, once files are determined to be suspect, the entity marks the suspect files to denote that they are suspect. One skilled in the art will recognize that there are many ways to mark the files. One example method for marking files as suspect is to create an extension to the file system so that there is an annotation on each file indicating whether it is suspect or not. In one embodiment, this annotation may be a binary flag, where when the flag is set the file is considered suspect.
At some point in time after some marking activity has been performed, at block 306 software operating within a user virtual machine (such as an application program, for example) may request execution of or access to a file. For example, an e-mail attachment may be selected by the user to be executed. In another example, the user desires to have a selected application program access a file stored in the file system. At block 308, it may be determined whether the file is currently marked as suspect. If the file is not suspect, then the file may be executed or accessed within the user virtual machine at block 310. If the file is suspect, then the file may be processed within a sandbox virtual machine. In one embodiment, at block 312 a sandbox virtual machine may be created to process this particular file access request. In another embodiment, a permanent sandbox virtual machine may be active in the processing system to handle all such requests to access suspect files.
In another embodiment, the sandbox virtual machine may be created by "forking" a new virtual machine environment to construct a duplicate copy of the user virtual machine at the time that the sandbox is needed. One benefit of forking is that the original copy and the duplicate copy can begin to diverge, with the state of the original copy going completely unmodified, and hence serving as a known-good "checkpoint" of the machine state. If an attack is later observed in the duplicate copy, the system can simply revert back to the known-good checkpoint. VM "forking", therefore, goes a step beyond containing viruses or slowing their propagation, to also offering a method for recovering from an attack.
Once a sandbox virtual machine is active to handle the file access, at block 314 the file may be accessed or executed in the sandbox virtual machine according to the rules of a specified sandbox policy. The sandbox policy may define what actions may be taken as part of the file access. For example, software executing in a sandbox may be held to a policy that e- mail is not allowed to be sent from the sandbox. This may be enforced by having a policy checker component within the processing system capture any requests by the sandbox to send e-mail. As another example, software executing within the sandbox may not be allowed to delete or modify files in the processing system. In one embodiment this may be enforced by having all requests to modify files virtualized so that it would appear to the sandbox virtual machine that a request to modify files was being fulfilled, but in reality the request would be fulfilled using temporary files, so that no changes to permanent system files would be made. In another embodiment where the sandbox virtual machine was forked from a user virtual machine, after executing for period of time in a sandbox, the forked environment may be merged back into the user environment. At this point, a decision may be made as to whether to accept the changes to files requested by the sandbox virtual machine. In one example, no changes to system files made from within a sandbox may be accepted. Alternatively, if it is detected that the forked environment has be compromised by a virus attack, it could simply be discarded, and system operation can revert back to the original VM state, which serves a known-good checkpoint.
While a suspect file is executing in or being accessed within a sandbox virtual machine, an entity such as the virtual machine monitor (VMM) may be monitoring the sandbox for behavior that indicates attack code is being run. For example, the VMM may monitor the sandbox for changes to system files, for automated e-mail requests, or for attempts to access sensitive documents. If the VMM detects any of these behaviors, then the VMM could respond in one or more prescribed manners. For example, the VMM could mark the file as probable attack code, have the code deleted, notify the user, send the file to a security server for further evaluation, or perform other predetermined actions.
With embodiments of the present invention, not only can executable files be marked as suspect and executed in a sandbox, but in addition, data files can be marked as suspect and the application to access the data file can be executed in a sandbox. For example, an application might execute in the user virtual machine when it is accessing a trusted data file, but would execute in a sandbox when it is accessing a suspect data file. This accommodates the idea that code can be trusted, but when trusted code executes untrusted data, the resulting combination may still contain an attack.
Once a file has been marked as suspect, the file will remain marked as suspect unless some specific action is taken to remove the suspect marking on the file. A suspect file could be accessed multiple times and still remain marked as suspect. One policy for implementing the functionality of unmarking a suspect file is for the user to operate a virtual machine that is not a sandbox, and to request the import of the suspect file into that virtual machine. Another policy that may be used to unmark a suspect file is that after a file has been executed within a sandbox for a specified period of time without evidence of behavior indicative of attack code, then the file's suspect marking may be changed. In one embodiment, this unmarking may be implemented by unsetting the suspect flag for the file. In another embodiment, the user may selectively un-mark a file once it is believed to be trusted.
Figure 4 is a diagram illustrating a virtual machine environment according to an embodiment of the present invention. In this embodiment, rather than have a VMM monitor the operations of the sandbox virtual machine, the entity performing the monitoring may be policy enforcer virtual machine 404. Alternatively, the monitoring entity could instead reside (at least in part) in another VM that performs additional actions. This virtual machine may interact with file system virtual machine 402 to ensure that attack code executing within the sandbox cannot modify files in the processing system. Requests to access the file system may be handled by the file system virtual machine. The policy enforcer virtual machine may enforce a predetermined policy 406 that describes the activities allowable by code being executed within the sandbox. In one example, the sandbox virtual machine may not be able to directly access the network so that any request by the sandbox virtual machine to access the network would be sent to the policy enforcer. The policy enforcer would then check the policy to see if the network access would be allowed. In this way, the policy enforcer could keep the sandbox virtual machine from sending email or from sending any information to the network.
Embodiments of the present invention may help to deter rapid propagation of some computer viruses. If a file attachment having attack code is opened using the present invention, the attachment would be opened in a sandbox. The sandbox may not be allowed to send out e-mail (depending on how the policy was defined), so the attack would not be replicated. The attack code might modify system files in the sandbox, but these changes would be made virtually, so that the actual system files would not be modified. After opening the file in the sandbox, a user may decide to move the file into another virtual machine. Although this is not as preferable as keeping the file in the sandbox, even this scenario may slow down virus propagation.
Although the operations may be described herein as a sequential process, some of the operations may in fact be performed in parallel or concurrently. In addition, in some embodiments the order of the operations may be rearranged without departing from the spirit of the invention.
While this invention has been described with reference to illustrative embodiments, this description is not intended to be construed in a limiting sense. Various modifications of the illustrative embodiments, as well as other embodiments of the invention, which are apparent to persons skilled in the art to which the invention pertains are deemed to lie within the spirit and scope of the invention.
Contents4
Every citation, both waysCites: the store holds 0 of 1
| Document | Relation | Office | Cited during |
|---|---|---|---|
| CN103150506A | Cited by | China | Search report |
| See references of WO 2006012197A2 | Non-patent | – | Search report |
10 members in 5 offices
Priority claims9
| Document | Office | Kind | Date |
|---|---|---|---|
| 881602 | United States of America | – | |
| 88160204 | United States of America | A | |
| 88160204 | United States of America | A | |
| 2005022227 | United States of America | W | |
| 2005022227 | United States of America | W | |
| 881602 | – | – | – |
| US20040881602 | – | – | – |
| US2005022227 | – | – | – |
| WO2005US22227 | – | – | – |
Members10
| Document | Office | Kind | |
|---|---|---|---|
| US2006021029A1 | United States of America | A1 | |
| WO2006012197A2 | World Intellectual Property Organization (WIPO) | A2 | |
| WO2006012197A3 | World Intellectual Property Organization (WIPO) | A3 | |
| EP1761836A2This record | European Patent Office (EPO) | A2 | |
| CN1961272A | China | A | |
| JP2008500653A | Japan | A | |
| CN100533334C | China | C | |
| JP4599400B2 | Japan | B2 | |
| US7908653B2 | United States of America | B2 | |
| EP1761836B1 | European Patent Office (EPO) | B1 |
65 legal events, as 9 offices reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | Office | |
|---|---|---|---|
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Gb: european patent ceased through non-payment of renewal feeCeasedGBPC | GBPC | EP | |
| Application deemed withdrawn, or ip right lapsed, due to non-payment of renewal feeWithdrawnR119 | R119 | DE | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed because of non-payment of the annual feeLapsedMM | MM | NL | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| No opposition filed against granted patent, or epo opposition proceedings concluded without decisionGrantedR097 | R097 | DE | |
| Notification of lapseLapsedST | ST | FR | |
| Patent lapsedLapsedMM4A | MM4A | IE | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| No opposition filedOpposition26N | 26N | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Patent ceasedCeasedPL | PL | CH | |
| No opposition filed within time limitOppositionORIGINAL CODE: 0009261PLBE | PLBE | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: NO OPPOSITION FILED WITHIN TIME LIMITSTAA | STAA | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Invalidated european patentMG4D | MG4D | LT | |
| Deletion acc. to par. 5 (withdrawal of the translation of the ep patent)MK05 | MK05 | AT | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Translation files for an european patent granted for nl, confirming art. 52 par. 1 or 6 of the patents act 1995GrantedT3 | T3 | NL | |
| Dpma publication of mentioned ep patent grantGrantedR096 | R096 | DE | |
| Reference to at number (ep patent enters austrian national phase)REF | REF | AT | |
| European patents granted designating irelandGrantedFG4D | FG4D | IE | |
| European patent takes effect as a national patent in ch/liEP | EP | CH | |
| Designated contracting statesAK | AK | EP | |
| European patent grantedGrantedFG4D | FG4D | GB | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| (expected) grantORIGINAL CODE: 0009210GRAA | GRAA | EP | |
| Amendment of ipc main classPREVIOUS MAIN CLASS: G06F0001000000R079 | R079 | DE | |
| Grant fee paidORIGINAL CODE: EPIDOSNIGR3GRAS | GRAS | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOSNIGR1GRAP | GRAP | EP | |
| First examination report despatched17Q | 17Q | EP | |
| Request for extension of the european patent (deleted)DAX | DAX | EP | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | EP | |
| Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI | PUAI | EP |
Numbers
- Publication
- 1761836
- Publication, DOCDB
- 1761836
- Publication, EPODOC
- EP1761836
- Application
- 5776327
- Application, DOCDB
- 05776327
- Application, EPODOC
- EP20050776327
Titles3
- German
- VERFAHREN ZUR VERBESSERUNG DER COMPUTERSICHERHEIT DURCH SANDBOXING
- English
- METHOD OF IMPROVING COMPUTER SECURITY THROUGH SANDBOXING
- French
- PROCEDE D'AMELIORATION DE SECURITE INFORMATIQUE PAR MISE EN BAC A SABLE
Classification
- CPC, 4
- G06F21/53
- G06F21/51
- G06F21/566
- G06F2221/2145
- IPC, 4
- G06F21 53
- G06F21 51
- G06F21 56
- G06F1 00
Designated states1
- Contracting states, 1
- Türkiye