US20150254670A1 - Account transaction fraud detection - Google Patents

Account transaction fraud detection Download PDF

Info

Publication number
US20150254670A1
US20150254670A1 US14/717,863 US201514717863A US2015254670A1 US 20150254670 A1 US20150254670 A1 US 20150254670A1 US 201514717863 A US201514717863 A US 201514717863A US 2015254670 A1 US2015254670 A1 US 2015254670A1
Authority
US
United States
Prior art keywords
character
computer
transaction
data field
sensitive data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US14/717,863
Inventor
John F. Sheets
Kim Wagner
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to US14/717,863 priority Critical patent/US20150254670A1/en
Publication of US20150254670A1 publication Critical patent/US20150254670A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/38Payment protocols; Details thereof
    • G06Q20/40Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
    • G06Q20/401Transaction verification
    • G06Q20/4015Transaction verification using location information
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/38Payment protocols; Details thereof
    • G06Q20/40Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
    • G06Q20/401Transaction verification
    • G06Q20/4016Transaction verification involving fraud or risk level assessment in transaction processing
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/04Payment circuits
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/38Payment protocols; Details thereof
    • G06Q20/40Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
    • G06Q20/403Solvency checks
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q2220/00Business processing using cryptography
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees

Definitions

  • the present invention relates to a payment processing system for a plurality of transactions each characterized by a merchant and an account holder engaging in the transaction upon an account that an issuer issues to the account holder, wherein a transaction handler processes the transaction for both the merchant and processes other transactions for other merchants, each merchant submitting the corresponding transaction to its acquirer for processing by the transaction handler who requests the issuer of the corresponding account to obtain payment for the corresponding transaction from the corresponding account and for which the issuer forwards the payment to the transaction handler who forwards the payment to the acquirer to pay the merchant for the corresponding said transaction.
  • the present invention more particularly relates to the detection of fraud in a transaction upon such an account in such a payment processing system by the use of encryption of the account.
  • a merchant conducting a transaction with an account holder on an account issued by an issuer is common place largely due to its convenience to the merchant and the account holder, the low transactional overhead cost of using such a payment system of acquired transactions, and the speed with which the transaction can be completed.
  • transactions fraudulently obtained accounts are a major and rising concern. It would be an advance in the art to use an encrypted account to detect an attempt by a party to conduct a transaction on the account where the account was fraudulently obtained, and where the detection occurs prior to the completion of the transaction. It would be a further advantage to detect the source from which the account was fraudulently obtained.
  • an account is retrieved at a Point of Service terminal (POS) of a merchant attempting to conduct a transaction with an account holder associated with the account.
  • the transaction data pertaining to the transaction data includes a sensitive data field having one or more characters of a predetermined character set. For each character in the sensitive data field there is formed a combined character from the character of the sensitive data field and a character of a generated pad.
  • a replacement character is formed by performing a modulus operation on the combined character. The replacement character is then stored in position of the corresponding character in the sensitive data field.
  • a transmission is then formed for delivery to the merchant's acquirer. The transmission contains the transaction data with the sensitive data field.
  • a first transmission is received from a merchant.
  • the first transmission has transaction data from a transaction upon an account of an account holder.
  • the transaction data includes a sensitive data field having characters of a predetermined character set.
  • an attempt is made to retrieve a transaction data record from a transaction database.
  • the transaction data record contains a data set from a previous transaction that includes the account upon which the previous transaction was conducted.
  • the sensitive data field which is encrypted as the corresponding account upon which the previous transaction was conducted, is encrypted by a character-by-character modulo operation using a generated pad. If there is a retrieval of the transaction data record, a second transmission is formed and sent that contains a fraud notification for the transaction. If, however, there is not a retrieval of the transaction data record, a third transmission containing a no-fraud notification for the one said transaction is formed and sent.
  • FIG. 1 depicts an exemplary process for the provision of the financial service of authorizing and remunerating electronic payment device transactions (i.e.; credit card transactions);
  • FIG. 2 depicts an exemplary set of steps for encryption of an account number using character-by-character modulus addition using only numeric characters
  • FIG. 3 depicts an exemplary set of steps for encryption of an arbitrary alphabetic phrase using character-by-character modulus addition using alphabetic characters
  • FIG. 4 depicts an exemplary process for detecting fraud-related data interception.
  • FIG. 1 is a diagram depicting an exemplary process 100 of a particular financial transaction system.
  • a lower case letter in parenthesis is intended to mean an integer variable having a value from 1 to the capital case of the lower case letter, which value can be large (i.e., approaching infinity).
  • ‘(b)’ is intended to mean that the integer ‘b’ can have a value from 1 to B
  • ‘(c)’ is intended to mean that the integer ‘c’ can have a value from 1 to C, etc.
  • drawing elements 104 , 106 , 108 , 110 , 180 , 182 , and 184 in FIG. 1 are illustrated with a block, but indicate one or more elements can be present.
  • Issuer (j) 104 is one of a possible plurality of issuers, where j may range from 1 to a large integer.
  • Account holder (p) 108 presents an electronic payment device (i.e.; a credit card) to a Merchant (n) 110 (at step 156 ) as tender for a financial transaction such as a purchase of goods.
  • a financial transaction such as a purchase of goods.
  • the Account holder's 108 credit card is typically scanned or swiped through a magnetic card reader by the merchant (n) 110 , whereupon account information is read from the card and a request for authorization is transmitted to the Merchant's 110 Acquirer (i) 106 (at step 162 ).
  • Each Acquirer (i) 106 is a financial organization that processes credit card transactions for businesses, for example merchants, and is licensed as a member of a transaction handler (TH) 102 such as a credit card association. As such, each Acquirer (i) 106 establishes a financial relationship with one or more Merchants (n) 110 , and assists in preventing and reporting fraudulent transactions and security-related events.
  • the Acquirer (i) 106 transmits the account information to the TH 102 (at step 170 ), who in turn routes the request to the account holder's issuing bank, or Issuer (j) 104 (at step 176 ).
  • the Issuer (j) 104 returns authorization information to the TH 102 (at step 174 ) who returns the information to the Merchant (n) 110 through the Acquirer (i) 106 (by steps 168 and 166 ).
  • the Merchant (n) 110 now knowing whether the Issuer's (j) 104 credit card account is valid and supports a sufficient credit balance, may complete the transaction and the Account holder (p) 108 in turn receives goods and/or services in exchange (at step 158 ).
  • Most credit card associations instruct merchants that, after receiving authorization, the detailed credit card account information obtained from the point of sale magnetic stripe scanner must be deleted.
  • information about the transaction is provided by the Merchant (n) 110 to Acquirer (i) 106 (at step 162 ), who in turn routes the transaction data to the TH 102 (at step 170 ) who then provides the transaction data to the appropriate Issuer (j) 104 (at step 176 ).
  • the Issuer (j) 104 then provides funding for the transaction to the TH 102 (at step 174 ) through a settlement bank (not shown).
  • the funds are then forwarded to the Merchant's (n) 110 Acquirer (i) 106 (at step 168 ) who in turn pays the Merchant (n) 110 for the transaction conducted at step 162 less a merchant discount, if applicable.
  • the Issuer (j) 104 then bills the Account holder (p) 108 (at step 150 ), and the Account holder (p) 108 pays the Issuer 104 (at step 152 ), with possible interest or fees.
  • Each of the Issuer (j) 104 , Merchants (n) 110 , Acquirer (i) 106 and the TH 102 may have access to information resources having one or more of the following databases: transaction database (z) 182 , merchant database (y) 184 , or account database (w) 180 .
  • These databases can be connected by a network, internet, virtual private network, or by other means known to those skilled in the art. Moreover, not every participant must necessarily have access to any or all of the databases.
  • Each database can assign read, write, and query permissions as appropriate to the various participants. For example, a Merchant (n) 110 have read access to the account database (w) 180 and the Issuer (j) may have read and write access.
  • the transaction database (z) 182 is designed to store some or all of the transaction data originating at the Merchants (n) 110 that use a payment device for each transaction conducted between an Account holder (p) 108 and the Merchant (n) 110 .
  • the transaction data can include information associated with the account of an Account holder (p) 108 , date, time, and location among other more specific information including the amount of the transaction.
  • the database can be searched using account information, date and time (or within proximity thereof), or by any other field stored in the database.
  • the Merchant database (y) 184 is designed to store information about each Merchant (n) 110 .
  • the Merchant database (y) can contain information such as the unique identification of each Merchant (n) 110 , an identifier for each point of sale device in use by the Merchant (n) 110 , and location of the Merchant (n) 110 .
  • the account database (w) 180 is designed to store account information for payment devices associated with Account holder (p).
  • the account database (w) 180 can store part or all of an account number, unique encryption key, account information, account name.
  • the information from the account database (w) 180 can be associated with information from the transaction database (z) 182 .
  • An Account holder (p) 108 initiates a transaction with a Merchant (n) 110 by presenting a card at step 156 to the Merchant (n) 110 .
  • the card is typically presented at the point of sale (not shown) such as by swiping a card in a card reader or entering account details at a website.
  • Certain transaction information is transmitted from the point of sale device in route to the Merchant's (n) 110 Acquirer (i) 106 and only some of the information may contain sensitive information.
  • the transaction information can include account information, account name, transaction balance, transaction time, transaction date, and transaction location.
  • Sensitive information includes information such account number and account holder name that identify and associate a particular account with a particular account holder. This transaction information may be transmitted via a less secure communication medium.
  • a transmission of transaction data may occur with weak or no encryption between two or more points from the point of origin, such as the point of sale device at the Merchant (n) 110 , and the ultimate destination, such as the Acquirer (i) 106 .
  • These points can include, without limitation, from the card reader to a point of sale device, point of sale device at the Merchant (n) 110 and a network router or computer that is connected to a network but is housed and maintained by the Merchant (n) 110 and between the Merchant (n) 110 and the Acquirer (i) 106 .
  • the communication channel could be Ethernet, wireless internet, satellite, infrared transmission, or other known communication protocols.
  • Some or all of the transmission may also be stored for record keeping, archival or data mining purposes with little or no encryption.
  • the Merchant (n) 110 may store transaction data, including certain account information in the Merchant's (n) 110 accounts on file database for reuse later.
  • Transaction validation is used to detect common errors, inconsistencies, and other transaction related problems before communicating with the Acquirer (i) 106 .
  • Such transaction validation can include confirming the payment type, routing information, certain aspects of the account number (like length and unique identifiers).
  • These validation routines rely upon specific formatting criteria such as the fact that a valid account number is of a given length comprised of numbers zero through nine. Any deviation from these rules may cause the system to preemptively terminate a transaction and request the Account holder (p) 108 retry their payment device.
  • encrypting some or all of the transaction data using standard encryption techniques would cause the transaction validation tests to fail. For example, using standard encryption techniques on an account number will change the character type, may change the length, may alter required values (such as affecting numbers indicating card type or routing information).
  • transaction information is retrieved from a point of sale device at a Merchant (n) 106 .
  • the transaction information is comprised of account information together with other information about the transaction itself: time, date, location, value, etc.
  • Certain of the transaction information is considered sensitive information including, without limitation, account number, credit card verification number, and account name. In at least one of the sensitive fields, the characters will be encrypted using modulus character addition.
  • each character of the applicable sensitive field is added to a character of a generated pad.
  • the generated pad is described in greater detail below, but specifies an offset by which the character value will be shifted. Since shifting the characters (positively or negatively) may cause certain characters to exceed the bounds of a given character set, a modulus operation is applied. As used in the process 100 , the modulus operation will be performed using a value equal to the number of characters in the character set. For example, modulus 10 for numeric character set (0-9), modulus 26 for alphabetic (A-Z), modulus 35 for alphanumeric (A-Z and 0-9), and, when a number base is set, modulus 12 for base 12 , modulus 16 for base 16 , and modulus 64 for base 64 .
  • Each character resulting for the character modulus addition is stored in the same character position as the original, unencrypted character.
  • a transmission is then formed comprising the newly encrypted sensitive data field together with the other transaction data.
  • the transmission is destined for the Acquirer (i) 406 , the TH 402 and ultimately the Issuer (i) 404 , and there may be various points along that path where the sensitive data fields are transmitted across unencrypted lines of communication, are stored without encryption or with only weak encryption, or are capable of being intercepted.
  • sensitive data fields encrypted using the character-by-character modulus addition will appear to be unencrypted and valid.
  • unauthorized use of the encrypted sensitive data fields in a subsequent transaction will result in the transaction failing since the encrypted sensitive data fields, while appearing to be valid, likely do not match any valid, active account.
  • the process can include a method of detecting fraud.
  • a merchant (n) 110 , an acquirer (i) 106 or a TH 102 can store the transaction data for each successful transaction in a transaction database.
  • the transaction database will store at least enough information to reconstruct the encrypted account number.
  • the transaction database can contain a data record for the encrypted account number itself; can include transaction date, time and location if transaction date, time and location are used to generate the pad; or can include a data record for the generated pad itself for each transaction.
  • the merchant (n) 110 , the acquirer (i) 106 or the TH 102 can use the account number of the failed transaction to retrieve a list of any previous transactions that used the account number of the failed transaction as the encrypted account number. If one or more transaction records are retrieved from the transaction database then the failed transaction is marked suspicious. The merchant (n) 110 , the acquirer (i) 106 or the TH 102 can then send a notification indicating that there is suspicious activity.
  • the transaction database can contain other transaction data, such as time, date, and place
  • the source of the fraud can be determined.
  • the transaction database can be further queried with respect other transactions that occurred in spatial and temporal proximity to the suspicious activity. Transactions occurring using those accounts can be preemptively marked as suspicious to counter fraudulent activity before any actual attempted transaction.
  • FIG. 2 shows an exemplary method 200 wherein the steps transform an exemplary account number into an encrypted form suitable for transmission and then decrypting the encrypted account back into the original account number.
  • Step 202 shows the unencrypted version of the account number.
  • the account number consists of sixteen characters. The characters are selected from a character set comprised of numeric values zero through nine.
  • Steps 204 and 210 show the generation of a pad.
  • a pad is an arbitrary set of characters that is used to encrypt and decrypt the account number. The pad, in general, will be used to indicate the corresponding shift in value of the original source character.
  • a pad can be generated based on any number of techniques. For example, a pad can be generated based on an algorithm using a key shared by both the sender and receiver; be a fixed string known by both the encrypting and decrypting entities; be based on other transaction data such as time, date, location, price, number of items, account name, credit card verification code, or any combination of the preceding; a custom pin associated with an account; or a one time pad issued at the start of each transaction.
  • a pad could be generated for a numeric character set by concatenating the time and date of a transaction such as 133301282008 could be used as a pad for a transaction occurring at 1:33 pm (1333) on Jan. 28, 2008 (01282008).
  • the pad generation algorithm can use any combination of techniques, for example applying a key known by both the encrypting and decrypting entity together with the date and time example above. In this situation, the key might be used to subtract 111101111001 from the date generated pad to produce a more obscure pad such as 022200171007.
  • DAKPT Derived Unique Key Per Transaction
  • Triple DES/AES counter mode may be used to generate either the pad or encrypted keys from which the pad may be generated or extracted. These techniques can further be based on one or more pieces of transaction data such as date and time.
  • the pad can be of any length. As shown in FIG. 2 , the pad is the same length as the account number. Where a pad is generated that has fewer characters than the account number, the pad characters can be applied in repetition. Where the length of the pad is longer than the account number, a subset of the pad can be selected for use. For example, if a pad of four characters were applied to the account number shown in FIG. 2 , the pad would be used four times in repetition. In any case, the same pad (or in some cases, its additive inverse) must be used for both the encrypting and decrypting and used in the same manner. Therefore, any pad generation must be capable of being reliably performed at both the point of encryption and decryption.
  • decryption may also be possible using the additive inverse of each character of the original pad.
  • the additive inverse is the character that, when added to the pad character, will equal the character set size. For example, if there are ten characters in a character set (0-9), the additive inverse of the character “2” will be “8”.
  • each character of the pad is added to its respective character in the account number field (as shown in step 206 ). That is, the first character of the account number is added to the first character of the pad, the second character of the account number is added to the second character of the pad, and so on until the sixteenth character of the account number is added to the sixteenth character of the pad.
  • the result of character addition is indicated as the value in the brackets. The result is that characters at positions 3, 14, and 15 have values greater than the allowable character set (again numbers zero through nine).
  • a modulus ten operation is performed on each character, step 208 .
  • the modulus operation finds the remainder of the division of one number by another.
  • the number ten is used to correspond to the number of valid characters in the character set—in this case there are ten characters represented by numerals zero through nine. If the valid characters were letters “a” through “z” the modulus operation would use twenty-six (the number of letters in the alphabet). The result is that result of character addition is mapped into a character of the character set.
  • the pad contains the value of zero
  • the corresponding character of the account number is not encrypted.
  • the pad can be created to accommodate those requirements.
  • the first character might indicate the card type and the second set of four digits might indicate some other piece of important information.
  • the resulting account number will have the appearance of a valid account number to anyone intercepting the data between the sender and the receiver and be difficult to distinguish from account numbers that are unencrypted.
  • the result of the character-by-character addition 206 and the modulus 10 operation 208 is an encrypted account number having characters selected from the same character set.
  • the decrypting entity must generate the same pad (or, in some cases, the pad's additive inverse), step 210 .
  • the pad generation will be substantially similar to the pad generation at the sender described above.
  • the decrypting entity performs character-by-character subtraction (or if the pad is the encrypting pad's additive inverse, character-by-character addition), step 212 .
  • the first character of the encrypted account number is subtracted from the first character of the generated pad (i.e. 4-0)
  • the second character of the account number is subtracted from the second character of the pad (i.e.
  • the modulus operation must then be applied to each resulting character of the character-by-character subtraction, step 214 , to return the unencrypted account number.
  • the value used by the modulus operation is equal to the size of the character set. In this case, the character set has ten characters (numerals zero through nine). Thus, the modulus 10 operation is applied to the result of each character-by-character subtraction.
  • FIG. 3 depicts a flow diagram for an exemplary process of encrypting and decrypting a sensitive data field with an alphabetic character set, 300 .
  • an unencrypted original phrase is “THEQUICKBROWNFOX” consists of only alphabetic letters (i.e. letters A-Z).
  • the entire character set is represented by table 316 .
  • Each character of the character set is mapped to a corresponding integer value as shown on the right hand side of the equals sign.
  • the table mapping must be known by both the encrypting and decrypting entities.
  • Table 316 is a simple table that maps numeric values in ascending order to an alphabetic letter.
  • the original phrase is represented by the following values: 19, 7, 4, 16, 20, 8, 2, 10, 1, 17, 14, 22, 13, 5, 14 and 23, in this example.
  • Steps 304 and 310 show pad generation.
  • the pad in FIG. 3 is a pass phrase comprised of characters from the same character set as the original phrase (i.e. alphabetic letters A-Z).
  • the pad can be produced by a number of different techniques provided that the encrypting and decrypting entities can generate the same pad.
  • each character of the pad is mapped to a value in the table, 316 .
  • the pad has the following numeric values: 8, 11, 14, 21, 4, 24, 14, and 20.
  • step 306 The numeric value of each character of the original message is added to the numeric value of each character of the pad, step 306 .
  • the pad contains fewer character than the original phrase, and so each character of the pad will be reapplied in sequence until no characters remain of the original phrase.
  • the result of the each character-by-character addition is shown at step 306 in brackets. Certain of the results, such as characters at positions 4, 6, and 8, are values outside the acceptable character set size. Therefore, step 308 applies the modulus operation to each of the resulting values.
  • the modulo 26 operation is applied to each result of the character-by-character addition.
  • the result creates a list of values that correspond with a number on the table, 316 .
  • Each value then is mapped back to an alphabetic character (e.g. 0 becomes “A” and 1 becomes “B”) and the alphabetic character is inserted in its place into the original phrase.
  • the encrypted phrase is “BSSLYGQEJCCRRDCR”.
  • the table 316 can be further used to have two way mapping of values, not shown. In this case, for example, one mapping could map original phrase to value and the second mapping could map the value to a set of characters used for the encrypted phrase.
  • the mapping represented by the table, 316 is therefore arbitrary.
  • the table 316 may be represented internally within a system where characters are already represented as a numeric value in a system, such as the case for ASCII characters. Mapping characters to the table permits arbitrary selection of character sets. In order for the table to be effective, the mapping of numeric values to characters must each be unique. Thus, 2 should not be mapped to both “A” and “B.” Furthermore, the numeric values in the table must be consecutive. Notwithstanding the foregoing, the characters of a character set do not have to be unique or consecutive. Therefore “A” could be represented by both 1 and 2 and “Q” could be represented by 3.
  • FIG. 3 starts with pad generation at step 310 .
  • the pad generation at step 310 will be the same as the pad generation at step 304 .
  • the pad can also be the additive inverse of the pad used during encryption.
  • the additive inverse of the pad will be the alphabetic letter's opposite (e.g. A would be Z, B would be Y, etc.).
  • the numeric mapping of each character of the pad is subtracted from the numeric mapping of each character of the encrypted phrase (or, when the additive inverse is used, each numeric value of each character of the pad is added to the numeric value of each character of the encrypted phrase).
  • the result of the character-by-character addition is a series of numeric values in which some values are not within the range of the character set (e.g. characters at positions 1, 4, 6, and 8).
  • the modulus operation is the applied to each of the resulting numeric values, step 314 .
  • the modulus operation is modulus 26 since the character set contains 26 characters.
  • the result are numeric values within the range of the character set.
  • each numeric value that results from the modulus 26 operation on the character-by-character addition of the encrypted phrase with the character of the pad is mapped back to a character using the table, 316 (e.g. 0 would become A, 1 would become B, etc.).
  • FIG. 4 is a diagram depicting an exemplary process 400 of a particular financial transaction system characterized substantially as in FIG. 3 .
  • the process 400 further includes a Fraud-related data intercept (FDI) (k) 490 .
  • the FDI (k) 490 is one or more entities that are in a position to intercept the transmission of transaction data along path 462 .
  • Path 462 can be any method of communication including wireless internet, Ethernet, satellite, standard network or communications protocols, internet, or radio transmissions.
  • FIG. 1 Fraud-related data intercept
  • the interception 4 shows the interception occurring along path 462 but it is contemplated that the interception could occur at any number of points of communication including, without limitation, between a Point of Service terminal (POS) and a network router located solely at the Merchant (n) 410 and between the Acquirer (i) 406 and TH 402 .
  • the interception can be the result of data theft of transaction or account data stored or maintained in one or more databases, log files, or caches where, for example, the account information stored is the encrypted version of the account number.
  • the interception can occur by any various number of techniques including, without limitation, packet sniffing, man-in-the-middle attack, hacked and compromised hardware or software.
  • the transmission of transaction data is thus copied and stored by the FDI (k) 490 .
  • the sensitive data fields of the transaction data would be exposed.
  • the FDI (k) 490 would be available to obtain only the encrypted sensitive data field.
  • the FDI (k) 490 may attempt to engage in fraudulent transaction (j) 192 with one or more Merchants (n) 410 using the encrypted sensitive data obtained through the interception of the transmission along path 462 .
  • the FDI (k) 490 will present the encrypted sensitive data to the Merchant (n) 410 at the POS and the transaction data will be encrypted in accordance with the techniques as disclosed herein. Since the encrypted sensitive data will not correspond to a valid account, the transaction will be denied by the Acquirer (i) 406 or, in some cases, by the TH 402 .
  • all successful transactions and the corresponding transaction data is stored in a transaction database (z) 482 .
  • the transaction database (z) 482 includes the encrypted account number used or information sufficient to reconstruct the encrypted account number (such as the information necessary to generate a pad).
  • the Acquirer (i) 406 or the TH 402 will use the account information data and transaction data from the failed transaction to retrieve transaction records from the transaction database (z) 482 that used the failed account information.
  • the Acquirer (i) 406 or the TH 402 can send a transmission destined for the Merchant (n) 410 indicating that this transaction is likely fraudulent.
  • the Merchant (n) 410 then can take steps to prevent additional fraud.
  • the Acquirer (i) 406 or the TH 402 can use the one or more records returned from the transaction database (z) 482 to identify the proximal time, date, and location that the transmission was intercepted.
  • the Acquirer (i) 406 or the TH 402 can use the one or more records returned from the transaction database (z) 482 to identify the merchant whose transaction was intercepted.
  • the Acquirer (i) 406 or the TH 402 can retrieve records having proximal location, date and time to derive information regarding potential other data interceptions, weaknesses in security, or security breaches.
  • implementations can be in the form of control logic, in a modular or integrated manner, using software, hardware or a combination of both.
  • the steps of a method, process, or algorithm described in connection with the implementations disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two.

Abstract

A merchant conducting a transaction on an account forms transaction data with a sensitive data field. To obscure the account prior to transmitting information about the transaction, for each character in the sensitive data field, a combined character is formed with a character of a generated pad. A replacement character is formed by a modulus operation on the combined character and is stored in the corresponding position in the sensitive data field. A transmission containing the sensitive data field with replacement characters is delivered to the merchant's acquirer. Subsequently, a first transmission is received for another transaction from a merchant that contains transaction data upon an account and a sensitive data field. Using the sensitive data field, an attempt is made to retrieve a transaction data record that contains data from a previous transaction that includes the account upon which the previous transaction was conducted. The sensitive data field, which is encrypted as the corresponding account upon which the previous transaction was conducted, was encrypted by a character-by-character modulo operation using a generated pad. If the transaction data record is retrieved, a second transmission is sent that contains a fraud notification of the attempt to conduct a transaction upon the encrypted account in the sensitive data field. If there is no retrieval of the transaction data record, a third transmission containing a no-fraud notification is sent.

Description

    RELATED APPLICATIONS
  • The application claims priority to U.S. Provisional Application Ser. No. 60/969,805, filed on Sep. 4, 2007, titled “Method and System For Securing Data Field,” which is incorporated herein by reference.
  • BACKGROUND
  • The present invention relates to a payment processing system for a plurality of transactions each characterized by a merchant and an account holder engaging in the transaction upon an account that an issuer issues to the account holder, wherein a transaction handler processes the transaction for both the merchant and processes other transactions for other merchants, each merchant submitting the corresponding transaction to its acquirer for processing by the transaction handler who requests the issuer of the corresponding account to obtain payment for the corresponding transaction from the corresponding account and for which the issuer forwards the payment to the transaction handler who forwards the payment to the acquirer to pay the merchant for the corresponding said transaction. The present invention more particularly relates to the detection of fraud in a transaction upon such an account in such a payment processing system by the use of encryption of the account.
  • BACKGROUND
  • A merchant conducting a transaction with an account holder on an account issued by an issuer is common place largely due to its convenience to the merchant and the account holder, the low transactional overhead cost of using such a payment system of acquired transactions, and the speed with which the transaction can be completed. With these advantages over a transaction for which a consumer's payment to a merchant is made by cash or check, transactions fraudulently obtained accounts are a major and rising concern. It would be an advance in the art to use an encrypted account to detect an attempt by a party to conduct a transaction on the account where the account was fraudulently obtained, and where the detection occurs prior to the completion of the transaction. It would be a further advantage to detect the source from which the account was fraudulently obtained.
  • SUMMARY
  • In one implementation, an account is retrieved at a Point of Service terminal (POS) of a merchant attempting to conduct a transaction with an account holder associated with the account. The transaction data pertaining to the transaction data includes a sensitive data field having one or more characters of a predetermined character set. For each character in the sensitive data field there is formed a combined character from the character of the sensitive data field and a character of a generated pad. A replacement character is formed by performing a modulus operation on the combined character. The replacement character is then stored in position of the corresponding character in the sensitive data field. A transmission is then formed for delivery to the merchant's acquirer. The transmission contains the transaction data with the sensitive data field.
  • In another implementation, a first transmission is received from a merchant. The first transmission has transaction data from a transaction upon an account of an account holder. The transaction data includes a sensitive data field having characters of a predetermined character set. By use of the sensitive data field, an attempt is made to retrieve a transaction data record from a transaction database. The transaction data record contains a data set from a previous transaction that includes the account upon which the previous transaction was conducted. The sensitive data field, which is encrypted as the corresponding account upon which the previous transaction was conducted, is encrypted by a character-by-character modulo operation using a generated pad. If there is a retrieval of the transaction data record, a second transmission is formed and sent that contains a fraud notification for the transaction. If, however, there is not a retrieval of the transaction data record, a third transmission containing a no-fraud notification for the one said transaction is formed and sent.
  • BRIEF DESCRIPTION OF DRAWINGS
  • Implementations of the invention will become more apparent from the detailed description set forth below when taken in conjunction with the drawings, in which like elements bear like reference numerals.
  • FIG. 1 depicts an exemplary process for the provision of the financial service of authorizing and remunerating electronic payment device transactions (i.e.; credit card transactions);
  • FIG. 2 depicts an exemplary set of steps for encryption of an account number using character-by-character modulus addition using only numeric characters;
  • FIG. 3 depicts an exemplary set of steps for encryption of an arbitrary alphabetic phrase using character-by-character modulus addition using alphabetic characters; and
  • FIG. 4 depicts an exemplary process for detecting fraud-related data interception.
  • DESCRIPTION
  • FIG. 1 is a diagram depicting an exemplary process 100 of a particular financial transaction system. By way of explanation for the nomenclature of reference numerals used in the Figures and described in the specification, a lower case letter in parenthesis is intended to mean an integer variable having a value from 1 to the capital case of the lower case letter, which value can be large (i.e., approaching infinity). Thus ‘(b)’ is intended to mean that the integer ‘b’ can have a value from 1 to B, and ‘(c)’ is intended to mean that the integer ‘c’ can have a value from 1 to C, etc. As such, drawing elements 104, 106, 108, 110, 180, 182, and 184 in FIG. 1 are illustrated with a block, but indicate one or more elements can be present. For example, Issuer (j) 104 is one of a possible plurality of issuers, where j may range from 1 to a large integer.
  • Account holder (p) 108 presents an electronic payment device (i.e.; a credit card) to a Merchant (n) 110 (at step 156) as tender for a financial transaction such as a purchase of goods. Those of skill in the art will recognize that other financial transactions and instruments other than credit cards may also be used, including, but not limited to, a prepaid card and a debit card. For purposes of illustration and explanation, however, reference will be made to a credit card.
  • As part of the transaction, the Account holder's 108 credit card is typically scanned or swiped through a magnetic card reader by the merchant (n) 110, whereupon account information is read from the card and a request for authorization is transmitted to the Merchant's 110 Acquirer (i) 106 (at step 162). Each Acquirer (i) 106 is a financial organization that processes credit card transactions for businesses, for example merchants, and is licensed as a member of a transaction handler (TH) 102 such as a credit card association. As such, each Acquirer (i) 106 establishes a financial relationship with one or more Merchants (n) 110, and assists in preventing and reporting fraudulent transactions and security-related events.
  • The Acquirer (i) 106 transmits the account information to the TH 102 (at step 170), who in turn routes the request to the account holder's issuing bank, or Issuer (j) 104 (at step 176). The Issuer (j) 104 returns authorization information to the TH 102 (at step 174) who returns the information to the Merchant (n) 110 through the Acquirer (i) 106 (by steps 168 and 166). The Merchant (n) 110 now knowing whether the Issuer's (j) 104 credit card account is valid and supports a sufficient credit balance, may complete the transaction and the Account holder (p) 108 in turn receives goods and/or services in exchange (at step 158). Most credit card associations instruct merchants that, after receiving authorization, the detailed credit card account information obtained from the point of sale magnetic stripe scanner must be deleted.
  • To reconcile the financial transactions and provide for remuneration, information about the transaction is provided by the Merchant (n) 110 to Acquirer (i) 106 (at step 162), who in turn routes the transaction data to the TH 102 (at step 170) who then provides the transaction data to the appropriate Issuer (j) 104 (at step 176). The Issuer (j) 104 then provides funding for the transaction to the TH 102 (at step 174) through a settlement bank (not shown). The funds are then forwarded to the Merchant's (n) 110 Acquirer (i) 106 (at step 168) who in turn pays the Merchant (n) 110 for the transaction conducted at step 162 less a merchant discount, if applicable. The Issuer (j) 104, then bills the Account holder (p) 108 (at step 150), and the Account holder (p) 108 pays the Issuer 104 (at step 152), with possible interest or fees.
  • Each of the Issuer (j) 104, Merchants (n) 110, Acquirer (i) 106 and the TH 102 may have access to information resources having one or more of the following databases: transaction database (z) 182, merchant database (y) 184, or account database (w) 180. These databases can be connected by a network, internet, virtual private network, or by other means known to those skilled in the art. Moreover, not every participant must necessarily have access to any or all of the databases. Each database can assign read, write, and query permissions as appropriate to the various participants. For example, a Merchant (n) 110 have read access to the account database (w) 180 and the Issuer (j) may have read and write access.
  • The transaction database (z) 182 is designed to store some or all of the transaction data originating at the Merchants (n) 110 that use a payment device for each transaction conducted between an Account holder (p) 108 and the Merchant (n) 110. The transaction data can include information associated with the account of an Account holder (p) 108, date, time, and location among other more specific information including the amount of the transaction. The database can be searched using account information, date and time (or within proximity thereof), or by any other field stored in the database.
  • The Merchant database (y) 184 is designed to store information about each Merchant (n) 110. The Merchant database (y) can contain information such as the unique identification of each Merchant (n) 110, an identifier for each point of sale device in use by the Merchant (n) 110, and location of the Merchant (n) 110.
  • The account database (w) 180 is designed to store account information for payment devices associated with Account holder (p). The account database (w) 180 can store part or all of an account number, unique encryption key, account information, account name. The information from the account database (w) 180 can be associated with information from the transaction database (z) 182.
  • An Account holder (p) 108 initiates a transaction with a Merchant (n) 110 by presenting a card at step 156 to the Merchant (n) 110. The card is typically presented at the point of sale (not shown) such as by swiping a card in a card reader or entering account details at a website. Certain transaction information is transmitted from the point of sale device in route to the Merchant's (n) 110 Acquirer (i) 106 and only some of the information may contain sensitive information. The transaction information can include account information, account name, transaction balance, transaction time, transaction date, and transaction location. Sensitive information includes information such account number and account holder name that identify and associate a particular account with a particular account holder. This transaction information may be transmitted via a less secure communication medium. In addition, a transmission of transaction data may occur with weak or no encryption between two or more points from the point of origin, such as the point of sale device at the Merchant (n) 110, and the ultimate destination, such as the Acquirer (i) 106. These points can include, without limitation, from the card reader to a point of sale device, point of sale device at the Merchant (n) 110 and a network router or computer that is connected to a network but is housed and maintained by the Merchant (n) 110 and between the Merchant (n) 110 and the Acquirer (i) 106. The communication channel could be Ethernet, wireless internet, satellite, infrared transmission, or other known communication protocols. Some or all of the transmission may also be stored for record keeping, archival or data mining purposes with little or no encryption. For example, the Merchant (n) 110 may store transaction data, including certain account information in the Merchant's (n) 110 accounts on file database for reuse later.
  • Furthermore, many point of sale system include a certain amount of transaction validation. Transaction validation is used to detect common errors, inconsistencies, and other transaction related problems before communicating with the Acquirer (i) 106. Such transaction validation can include confirming the payment type, routing information, certain aspects of the account number (like length and unique identifiers). These validation routines rely upon specific formatting criteria such as the fact that a valid account number is of a given length comprised of numbers zero through nine. Any deviation from these rules may cause the system to preemptively terminate a transaction and request the Account holder (p) 108 retry their payment device. In such situations, encrypting some or all of the transaction data using standard encryption techniques would cause the transaction validation tests to fail. For example, using standard encryption techniques on an account number will change the character type, may change the length, may alter required values (such as affecting numbers indicating card type or routing information).
  • In this process, transaction information is retrieved from a point of sale device at a Merchant (n) 106. The transaction information is comprised of account information together with other information about the transaction itself: time, date, location, value, etc. Certain of the transaction information is considered sensitive information including, without limitation, account number, credit card verification number, and account name. In at least one of the sensitive fields, the characters will be encrypted using modulus character addition.
  • In modulus character addition, each character of the applicable sensitive field is added to a character of a generated pad. The generated pad is described in greater detail below, but specifies an offset by which the character value will be shifted. Since shifting the characters (positively or negatively) may cause certain characters to exceed the bounds of a given character set, a modulus operation is applied. As used in the process 100, the modulus operation will be performed using a value equal to the number of characters in the character set. For example, modulus 10 for numeric character set (0-9), modulus 26 for alphabetic (A-Z), modulus 35 for alphanumeric (A-Z and 0-9), and, when a number base is set, modulus 12 for base 12, modulus 16 for base 16, and modulus 64 for base 64.
  • Each character resulting for the character modulus addition is stored in the same character position as the original, unencrypted character. A transmission is then formed comprising the newly encrypted sensitive data field together with the other transaction data.
  • As stated above, the transmission is destined for the Acquirer (i) 406, the TH 402 and ultimately the Issuer (i) 404, and there may be various points along that path where the sensitive data fields are transmitted across unencrypted lines of communication, are stored without encryption or with only weak encryption, or are capable of being intercepted. In those situations, sensitive data fields encrypted using the character-by-character modulus addition will appear to be unencrypted and valid. Under nearly all circumstances, unauthorized use of the encrypted sensitive data fields in a subsequent transaction will result in the transaction failing since the encrypted sensitive data fields, while appearing to be valid, likely do not match any valid, active account.
  • In one implementation, the process can include a method of detecting fraud. In this implementation, a merchant (n) 110, an acquirer (i) 106 or a TH 102 can store the transaction data for each successful transaction in a transaction database. The transaction database will store at least enough information to reconstruct the encrypted account number. For example, and without limitation, the transaction database can contain a data record for the encrypted account number itself; can include transaction date, time and location if transaction date, time and location are used to generate the pad; or can include a data record for the generated pad itself for each transaction. When a transaction fails, the merchant (n) 110, the acquirer (i) 106 or the TH 102 can use the account number of the failed transaction to retrieve a list of any previous transactions that used the account number of the failed transaction as the encrypted account number. If one or more transaction records are retrieved from the transaction database then the failed transaction is marked suspicious. The merchant (n) 110, the acquirer (i) 106 or the TH 102 can then send a notification indicating that there is suspicious activity.
  • Further, where the transaction database can contain other transaction data, such as time, date, and place, the source of the fraud can be determined. The transaction database can be further queried with respect other transactions that occurred in spatial and temporal proximity to the suspicious activity. Transactions occurring using those accounts can be preemptively marked as suspicious to counter fraudulent activity before any actual attempted transaction.
  • FIG. 2 shows an exemplary method 200 wherein the steps transform an exemplary account number into an encrypted form suitable for transmission and then decrypting the encrypted account back into the original account number. Step 202 shows the unencrypted version of the account number. The account number consists of sixteen characters. The characters are selected from a character set comprised of numeric values zero through nine.
  • Steps 204 and 210 show the generation of a pad. A pad is an arbitrary set of characters that is used to encrypt and decrypt the account number. The pad, in general, will be used to indicate the corresponding shift in value of the original source character. A pad can be generated based on any number of techniques. For example, a pad can be generated based on an algorithm using a key shared by both the sender and receiver; be a fixed string known by both the encrypting and decrypting entities; be based on other transaction data such as time, date, location, price, number of items, account name, credit card verification code, or any combination of the preceding; a custom pin associated with an account; or a one time pad issued at the start of each transaction. By way of example only, a pad could be generated for a numeric character set by concatenating the time and date of a transaction such as 133301282008 could be used as a pad for a transaction occurring at 1:33 pm (1333) on Jan. 28, 2008 (01282008). Moreover, the pad generation algorithm can use any combination of techniques, for example applying a key known by both the encrypting and decrypting entity together with the date and time example above. In this situation, the key might be used to subtract 111101111001 from the date generated pad to produce a more obscure pad such as 022200171007.
  • In addition, other techniques including, but not limited to, Derived Unique Key Per Transaction (DUKPT) and Triple DES/AES counter mode may be used to generate either the pad or encrypted keys from which the pad may be generated or extracted. These techniques can further be based on one or more pieces of transaction data such as date and time.
  • The pad can be of any length. As shown in FIG. 2, the pad is the same length as the account number. Where a pad is generated that has fewer characters than the account number, the pad characters can be applied in repetition. Where the length of the pad is longer than the account number, a subset of the pad can be selected for use. For example, if a pad of four characters were applied to the account number shown in FIG. 2, the pad would be used four times in repetition. In any case, the same pad (or in some cases, its additive inverse) must be used for both the encrypting and decrypting and used in the same manner. Therefore, any pad generation must be capable of being reliably performed at both the point of encryption and decryption. As noted earlier, where the pad is used in modulus addition (or subtraction), decryption may also be possible using the additive inverse of each character of the original pad. In the example, the additive inverse is the character that, when added to the pad character, will equal the character set size. For example, if there are ten characters in a character set (0-9), the additive inverse of the character “2” will be “8”.
  • In FIG. 2, each character of the pad is added to its respective character in the account number field (as shown in step 206). That is, the first character of the account number is added to the first character of the pad, the second character of the account number is added to the second character of the pad, and so on until the sixteenth character of the account number is added to the sixteenth character of the pad. The result of character addition is indicated as the value in the brackets. The result is that characters at positions 3, 14, and 15 have values greater than the allowable character set (again numbers zero through nine).
  • In order to transform the result of the character addition into a string of characters selected from the required character set, a modulus ten operation is performed on each character, step 208. The modulus operation finds the remainder of the division of one number by another. In this example, the number ten is used to correspond to the number of valid characters in the character set—in this case there are ten characters represented by numerals zero through nine. If the valid characters were letters “a” through “z” the modulus operation would use twenty-six (the number of letters in the alphabet). The result is that result of character addition is mapped into a character of the character set.
  • In the example shown in FIG. 2, where the pad contains the value of zero, the corresponding character of the account number is not encrypted. Thus, where certain transaction validation routines expect certain values at certain character positions, the pad can be created to accommodate those requirements. In this case, the first character might indicate the card type and the second set of four digits might indicate some other piece of important information. In addition, the resulting account number will have the appearance of a valid account number to anyone intercepting the data between the sender and the receiver and be difficult to distinguish from account numbers that are unencrypted.
  • The result of the character-by-character addition 206 and the modulus 10 operation 208 is an encrypted account number having characters selected from the same character set.
  • To decrypt the account number, the same steps are reversed. First, the decrypting entity must generate the same pad (or, in some cases, the pad's additive inverse), step 210. The pad generation will be substantially similar to the pad generation at the sender described above. Second, after the pad has been generated, the decrypting entity performs character-by-character subtraction (or if the pad is the encrypting pad's additive inverse, character-by-character addition), step 212. In the case of character-by-character subtraction, the first character of the encrypted account number is subtracted from the first character of the generated pad (i.e. 4-0), the second character of the account number is subtracted from the second character of the pad (i.e. 5-1), and so on until the sixteenth character of the account number is subtracted from the sixteenth character of the pad (i.e. 8-0). The result of each character subtraction in this example is shown in brackets at step 212. As above, characters at positions 3, 14 and 15 are characters that are outside the acceptable character set.
  • The modulus operation must then be applied to each resulting character of the character-by-character subtraction, step 214, to return the unencrypted account number. As described above, the value used by the modulus operation is equal to the size of the character set. In this case, the character set has ten characters (numerals zero through nine). Thus, the modulus 10 operation is applied to the result of each character-by-character subtraction.
  • FIG. 3 depicts a flow diagram for an exemplary process of encrypting and decrypting a sensitive data field with an alphabetic character set, 300. At step 302, an unencrypted original phrase is “THEQUICKBROWNFOX” consists of only alphabetic letters (i.e. letters A-Z). The entire character set is represented by table 316. Each character of the character set is mapped to a corresponding integer value as shown on the right hand side of the equals sign. The table mapping must be known by both the encrypting and decrypting entities. Table 316 is a simple table that maps numeric values in ascending order to an alphabetic letter. Thus, the original phrase is represented by the following values: 19, 7, 4, 16, 20, 8, 2, 10, 1, 17, 14, 22, 13, 5, 14 and 23, in this example.
  • Steps 304 and 310 show pad generation. The pad in FIG. 3 is a pass phrase comprised of characters from the same character set as the original phrase (i.e. alphabetic letters A-Z). As discussed with respect to FIG. 2, the pad can be produced by a number of different techniques provided that the encrypting and decrypting entities can generate the same pad.
  • In order to perform the character addition between the original phrase and the pad, each character of the pad is mapped to a value in the table, 316. As such, the pad has the following numeric values: 8, 11, 14, 21, 4, 24, 14, and 20.
  • The numeric value of each character of the original message is added to the numeric value of each character of the pad, step 306. In this example, the pad contains fewer character than the original phrase, and so each character of the pad will be reapplied in sequence until no characters remain of the original phrase. The result of the each character-by-character addition is shown at step 306 in brackets. Certain of the results, such as characters at positions 4, 6, and 8, are values outside the acceptable character set size. Therefore, step 308 applies the modulus operation to each of the resulting values.
  • Since the character set, in FIG. 3, is comprised of 26 characters, the modulo 26 operation is applied to each result of the character-by-character addition. The result creates a list of values that correspond with a number on the table, 316. Each value then is mapped back to an alphabetic character (e.g. 0 becomes “A” and 1 becomes “B”) and the alphabetic character is inserted in its place into the original phrase. In accordance with the example shown in FIG. 3, the encrypted phrase is “BSSLYGQEJCCRRDCR”.
  • The table 316 can be further used to have two way mapping of values, not shown. In this case, for example, one mapping could map original phrase to value and the second mapping could map the value to a set of characters used for the encrypted phrase. The mapping represented by the table, 316, is therefore arbitrary. Furthermore, the table 316 may be represented internally within a system where characters are already represented as a numeric value in a system, such as the case for ASCII characters. Mapping characters to the table permits arbitrary selection of character sets. In order for the table to be effective, the mapping of numeric values to characters must each be unique. Thus, 2 should not be mapped to both “A” and “B.” Furthermore, the numeric values in the table must be consecutive. Notwithstanding the foregoing, the characters of a character set do not have to be unique or consecutive. Therefore “A” could be represented by both 1 and 2 and “Q” could be represented by 3.
  • To decrypt a message in this form, FIG. 3 starts with pad generation at step 310. The pad generation at step 310 will be the same as the pad generation at step 304. As noted with respect to FIG. 2, the pad can also be the additive inverse of the pad used during encryption. In this case, the additive inverse of the pad will be the alphabetic letter's opposite (e.g. A would be Z, B would be Y, etc.).
  • At step 312, the numeric mapping of each character of the pad is subtracted from the numeric mapping of each character of the encrypted phrase (or, when the additive inverse is used, each numeric value of each character of the pad is added to the numeric value of each character of the encrypted phrase). The result of the character-by-character addition is a series of numeric values in which some values are not within the range of the character set (e.g. characters at positions 1, 4, 6, and 8).
  • The modulus operation is the applied to each of the resulting numeric values, step 314. As above, the modulus operation is modulus 26 since the character set contains 26 characters. The result are numeric values within the range of the character set. To retrieve the original message, each numeric value that results from the modulus 26 operation on the character-by-character addition of the encrypted phrase with the character of the pad is mapped back to a character using the table, 316 (e.g. 0 would become A, 1 would become B, etc.).
  • FIG. 4 is a diagram depicting an exemplary process 400 of a particular financial transaction system characterized substantially as in FIG. 3. The process 400 further includes a Fraud-related data intercept (FDI) (k) 490. The FDI (k) 490 is one or more entities that are in a position to intercept the transmission of transaction data along path 462. Path 462 can be any method of communication including wireless internet, Ethernet, satellite, standard network or communications protocols, internet, or radio transmissions. FIG. 4 shows the interception occurring along path 462 but it is contemplated that the interception could occur at any number of points of communication including, without limitation, between a Point of Service terminal (POS) and a network router located solely at the Merchant (n) 410 and between the Acquirer (i) 406 and TH 402. Moreover, the interception can be the result of data theft of transaction or account data stored or maintained in one or more databases, log files, or caches where, for example, the account information stored is the encrypted version of the account number.
  • The interception can occur by any various number of techniques including, without limitation, packet sniffing, man-in-the-middle attack, hacked and compromised hardware or software. In any event, the transmission of transaction data is thus copied and stored by the FDI (k) 490. In situations where the transmission is unencrypted or uses weak encryption, the sensitive data fields of the transaction data would be exposed. Thus, the FDI (k) 490 would be available to obtain only the encrypted sensitive data field.
  • Since the encrypted sensitive data is in a form that appears to be unencrypted, the FDI (k) 490 may attempt to engage in fraudulent transaction (j) 192 with one or more Merchants (n) 410 using the encrypted sensitive data obtained through the interception of the transmission along path 462. The FDI (k) 490 will present the encrypted sensitive data to the Merchant (n) 410 at the POS and the transaction data will be encrypted in accordance with the techniques as disclosed herein. Since the encrypted sensitive data will not correspond to a valid account, the transaction will be denied by the Acquirer (i) 406 or, in some cases, by the TH 402.
  • In one implementation, as described herein, all successful transactions and the corresponding transaction data is stored in a transaction database (z) 482. The transaction database (z) 482 includes the encrypted account number used or information sufficient to reconstruct the encrypted account number (such as the information necessary to generate a pad). In this implementation, when a transaction fails, the Acquirer (i) 406 or the TH 402, as the case may be, will use the account information data and transaction data from the failed transaction to retrieve transaction records from the transaction database (z) 482 that used the failed account information.
  • When one or more records are returned from the transaction database (z) 482, the Acquirer (i) 406 or the TH 402, as the case may be, can send a transmission destined for the Merchant (n) 410 indicating that this transaction is likely fraudulent. The Merchant (n) 410 then can take steps to prevent additional fraud.
  • In addition, the Acquirer (i) 406 or the TH 402, as the case may be, can use the one or more records returned from the transaction database (z) 482 to identify the proximal time, date, and location that the transmission was intercepted. In addition, in another implementation, where merchant information is stored in a merchant database (y) 484, the Acquirer (i) 406 or the TH 402, as the case may be, can use the one or more records returned from the transaction database (z) 482 to identify the merchant whose transaction was intercepted. Furthermore, the Acquirer (i) 406 or the TH 402, as the case may be, can retrieve records having proximal location, date and time to derive information regarding potential other data interceptions, weaknesses in security, or security breaches.
  • It should be understood implementations can be in the form of control logic, in a modular or integrated manner, using software, hardware or a combination of both. The steps of a method, process, or algorithm described in connection with the implementations disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two.
  • The various steps or acts in a method or process may be performed in the order shown, or may be performed in another order. Additionally, one or more process or method steps may be omitted or one or more process or method steps may be added to the methods and processes. An additional step, block, or action may be added in the beginning, end, or intervening existing elements of the methods and processes. Based on the disclosure and teachings provided herein, a person of ordinary skill in the art will appreciate other ways and/or methods for various implements.
  • It is understood that the examples and implementations described herein are for illustrative purposes only and that various modifications or changes in light thereof will be suggested to persons skilled in the art and are to be included within the spirit and purview of this application and scope of the appended claims.

Claims (21)

1-27. (canceled)
28. A computer comprising:
a processor; and
a non-transitory computer-readable medium comprising code executable by the processor for implementing a method comprising:
retrieving a sensitive data field having a plurality of characters of a predetermined character set;
determining a generated pad, wherein the generated pad is a set of characters that is used to encrypt and decrypt the sensitive data field;
for each character in the sensitive data field on a character by character basis:
forming a combined value from the character of the sensitive data field, taken alone, and a character of the generated pad;
forming a replacement character by performing a modulus operation on the combined value; and
storing the replacement character in a position of a corresponding character in the sensitive data field; and
transmitting a transmission comprising the replacement characters.
29. The computer of claim 28, wherein each of the replacement characters is a character selected from the predetermined character set, and wherein each character of the generated pad is a character selected from the predetermined character set.
30. The computer of claim 28, wherein forming the combined value comprises adding a numeric value of the character of the sensitive data field to a numeric value of the character of the generated pad.
31. The computer of claim 28, wherein the modulus operation performed on the combined value uses a value equal to the number of characters in the predetermined character set.
32. The computer of claim 28, wherein the generated pad is determined using a key known by the computer and a decrypting computer.
33. The computer of claim 32, wherein the generated pad is further determined using a date or time.
34. The computer of claim 28, wherein a value of zero for a character in the generated pad causes a replacement character formed using the character in the generated pad to be the same as the corresponding character in the sensitive data field.
35. The computer of claim 34, wherein the sensitive data field comprises transaction data for a transaction, and wherein the generated pad has a value of zero at one or more character positions in order to accommodate a requirement associated with the transaction data.
36. A system comprising:
the computer of claim 28; and
a decrypting computer configured to:
receive the transmission comprising the replacement characters from the computer;
generate a second generated pad; and
determine a second sensitive data field using the replacement characters and the second generated pad, wherein the second sensitive data field and the sensitive data field are the same.
37. A computer-implemented method comprising:
retrieving, by a computer, a sensitive data field having a plurality of characters of a predetermined character set;
determining, by the computer, a generated pad, wherein the generated pad is a set of characters that is used to encrypt and decrypt the sensitive data field;
for each character in the sensitive data field on a character by character basis:
forming, by the computer, a combined value from the character of the sensitive data field, taken alone, and a character of the generated pad;
forming, by the computer, a replacement character by performing a modulus operation on the combined value; and
storing, by the computer, the replacement character in a position of a corresponding character in the sensitive data field; and
transmitting, by the computer, a transmission comprising the replacement characters.
38. The computer-implemented method of claim 37, wherein forming the combined value comprises adding a numeric value of the character of the sensitive data field to a numeric value of the character of the generated pad.
39. The computer-implemented method of claim 37, wherein a value of zero for a character in the generated pad causes a replacement character formed using the character in the generated pad to be the same as the corresponding character in the sensitive data field.
40. The computer-implemented method of claim 39, wherein the sensitive data field comprises transaction data for a transaction, and wherein the generated pad has a value of zero at one or more character positions in order to accommodate a requirement associated with the transaction data.
41. A computer-implemented method comprising:
receiving, by a computer, encrypted data comprising a plurality of characters of a predetermined character set;
determining, by the computer, a generated pad, wherein the generated pad is a set of characters that is used to encrypt and decrypt a sensitive data field;
for each character in the encrypted data on a character by character basis:
forming, by the computer, a combined value from the character of the encrypted data, taken alone, and a character of the generated pad;
forming, by the computer, a replacement character by performing a modulus operation on the combined value; and
determining, by the computer, a character of the sensitive data field using the replacement character, wherein the position of the character in the sensitive data field is the position of the character in the encrypted data.
42. The computer-implemented method of claim 41, wherein each character in the generated pad is a character selected from the predetermined character set, and wherein each character in the sensitive data field is selected from the predetermined character set.
43. The computer-implemented method of claim 41, wherein forming the combined value comprises subtracting a numeric value of the character of the generated pad from a numeric value of the character of the encrypted data.
44. The computer-implemented method of claim 41, wherein the modulus operation performed on the combined value uses a value equal to the number of characters in the predetermined character set.
45. The computer-implemented method of claim 41, wherein the generated pad is determined using a key known by the computer and an encrypting computer, and wherein the generated pad is further determined using a date or time.
46. The computer-implemented method of claim 41, wherein a value of zero for a character in the generated pad causes a replacement character formed using the character in the generated pad to be the same as the corresponding character in the encrypted data.
47. The computer-implemented method of claim 46, wherein the sensitive data field comprises transaction data for a transaction, and wherein the generated pad has a value of zero at one or more character positions in order to accommodate a requirement associated with the transaction data.
US14/717,863 2007-09-04 2015-05-20 Account transaction fraud detection Abandoned US20150254670A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US14/717,863 US20150254670A1 (en) 2007-09-04 2015-05-20 Account transaction fraud detection

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US96980507P 2007-09-04 2007-09-04
US12/202,978 US9070129B2 (en) 2007-09-04 2008-09-02 Method and system for securing data fields
US14/717,863 US20150254670A1 (en) 2007-09-04 2015-05-20 Account transaction fraud detection

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US12/202,978 Continuation US9070129B2 (en) 2007-09-04 2008-09-02 Method and system for securing data fields

Publications (1)

Publication Number Publication Date
US20150254670A1 true US20150254670A1 (en) 2015-09-10

Family

ID=40408983

Family Applications (2)

Application Number Title Priority Date Filing Date
US12/202,978 Active 2031-03-08 US9070129B2 (en) 2007-09-04 2008-09-02 Method and system for securing data fields
US14/717,863 Abandoned US20150254670A1 (en) 2007-09-04 2015-05-20 Account transaction fraud detection

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US12/202,978 Active 2031-03-08 US9070129B2 (en) 2007-09-04 2008-09-02 Method and system for securing data fields

Country Status (2)

Country Link
US (2) US9070129B2 (en)
WO (1) WO2009032858A2 (en)

Families Citing this family (120)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140019352A1 (en) 2011-02-22 2014-01-16 Visa International Service Association Multi-purpose virtual card transaction apparatuses, methods and systems
US8762263B2 (en) 2005-09-06 2014-06-24 Visa U.S.A. Inc. System and method for secured account numbers in proximity devices
US7739169B2 (en) 2007-06-25 2010-06-15 Visa U.S.A. Inc. Restricting access to compromised account information
US7937324B2 (en) 2007-09-13 2011-05-03 Visa U.S.A. Inc. Account permanence
US8219489B2 (en) 2008-07-29 2012-07-10 Visa U.S.A. Inc. Transaction processing using a global unique identifier
US9715681B2 (en) 2009-04-28 2017-07-25 Visa International Service Association Verification of portable consumer devices
US8893967B2 (en) 2009-05-15 2014-11-25 Visa International Service Association Secure Communication of payment information to merchants using a verification token
US8534564B2 (en) 2009-05-15 2013-09-17 Ayman Hammad Integration of verification tokens with mobile communication devices
US9105027B2 (en) 2009-05-15 2015-08-11 Visa International Service Association Verification of portable consumer device for secure services
US10846683B2 (en) 2009-05-15 2020-11-24 Visa International Service Association Integration of verification tokens with mobile communication devices
US9038886B2 (en) 2009-05-15 2015-05-26 Visa International Service Association Verification of portable consumer devices
US10140598B2 (en) 2009-05-20 2018-11-27 Visa International Service Association Device including encrypted data for expiration date and verification value creation
US10255591B2 (en) * 2009-12-18 2019-04-09 Visa International Service Association Payment channel returning limited use proxy dynamic value
EP2524471B1 (en) 2010-01-12 2015-03-11 Visa International Service Association Anytime validation for verification tokens
US9424413B2 (en) 2010-02-24 2016-08-23 Visa International Service Association Integration of payment capability into secure elements of computers
US9245267B2 (en) 2010-03-03 2016-01-26 Visa International Service Association Portable account number for consumer payment account
US9342832B2 (en) 2010-08-12 2016-05-17 Visa International Service Association Securing external systems with account token substitution
AU2012217606A1 (en) 2011-02-16 2013-05-09 Visa International Service Association Snap mobile payment apparatuses, methods and systems
US10586227B2 (en) 2011-02-16 2020-03-10 Visa International Service Association Snap mobile payment apparatuses, methods and systems
AU2012220669A1 (en) 2011-02-22 2013-05-02 Visa International Service Association Universal electronic payment apparatuses, methods and systems
US9280765B2 (en) 2011-04-11 2016-03-08 Visa International Service Association Multiple tokenization for authentication
US8447693B2 (en) * 2011-04-13 2013-05-21 Citicorp Credit Services, Inc. Methods and systems for routing payment transactions
US9727748B1 (en) * 2011-05-03 2017-08-08 Open Invention Network Llc Apparatus, method, and computer program for providing document security
US9582598B2 (en) 2011-07-05 2017-02-28 Visa International Service Association Hybrid applications utilizing distributed models and views apparatuses, methods and systems
US10121129B2 (en) 2011-07-05 2018-11-06 Visa International Service Association Electronic wallet checkout platform apparatuses, methods and systems
US9355393B2 (en) 2011-08-18 2016-05-31 Visa International Service Association Multi-directional wallet connector apparatuses, methods and systems
WO2013019567A2 (en) 2011-07-29 2013-02-07 Visa International Service Association Passing payment tokens through an hop/sop
US9710807B2 (en) 2011-08-18 2017-07-18 Visa International Service Association Third-party value added wallet features and interfaces apparatuses, methods and systems
US10242358B2 (en) 2011-08-18 2019-03-26 Visa International Service Association Remote decoupled application persistent state apparatuses, methods and systems
US10825001B2 (en) 2011-08-18 2020-11-03 Visa International Service Association Multi-directional wallet connector apparatuses, methods and systems
US10223730B2 (en) 2011-09-23 2019-03-05 Visa International Service Association E-wallet store injection search apparatuses, methods and systems
RU2631983C2 (en) 2012-01-05 2017-09-29 Виза Интернэшнл Сервис Ассосиэйшн Data protection with translation
US10223710B2 (en) 2013-01-04 2019-03-05 Visa International Service Association Wearable intelligent vision device apparatuses, methods and systems
US9830595B2 (en) 2012-01-26 2017-11-28 Visa International Service Association System and method of providing tokenization as a service
AU2013214801B2 (en) 2012-02-02 2018-06-21 Visa International Service Association Multi-source, multi-dimensional, cross-entity, multimedia database platform apparatuses, methods and systems
US10282724B2 (en) 2012-03-06 2019-05-07 Visa International Service Association Security system incorporating mobile device
US9916439B2 (en) * 2012-03-22 2018-03-13 Microsoft Technology Licensing, Llc Securing a computing environment against malicious entities
JP6007975B2 (en) * 2012-04-24 2016-10-19 日本電気株式会社 Format storage encryption apparatus, method and program, decryption apparatus, method and program
US20130297501A1 (en) 2012-05-04 2013-11-07 Justin Monk System and method for local data conversion
US9524501B2 (en) 2012-06-06 2016-12-20 Visa International Service Association Method and system for correlating diverse transaction data
US10607219B2 (en) 2012-06-11 2020-03-31 Visa International Service Association Systems and methods to provide privacy protection for activities related to transactions
WO2014008403A1 (en) 2012-07-03 2014-01-09 Visa International Service Association Data protection hub
US9256871B2 (en) 2012-07-26 2016-02-09 Visa U.S.A. Inc. Configurable payment tokens
US10332108B2 (en) * 2012-08-01 2019-06-25 Visa International Service Association Systems and methods to protect user privacy
US9665722B2 (en) 2012-08-10 2017-05-30 Visa International Service Association Privacy firewall
WO2014043278A1 (en) 2012-09-11 2014-03-20 Visa International Service Association Cloud-based virtual wallet nfc apparatuses, methods and systems
WO2014066559A1 (en) 2012-10-23 2014-05-01 Visa International Service Association Transaction initiation determination system utilizing transaction data elements
US9911118B2 (en) 2012-11-21 2018-03-06 Visa International Service Association Device pairing via trusted intermediary
WO2014087381A1 (en) 2012-12-07 2014-06-12 Visa International Service Association A token generating component
US10740731B2 (en) 2013-01-02 2020-08-11 Visa International Service Association Third party settlement
US9741051B2 (en) 2013-01-02 2017-08-22 Visa International Service Association Tokenization and third-party interaction
US11055710B2 (en) 2013-05-02 2021-07-06 Visa International Service Association Systems and methods for verifying and processing transactions using virtual currency
SG10202008740YA (en) 2013-05-15 2020-10-29 Visa Int Service Ass Mobile tokenization hub
US10878422B2 (en) 2013-06-17 2020-12-29 Visa International Service Association System and method using merchant token
CN103346886B (en) * 2013-07-01 2016-12-28 天地融科技股份有限公司 A kind of method sending signed data and electronic signature token
WO2015013548A1 (en) 2013-07-24 2015-01-29 Visa International Service Association Systems and methods for interoperable network token processing
EP3025291A4 (en) 2013-07-26 2016-06-01 Visa Int Service Ass Provisioning payment credentials to a consumer
SG10201801086RA (en) 2013-08-08 2018-03-28 Visa Int Service Ass Methods and systems for provisioning mobile devices with payment credentials
US10496986B2 (en) 2013-08-08 2019-12-03 Visa International Service Association Multi-network tokenization processing
WO2015054697A1 (en) 2013-10-11 2015-04-16 Visa International Service Association Network token system
US9978094B2 (en) 2013-10-11 2018-05-22 Visa International Service Association Tokenization revocation list
US10515358B2 (en) 2013-10-18 2019-12-24 Visa International Service Association Contextual transaction token methods and systems
US10489779B2 (en) 2013-10-21 2019-11-26 Visa International Service Association Multi-network token bin routing with defined verification parameters
US10366387B2 (en) 2013-10-29 2019-07-30 Visa International Service Association Digital wallet system and method
US8886570B1 (en) 2013-10-29 2014-11-11 Quisk, Inc. Hacker-resistant balance monitoring
US9922322B2 (en) 2013-12-19 2018-03-20 Visa International Service Association Cloud-based transactions with magnetic secure transmission
CA2931093A1 (en) 2013-12-19 2015-06-25 Visa International Service Association Cloud-based transactions methods and systems
US10433128B2 (en) 2014-01-07 2019-10-01 Visa International Service Association Methods and systems for provisioning multiple devices
US9846878B2 (en) 2014-01-14 2017-12-19 Visa International Service Association Payment account identifier system
US10026087B2 (en) 2014-04-08 2018-07-17 Visa International Service Association Data passed in an interaction
US9942043B2 (en) 2014-04-23 2018-04-10 Visa International Service Association Token security on a communication device
CN106233664B (en) 2014-05-01 2020-03-13 维萨国际服务协会 Data authentication using an access device
SG11201609216YA (en) 2014-05-05 2016-12-29 Visa Int Service Ass System and method for token domain control
CN106465112A (en) 2014-05-21 2017-02-22 维萨国际服务协会 Offline authentication
US11023890B2 (en) 2014-06-05 2021-06-01 Visa International Service Association Identification and verification for provisioning mobile application
US9780953B2 (en) 2014-07-23 2017-10-03 Visa International Service Association Systems and methods for secure detokenization
US10484345B2 (en) 2014-07-31 2019-11-19 Visa International Service Association System and method for identity verification across mobile applications
US9775029B2 (en) 2014-08-22 2017-09-26 Visa International Service Association Embedding cloud-based functionalities in a communication device
US10140615B2 (en) 2014-09-22 2018-11-27 Visa International Service Association Secure mobile device credential provisioning using risk decision non-overrides
WO2016049636A2 (en) 2014-09-26 2016-03-31 Visa International Service Association Remote server encrypted data provisioning system and methods
US11257074B2 (en) 2014-09-29 2022-02-22 Visa International Service Association Transaction risk based token
US10015147B2 (en) 2014-10-22 2018-07-03 Visa International Service Association Token enrollment system and method
GB201419016D0 (en) 2014-10-24 2014-12-10 Visa Europe Ltd Transaction Messaging
RU2708945C2 (en) 2014-11-26 2019-12-12 Виза Интернэшнл Сервис Ассосиэйшн Tokenization request via access device
BR112017011176A2 (en) 2014-12-12 2018-02-27 Visa Int Service Ass method, electronic device, and first electronic device
US10257185B2 (en) 2014-12-12 2019-04-09 Visa International Service Association Automated access data provisioning
US10096009B2 (en) 2015-01-20 2018-10-09 Visa International Service Association Secure payment processing using authorization request
US11250391B2 (en) 2015-01-30 2022-02-15 Visa International Service Association Token check offline
US10147087B2 (en) * 2015-03-06 2018-12-04 Mastercard International Incorporated Primary account number (PAN) length issuer identifier in payment account number data field of a transaction authorization request message
US10164996B2 (en) 2015-03-12 2018-12-25 Visa International Service Association Methods and systems for providing a low value token buffer
RU2019142493A (en) * 2015-03-17 2020-01-21 Виза Интернэшнл Сервис Ассосиэйшн TRANSACTION CHECK BY MULTIPLE DEVICES
CA2977427A1 (en) 2015-04-10 2016-10-13 Visa International Service Association Browser integration with cryptogram
US9998978B2 (en) 2015-04-16 2018-06-12 Visa International Service Association Systems and methods for processing dormant virtual access devices
US10552834B2 (en) 2015-04-30 2020-02-04 Visa International Service Association Tokenization capable authentication framework
CA2997379A1 (en) 2015-10-15 2017-04-20 Visa International Service Association Instant token issuance system
US10664843B2 (en) 2015-12-04 2020-05-26 Visa International Service Association Unique code for token verification
SG11201805266YA (en) 2016-01-07 2018-07-30 Visa Int Service Ass Systems and methods for device push provisioning
WO2017136418A1 (en) 2016-02-01 2017-08-10 Visa International Service Association Systems and methods for code display and use
US11501288B2 (en) 2016-02-09 2022-11-15 Visa International Service Association Resource provider account token provisioning and processing
US10313321B2 (en) 2016-04-07 2019-06-04 Visa International Service Association Tokenization of co-network accounts
CA3014875A1 (en) 2016-04-19 2017-10-26 Visa International Service Association Systems and methods for performing push transactions
US11250424B2 (en) 2016-05-19 2022-02-15 Visa International Service Association Systems and methods for creating subtokens using primary tokens
RU2018144220A (en) 2016-06-03 2020-07-09 Виза Интернэшнл Сервис Ассосиэйшн SUB-TOKEN MANAGEMENT SYSTEM FOR CONNECTED DEVICES
US11068899B2 (en) 2016-06-17 2021-07-20 Visa International Service Association Token aggregation for multi-party transactions
CN109328445B (en) 2016-06-24 2022-07-05 维萨国际服务协会 Unique token authentication verification value
AU2017295842A1 (en) 2016-07-11 2018-11-01 Visa International Service Association Encryption key exchange process using access device
AU2016415250A1 (en) 2016-07-19 2018-11-29 Visa International Service Association Method of distributing tokens and managing token relationships
US10509779B2 (en) 2016-09-14 2019-12-17 Visa International Service Association Self-cleaning token vault
US11005650B2 (en) * 2016-10-19 2021-05-11 Stripe, Inc. Systems and methods for data management and the use of salts and keys in data encryption/decryption
SG11201903468RA (en) 2016-11-28 2019-05-30 Visa Int Service Ass Access identifier provisioning to application
US10915899B2 (en) 2017-03-17 2021-02-09 Visa International Service Association Replacing token on a multi-token user device
US10902418B2 (en) 2017-05-02 2021-01-26 Visa International Service Association System and method using interaction token
US11494765B2 (en) 2017-05-11 2022-11-08 Visa International Service Association Secure remote transaction system using mobile devices
US10491389B2 (en) 2017-07-14 2019-11-26 Visa International Service Association Token provisioning utilizing a secure authentication system
CN111819555A (en) 2018-03-07 2020-10-23 维萨国际服务协会 Secure remote token issuance with online authentication
CN108428132B (en) 2018-03-15 2020-12-29 创新先进技术有限公司 Fraud transaction identification method, device, server and storage medium
US11256789B2 (en) 2018-06-18 2022-02-22 Visa International Service Association Recurring token transactions
SG11202101587SA (en) 2018-08-22 2021-03-30 Visa Int Service Ass Method and system for token provisioning and processing
WO2020102484A1 (en) 2018-11-14 2020-05-22 Visa International Service Association Cloud token provisioning of multiple tokens
WO2020236135A1 (en) 2019-05-17 2020-11-26 Visa International Service Association Virtual access credential interaction system and method

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5483595A (en) * 1993-09-20 1996-01-09 Seiko Communications Holding N.V. Paging device including password accessed stored cryptographic keys
US20030016821A1 (en) * 2000-03-29 2003-01-23 Vadium Technology, Inc. One-time-pad encryption with keyable characters
US20030149869A1 (en) * 2002-02-01 2003-08-07 Paul Gleichauf Method and system for securely storing and trasmitting data by applying a one-time pad
US20060049256A1 (en) * 2004-09-07 2006-03-09 Clay Von Mueller Transparently securing data for transmission on financial networks
US7020774B1 (en) * 1999-08-30 2006-03-28 Georges Marc Cornuejols Communications method and device
US8355982B2 (en) * 2007-08-16 2013-01-15 Verifone, Inc. Metrics systems and methods for token transactions

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
IL100238A (en) 1991-12-04 1995-01-24 Labaton Isaac J Device and method for credit accounts charging
US5477038A (en) * 1993-10-25 1995-12-19 Visa International Method and apparatus for distributing currency
US5500513A (en) * 1994-05-11 1996-03-19 Visa International Automated purchasing control system
US5781654A (en) * 1996-01-18 1998-07-14 Merrill Lynch & Co., Inc. Check authentication system utilizing payee information
JPH10133955A (en) * 1996-10-29 1998-05-22 Matsushita Electric Ind Co Ltd Portable medium driving device, its method, cooperative device of portable medium and network, and its method
US6163771A (en) * 1997-08-28 2000-12-19 Walker Digital, Llc Method and device for generating a single-use financial account number
US6445794B1 (en) * 1998-06-24 2002-09-03 Benyamin Ron System and method for synchronizing one time pad encryption keys for secure communication and access control
EP1350228A4 (en) * 2000-12-22 2008-04-16 Mei Inc Secure communications for a currency handling machine
US7428509B2 (en) * 2002-01-10 2008-09-23 Mastercard International Incorporated Method and system for detecting payment account fraud
US8762263B2 (en) * 2005-09-06 2014-06-24 Visa U.S.A. Inc. System and method for secured account numbers in proximity devices

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5483595A (en) * 1993-09-20 1996-01-09 Seiko Communications Holding N.V. Paging device including password accessed stored cryptographic keys
US7020774B1 (en) * 1999-08-30 2006-03-28 Georges Marc Cornuejols Communications method and device
US20030016821A1 (en) * 2000-03-29 2003-01-23 Vadium Technology, Inc. One-time-pad encryption with keyable characters
US20030149869A1 (en) * 2002-02-01 2003-08-07 Paul Gleichauf Method and system for securely storing and trasmitting data by applying a one-time pad
US20060049256A1 (en) * 2004-09-07 2006-03-09 Clay Von Mueller Transparently securing data for transmission on financial networks
US20070276765A1 (en) * 2004-09-07 2007-11-29 Hazel Patrick K Method and system for secured transactions
US20080040284A1 (en) * 2004-09-07 2008-02-14 Hazel Patrick K Method and system for secured transactions
US8355982B2 (en) * 2007-08-16 2013-01-15 Verifone, Inc. Metrics systems and methods for token transactions

Also Published As

Publication number Publication date
US20090063354A1 (en) 2009-03-05
WO2009032858A2 (en) 2009-03-12
WO2009032858A3 (en) 2009-05-07
US9070129B2 (en) 2015-06-30

Similar Documents

Publication Publication Date Title
US9070129B2 (en) Method and system for securing data fields
US10185956B2 (en) Secure payment card transactions
US20220156732A1 (en) Data protection with translation
US7841523B2 (en) Secure payment card transactions
US7770789B2 (en) Secure payment card transactions
ES2748847T3 (en) Secure payment card transactions
US7024395B1 (en) Method and system for secure credit card transactions
US20180315043A1 (en) Dynamic primary account number (pan) and unique key per card
US20180189790A1 (en) Method and system using candidate dynamic data elements
JP5519754B2 (en) System and method for secure account number in proximity device
US8281991B2 (en) Transaction secured in an untrusted environment
KR101456551B1 (en) Track data encryption
US20030061168A1 (en) Method for generating customer secure card numbers
EP1393271A2 (en) Systems and method for approval of credit/debit account transactions using a wireless device
KR100598573B1 (en) Creating and authenticating one time card data using smartcard and the system therefor
JP4903346B2 (en) Improved method and system for processing secure payments across computer networks without pseudo or proxy account numbers
KR100565546B1 (en) Finance correspondent system of security card give characteristic number for cipher algorism and method thereof, and media that can record computer program for method thereof
JP2019029680A (en) Processor, individual information protection system, token creation method, and token creation program
WO2002103642A2 (en) Method and system for secure credit card transactions

Legal Events

Date Code Title Description
STPP Information on status: patent application and granting procedure in general

Free format text: NON FINAL ACTION MAILED

STPP Information on status: patent application and granting procedure in general

Free format text: FINAL REJECTION MAILED

STPP Information on status: patent application and granting procedure in general

Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION

STPP Information on status: patent application and granting procedure in general

Free format text: FINAL REJECTION MAILED

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION