The present invention relates generally to data sharing techniques and in particular mechanisms for easily sharing data in a secure format.
There exists a need to transfer sensitive information, such as cryptographic keys, between entities. As one example, secure access solution providers often need to share cryptographic keys with their customers and vice versa in order that the solution provider can create customized credentials and/or readers for the customer.
Many methods of transferring cryptographic keys between entities are in current use. Most of the existing methods do not provide a high level of assurance that the key is neither copied nor changed in the process. For example, there are instances where a cryptographic key is written on a piece of paper and sent via postal or express delivery to the receiving entity. There are other instances where a key is sent via facsimile transmission or email from the sending entity to the receiving entity.
There are highly secure methods of transferring cryptographic keys between entities. As one example, a cryptographic key can be split into any number of parts (e.g., seven parts) in such a manner that some subset of the parts (e.g., four parts) are needed to reassemble the key. The parts, which are commonly referred to as key fragments, are written individually to different secure devices such as smart cards or Fortezza cards. Each of the cards are sent by different routes to the receiving entity. The receiving entity waits until the necessary subset of the total number of secure devices comprising all of the parts have arrived and combines the fragments on those devices to reconstruct the key. The total number of parts and subparts are variable.
It can be appreciated that the simple methods described above are relatively unsecure and the secure methods are relatively complex. It is not surprising then that many keys are transferred using unsecure methods. What is needed is a simple yet secure mechanism for transferring cryptographic keys and other sensitive information from one entity to another.
It is, therefore, one aspect of the present invention to provide a simple and secure mechanism for transferring sensitive information from one entity to another entity.
Embodiments of the present invention provide a purpose-built computing device containing a secure element, such as a tamper-resistant processor, that is used to secure sensitive information by encoding/encrypting such information as well as unsecure sensitive information by decoding/decrypting such information. In some embodiments, the sensitive information is secured prior to and in anticipation of transmission of the sensitive information to a receiving entity and is subsequently unsecured following transmission.
In some embodiments, a user at the sending entity enters the characters of the sensitive information to be sent to the receiving entity into a user input on the computing device. The entries are sent directly to the secure element without passing through any other electrical component or application. The sensitive information is transformed into secure sensitive information by encoding or encrypting the sensitive information inside the secure element. The secure sensitive information can then be communicated back to the person entering the sensitive information, for example using an LED display on the computing device. Alternatively, or in addition, the secure sensitive information is sent to the receiving entity, for example using an Internet connection and an Internet protocol such as the Simple Network Management Protocol (SNMP), which is a User Datagram Protocol (UDP)-based network protocol. In this situation, the characters representing the secure sensitive information are communicated to the receiving entity using traditional ad hoc low security techniques such as voice call, video call, fax, text message (e.g., Short Message Service (SMS) message), email, letter, etc. In this manner, the sensitive information is handled according to the highest security procedures and yet the transfer procedure itself is simple and, therefore, can be executed using the low security methods of key transfer such as voice call, video call, text message, email, fax, etc.
At the receiving entity, the process is reversed. The received characters, whether received at a network interface or at a user interface, comprising the secure sensitive information are entered into a complementary computing device of generally the same construction as the computing device used by the sending entity. As before, the characters representing the secure sensitive information are passed directly to the secure element. The secure element at the receiving entity decodes or decrypts the received secure sensitive information, as necessary, and communicates the unsecure sensitive information back to the person handling the computing device at the receiving entity. The unsecure sensitive information may be displayed to the user, for example, by using an LED display. Alternatively, or in addition, the secure element may send the unsecure sensitive information directly to an external device that is to use the sensitive data (e.g., to create secure access credentials for the first entity).
In some embodiments, the secure sensitive information can be split into N fragments (wherein N is a variable) inside the secure element and each fragment is treated as above. As one example, M, a subset of the N fragments, may be sent to the receiving entity via IP packets whereas N-M of the fragments may be communicated to the receiving entity via phone call, video call, email, text message, fax, etc.
In accordance with at least some embodiments of the present invention, a method of sharing sensitive information of a first entity with a second entity such that the second entity has useable control of the sensitive information is provided, the method generally comprises:
receiving, at a user input of a first computing device, input of sensitive information;
transmitting the input sensitive information directly from the user input to a secure element of the first computing device;
securing the sensitive information within the secure element by at least one of encoding and encrypting the sensitive information with an encryption algorithm and key;
encapsulating the secured sensitive information in at least one Internet Protocol packet for transmission across a public network; and
transmitting the at least one Internet Protocol packet containing the secured sensitive information from the first entity to the second entity over a packet-switched network.
Embodiments of the present invention include two parts. The first part is a secure element, possibly in the form of a tamper-resistant processor, such as is found in a smart card or the Subscriber Identity Module (SIM) card in a mobile telephone. The second part is a computing device with a user input and, optionally an alpha-numeric display, having communication capabilities and into which the first part is placed.
The Summary is neither intended nor should it be construed as being representative of the full extent and scope of the present invention. The present invention is set forth in various levels of detail and the Summary as well as in the attached drawings and in the detailed description of the invention and no limitation as to the scope of the present invention is intended by either the inclusion or non inclusion of elements, components, etc. in the Summary. Additional aspects of the present invention will become more readily apparent from the detailed description, particularly when taken together with the drawings.
The invention will be illustrated below in conjunction with an exemplary communication system. Although well suited for use with, e.g., a system using computers, servers, and other computing devices, the invention is not limited to use with any particular type of computing or communication device or configuration of system elements. Those skilled in the art will recognize that the disclosed techniques may be used in any application in which it is desirable to share sensitive information between entities such that the data is secured for transfer purposes and useable by both entities.
The exemplary systems and methods of this invention will also be described in relation to analysis software, modules, and associated analysis hardware. However, to avoid unnecessarily obscuring the present invention, the following description omits well-known structures, components and devices that may be shown in block diagram form that are well known, or are otherwise summarized.
For purposes of explanation, numerous details are set forth in order to provide a thorough understanding of the present invention. It should be appreciated, however, that the present invention may be practiced in a variety of ways beyond the specific details set forth herein.
Referring initially to
Both the first and second entities 104a, 104b may have or control their own version of a computing device 116 that facilitates the sharing of sensitive information 112. A computing device 116 may correspond to a hand-held device that can be used and operated by a user 108a, 108b of the entity 104a, 104b. In some embodiments, the computing device 116 comprises a secure element 120, a user input 124, an optional user output 128, and an optional network interface 132.
The secure element 120 may comprise any type of secure platform for receiving and securing the sensitive information 112. In some embodiments, the secure element may comprise a tamper-resistant or tamper-proof processor. As one example, the secure element 120 may comprise an Integrated Circuit (IC) card into which an application, usually in the form of an applet, is programmed. Alternatively, or in addition, the secure element 120 may comprise a Subscriber Identity Module (SIM) card having an applet programmed therein.
The application programmed into the IC or SIM card may be capable of supporting the features and functions of the secure element 120. For example, the application programmed into the secure element 120 may comprise instructions which allow the secure element 120 to communicate with the user input 124, user output 128, and/or network interface 132. The application programmed into the secure element 120 may also comprise encoding/decoding and/or encryption/decryption instructions which allow the secure element 120 to translate the sensitive information 112 into secure sensitive information and vice versa. In the encryption/decryption example, the secure element 120 may internally comprise the encryption algorithm and encryption key used in encrypting sensitive information 112 and decrypting the encrypted version of the same.
Alternatively, or in addition, the secure element 120 may comprise an Application Specific Integrated Circuit (ASIC) that has been specifically programmed for executing the secure element 120. In some embodiments, the instructions provided in the ASIC may be similar or identical to the instructions that would be otherwise included in the application programmed into an IC or SIM card.
In some embodiments, the user input 124 is hardwired to the secure element 120 such that input received from a user 108a, 108b at the user input 124 is transferred directly to the secure element 120 without passing through any other electronic component or application, such as an operating system, etc. Examples of a user input 124 include, without limitation, a keyboard, keypad, touchpad, touchscreen, mouse, rollerball, and the like. The user input 124 is generally responsible for converting motion of the user 108a, 108b into an electronic signal that is useable within the computing device 116.
Since the user input 124 is hardwired to the secure element 120, any input received at the user input 124 is passed as an electronic signal directly to the secure element 120. Within the boundary of the secure element 120, the secure element 120 may comprise the functionality necessary to convert the electronic signal received from the user input 124 into a secure useable format. In some embodiments, the electronic signals received from the user input 124 may be converted from ASCII characters into binary code or any other machine code.
As can be seen in
It is, thus, one aspect of the present invention to provide a pair of computing devices 116 having similar encoding/decoding or encryption/decryption capabilities. This removes the requirement that the devices 116 share any additional information beyond the secure sensitive information 204 for the device into which the sensitive information 112 was not input to determine the input sensitive information 112.
As will be discussed in greater detail below, the secure sensitive information 204 may be shared between computing devices 116 either automatically via a network interface 132 or manually via displaying the secure sensitive information 204 on the user output 128 of the device 116 into which the sensitive information 112 was input. This allows the user (e.g., the first user 108a) associated with that device to receive the secure sensitive information 204 via the user output 128. That user can communicate the secure sensitive information 204 to the other user (e.g., the second user 108b) over a traditional communication network 144 (e.g., via a telephone call, video call, email, SMS message, and/or fax). The other user is then allowed to input the secure sensitive information 204 into the user input 124 of the other computing device 116. Once the secure sensitive information 204 is input into the other computing device 116, the secure element 120 of that device converts the information back into unsecure sensitive information 112 such that it can be used by the other entity (e.g., the second entity 104b). Additionally, manual and automated mechanisms of sharing the secure sensitive information 204 may be employed in the event that the secure sensitive information 204 is split into two or more portions and at least one portion is shared automatically while at least one other portion is shared manually.
Referring back to
The network interface 132 may comprise any type of electrical component or combination of components which allows the computing device 116 to communicate with other devices via a network 140. In some embodiments, the network interface 132 may comprise a network interface such as a Local Network Interface (LAN) (e.g., for IEEE 802.3 and Ethernet networks, 100VG-AnyLAN networks, and 100Base-T networks), a Token Ring (e.g., for IEEE 802.5 networks), a Fiber Distributed Data Interface (FDDI) (e.g., for fiber optic networks), a 100VG-AnyLAN (e.g., for 100VG-AnyLAN networks), a 100Base-T (e.g., for 100Base-T networks), a Point-to-Point (e.g., for networks that use Point-to-Point routing), X.25 (e.g., for X.25 networks), wireless network adapter and antennas (e.g., for wireless communication networks), and any other type of device capable of formatting information received from the secure element 120 for transmission across the network 140 and vice versa.
In some embodiments, the network 140 may comprise an Internet Protocol (IP) network, such as the Internet, a LAN, a Wide Area Network (WAN), a 3G network, a 4G network, or combinations thereof. In accordance with at least some embodiments, the network 140 is adapted to carry messages between the components connected thereto. Thus, computing devices 116 are enabled to automatically share secure sensitive information 204 with one another via the network 140. The network 140 may comprise any type of known communication network including wired and wireless or combinations of communication networks and may span long or small distances. The protocols supported by the network 140 include, but are not limited to, the TCP/IP protocol, Wi-Fi, Wiegand Protocol, RS 232, RS 485, RS422, Current Loop, F2F, Bluetooth, Zigbee, GSM, SMS, optical, audio and so forth. The Internet is an example of the network 140 that constitutes a collection of IP networks consisting of many computers and other communication devices located locally and all over the world.
The network 140 serves as one mechanism by which entities 104a and 104b can communicate with one another and share sensitive information 112. An alternative communication network 144 may also be provided between the entities 104a, 104b. In particular, the communication network 144 may connect communication devices 136 maintained within each entity 104a, 104b. As an example, the communication devices 136 may correspond to telephones, video phones, Personal Computers (PCs), laptops, cellular phones, Personal Digital Assistants (PDAs), or any other multi-function device capable of connecting to the communication network 144. Examples of the communication network 144 include, without limitation, a standard Plain Old Telephone System (POTS), an Integrated Services Digital Network (ISDN), the Public Switched Telephone Network (PSTN), a Local Area Network (LAN), a Wide Area Network (WAN), a Session Initiation Protocol (SIP) network, a cellular communication network, a satellite communication network, any type of enterprise network, and any other type of packet-switched or circuit-switched network known in the art. It can be appreciated that the communication network 144 need not be limited to any one network type, and instead may be comprised of a number of different networks and/or network types.
It is also possible that the network 140 and the communication network 144 are a single network. As one example, the single network may correspond to an IP network over which the computing devices 116 share secure sensitive information 204. The communication devices 136 may also share information utilizing Voice over IP (VoIP), email, SMS messages, and the like.
In accordance with at least some embodiments of the present invention, the computing devices 116 may be adapted to share secure sensitive information 204 in the form of an SNMP message or multiple SNMP messages. To prepare the SNMP message for transmission over the network 140, the computing device 116 may encapsulate the SNMP message containing the secure sensitive information 204 in another type of message format capable of being transmitted over the network 140. As one example, the SNMP message may be encapsulated in a TCP or UDP packet or collection of packets which are then sent over the network 140. The other computing device 116 is adapted to receive the packet or packets of information and remove the SNMP message encapsulated therein at which point the secure element 120 of the other computing device 116 can transform the secure sensitive information 204 back into useable unsecure sensitive information 112.
With reference now to
Once the sensitive information is secured within the secure element 120, the method continues by determining whether the secure sensitive information 204 will be communicated to the other computing device 116 via automatic transmission mechanisms 216 (step 316). As can be appreciated by one skilled in the art, this determination is not exclusive. In fact, it is possible that automatic and manual transmission mechanisms may be employed to communicate a single instance of secure sensitive information 204. As an example, the secure sensitive information 204 may be split into two or more portions, one of which is transmitted automatically and another of which is transmitted with manual intervention. Therefore, the query at step 316 may correspond to a single query for all of the secure sensitive information 204 or may correspond to multiple queries for each portion of the secure sensitive information 204.
In the event that the automated mechanisms are to be used in transmitting the secure sensitive information 204, the method continues with the secure element 120 transferring the secure sensitive information 204 to a network interface 132 where the secure sensitive information is encapsulated into one or more IP packets (step 320). A target device (i.e., the computing device 116 at the second entity 104b) and its corresponding address (e.g., IP address, URI, URL, or the like) is also determined (step 324). The determination of the target device 324 may be made by the secure element 120, but the determination of the target device's 324 address may be made either at the secure element 120 or the network interface 132. Once configured for transmission across the network 140, the method continues with the transmission of the IP packets to the target device across the network 140 (step 328).
Referring back to step 316, in the event that manual mechanisms are to be used in transmitting the secure sensitive information 204, the method proceeds with the secure element 120 transmitting the secure sensitive information 204 to the user output 128, where it is rendered for presentation to the first user 108a (step 332). The first user 108a receives the secure sensitive information 204 (e.g., via seeing and/or hearing such information) then utilizes the communication device 136 to communicate the secure sensitive information 204 to the second user 108b (step 336). This step may be accomplished by utilizing one or more of a telephone call, video call, email, SMS message, and fax to communicate the secure sensitive information 204 to the second user 108b. As can be appreciated by one skilled in the art, the second user 108b utilizes its communication device 136 to receive the secure sensitive information 204 if transmitted via a manual mechanism. The second user 108b then enters the secure sensitive information 204 into the user input 124 of their computing device 116, where it is transmitted directly to the secure element 120 of the same.
Regardless of whether or not the secure sensitive information 204 is received via automatic or manual-intervention mechanisms, the method continues with the secure sensitive information 204 being passed from the network interface 132 or user input 124 to the secure element 120 (step 340). The secure sensitive information 204 is then unsecured by the secure element 120 by reversing the process which was applied at the first entity 104a (step 344). In particular, the secure element 120 at the receiving computing device 116 comprises the same algorithms and/or keys as the secure element 120 at the sending computing device 116 such that when it receives input that is identified as already secured, the secure element 120 reverses the process that was used to secure such data and the secure sensitive information 204 is transformed back into unsecure sensitive information.
Once in this form, the sensitive information 112 can be used by the second entity 104b (step 348). In some embodiments, the second entity 104b may be allowed to generate secure access credentials (e.g., smart cards) for the first entity 104a using the sensitive information 112 of the first entity 104a. Because the sensitive information 112 was shared using the pair of computing devices 116 described herein, the first entity 104a is able share its sensitive information 112 via relatively simple but secure mechanisms.
While the above-described flowchart has been discussed in relation to a particular sequence of events, it should be appreciated that changes to this sequence can occur without materially effecting the operation of the invention. Additionally, the exact sequence of events need not occur as set forth in the exemplary embodiments. The exemplary techniques illustrated herein are not limited to the specifically illustrated embodiments but can also be utilized with the other exemplary embodiments and each described feature is individually and separately claimable.
The systems, methods and protocols of this invention can be implemented on a special purpose computer in addition to or in place of the described access control equipment, a programmed microprocessor or microcontroller and peripheral integrated circuit element(s), an ASIC or other integrated circuit, a digital signal processor, a hard-wired electronic or logic circuit such as discrete element circuit, a programmable logic device such as TPM, PLD, PLA, FPGA, PAL, a communications device, such as a server, personal computer, any comparable means, or the like. In general, any device capable of implementing a state machine that is in turn capable of implementing the methodology illustrated herein can be used to implement the various data messaging methods, protocols and techniques according to this invention.
Furthermore, the disclosed methods may be readily implemented in software. Alternatively, the disclosed system may be implemented partially or fully in hardware using standard logic circuits or VLSI design. Whether software or hardware is used to implement the systems in accordance with this invention is dependent on the speed and/or efficiency requirements of the system, the particular function, and the particular software or hardware systems or microprocessor or microcomputer systems being utilized. The analysis systems, methods and protocols illustrated herein can be readily implemented in hardware and/or software using any known or later developed systems or structures, devices and/or software by those of ordinary skill in the applicable art from the functional description provided herein and with a general basic knowledge of the computer arts.
Moreover, the disclosed methods may be readily implemented in software that can be stored on a storage medium, executed on a programmed general-purpose computer with the cooperation of a controller and memory, a special purpose computer, a microprocessor, or the like. In these instances, the systems and methods of this invention can be implemented as program embedded on personal computer such as an integrated circuit card applet, JAVA® or CGI script, as a resource residing on a server or computer workstation, as a routine embedded in a dedicated communication system or system component, or the like. The system can also be implemented by physically incorporating the system and/or method into a software and/or hardware system, such as the hardware and software systems of a communications device or system.
It is therefore apparent that there has been provided, in accordance with the present invention, systems, apparatuses and methods for sharing sensitive data between entities. While this invention has been described in conjunction with a number of embodiments, it is evident that many alternatives, modifications and variations would be or are apparent to those of ordinary skill in the applicable arts. Accordingly, it is intended to embrace all such alternatives, modifications, equivalents and variations that are within the spirit and scope of this invention.
This Application claims the benefit of U.S. Provisional Application No. 61/160,187, filed Mar. 13, 2009, the entire disclosure of which is hereby incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
3920896 | Bishop et al. | Nov 1975 | A |
3958088 | Vieri | May 1976 | A |
4703503 | Asai | Oct 1987 | A |
5146499 | Geffrotin | Sep 1992 | A |
5377997 | Wilden et al. | Jan 1995 | A |
5438650 | Motoyama et al. | Aug 1995 | A |
5572195 | Heller et al. | Nov 1996 | A |
5651006 | Fujino et al. | Jul 1997 | A |
5657388 | Weiss | Aug 1997 | A |
5758083 | Singh et al. | May 1998 | A |
5822435 | Boebert et al. | Oct 1998 | A |
5828830 | Rangaraian et al. | Oct 1998 | A |
5987513 | Prithviraj et al. | Nov 1999 | A |
6088450 | Davis et al. | Jul 2000 | A |
6219718 | Villalpando | Apr 2001 | B1 |
6272542 | Barnes et al. | Aug 2001 | B1 |
6356949 | Katsandres et al. | Mar 2002 | B1 |
6360258 | LeBlanc | Mar 2002 | B1 |
6367011 | Lee et al. | Apr 2002 | B1 |
6484225 | Sheikh et al. | Nov 2002 | B2 |
6490680 | Scheidt et al. | Dec 2002 | B1 |
6516357 | Hamann et al. | Feb 2003 | B1 |
6601200 | Delp et al. | Jul 2003 | B1 |
6616535 | Nishizaki et al. | Sep 2003 | B1 |
6675351 | Leduc | Jan 2004 | B1 |
6757280 | Wilson, Jr. | Jun 2004 | B1 |
6823453 | Hagerman | Nov 2004 | B1 |
6857566 | Wankmueller | Feb 2005 | B2 |
6880752 | Tarnovsky et al. | Apr 2005 | B2 |
6959394 | Brickell et al. | Oct 2005 | B1 |
6986139 | Kubo | Jan 2006 | B1 |
6990588 | Yasukura | Jan 2006 | B1 |
7036146 | Goldsmith | Apr 2006 | B1 |
7070091 | Hepworth et al. | Jul 2006 | B2 |
7092915 | Best et al. | Aug 2006 | B2 |
7096282 | Wille | Aug 2006 | B1 |
7171654 | Werme et al. | Jan 2007 | B2 |
7194628 | Guthery | Mar 2007 | B1 |
7242694 | Beser | Jul 2007 | B2 |
7270266 | Silverbrook et al. | Sep 2007 | B2 |
7287695 | Wankmueller | Oct 2007 | B2 |
7321566 | Fu | Jan 2008 | B2 |
7363489 | Burakoff et al. | Apr 2008 | B2 |
7406592 | Polyudov | Jul 2008 | B1 |
7500606 | Park et al. | Mar 2009 | B2 |
7506041 | Shelton et al. | Mar 2009 | B1 |
7620041 | Dunn et al. | Nov 2009 | B2 |
7669212 | Alao et al. | Feb 2010 | B2 |
7716355 | McCloghrie et al. | May 2010 | B2 |
7725784 | Laouamri et al. | May 2010 | B2 |
7742183 | Sato | Jun 2010 | B2 |
7788403 | Darugar et al. | Aug 2010 | B2 |
7853643 | Martinez et al. | Dec 2010 | B1 |
7908608 | Ozor et al. | Mar 2011 | B2 |
8074271 | Davis et al. | Dec 2011 | B2 |
20020138582 | Chandra et al. | Sep 2002 | A1 |
20020199096 | Wenocur et al. | Dec 2002 | A1 |
20030115466 | Aull et al. | Jun 2003 | A1 |
20030131051 | Lection et al. | Jul 2003 | A1 |
20030159056 | Cromer et al. | Aug 2003 | A1 |
20040040026 | Farrugia | Feb 2004 | A1 |
20040059925 | Benhammou et al. | Mar 2004 | A1 |
20040073727 | Moran et al. | Apr 2004 | A1 |
20040083378 | LeRose | Apr 2004 | A1 |
20040104266 | Bolle et al. | Jun 2004 | A1 |
20040151322 | Sovio et al. | Aug 2004 | A1 |
20040158625 | Neale | Aug 2004 | A1 |
20040204778 | Lalapeth et al. | Oct 2004 | A1 |
20040250087 | Ray et al. | Dec 2004 | A1 |
20050005063 | Liu et al. | Jan 2005 | A1 |
20050005131 | Yoshida et al. | Jan 2005 | A1 |
20050033703 | Holdsworth | Feb 2005 | A1 |
20050105508 | Saha | May 2005 | A1 |
20050109841 | Ryan et al. | May 2005 | A1 |
20050193213 | Johnson et al. | Sep 2005 | A1 |
20050228993 | Silvester et al. | Oct 2005 | A1 |
20050242921 | Zimmerman et al. | Nov 2005 | A1 |
20050262229 | Gattu et al. | Nov 2005 | A1 |
20060022799 | Juels | Feb 2006 | A1 |
20060023674 | Goring et al. | Feb 2006 | A1 |
20060053210 | Dague et al. | Mar 2006 | A1 |
20060059253 | Goodman et al. | Mar 2006 | A1 |
20060095957 | Lundblade et al. | May 2006 | A1 |
20060132304 | Cabell | Jun 2006 | A1 |
20060174130 | Noble | Aug 2006 | A1 |
20060195594 | Fujimori et al. | Aug 2006 | A1 |
20060208066 | Finn et al. | Sep 2006 | A1 |
20060226950 | Kanou et al. | Oct 2006 | A1 |
20060230437 | Boyer et al. | Oct 2006 | A1 |
20060259961 | Joffray | Nov 2006 | A1 |
20070057057 | Andresky et al. | Mar 2007 | A1 |
20070064623 | Brahmaroutu | Mar 2007 | A1 |
20070067642 | Singhal | Mar 2007 | A1 |
20070067833 | Colnot | Mar 2007 | A1 |
20070169183 | Kipnis et al. | Jul 2007 | A1 |
20070174907 | Davis | Jul 2007 | A1 |
20070180086 | Fang et al. | Aug 2007 | A1 |
20070186106 | Ting et al. | Aug 2007 | A1 |
20070209040 | Alstad | Sep 2007 | A1 |
20070214369 | Roberts et al. | Sep 2007 | A1 |
20070217425 | Mclaise et al. | Sep 2007 | A1 |
20070249323 | Lee et al. | Oct 2007 | A1 |
20070250915 | Thibadeau | Oct 2007 | A1 |
20070276935 | Liu | Nov 2007 | A1 |
20070278291 | Rans et al. | Dec 2007 | A1 |
20070282951 | Selimis et al. | Dec 2007 | A1 |
20070283145 | Gressel et al. | Dec 2007 | A1 |
20080010674 | Lee | Jan 2008 | A1 |
20080016370 | Libin et al. | Jan 2008 | A1 |
20080095339 | Elliott et al. | Apr 2008 | A1 |
20080133391 | Kurian et al. | Jun 2008 | A1 |
20080204429 | Silverbrook et al. | Aug 2008 | A1 |
20080257952 | Zandonadi | Oct 2008 | A1 |
20090013190 | Benhammou et al. | Jan 2009 | A1 |
20090028118 | Gray | Jan 2009 | A1 |
20090115573 | Naressi et al. | May 2009 | A1 |
20090157700 | Van Vugt | Jun 2009 | A1 |
20100077091 | Sarkar et al. | Mar 2010 | A1 |
20110264926 | Guthery | Oct 2011 | A1 |
Number | Date | Country |
---|---|---|
0668579 | Aug 1995 | EP |
1724684 | May 2005 | EP |
1705941 | Sep 2006 | EP |
1895445 | Mar 2008 | EP |
2358500 | Jul 2001 | GB |
WO 9852136 | Nov 1998 | WO |
WO 2005078465 | Aug 2005 | WO |
WO 2006013162 | Feb 2006 | WO |
Entry |
---|
International Preliminary Report on Patentability for Intrnational (PCT) Patent Application No. PCT/US2010/027320, mailed Sep. 22, 2011 7 pages. |
“RFC 1661: The Point-to-Point Protocol (PPP),” Network Working Group (W. Simpson, ed.), Jul. 1994, pp. 1-52. |
“RFC 707: A High-Level Framework for Network-Based Resource Sharing,” Network Working Group, Jan. 1976, pp. 1-28. |
Aboba, B. et al., “RFC 3748, Extensible Authentication Protocol,” Network Working Group (H. Levkowetz, ed.), Jun. 2004, pp. 1-67. |
Arkko, J. et al., “RFC 4187: Extensible Authentication Protocol Method for 3rd Generation Authentication and Key Agreement (EAP-AKA),” Network Working Group, Jan. 2006, pp. 1-79. |
Benaloh, J. et al., “Generalized Secret Sharing and Monotone Functions,” Advances in Cryptology—CRYPTO '88, Santa Barbara, CA (S. Goldwasser ed., Aug. 1988); Lecture Notes in Computer Science, vol. 403 (G. Goos and J. Hartmanis, eds. 1990), pp. 27-35. |
Blumenthal, U. et al., “RFC 3826: The Advanced Encryption Standard (AES) Cipher Algorithm in the SNMP User-based Security Model,” Network Working Group, Dec. 2002, pp. 1-16. |
Blumenthal, U. et al., “Standard 62—RFC 3414: User-based Security Model (USM) for Version 3 of the Simple Network Management Protocol (SNMPv3),” Network Working Group, Dec. 2002, available at www.ietf.org/rfc/rfc3414.txt, pp. 1-88. |
Bormann, C. et al., “RFC 3095: RObust Header Compression (ROHC): Framework and Four Profiles: RTP, UDP, ESP, and Uncompressed,” Network Working Group, Jul. 2001, available at www.ietf.org/rfc/rfc3095.txt, pp. 1-168. |
Case, J. et al., “Standard 62—RFC 3412: Message Processing and Dispatching for the Simple Network Management Protocol (SNMP),” Network Working Group, Dec. 2002, available at www.ietf.org/rfc/rfc3412.txt, pp. 1-43. |
Casner, S. et al., “RFC 2508: Compressing IP/UDP/RTP Headers for Low-Speed Serial Links,” Network Working Group, Feb. 1999, pp. 1-24. |
Chiu, A., “RFC 2695: Authentication Mechanisms for ONC RPC,” Network Working Group, Sep. 1999, pp. 1-18. |
Degermark, M., ed., “RFC 3096: Requirements for Robust IP/UDP/RTP Header Compression,” Network Working Group, Jul. 2001, pp. 1-8. |
Eisler, M., ed., “RFC 4506: XDR: External Data Representation Standard,” replaced RFC 1832, Network Working Group, May 2006, pp. 1-27. |
Finking, R. et al., “RFC 4997: Formal Notation for RObust Header Compression (ROHC-FN),” Network Working Group, Jul. 2007, pp. 1-62. |
Geer, D.E. et al., “Threshold Cryptography for the Masses,” Sixth International Financial Cryptography Conference, Southampton, Bermuda, Mar. 2002, Revised Papers, Lecture Notes in Computer Science, vol. 2357 (2003), pp. 220-237. |
Guthery, S. et al., “IP and ARP over ISO 7816,” Internet Draft, Network Working Group, Jan. 2001, pp. 1-8. |
Guthery, S. et al., “IP/TCP/UDP Header Compression for ISO 7816 Links,” Internet Draft, Network Working Group, Jan. 2001, pp. 1-8. |
Guthery, S., “EchoNets, E-memes, and Extended Realities,” Dr. Dobb's Journal, Apr. 1, 1994, pp. 72-84, also available at http://www.drdobbs.com/architect/184409220. |
Guthery, S., “Wireless Relay Networks,” IEEE Network, vol. 11, No. 6, Nov.-Dec. 1997, pp. 46-51. |
Guthery, S.B., “Group Authentication Using the Naccache-Stern Public-Key Cryptosystem”, arXiv.org > cs > arXiv:cs/0307059 (2003), 7 pages. |
Harrington, D. et al., “Secure Shell Transport Model for SNMP,” Internet Draft, Network Working Group, Oct. 11, 2006, pp. 1-37. |
Harrington, D. et al., “Standard 62—RFC 3411: An Architecture for Describing Simple Network Management Protocol (SNMP) Management Frameworks,” Network Working Group, Dec. 2002, available at www.ietf.org/rfc/rfc3411.txt, pp. 1-64. |
Harrington, D. et al., “Transport Subsystem for the Simple Network Management Protocol (SNMP),” Internet Draft, Network Working Group, Dec. 13, 2006, pp. 1-34. |
Harrington, D., “Transport Security Model for SNMP,” Internet Draft, Network Working Group, Oct. 11, 2006, pp. 1-34. |
Housley, R. et al. “RFC 4334: Certificate Extensions and Attributes Supporting Authentication in Point-to-Point Protocol (PPP) and Wireless Local Area Networks (WLAN),” Network Working Group, Feb. 2006, pp. 1-11. |
Jonsson, L-E. et al., RFC 4815: RObust Header Compression (ROHC): Corrections and Clarifications to RFC 3095, Network Working Group, Feb. 2007, pp. 1-33. |
Jonsson, L-E. et al., “RFC 4995: The Robust Header Compression (ROHC) Framework,” Network Working Group, Jul. 2007, pp. 1-40. |
Jonsson, L-E., “RFC 3759: RObust Header Compression (ROHC): Terminology and Channel Mapping Examples,” Network Working Group, Apr. 2004, pp. 1-20. |
Koren, T. et al., “RFC 3544: IP Header Compression over PPP,” Network Working Group, Jul. 2003, pp. 1-14. |
Larzon, L-A. et al. “RFC 3828: The Lightweight User Datagram Protocol (UDP-Lite),” Network Working Group, Sep. 2006, pp. 1-12. |
Leach, P. et al., “RFC 4122: A Universally Unique IDentifier (UUID) URN Namespace,” Network Working Group, Jul. 2005, pp. 1-32. |
Levi, D. et al., “Standard 62—RFC 3413: Simple Network Management Protocol (SNMP) Application,” Network Working Group, Dec. 2002, available at www.ietf.org/rfc/rfc3413.txt, pp. 1-74. |
McCloghrie, K. et al., eds., “RFC 2579: Textual Conventions for SMIv2,” Network Working Group, Apr. 1999, pp. 1-26. |
McCloghrie, K. et al., eds., “RFC 2580: Conformance Statements for SMIv2,” Network Working Group, Apr. 1999, pp. 1-29. |
McCloghrie, K., ed., “Standard 58—RFC 2578: Structure of Management Information Version 2 (SMIv2),” Network Working Group, Apr. 1999, pp. 1-43. |
Naccache et al., “A New Public-Key Cryptosystem,” published in W. Fumy, Ed., Advances in Cryptology—EUROCRYPT '97, vol. 1233 of Lecture Notes in Computer Science, pp. 27-36, Springer-Verlag, 1997. |
Neuman, C. et al., “RFC 4120: The Kerberos Network Authentication Service (V5),” Network Working Group, Jul. 2005, pp. 1-138. |
Pelletier, G., “RFC 4019: RObust Header Compression (ROHC): Profiles for User Datagram Protocol (UDP) Lite,” Network Working Group, Apr. 2005, pp. 1-23. |
Prafullchandra, H., “RFC 2875: Diffie-Hellman Proof-of-Possession Algorithms,” Network Working Group, Jul. 2000, pp. 1-23. |
Presuhn, R., ed., “Standard 62—RFC 3416: Version 2 of the Protocol Operations for the Simple Network Management Protocol (SNMP),” Network Working Group, Dec. 2002, pp. 1-31. |
Presuhn, R., ed., “Standard 62—RFC 3417: Transport Mappings for the Simple Network Management Protocol (SNMP),” Network Working Group, Dec. 2002, pp. 1-19. |
Presuhn, R., ed., Standard 62—RFC 3418: Management Information Base (MIB) for the Simple Network Management Protocol (SNMP), Network Working Group, Dec. 2002, pp. 1-26. |
Rescorla, E., “RFC 2631: Diffie-Hellman Key Agreement Method,” Network Working Group, Jun. 1999, pp. 1-13. |
Shamir, “How to Share a Secret,” Communications for the ACM, Nov. 1979, pp. 612-613. |
Simpson, W., “RFC 1994: PPP Challenge Handshake Authentication Protocol (CHAP),” Network Working Group, Aug. 1996, pp. 1-12. |
Simpson, W., ed., “RFC 1662: PPP in HDLC-like Framing,” Network Working Group, Jul. 1994, pp. 1-25. |
Srinivasan, R. et al., “RFC 1831: RPC: Remote Procedure Call Protocol Specification Version 2,” Network Working Group, Aug. 1995, pp. 1-18. |
Vanderveen, M. et al., RFC 4763: Extensible Authentication Protocol Method for Shared-secret Authentication and Key Establishment (EAP-SAKE), Network Working Group, Nov. 2006, pp. 1-46. |
Vollbrecht, J. et al., “RFC 4137: State Machines for Extensible Authentication Protocol (EAP) Peer and Authenticator,” Network Working Group, Aug. 2005, pp. 1-51. |
Wijnen, B. et al., “Standard 62—RFC 3415: View-based Access Control Model (VACM) for the Simple Network Management Protocol (SNMP),” Network Working Group, Dec. 2002, available at www.ietf.org/rfc/rfc3415.txt, pp. 1-39. |
ISO/IEC 8825-1, “Information technology—ASN.1 encoding rules: Specification of Basic Encoding Rules (BER), Canonical Encoding Rules (CER) and Distinguished Encoding Rules (DER),” 2008. |
Wieringa, R. et al., “The identification of objects and roles,” Technical Report IR-267, Faculty of Mathematics and Computer Science, Vrije Universiteit, Amsterdam, 1991, pp. 1-15. |
International Search Report for International (PCT) Patent Application No. PCT/US10/27320, mailed May 11, 2010. |
Written Opinion for International (PCT) Patent Application No. PCT/US10/27320, mailed May 11, 2010. |
Extended Search Report for European Patent Application No. 10751539.7, dated Sep. 17, 2012 11 pages. |
Zhang et al. “Plugging a Scalable Authentication Framework into Shibboleth,” Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (WETICE '05, Jun. 2005, pp. 271-276. |
Number | Date | Country | |
---|---|---|---|
20100235622 A1 | Sep 2010 | US |
Number | Date | Country | |
---|---|---|---|
61160187 | Mar 2009 | US |