1. Field of the Invention
The field of the present invention is systems and methods for securely sending a digital document between computing devices.
2. Description of the Related Art
As electronic commerce and communications become ever more prevalent within society, it is becoming increasingly important that electronic communications are not only secure, but also that they are received and made available only to the intended recipient. To a great extent, encryption technologies, whether public-private key encryption and symmetric key encryption, have enabled secure communications. However, while these encryption technologies aid in ensuring that the communication is secure during transit, neither is very capable of verifying that the actual recipient is decrypting the communication. Essentially, anyone who possesses the encryption key is capable of decrypting the communication. Increasing the likelihood that it is the recipient who decrypts the message, and not an unwanted third party, is therefore desirable.
The present invention is directed toward a system and method for securing an electronic communication. The electronic communication is sent from a first computing device to a second computing device, and through interactions with a gateway server, the first computing device obtains an encryption key which is used to encrypt the electronic communication. The second computing device, upon receipt of the encrypted electronic communication, decrypts the encrypted electronic communication.
In a first separate aspect of the present invention, with respect to the system, the gateway server receives and stores a device identifier and a network address from the first computing device. The device identifier identifies and the network address is associated with the first computing device. Thereafter, when the gateway server receives a request for an encryption key, along with the network address of the first computing device, from a second computing device, the gateway server derives the encryption key from the device identifier for the first computing device. The generated encryption key is then sent to the second computing device, which may use the encryption key to secure an electronic communication with the first computing device.
In a second separate aspect of the present invention, building upon the first separate aspect, the gateway server may give confirmation to the first computing device, upon request therefrom, that the encryption key was provided to the second computing device.
In a third separate aspect of the present invention, building upon the first separate aspect, the encryption key sent to the second computing device may be a public encryption key, and the first computing device may decrypt the encrypted electronic communication by deriving the private encryption key from the device identifier previously sent to the gateway server. Alternatively, the two encryption keys may be the same.
In a fourth separate aspect of the present invention, with respect to the method, the gateway server receives and stores a device identifier and a network address from a first computing device. The device identifier identifies and the network address is associated with the first computing device. The gateway server receives from a second computing device the network address of the first computing device along with a request for an encryption key. In response, the gateway server derives the encryption key from the device identifier for the first computing device and sends the encryption key to the second computing device. Thereafter, the second computing device may use the encryption key to secure an electronic communication with the first computing device.
In a fifth separate aspect of the present invention, any of the foregoing aspects may be employed in combination. Aspects indicated for the system may be incorporated into the method, just as aspects indicated for the method may be incorporated into the system.
Accordingly, an improved system and method for securing an electronic communication are disclosed. Advantages of the improvements will appear from the drawings and the description of the preferred embodiment.
In the drawings, wherein like reference numerals refer to similar components:
Turning in detail to the drawings,
Both computers 101, 103 may communicate over the network 105 with at least each other and a gateway server 107, which is also communicably connected to the network 105. When not communicating in a manner as disclosed herein, such communications may be in the clear or secured through any desired encryption technique. The communication links between the network, on the one hand, and the computers 101, 103 and the gateway server 107, on the other hand, may take any form desired. For example, any of the communication links may be established through intermediaries such as a private communications network or over a public communications network, the Internet being an example of the latter. Alternatively, a private communications network, a public communications network, or any combination of one or more of such networks may form the network 105. Also, any of the communication links may be established directly or indirectly, permanent or transitory, wired or wireless. In some instances, the communication links may be established as needed.
To achieve a secure communication between the two computers 101, 103, at least one of the two, the one to receive the secure communication, communicates with the server 107 to provide information that enables the secure communication. The information provided to the server includes the network address associated with and a device identifier for the receiving computer. The server 107 receives the information and stores it within the database 109 for later access as needed. The database 109 may reside on the server 107, or it may reside on another computing device that is communicatively connected with the server 107. With such a system, the database becomes populated with network addresses and device identifiers for as many computing devices as may be on a particular network, or as may desire to take advantage of the ability to send and receive secure communications as discussed herein.
The network address may be any identifier by which the receiving computer is represented on the network. The network address may also be any combination of information sufficient to represent or identify the receiving computer on the network, depending upon the type of network connecting the computers. The type of information used and or needed as the network address will depend upon the type of network connecting the two computers. For example, the network address may be any one or more of an email address, an Internet Protocol (IP) address, and/or a Media Access Control (MAC) address. For certain wide area networks (WANs), an email address or MAC address may be sufficient to identify the receiving computer on the network. For other types of WANs, a combination of an email address and a MAC address may be sufficient. As another example, when the network is viewed as the Internet, an IP address may be sufficient.
An application is included on each computer 103, 105 to collect information about each respective computing device and to generate the device identifier for each computer 103, 105. This application may be incorporated as a function or routine as part of another application, or as part of the operating system, to be called upon and run as needed. The application checks and gathers a number of parameters which, collectively, are expected to uniquely identify the individual computing devices. The parameters checked may include, for example, hard disk volume name, user name, device name, user password, hard disk initialization date, etc. The collected information includes information that identifies the hardware on which the application is used, such as, for example, CPU number, or unique parameters associated with the firmware in use. The system information may further include system configuration information, such as amount of memory, type of processor, software or operating system serial number, etc. The parameters checked may also include, alternatively or in addition, virtual machine specifications. Examples of virtual machine specifications include, but are not limited to, information relating to virtual processors, virtual BIOS, virtual memory, virtual graphics, virtual IDE drives, virtual SCSI devices, virtual PCI slots, virtual floppy drives, virtual serial (COM) ports, virtual parallel (LPT) ports, virtual keyboard, virtual mouse and drawing tablets, virtual Ethernet card, virtual networking, virtual sound adapter, etc.
Based on the information collected from the computing device, the application generates a device identifier that uniquely identifies the user's computer. The device identifier may be stored in a hidden directory of the device, and/or it may be generated each time prior to the occurrence of a data transmission, or at any other desired time. The device identifier, by virtue of the application being used on the computing device or otherwise having access to the computing device's hardware and file system, is generated by a process which operates on data indicative of the computing device's configuration and hardware.
The device identifier may be generated using a combination of user-configurable and non-user-configurable machine parameters as input to a process that results in the device identifier, which may be expressed in digital data as a binary number. Each machine parameter is data determined by a hardware component, software component, or data component specific to the device that the unique identifier pertains to. Machine parameters may be selected based on the target device system configuration such that the resulting device identifier has a very high probability (e.g., greater than 99.999%) of being unique to the target device. In addition, the machine parameters may be selected such that the device identifier includes at least a stable unique portion up to and including the entire identifier, that has a very high probability of remaining unchanged during normal operation of the target device. Thus, the resulting device identifier should be highly specific, unique, reproducible and stable as a result of properly selecting the machine parameters.
The application that generates the device identifier may also operate on the collected parameters with one or more algorithms to generate the device identifier. This process may include at least one irreversible transformation, such as, for example, a cryptographic hash function, such that the input machine parameters cannot be derived from the resulting device identifier. Each device identifier, to a very high degree of certainty, cannot be generated except by the suitably configured device identifier application operating or otherwise having had access to the same computing device for which the device identifier was first generated. Conversely, each identifier, again to a very high degree of certainty, can be successfully reproduced by the suitably configured device identifier application operating or otherwise having access to the same computing device on which the identifier was first generated.
The device identifier application may operate by performing a system scan to determine a present configuration of the computing device. The application may then select the machine parameters to be used as input for generating the unique device identifier. Selection of parameters may vary depending on the system configuration. Once the parameters are selected, the application may generate the identifier.
Further, generating the device identifier may also be described as generating a device fingerprint and may entail the sampling of physical, non-user configurable properties as well as a variety of additional parameters such as uniquely generated hashes and time sensitive values. Physical device parameters available for sampling may include, for example, unique manufacturer characteristics, carbon and silicone degradation and small device failures.
The process of measuring carbon and silicone degradation may be accomplished by measuring a chip's ability to process complex mathematical computations, and its ability to respond to intensive time variable computations. These processes measure how fast electricity travels through the carbon. Using variable offsets to compensate for factors such as heat and additional stresses placed on a chip during the sampling process allows for each and every benchmark to reproduce the expected values. During a standard operating lifetime, the process of passing electricity through the various switches causes a computer chip to degrade. These degradations manifest as gradually slower speeds that extend the processing time required to compute various benchmarking algorithms.
In addition to the chip benchmarking and degradation measurements, the process for generating a device identifier may include measuring physical, non-user-configurable characteristics of disk drives and solid state memory devices. Each data storage device has a large variety of damage and unusable data sectors that are nearly unique to each physical unit. The ability to measure and compare values for damaged sectors and data storage failures provides a method for identifying storage devices.
Device parameter sampling, damage measurement and chip benchmarking make up just a part of device fingerprinting technologies described herein. These tools may be further extended by the use of complex encryption algorithms to convolute the device identifier values during transmission and comparisons. Such encryption processes may be used in conjunction with random sampling and key generations.
The device identifier may be generated by utilizing machine parameters associated with one or more of the following: machine model; machine serial number; machine copyright; machine ROM version; machine bus speed; machine details; machine manufacturer; machine ROM release date; machine ROM size; machine UUID; and machine service tag.
The device identifier may also be generated by utilizing machine parameters associated with one or more of the following: CPU ID; CPU model; CPU details; CPU actual speed; CPU family; CPU manufacturer; CPU voltage; and CPU external clock.
The device identifier may also be generated by utilizing machine parameters associated with one or more of the following: memory model; memory slots; memory total; and memory details.
The device identifier may also be generated by utilizing machine parameters associated with one or more of the following: video model; video details; display model; display details; audio model; and audio details.
The device identifier may also be generated by utilizing machine parameters associated with one or more of the following: network model; network address; Bluetooth address; BlackBox model; BlackBox serial; BlackBox details; BlackBox damage map; BlackBox volume name; NetStore details; and NetStore volume name.
The device identifier may also be generated by utilizing machine parameters associated with one or more of the following: optical model; optical serial; optical details; keyboard model; keyboard details; mouse model; mouse details; printer details; and scanner details.
The device identifier may also be generated by utilizing machine parameters associated with one or more of the following: baseboard manufacturer; baseboard product name; baseboard version; baseboard serial number; and baseboard asset tag.
The device identifier may also be generated by utilizing machine parameters associated with one or more of the following: chassis manufacturer; chassis type; chassis version; and chassis serial number.
The device identifier may also be generated by utilizing machine parameters associated with one or more of the following: IDE controller; SATA controller; RAID controller; and SCSI controller.
The device identifier may also be generated by utilizing machine parameters associated with one or more of the following: port connector designator; port connector type; port connector port type; and system slot type.
The device identifier may also be generated by utilizing machine parameters associated with one or more of the following: cache level; cache size; cache max size; cache SRAM type; and cache error correction type.
The device identifier may also be generated by utilizing machine parameters associated with one or more of the following: fan; PCMCIA; modem; portable battery; tape drive; USB controller; and USB hub.
The device identifier may also be generated by utilizing machine parameters associated with one or more of the following: device model; device model IMEI; device model IMSI; and device model LCD.
The device identifier may also be generated by utilizing machine parameters associated with one or more of the following: wireless 802.11; webcam; game controller; silicone serial; and PCI controller.
In one example, the device identifier may also be generated by utilizing machine parameters associated with one or more of the following: machine model, processor model, processor details, processor speed, memory model, memory total, network model of each Ethernet interface, network MAC address of each Ethernet interface, BlackBox Model, BlackBox Serial (e.g., using Dallas Silicone Serial DS-2401 chipset or the like), OS install date, nonce value, and nonce time of day.
Thus, a system and method for securing an electronic communication are disclosed. While embodiments of this invention have been shown and described, it will be apparent to those skilled in the art that many more modifications are possible without departing from the inventive concepts herein. The invention, therefore, is not to be restricted except in the spirit of the following claims.
As used in this application, the terms “component,” “module,” “system,” and the like are intended to refer to a computer-related entity, either hardware, firmware, a combination of hardware and software, software, or software in execution. For example, a component can be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a computing device and the computing device can be a component. One or more components can reside within a process and/or thread of execution and a component can be localized on one computer and/or distributed between two or more computers. In addition, these components can execute from various computer readable media having various data structures stored thereon. The components can communicate by way of local and/or remote processes such as in accordance with a signal having one or more data packets (e.g., data from one component interacting with another component in a local system, distributed system, and/or across a network such as the Internet with other systems by way of the signal).
It is understood that the specific order or hierarchy of steps in the processes disclosed herein in an example of exemplary approaches. Based upon design preferences, it is understood that the specific order or hierarchy of steps in the processes may be rearranged while remaining within the scope of the present disclosure. The accompanying method claims present elements of the various steps in sample order, and are not meant to be limited to the specific order or hierarchy presented.
Moreover, various aspects or features described herein can be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering techniques. The term “article of manufacture” as used herein is intended to encompass a computer program accessible from any computer-readable device, carrier, or media. For example, computer-readable media can include but are not limited to magnetic storage devices (e.g., hard disk, floppy disk, magnetic strips, etc.), optical discs (e.g., compact disc (CD), digital versatile disc (DVD), etc.), smart cards, and flash memory devices (e.g., Erasable Programmable Read Only Memory (EPROM), card, stick, key drive, etc.). Additionally, various storage media described herein can represent one or more devices and/or other machine-readable media for storing information. The term “machine-readable medium” can include, without being limited to, wireless channels and various other media capable of storing, containing, and/or carrying instruction(s) and/or data.
Those skilled in the art will further appreciate that the various illustrative logical blocks, modules, circuits, methods and algorithms described in connection with the examples disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, methods and algorithms have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
This application claims priority to U.S. Provisional Application Ser. No. 61/219,062 which was filed Jun. 22, 2009 and which is fully incorporated herein by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4200770 | Hellman et al. | Apr 1980 | A |
| 4323921 | Guillou | Apr 1982 | A |
| 4337483 | Guillou | Jun 1982 | A |
| 4351982 | Miller et al. | Sep 1982 | A |
| 4405829 | Rivest et al. | Sep 1983 | A |
| 4450535 | de Pommery et al. | May 1984 | A |
| 4658093 | Hellman | Apr 1987 | A |
| 4704610 | Smith et al. | Nov 1987 | A |
| 4796220 | Wolfe | Jan 1989 | A |
| 5191611 | Lang | Mar 1993 | A |
| 5210795 | Lipner et al. | May 1993 | A |
| 5239648 | Nukui | Aug 1993 | A |
| 5291598 | Grundy | Mar 1994 | A |
| 5313637 | Rose | May 1994 | A |
| 5349643 | Cox et al. | Sep 1994 | A |
| 5414269 | Takahashi | May 1995 | A |
| 5418854 | Kaufman et al. | May 1995 | A |
| 5440635 | Bellovin et al. | Aug 1995 | A |
| 5490216 | Richardson, III | Feb 1996 | A |
| 5666415 | Kaufman | Sep 1997 | A |
| 5745879 | Wyman | Apr 1998 | A |
| 5754763 | Bereiter | May 1998 | A |
| 5790664 | Coley et al. | Aug 1998 | A |
| 5925127 | Ahmad | Jul 1999 | A |
| 5974150 | Kaish et al. | Oct 1999 | A |
| 6009401 | Horstmann | Dec 1999 | A |
| 6044471 | Colvin | Mar 2000 | A |
| 6098053 | Slater | Aug 2000 | A |
| 6098106 | Philyaw et al. | Aug 2000 | A |
| 6158005 | Bharathan et al. | Dec 2000 | A |
| 6163843 | Inoue et al. | Dec 2000 | A |
| 6230199 | Revashetti et al. | May 2001 | B1 |
| 6233567 | Cohen | May 2001 | B1 |
| 6243468 | Pearce et al. | Jun 2001 | B1 |
| 6294793 | Brunfeld et al. | Sep 2001 | B1 |
| 6330670 | England et al. | Dec 2001 | B1 |
| 6449645 | Nash | Sep 2002 | B1 |
| 6536005 | Augarten | Mar 2003 | B1 |
| 6681017 | Matias et al. | Jan 2004 | B1 |
| 6785825 | Colvin | Aug 2004 | B2 |
| 6859793 | Lambiase | Feb 2005 | B1 |
| 6880079 | Kefford et al. | Apr 2005 | B2 |
| 6920567 | Doherty et al. | Jul 2005 | B1 |
| 6976009 | Tadayon et al. | Dec 2005 | B2 |
| 7032110 | Su et al. | Apr 2006 | B1 |
| 7032242 | Grabelsky et al. | Apr 2006 | B1 |
| 7069440 | Aull | Jun 2006 | B2 |
| 7069595 | Cognigni et al. | Jun 2006 | B2 |
| 7085741 | Lao et al. | Aug 2006 | B2 |
| 7188241 | Cronce et al. | Mar 2007 | B2 |
| 7203966 | Abburi et al. | Apr 2007 | B2 |
| 7206765 | Gilliam et al. | Apr 2007 | B2 |
| 7272728 | Pierson et al. | Sep 2007 | B2 |
| 7310813 | Lin et al. | Dec 2007 | B2 |
| 7319987 | Hoffman et al. | Jan 2008 | B1 |
| 7327280 | Bachelder et al. | Feb 2008 | B2 |
| 7337147 | Chen et al. | Feb 2008 | B2 |
| 7343297 | Bergler et al. | Mar 2008 | B2 |
| 7444508 | Karjala et al. | Oct 2008 | B2 |
| 7463945 | Kiesel et al. | Dec 2008 | B2 |
| 7506056 | Satish et al. | Mar 2009 | B2 |
| 7552233 | Raju et al. | Jun 2009 | B2 |
| 7599303 | Nadeau et al. | Oct 2009 | B2 |
| 7653899 | Lindahl et al. | Jan 2010 | B1 |
| 7739401 | Goyal | Jun 2010 | B2 |
| 7739402 | Roese | Jun 2010 | B2 |
| 7818573 | Martin et al. | Oct 2010 | B2 |
| 7852861 | Wu et al. | Dec 2010 | B2 |
| 7870273 | Watson et al. | Jan 2011 | B2 |
| 8023484 | Huang et al. | Sep 2011 | B1 |
| 20010034712 | Colvin | Oct 2001 | A1 |
| 20010044782 | Hughes et al. | Nov 2001 | A1 |
| 20020010864 | Safa | Jan 2002 | A1 |
| 20020019814 | Ganesan | Feb 2002 | A1 |
| 20020082997 | Kobata et al. | Jun 2002 | A1 |
| 20020099952 | Lambert et al. | Jul 2002 | A1 |
| 20020161718 | Coley et al. | Oct 2002 | A1 |
| 20030063750 | Medvinsky et al. | Apr 2003 | A1 |
| 20030065918 | Willey | Apr 2003 | A1 |
| 20030070067 | Saito | Apr 2003 | A1 |
| 20030131001 | Matsuo | Jul 2003 | A1 |
| 20030149777 | Adler | Aug 2003 | A1 |
| 20030172035 | Cronce et al. | Sep 2003 | A1 |
| 20030182435 | Redlich et al. | Sep 2003 | A1 |
| 20030212892 | Oishi | Nov 2003 | A1 |
| 20030217263 | Sakai | Nov 2003 | A1 |
| 20030237004 | Okamura | Dec 2003 | A1 |
| 20040024860 | Sato et al. | Feb 2004 | A1 |
| 20040030912 | Merkle et al. | Feb 2004 | A1 |
| 20040059929 | Rodgers et al. | Mar 2004 | A1 |
| 20040143746 | Ligeti et al. | Jul 2004 | A1 |
| 20040145773 | Oakeson et al. | Jul 2004 | A1 |
| 20040187018 | Owen et al. | Sep 2004 | A1 |
| 20050033957 | Enokida | Feb 2005 | A1 |
| 20050108173 | Stefik et al. | May 2005 | A1 |
| 20050138155 | Lewis | Jun 2005 | A1 |
| 20050169271 | Janneteau et al. | Aug 2005 | A1 |
| 20050172280 | Ziegler et al. | Aug 2005 | A1 |
| 20050187890 | Sullivan | Aug 2005 | A1 |
| 20050223218 | Honkanen et al. | Oct 2005 | A1 |
| 20060072444 | Engel et al. | Apr 2006 | A1 |
| 20060095454 | Shankar et al. | May 2006 | A1 |
| 20060130135 | Krstulich et al. | Jun 2006 | A1 |
| 20060161914 | Morrison et al. | Jul 2006 | A1 |
| 20060168253 | Baba et al. | Jul 2006 | A1 |
| 20060265337 | Wesinger, Jr. | Nov 2006 | A1 |
| 20060271485 | McKenzie et al. | Nov 2006 | A1 |
| 20060280207 | Guarini et al. | Dec 2006 | A1 |
| 20060282511 | Takano et al. | Dec 2006 | A1 |
| 20070005974 | Kudou | Jan 2007 | A1 |
| 20070055853 | Hatasaki et al. | Mar 2007 | A1 |
| 20070168288 | Bozeman | Jul 2007 | A1 |
| 20070198422 | Prahlad et al. | Aug 2007 | A1 |
| 20070203846 | Kavuri et al. | Aug 2007 | A1 |
| 20070219917 | Liu et al. | Sep 2007 | A1 |
| 20070282615 | Hamilton et al. | Dec 2007 | A1 |
| 20080040785 | Shimada | Feb 2008 | A1 |
| 20080049779 | Hopmann et al. | Feb 2008 | A1 |
| 20080052775 | Sandhu et al. | Feb 2008 | A1 |
| 20080065552 | Elazar et al. | Mar 2008 | A1 |
| 20080076572 | Nguyen et al. | Mar 2008 | A1 |
| 20080082813 | Chow et al. | Apr 2008 | A1 |
| 20080086423 | Waites | Apr 2008 | A1 |
| 20080098471 | Ooi et al. | Apr 2008 | A1 |
| 20080147556 | Smith et al. | Jun 2008 | A1 |
| 20080148067 | Sitrick et al. | Jun 2008 | A1 |
| 20080152140 | Fascenda | Jun 2008 | A1 |
| 20080177997 | Morais et al. | Jul 2008 | A1 |
| 20080228578 | Mashinsky | Sep 2008 | A1 |
| 20080244739 | Liu et al. | Oct 2008 | A1 |
| 20080298595 | Narayanan et al. | Dec 2008 | A1 |
| 20080320607 | Richardson | Dec 2008 | A1 |
| 20090003600 | Chen et al. | Jan 2009 | A1 |
| 20090006861 | Ven Bemmel | Jan 2009 | A1 |
| 20090016264 | Hirano et al. | Jan 2009 | A1 |
| 20090083730 | Richardson | Mar 2009 | A1 |
| 20090113088 | Illowsky et al. | Apr 2009 | A1 |
| 20090138975 | Richardson | May 2009 | A1 |
| 20090158426 | Yoon et al. | Jun 2009 | A1 |
| 20100034207 | Mcgrew et al. | Feb 2010 | A1 |
| 20100197326 | Ngo | Aug 2010 | A1 |
| 20100235624 | Candelore | Sep 2010 | A1 |
| Number | Date | Country |
|---|---|---|
| 678985 | Jun 1997 | AU |
| 1637958 | Mar 2006 | EP |
| 1637961 | Mar 2006 | EP |
| 1670188 | Jun 2006 | EP |
| WO 9220022 | Nov 1992 | WO |
| WO 9301550 | Jan 1993 | WO |
| WO 9535533 | Dec 1995 | WO |
| WO 0067095 | Nov 2000 | WO |
| WO 0109756 | Feb 2001 | WO |
| WO 2005104686 | Nov 2005 | WO |
| WO2007060516 | May 2007 | WO |
| WO2008013504 | Jan 2008 | WO |
| WO 2008034900 | Mar 2008 | WO |
| WO 2008052310 | May 2008 | WO |
| WO2008157639 | Dec 2008 | WO |
| WO2009039504 | Mar 2009 | WO |
| WO2009065135 | May 2009 | WO |
| WO2009076232 | Jun 2009 | WO |
| WO2009105702 | Aug 2009 | WO |
| WO2009143115 | Nov 2009 | WO |
| WO 2009158525 | Dec 2009 | WO |
| Entry |
|---|
| The Secure Shell (SSH) Authentication Protocol|http://tools.ietf.org/pdf/rfc4252.pdf|Jan. 2006|T. Ylonen and C. Lonvick|. |
| Optimizing Public-Key Encryption for Wireless Clients|http://palms.ee.princeton.edu/PALMSopen/potlapally02optimizing.pdf|Potlapally et al.|2002|pp. 1-7. |
| Williams, R., “A Painless Guide to CRC Error Detection Algorithms”, Ver. 3, Aug. 19, 1993. |
| Angha, F. et al., “Securing Transportation Network Infrastructure with Patented Technology of Device Locking—Developed by Uniloc USA”, avail. at: http://www.dksassociates.com/admin/paperfile/ITS%20World%20Paper%20Submission—Uniloc%20—2—.pdf, Oct. 24, 2006. |
| Econolite, “Econolite and Uniloc Partner to Bring Unmatched Infrastructure Security to Advanced Traffic Control Networks with Launch of Strongpoint”, avail. at: http://www.econolite.com/docs/press/20080304—Econolite—StrongPoint.pdf, Mar. 4, 2008. |
| Eisen, Ori, “Catching the Fraudulent Man-in-the-Middle and Man-in-the-Browser,” Network Security, Apr. 2010, pp. 11-12. |
| Housley et al., “Internet x.509 Public Key Infracstructure Certificate and CRL Profile,” The Internet Society, Network Working Group, Sep. 1999, 75 pages [RFC 2459]. |
| Wikipedia: “Software Extension,” May 28, 2009, Internet Article retrieved on Oct. 11, 2010. XP002604710. |
| H. Williams, et al., “Web Database Applications with PHP & MySQL”, Chapter 1, “Database Applications and the Web”, ISBN 0-596-00041-3, O'Reilly & Associates, Inc., Mar. 2002, avail. at: http://docstore.mik.ua/orelly/webprog/webdb/ch01—01.htm. XP002603488. |
| Nesi, et al., “A Protection Processor for MPEG-21 Players,” In Proceedings of ICME, 2006, pp. 1357-1360. |
| Zhu, Yunpu, “A New Architecture for Secure Two-Party Mobile Payment Transactions,” Submitted to the School of Graduate Studies of the University of Lethbridge, Master of Science, 2010, 240 pages. |
| FC 4252 The Secure Shell, Authentication Protocol, Print Publication, Jan. 2006. |
| Number | Date | Country | |
|---|---|---|---|
| 20100325423 A1 | Dec 2010 | US |
| Number | Date | Country | |
|---|---|---|---|
| 61219062 | Jun 2009 | US |