|Publication number||US7669233 B2|
|Application number||US 11/067,306|
|Publication date||Feb 23, 2010|
|Filing date||Feb 25, 2005|
|Priority date||Sep 10, 1999|
|Also published as||CA2557663A1, EP1730866A2, EP1730866A4, US20050228755, WO2005084293A2, WO2005084293A3|
|Publication number||067306, 11067306, US 7669233 B2, US 7669233B2, US-B2-7669233, US7669233 B2, US7669233B2|
|Inventors||David Grace, Paul Turgeon|
|Original Assignee||Metavante Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (49), Referenced by (4), Classifications (17), Legal Events (5)|
|External Links: USPTO, USPTO Assignment, Espacenet|
This application is a nonprovisional of, and claims the benefit of the filing date of, U.S. Provisional Patent Appl. No. 60/548,824, entitled “METHODS AND SYSTEMS FOR SECURE TRANSMISSION OF IDENTIFICATION INFORMATION OVER PUBLIC NETWORKS,” filed Feb. 27, 2004 by David Grace and Paul Turgeon, the entire disclosure of which is incorporated by reference for all purposes.
This application is a continuation-in-part application of U.S. patent application Ser. No. 10/086,793, entitled “SYSTEM AND METHOD FOR PERFORMING SECURE REMOTE REAL-TIME FINANCIAL TRANSACTIONS OVER A PUBLIC COMMUNICATIONS INFRASTRUCTURE WITH STRONG AUTHENTICATION,” filed Mar. 1, 2002 by Paul Turgeon, which is a continuation-in-part application of U.S. patent application Ser. No. 09/394,143, entitled “SYSTEM AND METHOD FOR PROVIDING SECURE SERVICES OVER PUBLIC AND PRIVATE NETWORKS USING A REMOVABLE, PORTABLE COMPUTER-READABLE STORAGE MEDIUM AT A NETWORK ACCESS DEVICE,” filed Sep. 10, 1999 by Paul Turgeon, the entire disclosures of both of which are incorporated herein by reference in their entireties for all purposes.
This application relates generally to information security. More specifically, this application relates to methods and systems for secure transmission of identification information over public networks.
There are numerous instances in which parties may wish to access a host system over a public network. In many instances, the host system is configured with security protocols to limit access to legitimate parties, and such security protocols typically rely on the receipt and verification of identification information. For example, the identification information might comprise a combination of a user identifier and a secret password, with access to the host system being granted only upon presentation by the user of both pieces of the identification information. While the ability for parties to access a host system over a public network presents numerous conveniences, it also presents a danger that the security of the identification information might be comprised as a result of interception by an eavesdropper.
A basic arrangement that is currently commonly used in connecting parties to a host system over a public network is illustrated in
Such a security protocol 116 thus aids in preventing a hostile party from attempting to guess a legitimate party's password, but is less effective when the identification information may be intercepted by an eavesdropper 120. The danger of interception by eavesdroppers 120 has, moreover, been increasing as public networks are more widely used. Rather than remember multiple different passwords, parties 104 frequently use the same password to access multiple different host systems 112. If an eavesdropper intercepts a transmission from a particular party 104 for any host system 112, he may obtain information to gain access to multiple host systems 112.
One technique that has been used to compensate for such possibilities is to provide an intermediate system that maintains a record of identification information for multiple host systems 112 on behalf of a party, and requiring only a single password for that party 104. When the party wishes to access a certain host system 112, the transmission is routed through the intermediate system, which detects whether the single password is correct, transmitting the appropriate host password only if it is. Such a technique protects the host system 112 from potential fraud by truncating the transmission when an incorrect password is provided.
One disadvantage of such an arrangement, however, is that this technique also circumvents the security protocol 116 that may exist at the host system 112. This is true of all arrangements that use truncation of transmission to the host system 112 as part of fraud prevention. Circumvention of the host system's security protocol 116 thus deprives that protocol of information that may be useful in analyzing patterns of attempted security breaches. Furthermore, it is generally undesirable to implement the host system's security protocol 116 at the intermediate system. Not only would such implementation require duplication of the significant investment already made by multiple host systems 112, but it would also remove control of the security protocol from the host systems 112. This is particularly disadvantageous since the security protocols for each host system 112 frequently reflect security concerns specific to that host system 112 and may benefit from periodic revision as those particular security concerns change.
There is accordingly a general need in the art for improved methods and systems for secure transmission of identification information over public networks.
Embodiments of the invention provide methods and systems that permit secure transmission of identification information over public networks. The identification information includes a party static token and a party dynamic token, which are tokens provided by a party when access to a host system is desired. The combination of the party static token and the party dynamic token are used to generate a host static token and a host dynamic token, which are used by the host system to confirm the party's identity. In the event that a party supplies an incorrect party dynamic token, the methods and systems result in the host system being supplied with an incorrect host dynamic token so that security protocols implemented by the host system may still be used.
In one set of embodiments, a method is provided for generating a party static token to be used in combination with a party dynamic token for identifying a party to a host system. Identification information that identifies the party to the host system is received. Such identification information comprises a host dynamic token and a host static token. A false host dynamic token that differs from the host dynamic token is generated. The host dynamic token and the false host dynamic token are encrypted. In addition, information that uniquely identifies the party dynamic token is encrypted. The party static token is produced from a combination of the encrypted host dynamic token, the encrypted false host dynamic token, and the encrypted information that uniquely identifies the party dynamic token.
In one such embodiment, the party static token may be produced by encrypting the combination of the encrypted host dynamic token, the encrypted false host dynamic token, and the encrypted information that uniquely identifies the party dynamic token. Each of the encrypting steps may be performed with a symmetric-key encryption algorithm, and in some instances each of the encrypting steps may be performed with a different key. In one embodiment, encrypting the host dynamic token and encrypting the false host dynamic token are performed with the same key.
In another embodiment, the information that uniquely identifies the party dynamic token comprises a seed value and a complement to the party dynamic token. In such instances, the method may further comprise determining the complement to the party dynamic token from the seed value and the party dynamic token. For example, the seed value may be encrypted, and a portion of the encrypted seed value having a predetermined length may be selected to produce a natural party dynamic token. A different between the natural party dynamic token and the party dynamic token is calculated. The seed value could be generated randomly. In some instances, the party dynamic token may be received from the host system, while in other instances the party dynamic token may be generated randomly.
In another set of embodiments, a method is provided for transmitting party-identification information to a host system. A party static token and a purported party dynamic token are received from a party. The party static token is decrypted to extract an encrypted host dynamic token, an encrypted false host dynamic token, a host static token, and encrypted information that uniquely identifies a party dynamic token. The host static token and host dynamic token identify the party to the host system, and the false host dynamic token differs from the host dynamic token. The party dynamic token is generated from the encrypted information that uniquely identifies the party dynamic token. A decrypted one of the host dynamic token and false host dynamic token is transmitted with the host static token to the host system depending on a comparison of the party dynamic token and purported party dynamic token. In some such embodiments, the one of the host dynamic token and false host dynamic token may be decrypted depending on the comparison of the party dynamic token and purported party dynamic token.
In some instances, the party static token and purported party dynamic token may be received over a public network from a public-network access device accessed by the party. In other instances, the party static token and purported party dynamic token may be received over a public network from an intermediary system accessed by the party with a public-network access device.
The party dynamic token may be generated by decrypting the encrypted information that uniquely identifies the party dynamic token to extract a seed value and a complement to the party dynamic token. The party dynamic token is then generated from the seed value and the complement. For example, the seed value may be encrypted and a portion of the encrypted seed value having a predetermined length may be selected to produce a natural party dynamic token. A different between the natural party dynamic token and the complement may then be calculated. Each of the decrypting steps may be performed with a symmetric-key decryption algorithm and, in some instances, each of the decrypting steps may be performed with a different key.
The methods of the present invention may be embodied in computer-readable storage media having a computer-readable program embodied therein for directing operation of a token preparer (to generate the party static token) or of a public-network intercept (to transmit party-identification information to the host system). Such devices may each include a communications system, a processor, and a storage device. The computer-readable programs include instructions for operating the respective devices to in accordance with the embodiments described above.
In a further set of embodiments, a computer-readable storage medium may be provided with a data structure comprising a plurality of fields. A first field contains data representing an encrypted host dynamic token. A second field contains data representing an encrypted false host dynamic token, with the false host dynamic token differing from the host dynamic token. A third field contains data representing a host static token, where a pairing of the host static token and host dynamic token provide information identifying a party to a host system and a pairing of the host static token and false host dynamic token do not provide information identifying the party to the host system. A fourth field contains data that uniquely identify a party dynamic token that identifies the party when paired with the data structure.
In some instances, the first, second, third, and fourth fields may be commonly encrypted with a first symmetric key encryption algorithm. In one such instance the host dynamic token and false dynamic token are encrypted with a common second symmetric-key algorithm. In other instances, the third field may comprise a first subfield containing data representing a seed value and a second subfield containing data representing a party dynamic token complement; the host dynamic token is equal to a result of applying a predetermined algorithm to the seed value, the party dynamic token complement, and the party dynamic complement. In one embodiment, the data contained by the third field are encrypted with a first symmetric-key algorithm that differs from a second symmetric-key algorithm under which the host dynamic token and false host dynamic token are commonly encrypted.
A further understanding of the nature and advantages of the present invention may be realized by reference to the remaining portions of the specification and the drawings wherein like reference numerals are used throughout the several drawings to refer to similar components. In some instances, a sublabel is associated with a reference numeral and follows a hyphen to denote one of multiple similar components. When reference is made to a reference numeral without specification to an existing sublabel, it is intended to refer to all such multiple similar components.
Embodiments of the invention enable connections to be established between a party and a host system over a public network by providing for secure transmission of identification information over the public network. As used herein, a “public network” is intended to refer to a network that permits access to a group of parties that belong to a common community. For example, in some embodiments, the public network could correspond to a network such as the Internet, in which the common community essentially includes the entire world. In other instances, though, the common community could be more restrictive, such as corresponding to an academic community at a university, with the public network being the network accessible to the members of that academic community.
There are a variety of specific applications in which connections to a public network may be used. For example, in the specific case where the public network comprises the Internet, the host system could be any system that a party might wish to access securely. For instance, the host system could administer a financial web site where a party might manage funds that are in one or more accounts, such as a mutual-fund web site, a bank web site, and the like. In another embodiment, the host system could provide restricted access to publication material to parties who have paid for access. In a further embodiment, the host system could be a computer system of an employer of a party so that files, programs, and the like could be accessed by the party employee remotely.
It is emphasized that these examples are merely illustrative and that there are many more examples of host systems that are within the scope of the invention and intended to permit restricted access to parties over a public network. Many such additional examples will be evident to those of skill in the art. Furthermore, while the above examples are drawn in connection with the Internet, further applications exist with other examples of public networks.
In some instances, the identification information may pass through an intermediary system before it reaches the public-network intercept 212 or host system 112, which increases the risk of interception of the identification information by an eavesdropper 120. For example, in the context of electronic commerce, the host system 112 could correspond to a bank system managing an account that holds funds belonging to the party and the intermediary system could correspond to a system managing a merchant's sales web site. In order to make a purchase, the party 104 might access a web site managed by the intermediary system 216 over the public network to search for goods and make a selection to be purchased. An interface provided by the intermediary system 216 might then permit the party to identify the host system 112 where funds for the transaction could be sought, together with the party's identification information. Upon receipt of acceptable identification information and authorization from the party to provide the specified funds to the merchant, the host system 112 may arrange for transfer of the funds to the control of the merchant.
The architecture shown in
As used herein, “tokens” refer generically to identification information that is used in gaining access to a secure host system. The identification information has at least two components, one of which is a “static token,” and the other of which is a “dynamic token.” The static token is a generally fixed identifier that corresponds uniquely to the party 104, or in some instances to a related group of parties. For example, in one embodiment, the static token could comprise a user identification, commonly referred to in the art as a “userid.” Each distinct userid could identify a distinct party, although is some instances multiple parties might sometimes share a common userid such as where a project team might establish a userid for accessing materials related to a project, such as where members of a family share a common family userid, and the like. The dynamic token is associated with the static token, with that association being used to confirm the validity of the combination in providing access to the host system 112. For example, in the case where the static token is a userid, the associated dynamic token could be a password. In some instances, particularly in cases where a single static token is used to identify a related group of parties, a plurality of dynamic tokens could be associated with each static token, perhaps with each associated dynamic token identifying one of the parties. For example, a common userid could have several valid passwords associated with it, each of which is known to only one of a group of parties and therefore identifies that party from the group. In other embodiments, such as in the context where the host system is a financial host system, the static token could correspond to a primary account number (“PAN”), with the dynamic token corresponding to a personal identification number (“PIN”). In still other embodiments, the static and dynamic tokens may take still other forms.
Embodiments of the invention permit different static and dynamic tokens to be used by the host system 112 and by the party 104. The examples provided above, in the form of userid/password, PAN/PIN, and the like, are typical examples of a host static and dynamic tokens that may be used by existing host systems 112 in identifying parties 104. According to embodiments of the invention, the party 104 is assigned different static and dynamic tokens by the token preparer 208, which incorporate the host's static and dynamic tokens, but permit them to be transmitted securely over the public network. The public-network intercept may extract the host static and dynamic tokens from the party static and dynamic tokens after their transmission through the public network 108 for presentation and authentication by the host system 112.
Thus, as illustrated in
The flow diagram of
At block 308, the token preparer 208 generates a false host dynamic token 404. The false host dynamic token 404 may generally take the form of any token that is not identical with the host dynamic token 244 so that presentation of the false host dynamic token 404 in combination with the host static token 240 to the host system 112 will result in a denial of access. It may be convenient, however, for the false dynamic token 404 to be generated with approximately the same format as the host dynamic token 244 in some embodiments. Furthermore, presentation of such a combination is intended to prompt implementation of any security protocol 116 included with the host system 112 so that the benefits of recording false attempts at access in accordance with that security protocol 116 will be maintained.
The preparation of the party static token includes a number of encryption techniques performed with one or more symmetric-key encryption algorithms. Such symmetric-key algorithms are such that one of the encryption key and decryption key may be calculated from the other; in many such algorithms, the encryption and decryption keys are simply the same. Symmetric-key algorithms include stream ciphers, in which plaintext is converted to ciphertext one bit (or byte) at a time, and block ciphers, which operate on blocks of plaintext. Many examples of such symmetric-key algorithms are well know to those of skill in the art and include, merely by way of example, the Data Encryption Standard (“DES”), the triple Data Encryption Algorithm (“3DEA”), and the Advanced Encryption Standard (“AES”), among others.
At block 312, a symmetric-key algorithm using first keys designated “A” is used by the token preparer 208 to encrypt the host dynamic token 244. Similarly, at block 316 the false host dynamic token 404 is also encrypted with a symmetric-key algorithm, which may conveniently use the same keys “A.” If no party dynamic token 252 was provided by the host system 112 at block 304, one may be generated by the token preparer 208 at block 320. Such generation may be performed in concert with the party 104, such as by using a party dynamic token 252 requested by the party 104, or may be performed randomly by the token preparer 208, perhaps in conformity with formatting requirements specified by the host system 112 and/or party 104.
At block 328, the token preparer 208 generates a “natural” party dynamic token. This token is referred to as the “natural” party dynamic token because it is determined in accordance with a specified algorithm from a specific seed value 412, which may be generated randomly. In one embodiment, the specified algorithm may comprise a symmetric-key algorithm using second keys designated “B.” This algorithm is applied to the random seed value 412, with all or a specific portion of the result being extracted to define the natural party dynamic token. A mapping between the natural party dynamic token and the party dynamic token 252 is defined at block 332 by determining a party dynamic token complement 408 from the party dynamic token 252 and the natural party dynamic token. Determining a complement may be performed in any mathematically unique way. For example, if the party dynamic token and natural party dynamic token are both 6-digit numbers, the complement could be defined as the difference between them. A similar complement could be defined for alphabetic or alphanumeric tokens. Also, while such difference calculations are conveniently simple, alternative embodiments could use more complicated complement definitions.
The combination of the party dynamic token complement 408 and the random seed value 412 are encrypted at block 336 using a symmetric-key algorithm with third keys designated “C.” The combination of the party dynamic token complement 408 and the random seed 412 could be a simple concatenation of those two quantities or could be a more complicated combination in different embodiments.
The party static token 248 is generated at block 340 by encrypting a combination of the encrypted result from block 336, the encrypted host dynamic token 244, the encrypted false host dynamic token 404, and the host static token 240. This combination, which may be formed by a simple concatenation of the quantities or by a more complicated combination, is encrypted using a symmetric-key algorithm with fourth keys designated “D.”
At this point, the token preparer 208 has both the party static token 248 and the party dynamic token 252, which may thus be provided to the party 104 at block 344. To provide enhanced security, each of these tokens will usually be provided to the party 104 in a different fashion. For example, the party static token 248 could be downloaded to the party 104 through the public network 108 and public-network access device 204 while the party dynamic token is provided separately by electronic mail, by postal mail, or the like. Typically, the party static token 248 will be stored locally to the party 104 on a computer-readable storage medium, which could be portable as in the case of a CD-ROM or similar data store or could be fixed as in the case of a hard drive of a computer.
As noted in the above description, various encryptions are performed by the token preparer 208 in preparing the party static token 248. In some embodiments, the same encryption algorithm may be used for each encryption; in such instances, it is possible even to use the same keys for each encryption, although improved security is provided when different keys are used in the manner described. In other embodiments, different encryption algorithms could be used for the different encryptions, with, say, a DES algorithm being used for one of the encryptions, an AES algorithm being used for another of the encryptions, and still other symmetric-key encryption algorithms being used for the remainder of the encryptions.
Example The generation of the party tokens in accordance with
and at block 316, the false dynamic token is encrypted with first symmetric keys “A” to produce
At block 320, the token preparer 208 generates the party dynamic token randomly to produce DP=2468. At block 324, a random seed value is generated by the token preparer 208 to produce S=629663. Generation of the natural party dynamic token at 328 may be performed by encrypting the seed S with second symmetric keys “B” and extracting the four digits at the 3rd-6th most significant positions:
so that DP (nat)=8255. The party dynamic token complement determined at block 332 may take the form of a difference between DP and DP (nat) so that the complement is
C P =D P (nat) −D P=8255−2468=5787.
Encryption of the combination of the seed value S and the party dynamic token complement CP may produce
E C [S⊕C P ]=E C[629663⊕5787]
when the combination is produced by concatenation. Formation of the party static token SP at block 340 may then proceed by combining the identified quantities and encrypting the combination with fourth keys “D”:
S P =E D [E A [D H ]⊕E A [
The data structure of the party static token 248 after its generation with the method described in connection with
The structure of the tokens in embodiments of the invention includes information for which efforts are taken to maintain secrecy of the information, as well as information which is considered to be “clear” and for which no significant secrecy efforts are made. The following table provides a comparison of such secrecy protocols for an exemplary prior-art structure and for the tokens of the invention. In particular, the exemplary prior-art structure corresponds to the PAN/PIN structure discussed previously and commonly used in financial applications. The PAN identifies a financial account and is a prior-art example of a static token, while the customer PIN is a private code used by a customer to access the financial account and is a prior-art example of a dynamic token. In such an example, the “PIN offset” is a complement that is used to map a natural PIN to the customer PIN.
Prior Art Current Information Secrecy Status Information Secrecy Status PAN Clear Random Seed Value Secret Customer PIN Secret Party Dynamic Clear Token Natural PIN Private Natural Party Private Dynamic Token PIN Offset Clear Party Dynamic Secret Token Complement Encryption Keys Private Encryption Keys Private
The table illustrates that while the prior-art customer PIN, i.e. a prior-art example of a dynamic token, is maintained as secret, embodiments of the invention instead permit the party dynamic token to be treated in the clear. This treatment of the party dynamic token thus represents a significant departure from the way in which security of identification information has traditionally been handled.
In a case where the access is achieved with an intermediary system 216, the party 104 connects to the intermediary system with a public-network access device 204 at block 552. An example of an intermediary system discussed above was made in the context of electronic commerce, although the discussion herein applies generally to any arrangement in which the party's identification information might pass through an intermediary system. At block 556, the party 104 indicates to the intermediary system 216 a desire to access the host system 112. For example, in the context of electronic commerce, such an indication may take the form of providing financial information after the party 104 has decided to make a purchase from the intermediary. At blocks 560 and 564, the party provides the party static token 248 and the party dynamic token 252 to the intermediary system 216. This may be done in a fashion similar to that described with respect to providing such party tokens directly to the public-network intercept, i.e. by downloading the static party token 248 from a local data store and entering the dynamic party token 252 from the party's memory over an interface. At block 568, the intermediary system 216 provides the party tokens 248 and 252 to the public-network intercept 212.
Irrespective of whether the transmission occurs directly, as for blocks 504-516, or indirectly, as for blocks 552-568, the public-network intercept 112 is provided with both the static and dynamic party tokens 248 and 252. The component elements of the party static token 248 are extracted by the public-network intercept 212 at block 520 by decrypting the static party token 248 with the fourth symmetric keys “D.” The component element that includes the party dynamic token complement 408 and seed value 412 is decrypted at block 524 using the third symmetric keys “C” to extract those components. At block 528, the decrypted seed value 412 is used to generate a natural party dynamic token in the same fashion that was described in connection with block 328 of
A match of the result with the party dynamic token 252 confirms the identity of the party 104. In response, the public-network intercept 212 decrypts the host dynamic token 244 with the first symmetric keys “A” at block 540. The decrypted host dynamic token 244 is then transmitted with the host static token 240, which was recovered at block 520, to the host system 112. If the result from block 532 instead fails to match the party dynamic token 252 when checked at block 536, the public-network intercept 212 decrypts the false host dynamic token 404 with the first symmetric keys “A” at block 572. This decrypted false host dynamic token 404 is then transmitted to the host system 112 with the host static token 240 at block 576.
The host system 112 remains free to conduct its own validation of the identification information that it receives, thereby permitting full use of its security protocol 116, including the ability to respond to repeated unsuccessful attempts at access. Thus, the host system 112 attempts to validate the data that it receives at block 580, such as by comparing the host dynamic token with a value that it expects to be associated with the host static token that it receives. If the data are validated, as is expected in the case where the check performed at block 536 confirmed the identity of the party 104, a secure connection may be established between the party 104 and the host system 112 at block 548. If the data are not validated, such a connection may be denied at block 584, and the connection attempt may be logged by the host system 112 in accordance with its security protocol 116.
Example The extraction of identification information and its use in establishing or denying a connection between the party 104 and the host system 112 as outlined in
At block 524, the combination of the seed value S and party dynamic token complement CP is identified with the appropriate element and decrypted with the third symmetric keys “C” to identify the individual elements:
The seed value S is used at block 528 to generate the natural party dynamic token DP (nat) using the algorithm that includes encryption with the second symmetric keys “B” and extraction of specific resulting digits:
so that, as before, DP (nat)=8255. Combining the natural party dynamic token DP (nat) and the party dynamic token complement CP at block 532 provides a result R that may be compared with the party dynamic token DP at block 536:
In this instance, the result matches the party dynamic token, R=DP, so that the host dynamic token is decrypted at block 540:
The host static token SH=SMITH and host dynamic token DH=1234 are provided to the host system at block 544 so that the host system validates the received data. If the result R had not matched the party dynamic token, R≠DP, because the incorrect party dynamic token was supplied, the false host dynamic token would be decrypted at block 572,
and provided to the host system with the host static token SH=SMITH at block 576. The host system would thus deny establishing a connection and would log the attempt in accordance with its security protocols.
The description of the methods in connection with
The public-network intercept 212 also comprises software elements, shown as being currently located within working memory 620, including an operating system 624 and other code 622, such as a program designed to implement methods of the invention. It will be apparent to those skilled in the art that substantial variations may be made in accordance with specific requirements. For example, customized hardware might also be used and/or particular elements might be implemented in hardware, software (including portable software, such as applets), or both. Further, connection to other computing devices such as network input/output devices may be employed.
Having described several embodiments, it will be recognized by those of skill in the art that various modifications, alternative constructions, and equivalents may be used without departing from the spirit of the invention. Accordingly, the above description should not be taken as limiting the scope of the invention, which is defined in the following claims.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4259720||Jan 9, 1978||Mar 31, 1981||Interbank Card Association||Security system for electronic funds transfer system|
|US4827508||Oct 14, 1986||May 2, 1989||Personal Library Software, Inc.||Database usage metering and protection system and method|
|US4906828||May 31, 1988||Mar 6, 1990||Paperless Accounting, Inc.||Electronic money purse and fund transfer system|
|US5220501||Dec 8, 1989||Jun 15, 1993||Online Resources, Ltd.||Method and system for remote delivery of retail banking services|
|US5323146 *||Mar 20, 1991||Jun 21, 1994||Siemens Nixdorf Informationssysteme Ag||Method for authenticating the user of a data station connected to a computer system|
|US5371797||Jan 19, 1993||Dec 6, 1994||Bellsouth Corporation||Secure electronic funds transfer from telephone or unsecured terminal|
|US5453601||Nov 15, 1991||Sep 26, 1995||Citibank, N.A.||Electronic-monetary system|
|US5457746||Dec 19, 1994||Oct 10, 1995||Spyrus, Inc.||System and method for access control for portable data storage media|
|US5539828||May 31, 1994||Jul 23, 1996||Intel Corporation||Apparatus and method for providing secured communications|
|US5590197||Apr 4, 1995||Dec 31, 1996||V-One Corporation||Electronic payment system and method|
|US5623547||Mar 6, 1995||Apr 22, 1997||Jonhig Limited||Value transfer system|
|US5677953||Jun 7, 1995||Oct 14, 1997||Spyrus, Inc.||System and method for access control for portable data storage media|
|US5734823||Jul 25, 1996||Mar 31, 1998||Microtome, Inc.||Systems and apparatus for electronic communication and storage of information|
|US5771291||Dec 11, 1995||Jun 23, 1998||Newton; Farrell||User identification and authentication system using ultra long identification keys and ultra large databases of identification keys for secure remote terminal access to a host computer|
|US5850446||Jun 17, 1996||Dec 15, 1998||Verifone, Inc.||System, method and article of manufacture for virtual point of sale processing utilizing an extensible, flexible architecture|
|US5870724||Jun 6, 1995||Feb 9, 1999||Online Resources & Communications Corporation||Targeting advertising in a home retail banking delivery service|
|US5872917 *||Oct 8, 1997||Feb 16, 1999||America Online, Inc.||Authentication using random challenges|
|US5889863||Jun 17, 1996||Mar 30, 1999||Verifone, Inc.||System, method and article of manufacture for remote virtual point of sale processing utilizing a multichannel, extensible, flexible architecture|
|US5892900||Aug 30, 1996||Apr 6, 1999||Intertrust Technologies Corp.||Systems and methods for secure transaction management and electronic rights protection|
|US5903881||Jun 5, 1997||May 11, 1999||Intuit, Inc.||Personal online banking with integrated online statement and checkbook user interface|
|US5913202||Jun 13, 1997||Jun 15, 1999||Fujitsu Limited||Financial information intermediary system|
|US5956483||Jun 28, 1996||Sep 21, 1999||Microsoft Corporation||System and method for making function calls from a web browser to a local application|
|US6065073||Aug 17, 1998||May 16, 2000||Jato Technologies, Inc.||Auto-polling unit for interrupt generation in a network interface device|
|US6073160||Dec 18, 1996||Jun 6, 2000||Xerox Corporation||Document communications controller|
|US6098053||Jan 26, 1999||Aug 1, 2000||Citibank, N.A.||System and method for performing an electronic financial transaction|
|US6173269||Apr 7, 1999||Jan 9, 2001||Zowi.Com, Inc||Method and apparatus for executing electronic commercial transactions with minors|
|US6182220 *||Mar 30, 1998||Jan 30, 2001||International Business Machines Corporation||System and method for building and exchanging encrypted passwords between a client and server|
|US6195357||Sep 24, 1996||Feb 27, 2001||Intervoice Limited Partnership||Interactive information transaction processing system with universal telephony gateway capabilities|
|US6505178||Dec 29, 1999||Jan 7, 2003||International Business Machines Corporation||Automatic teller machine with secure variable storage for internet applications|
|US6526489||Nov 14, 2000||Feb 25, 2003||Nec Corporation||Data storage apparatus with improved security process and partition allocation funds|
|US6553492||Feb 15, 2000||Apr 22, 2003||Toshiba Information Systems (Japan) Corporation||Client-server system, server access authentication method, memory medium stores server-access authentication programs, and issuance device which issues the memory medium contents|
|US6904526 *||Nov 14, 2000||Jun 7, 2005||Yang Hongwei||System and method of authenticating individuals|
|US7103912 *||Jun 29, 2001||Sep 5, 2006||International Business Machines Corporation||User authorization management system using a meta-password and method for same|
|US7228417 *||Nov 7, 2002||Jun 5, 2007||America Online, Inc.||Simple secure login with multiple-authentication providers|
|US7309004 *||Dec 26, 2003||Dec 18, 2007||Diebold Self-Service Systems, Division Of Diebold, Incorporated||Cash dispensing automated banking machine firmware authentication system and method|
|US7343014 *||Jul 15, 2003||Mar 11, 2008||Nokia Corporation||Method for sharing the authorization to use specific resources|
|US7451322 *||Oct 1, 2002||Nov 11, 2008||Samsung Electronics Co., Ltd.||User authentication method using password|
|US20020152180||Mar 1, 2002||Oct 17, 2002||Paul Turgeon||System and method for performing secure remote real-time financial transactions over a public communications infrastructure with strong authentication|
|US20020166048||Apr 30, 2002||Nov 7, 2002||Frank Coulier||Use and generation of a session key in a secure socket layer connection|
|US20030014371||Sep 10, 1999||Jan 16, 2003||Paul Charles Turgeon||System and method for providing secure services over public and private networks using a removable portable computer-readable storage|
|US20030093680 *||Nov 13, 2001||May 15, 2003||International Business Machines Corporation||Methods, apparatus and computer programs performing a mutual challenge-response authentication protocol using operating system capabilities|
|US20030204732||Apr 30, 2002||Oct 30, 2003||Yves Audebert||System and method for storage and retrieval of a cryptographic secret from a plurality of network enabled clients|
|US20030208684||Mar 7, 2001||Nov 6, 2003||Camacho Luz Maria||Method and apparatus for reducing on-line fraud using personal digital identification|
|US20040030932 *||Aug 9, 2002||Feb 12, 2004||Ari Juels||Cryptographic methods and apparatus for secure authentication|
|US20040062400 *||Jul 15, 2003||Apr 1, 2004||Nokia Corporation||Method for sharing the authorization to use specific resources|
|US20070180507||Sep 25, 2006||Aug 2, 2007||Feitian Technologies, Co., Ltd.||Information security device of universal serial bus human interface device class and data transmission method for same|
|US20070249324 *||Apr 18, 2007||Oct 25, 2007||Tyan-Shu Jou||Dynamic authentication in secured wireless networks|
|US20080034216 *||Aug 3, 2006||Feb 7, 2008||Eric Chun Wah Law||Mutual authentication and secure channel establishment between two parties using consecutive one-time passwords|
|US20090092255 *||Dec 19, 2008||Apr 9, 2009||Ruckus Wireless, Inc.||Dynamic Authentication in Secured Wireless Networks|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7765584 *||Dec 4, 2006||Jul 27, 2010||Aol Inc.||Simple, secure login with multiple authentication providers|
|US8196189 *||Jun 11, 2010||Jun 5, 2012||Aol Llc||Simple, secure login with multiple authentication providers|
|US20070169181 *||Dec 4, 2006||Jul 19, 2007||James Roskind||Simple, secure login with multiple authentication providers|
|US20100251347 *||Sep 30, 2010||Aol Inc.||Simple, secure login with multiple authentication providers|
|U.S. Classification||726/9, 726/20, 713/185|
|International Classification||H04L9/32, H04L29/06, G06F21/00, G06F15/16, H04K1/00|
|Cooperative Classification||H04L9/3234, H04L9/3226, H04L2209/56, G06Q20/4012, H04L63/0428, H04L63/08|
|European Classification||H04L63/04B, H04L63/08, G06Q20/4012|
|Aug 24, 2005||AS||Assignment|
Owner name: METAVANTE CORPORATION,WISCONSIN
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:GRACE, DAVID;REEL/FRAME:016447/0053
Effective date: 20050822
|Nov 21, 2005||AS||Assignment|
Owner name: METAVANTE CORPORATION,WISCONSIN
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:TURGEON, PAUL;REEL/FRAME:016805/0201
Effective date: 20050214
|Nov 7, 2007||AS||Assignment|
|Aug 16, 2010||AS||Assignment|
Owner name: METAVANTE CORPORATION, FLORIDA
Free format text: RELEASE OF SECURITY INTEREST;ASSIGNOR:JPMORGAN CHASE BANK, N.A.;REEL/FRAME:024842/0917
Effective date: 20100810
|Jul 24, 2013||FPAY||Fee payment|
Year of fee payment: 4