The present invention relates generally to computer systems, and specifically to systems and methods for data communication and storage.
In a computer network handling sensitive data, such as data in military or financial environments, portions of the network may be connected by one-way data links. For example, confidential data that must not be accessed from external sites may be stored on a computer that is configured to receive data over a one-way link and has no physical outgoing link over which data might be transmitted to the external site.
One-way links may be implemented, for example, using Waterfall™ systems, which are manufactured by Gita Technologies, Ltd. (Rosh HaAyin, Israel). The Waterfall system provides a physical one-way connection based on fiberoptic communication, using an underlying proprietary transfer protocol. When a transmitting computer is connected by a Waterfall system (or other one-way link) to a receiving computer, the receiving computer can receive data from the transmitting computer but has no means of sending any return communications to the transmitting computer.
Networked computing systems, such as enterprise computer networks, often use centralized storage for archiving of data, such as transaction logs, information technology (IT) system events, and backups. Maintaining the integrity of such archives is crucial in order to ensure that functions such as log analysis, audits, forensics, and data recovery after system failures can be carried out. It is also necessary to prevent unauthorized parties from accessing sensitive archived data.
The embodiments of the present invention that are described hereinbelow address these needs by providing a secure storage system, in which computers on a network can write data to a memory only via an encryption processor. (The term “memory” is used broadly in the present patent application and in the claims to refer to any sort of data storage medium.) The processor encrypts the data using an encryption key, which typically is not available to the source computers, and conveys the encrypted data over a one-way link to the memory. Thus, the encryption processor is able to write encrypted data to the memory but not to read from the memory.
Since all data written to the memory are encrypted, any malicious program code that a hacker may attempt to introduce into the storage system is scrambled and therefore rendered harmless until it is decrypted. Decryption may take place in a controlled, “sterile” environment, in which malicious code can be detected and neutralized before it affects vulnerable network elements. For example, the storage contents may be duplicated and then decrypted in an environment that is separate from the storage system, so that any damage that may be caused by malicious code will not affect the original stored data.
There is therefore provided, in accordance with an embodiment of the present invention, storage apparatus, including:
a memory;
an encryption processor, which is configured to receive and encrypt data transmitted from one or more computers for storage in the memory; and
a one-way link, coupling the encryption processor to the memory so as to enable the encryption processor to write the encrypted data to the memory but not to read from the memory.
In some embodiments, the encryption processor is configured to encrypt the data using an encryption key that is not available to the one or more computers. In one embodiment, for each transmission of the data from the one or more computers, the encryption processor is configured to select the encryption key from among a plurality of possible encryption keys, and to convey an indication of the selected encryption key to the memory in addition to the encrypted data.
Typically, the memory is configured to store the encrypted data without decryption prior to storage.
In a disclosed embodiment, the encryption processor is configured to receive the data from the one or more computers over a network and to apply a time stamp to each of at least some items of the data that are written to the memory.
In some embodiments, the apparatus includes a monitoring processor, which is coupled to the memory so as to generate an indication of a status of the data stored in the memory, and a further one-way link, coupling the monitoring processor to at least one of the computers so as to enable the monitoring processor to convey the indication of the status to the at least one of the computers but not to receive inputs from the one or more computers.
There is also provided, in accordance with an embodiment of the present invention, a method for data storage, including:
receiving data transmitted from one or more computers for storage in a memory;
encrypting the received data using an encryption processor before passing the data to the memory;
conveying the encrypted data from the encryption processor to the memory over a one-way link, which permits the encryption processor to write the encrypted data to the memory but not to read from the memory; and
storing the encrypted data in the memory.
The present invention will be more fully understood from the following detailed description of the embodiments thereof, taken together with the drawings in which:
Archive 22 comprises an encryption processor 28, which writes encrypted data to a memory 30 via a one-way link 32. Computers on network 26 are able to write data to memory 30 only via the encryption processor. Therefore, any malicious program code that a user may attempt to introduce into archive 22 will be scrambled by encryption and will simply be stored in scrambled form in memory 30. Consequently, the user will be unable to cause the control unit of memory 30 to perform any action other than simply writing data to the memory, since any program instructions submitted by the user will be rendered unintelligible by the encryption.
Encryption processor 28 may comprise either dedicated hardware or a general-purpose, software-driven computer processor, or a combination of hardware and software elements. For rapid encryption, as well as enhanced security, for example, the encryption processor may comprise one or more gate arrays with suitable firmware and/or an application-specific integrated circuit (ASIC). If a general-purpose computer processor is used, the software for carrying out the functions described herein may be downloaded to the processor over a network, or it may be alternatively provided on tangible media, such as optical, magnetic, or electronic memory media.
The encryption processor may use any suitable sort of encryption that is known in the art, including both asymmetric encryption methods, such as the RSA (Rivest Shamir Adelman) algorithm, and symmetric methods, such as the DES (Data Encryption Standard) and AES (Advanced Encryption Standard) algorithms, as well as simpler methods, which are sometimes referred to as “scrambling.” In encrypting incoming data, the encryption processor typically uses different keys at different times, and may use a key that is not available to computers outside archive 22. Because of the changing keys, hackers are prevented from using a known key to prepare their transmissions in such a way as to have malicious effect after encoding. Typically, the encryption processor chooses the key for each data item or group of data items using a pseudo-random process, either by selection from a list that was prepared in advance, or by pseudo-random generation. (Alternatively, the key may be chosen deterministically, as long as it is not known or available to the sending computer.) The key may be of any suitable length, depending on the encryption algorithm that is used.
Encryption processor 28 transmits the encrypted data over one-way link 32 to memory 30. Assuming that the encryption processor uses different encryption keys at different times, the encryption processor may also transmit to the memory an indication of the key that is to be used to decrypt each transmission. The indication may comprise either the key itself or an index to a predetermined list of keys. Optionally, either the encryption processor or the memory controller (or both) may add a time-stamp to each item of data, in order to facilitate audit functions. Alternatively or additionally, the time stamp may be applied by a dedicated hardware unit.
One-way link 32 may comprise a Waterfall link, as described in the Background section above, or any other suitable type of one-way link that is known in the art. As noted above, this link is typically physically configured so as to permit data transmission in only one direction, from processor 28 to memory 30. Optionally, link 32 may comprise two or more one-way links connected in series, with a data security engine placed between the one-way links. This link configuration, which provides enhanced security, is described, for example, in PCT Patent Application PCT/IL2006[DK1]/001499, filed Dec. 28, 2006, which is assigned to the assignee of the present patent application and whose disclosure is incorporated herein by reference.
Memory 30 may comprise any suitable type of storage device, such as magnetic, optical, or electronic memory, or a combination of these memory types. The storage device may comprise a control unit (not shown), as is known in the art, which receives the encrypted data over link 32 and writes the data to appropriate locations in the memory. As noted above, however, the control unit does not attempt to decrypt the data before writing. Rather, the data are typically decrypted and “sterilized” offline, as needed, by a separate decryption processor (not shown). To decrypt the data, this processor uses the key that was indicated by the encryption processor, as explained above. After decryption, the decryption processor sterilizes the data in order to detect and neutralize any malicious content, such as viruses, worms and spyware, for example. Methods that can be used for encryption and decryption of potentially-malicious data transmissions are described in greater detail in PCT Patent Application PCT/IL2007/001070, [DK2] filed Aug. 29, 2007, which is assigned to the assignee of the present patent application and whose disclosure is incorporated herein by reference.
Some archiving applications may require archive 22 to return an acknowledgment or other status indicator to one or more of computers 24 after receiving data from the computer. Simple data acknowledgments may be returned by encryption processor 28. Alternatively or additionally, an optional monitoring processor 34 may monitor the status of memory 30 and report on data storage status. Typically, the monitoring processor is pre-programmed to carry out these functions and performs the functions without receiving explicit commands to do so from computers on network 26. Monitoring processor 34 conveys the reports via a one-way link 36 to an output interface 38, which then transmits the reports to the appropriate computer 24 on network 26. In this configuration, computers 24 are unable to send inputs, such as data or commands, to the monitoring processor, and are thus prevented from introducing malicious program code that could cause this processor to retrieve and transmit confidential data from memory 30 or otherwise tamper with the contents of the memory.
Although
Number | Date | Country | Kind |
---|---|---|---|
180748 | Jan 2007 | IL | national |
Filing Document | Filing Date | Country | Kind | 371c Date |
---|---|---|---|---|
PCT/IL2008/000070 | 1/16/2008 | WO | 00 | 4/28/2009 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2008/087640 | 7/24/2008 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
4985919 | Naruse et al. | Jan 1991 | A |
4987595 | Marino et al. | Jan 1991 | A |
5388212 | Grube et al. | Feb 1995 | A |
5530758 | Marino et al. | Jun 1996 | A |
5548646 | Aziz et al. | Aug 1996 | A |
5677952 | Blakley et al. | Oct 1997 | A |
5696822 | Nachenberg | Dec 1997 | A |
5732278 | Furber et al. | Mar 1998 | A |
5822435 | Boebert et al. | Oct 1998 | A |
5825879 | Davis | Oct 1998 | A |
5835726 | Shwed et al. | Nov 1998 | A |
5940507 | Cane et al. | Aug 1999 | A |
5946399 | Kitaj et al. | Aug 1999 | A |
5995628 | Kitaj et al. | Nov 1999 | A |
6023570 | Tang et al. | Feb 2000 | A |
6049611 | Tatebayashi et al. | Apr 2000 | A |
6134661 | Topp | Oct 2000 | A |
6240514 | Inoue et al. | May 2001 | B1 |
6289377 | Lalwaney et al. | Sep 2001 | B1 |
6311272 | Gressel | Oct 2001 | B1 |
6317831 | King | Nov 2001 | B1 |
6442607 | Korn et al. | Aug 2002 | B1 |
6470449 | Blandford | Oct 2002 | B1 |
6574640 | Stahl | Jun 2003 | B1 |
6601126 | Zaidi et al. | Jul 2003 | B1 |
6615244 | Singhal | Sep 2003 | B1 |
6643701 | Aziz et al. | Nov 2003 | B1 |
6738388 | Stevenson et al. | May 2004 | B1 |
6738742 | Badt et al. | May 2004 | B2 |
6758404 | Ladyansky | Jul 2004 | B2 |
6915435 | Merriam | Jul 2005 | B1 |
6931549 | Ananda | Aug 2005 | B1 |
6957330 | Hughes | Oct 2005 | B1 |
6963817 | Ito et al. | Nov 2005 | B2 |
6966001 | Obara et al. | Nov 2005 | B2 |
6970183 | Monroe | Nov 2005 | B1 |
6986061 | Kunzinger | Jan 2006 | B1 |
7031322 | Matsuo | Apr 2006 | B1 |
7062587 | Zaidi et al. | Jun 2006 | B2 |
7069437 | Williams | Jun 2006 | B2 |
7100048 | Czajkowski et al. | Aug 2006 | B1 |
7143289 | Denning et al. | Nov 2006 | B2 |
7171566 | Durrant | Jan 2007 | B2 |
7200693 | Jeddeloh | Apr 2007 | B2 |
7234158 | Guo et al. | Jun 2007 | B1 |
7254663 | Bartley et al. | Aug 2007 | B2 |
7260833 | Schaeffer | Aug 2007 | B1 |
7324515 | Chapman | Jan 2008 | B1 |
7366894 | Kallimuthu et al. | Apr 2008 | B1 |
7523856 | Block et al. | Apr 2009 | B2 |
7581097 | Catherman et al. | Aug 2009 | B2 |
7631189 | Ichinose et al. | Dec 2009 | B2 |
7660959 | Asher et al. | Feb 2010 | B2 |
7675867 | Mraz et al. | Mar 2010 | B1 |
7685436 | Davis et al. | Mar 2010 | B2 |
7685636 | Leake et al. | Mar 2010 | B2 |
7698470 | Ruckerbauer et al. | Apr 2010 | B2 |
7716467 | Deffet et al. | May 2010 | B1 |
7757074 | Sundarrajan et al. | Jul 2010 | B2 |
7761704 | Ho et al. | Jul 2010 | B2 |
7792300 | Caronni | Sep 2010 | B1 |
7814316 | Hughes et al. | Oct 2010 | B1 |
7815548 | Barre et al. | Oct 2010 | B2 |
7845011 | Hirai | Nov 2010 | B2 |
7849330 | Osaki | Dec 2010 | B2 |
7992209 | Menoher et al. | Aug 2011 | B1 |
8041832 | Hughes et al. | Oct 2011 | B2 |
8046443 | Parker et al. | Oct 2011 | B2 |
20010033332 | Kato et al. | Oct 2001 | A1 |
20020065775 | Monaghan | May 2002 | A1 |
20020066018 | Linnartz | May 2002 | A1 |
20020077990 | Ryan | Jun 2002 | A1 |
20020114453 | Bartholet et al. | Aug 2002 | A1 |
20020174010 | Rice | Nov 2002 | A1 |
20020178370 | Gurevich et al. | Nov 2002 | A1 |
20020188862 | Trethewey et al. | Dec 2002 | A1 |
20020191866 | Tanabe | Dec 2002 | A1 |
20020199181 | Allen | Dec 2002 | A1 |
20030005295 | Girard | Jan 2003 | A1 |
20030037247 | Obara et al. | Feb 2003 | A1 |
20030055792 | Kinoshita et al. | Mar 2003 | A1 |
20030061505 | Sperry et al. | Mar 2003 | A1 |
20030114204 | Allen et al. | Jun 2003 | A1 |
20030140090 | Rezvani et al. | Jul 2003 | A1 |
20030140239 | Kuroiwa et al. | Jul 2003 | A1 |
20030159029 | Brown et al. | Aug 2003 | A1 |
20030188102 | Nagasoe et al. | Oct 2003 | A1 |
20030217262 | Kawai et al. | Nov 2003 | A1 |
20040022107 | Zaidi et al. | Feb 2004 | A1 |
20040024710 | Fernando et al. | Feb 2004 | A1 |
20040070620 | Fujisawa | Apr 2004 | A1 |
20040071311 | Choi et al. | Apr 2004 | A1 |
20040080615 | Klein et al. | Apr 2004 | A1 |
20040125077 | Ashton | Jul 2004 | A1 |
20040175123 | Lim et al. | Sep 2004 | A1 |
20040217890 | Woodward et al. | Nov 2004 | A1 |
20040247308 | Kawade | Dec 2004 | A1 |
20050015624 | Ginter et al. | Jan 2005 | A1 |
20050033990 | Harvey et al. | Feb 2005 | A1 |
20050057774 | Maruyama | Mar 2005 | A1 |
20050066186 | Gentle et al. | Mar 2005 | A1 |
20050085964 | Knapp et al. | Apr 2005 | A1 |
20050091173 | Alve | Apr 2005 | A1 |
20050119967 | Ishiguro et al. | Jun 2005 | A1 |
20050120214 | Yeates et al. | Jun 2005 | A1 |
20050120251 | Fukumori | Jun 2005 | A1 |
20050138369 | Lebovitz et al. | Jun 2005 | A1 |
20050165939 | Nikunen et al. | Jul 2005 | A1 |
20050216648 | Jeddeloh | Sep 2005 | A1 |
20050264415 | Katz | Dec 2005 | A1 |
20060026292 | Namioka et al. | Feb 2006 | A1 |
20060047887 | Jeddeloh | Mar 2006 | A1 |
20060064550 | Katsuragi et al. | Mar 2006 | A1 |
20060085354 | Hirai | Apr 2006 | A1 |
20060085534 | Ralston et al. | Apr 2006 | A1 |
20060095629 | Gower et al. | May 2006 | A1 |
20060136724 | Takeshima et al. | Jun 2006 | A1 |
20060161791 | Bennett | Jul 2006 | A1 |
20060165347 | Mita | Jul 2006 | A1 |
20060179208 | Jeddeloh | Aug 2006 | A1 |
20060220903 | Zigdon et al. | Oct 2006 | A1 |
20060242423 | Kussmaul | Oct 2006 | A1 |
20060259431 | Poisner | Nov 2006 | A1 |
20060271617 | Hughes et al. | Nov 2006 | A1 |
20070028027 | Janzen et al. | Feb 2007 | A1 |
20070028134 | Gammel et al. | Feb 2007 | A1 |
20070043769 | Kasahara et al. | Feb 2007 | A1 |
20070055814 | Jeddeloh | Mar 2007 | A1 |
20070063866 | Webb | Mar 2007 | A1 |
20070094430 | Speier et al. | Apr 2007 | A1 |
20070112863 | Niwata et al. | May 2007 | A1 |
20070180263 | Delgrosso et al. | Aug 2007 | A1 |
20070180493 | Croft et al. | Aug 2007 | A1 |
20070203970 | Nguyen | Aug 2007 | A1 |
20070258595 | Choy | Nov 2007 | A1 |
20070283297 | Hein et al. | Dec 2007 | A1 |
20080005325 | Wynn et al. | Jan 2008 | A1 |
20080008207 | Kellum | Jan 2008 | A1 |
20080059379 | Ramaci et al. | Mar 2008 | A1 |
20080065837 | Toyonaga et al. | Mar 2008 | A1 |
20080066192 | Greco et al. | Mar 2008 | A1 |
20080082835 | Asher et al. | Apr 2008 | A1 |
20080120511 | Naguib | May 2008 | A1 |
20080144821 | Armstrong | Jun 2008 | A1 |
20080155273 | Conti | Jun 2008 | A1 |
20080209216 | Kelly et al. | Aug 2008 | A1 |
20080244743 | Largman et al. | Oct 2008 | A1 |
20080263672 | Chen et al. | Oct 2008 | A1 |
20080288790 | Wilson | Nov 2008 | A1 |
20090002150 | Zilberstein et al. | Jan 2009 | A1 |
20090019325 | Miyamoto et al. | Jan 2009 | A1 |
20090300368 | Zilberstein et al. | Dec 2009 | A1 |
20100180120 | Frenkel et al. | Jul 2010 | A1 |
20100278339 | Frenkel et al. | Nov 2010 | A1 |
20100324380 | Perkins et al. | Dec 2010 | A1 |
20110202772 | Frenkel et al. | Aug 2011 | A1 |
20110213990 | Poisner | Sep 2011 | A1 |
20110258690 | Gaffan et al. | Oct 2011 | A1 |
Number | Date | Country |
---|---|---|
1632833 | Mar 2006 | EP |
2267986 | Dec 1993 | GB |
2371125 | Jul 2002 | GB |
9526085 | Sep 1995 | WO |
0110079 | Feb 2001 | WO |
0163879 | Aug 2001 | WO |
2008001344 | Jan 2008 | WO |
2008026212 | Mar 2008 | WO |
2008087640 | Jul 2008 | WO |
2009004611 | Jan 2009 | WO |
2009053990 | Apr 2009 | WO |
Entry |
---|
Einey, D., “Waterfall IP Surveillance Enalber”, Jul. 2007. |
Waterfall Security Solutions Ltd., “Waterfall One Way Link Technology”, 2008 http://www.waterfall-solutions.com/home/Waterfall—Technology.aspx. |
Multi-State Information Sharing Analysis Center (MSISAC), “Cyber Security Procurement Language for Control Systems”, version 1.8, revision 3, Feb. 2008 http://www.msisac.org/scada/documents/4march08scadaprocure.pdf. |
International Application PCT/IL2008/000886 Search Report dated Nov. 13, 2008. |
International Application PCT/IL2008/000070 Search Report dated Jun. 16, 2008. |
International Application PCT/IL2007/001070 Search Report dated Jul. 25, 2008. |
Axis Communications., “Axis Network Cameras”, 2008 http://www.axis.com/products/video/camera/index.htm. |
International Application PCT/IL2006/001499 Search Report dated Apr. 8, 2008. |
International Application PCT/IL2006/001499 Patentability Report dated Mar. 19, 2009. |
International Application PCT/IL2007/001070 Patentability Report dated Mar. 16, 2009. |
International Application PCT/IL2008/001513 Search Report dated Mar. 10, 2009. |
Check Point Software Technologies Ltd., “Extended Unified Threat Management capabilities with new multi-layer messaging security deliver best all-inclusive security solution”, USA, Nov. 18, 2008 http://www.checkpoint.com/press/2008/utm-1-edge-upgrade-111808.html. |
Innominate Security Technologies, “Press Release: Innominate joins Industrial Defender Enabled Partner Program”, Germany, Apr. 14, 2008 http://www.innominate.com/content/view/288/120/lang,en/. |
U.S. Appl. No. 11/823,950 Official Action dated Jun. 22, 2009. |
IL Patent Application # 177,756 Official Action dated Aug. 17, 2010. |
IL Patent Application # 180,748 Official Action dated Oct. 25, 2010. |
Israel Patent Application # 201473 Official Action dated May 8, 2011. |
U.S. Appl. No. 11/977,391 Official Action dated Jun. 14, 2011. |
Frenkel, L., “Unidirectional Information Transfer”, Web issue, Jun. 2005. |
U.S. Appl. No. 12/306,692 Official Action dated Sep. 28, 2011. |
U.S. Appl. No. 12/306,692 Official Action dated Feb. 13, 2012. |
U.S. Appl. No. 12/438,548 Official Action dated Mar. 6, 2012. |
European Patent Application # 07805530.8 Search report dated Mar. 6, 2012. |
EP Patent Application # 08702651.4 Search report dated May 11, 2012. |
U.S. Appl. No. 12/480,692 Official Action dated May 10, 2012. |
U.S. Appl. No. 12/518,276 Official Action dated Apr. 23, 2012. |
U.S. Appl. No. 12/438,548 Office Action dated Jul. 11, 2013. |
Schneier, B., “Applied Cryptography”, Chapter 15, pp. 357-358, published by John Wiley & Sons, Inc, year 1996. |
U.S. Appl. No. 12/676,143 Official Action dated Jul. 13, 2012. |
European Patent Application # 07849562.9 Extended Search Report dated Jun. 8, 2011. |
European Patent Application # 09162276.1 Examination Report dated Apr. 15, 2011. |
Israel Patent Application # 186473 Official Action dated Jun. 12, 2011. |
Israel Patent Application # 185795 Official Action dated May 5, 2011. |
U.S. Appl. No. 12/518,276 Official Action dated Apr. 5, 2011. |
European Patent Application EP09162276 Search Report dated Aug. 9, 2010. |
International Application PCT/IB2009/055396 Search Report dated Jul. 13, 2010. |
Israel Patent Application # 180020 Office Action dated Sep. 13, 2010. |
International Application PCT/IB2009/054541 Search Report dated Feb. 25, 2010. |
Dierks, T., “The TLS Protocol”, version 1.0, RFC 2246, Networking group of IETF, Jan. 1999. |
International Application PCT/IB2007/001535 Search Report dated Jun. 17, 2008. |
International Application PCT/IB2008/001187 Search Report dated Jan. 23, 2009. |
U.S. Appl. No. 12/480,692 Official Action dated Nov. 9, 2012. |
U.S. Appl. No. 12/676,143 Official Action dated Oct. 25, 2012. |
U.S. Appl. No. 12/438,548 Official Action dated Feb. 22, 2013. |
U.S. Appl. No. 13/487,265 Office Action filed Nov. 22, 2013. |
U.S. Appl. No. 13/487,265 Office Action filed Mar. 6, 2014. |
EP Patent Application # 13182696.8 Search Report dated Apr. 3, 2014. |
Number | Date | Country | |
---|---|---|---|
20100275039 A1 | Oct 2010 | US |