A method of identifying a caller with a telephone service operator. Of the invention, said method comprises the following steps: for the operator, drawing up a list of literal expressions and allocating the caller an identifier consisting of a combination of consecutive literal expressions taken from each of said lists, for the caller, connecting to said telephone service and speaking, in order, each literal expression of said combination, and for the operator, identifying the caller by using voice recognition to search for the combination of literal expressions allocated to the caller. Application to secure access to telephone services.
|
1. A method of identifying a caller with a telephone service operator, comprising the steps of:
for the operator, deriving at least one list of literal expressions and generating a database of callers authorized to use the telephone service, said database associating each of said authorized callers with a unique identifier consisting of a combination of consecutive literal expressions, each literal expression of the combination being respectively obtained from said at least one list of literal expressions;
for the caller, connecting to said telephone service and speaking, in order, each literal expression of said unique identifier associated therewith and of which said caller has prior knowledge;
for the operator, recognizing whether the literal expressions spoken by the caller belong to said at least one list of literal expressions and, if so, searching the database to compare the spoken combination of consecutive literal expressions to identifiers stored in the database; and
identifying the caller if the combination of literal expressions spoken by the caller and recognized by the operator matches an identifier in the database.
2. The method of identifying a caller according to
3. The method of identifying a caller according to
4. The method of identifying a caller according to
5. The method of identifying a caller according to
6. The method of identifying a caller according to
7. The method of identifying a caller according to
8. A prepaid telephone card which includes an identifier consisting of one or more literal expressions to be spoken by a caller to identify himself with a telephone service operator by the identification method according to
9. The prepaid telephone card according to
|
This is a U.S. National Phase Application under 35 USC 371 of International application No. PCT/FR01/02431, filed on 25 Jul. 2001.
The present invention relates to a method of identifying a caller with a telephone service company. It also relates to a prepaid telephone card for implementing the method.
The invention finds a particularly advantageous application in the field of secure access to telephone services.
In the remainder of this description, the expression “identification of a caller” refers either to identifying the caller as such or to identifying a telephone account of the caller to which the amount due for telephone calls is debited, whether the account be a prepaid account or a deferred debit account.
At present, for telephone services that necessitate identification of the caller, the latter enters in DTMF code a number of digits that varies depending on the type of service and on the telephone service company. The number of digits to be entered is generally from 10 to 20. However, in the case of a call made with an electronic microchip telephone card from a public telephone fitted with a card reader, the number of digits to be entered is reduced to the four digits of a personal identification number, because the number of the card is stored in the microchip and is recovered by the telephone and transmitted to the telephone service company over the network.
The ergonomics of that prior art method are somewhat limited because the caller must memorize a series of digits, which can be very long, and so a first improvement has been introduced that consists in re-using the caller's fixed or mobile telephone number, to which a personal identification number can be added.
That solution is particularly suitable for services accessed from the caller's main telephone installation, whose number is transmitted automatically by the network.
In the case of mobile services, that solution removes the difficulty of memorizing identification numbers, as a caller generally knows his own telephone number, but does not avoid the need to enter digits in DTMF code.
Prepaid cards also employ that solution, by means of the facility for associating a prepaid card with a given telephone line, usually the one that the user employs most often to make calls using the card.
The above-described identification method is satisfactory in the case of access to telephone services from a fixed or a mobile terminal, in which case the identifier of the caller consists of the telephone number associated with the terminal, possibly with the addition of a personal identification number.
Nevertheless, in a mobile situation, the ergonomics remain somewhat irksome as the caller must still make a long and even painstaking (to avoid miskeying, etc.) entry in DTMF code, not forgetting that the user also has to remember his personal identification number.
Finally, for some services security is limited as the caller's telephone number is often known to third parties, so that a fraudster needs only to discover the personal identification number, if there is one.
A caller must still enter the entire number if using his prepaid telephone card at a telephone that is not associated with the card, as when making a call from a public telephone or away from home.
This phase is particularly difficult for prepaid cards, since for security reasons the number cannot be personalized. As a series of more than ten digits is generally very difficult to remember, the user must keep the card on his person at all times and take it out each time a call is made, in order to enter its number.
One object of the invention is to provide a way of identifying a caller with a telephone service company by a method that has improved ergonomics compared to the prior art method, in particular with regard to memorizing the identifier, while enhancing security.
This and other objects are attained in accordance with one aspect of the present invention directed to a method that comprises the following steps:
The identification method of the invention is therefore based on voice recognition, for which existing technologies, in particular flexible multi-speaker voice recognition, are already able to recognize a spoken literal expression from among several thousand, the only condition being that it must be known which list contains the literal expression to be recognized. Generally speaking, a literal expression comprises a single word or a meaningful set of words, such as “Everything is OK”.
In the case of a non-personalized service, such as a prepaid telephone card, an identifier (e.g., a combination of literal expressions) is provided on the card.
Compared to spoken or DTMF code entry of a multidigit identifier, the advantages of an identification method of the invention using voice recognition of a combination of literal expressions are:
An identification method of the invention can be made secure in two ways.
A first way is to increase the number of potential combinations of literal expressions and allocate a limited number of such combinations as identifiers. If all possible combinations of literal expressions are known, the security ratio is the ratio of the number of possible combinations to the number of identifiers actually allocated. The hypothesis that all potential identifiers are known is much less probable with literal expressions than with digits, as the vocabulary is richer than the number of digits, which is limited to 10. Of course, the number of possible combinations can be further increased by increasing the number of lists of literal expressions used to formulate the identifier.
In a second security mode conforming to the invention, an authentication key is associated with the identifier and the caller provides the authentication key after speaking the combination of literal expressions allocated to him.
There are several variants of the authentication key associated with the identifier.
In a first variant, the authentication key is a number of digits to be entered in DTMF code.
In a second variant, the authentication key is another literal expression recorded by the caller the first time he connects to the telephone service.
In a third variant, the authentication key is a voiceprint of the caller established on speaking the combination of literal expressions.
Finally, associating a double authentication key with the identifier can be envisaged, comprising a main key consisting of a voiceprint and a back-up key consisting of a plurality of digits to be entered in DTMF code. This advantageous feature remedies situations in which the voiceprint of the caller cannot be recognized (for example because the caller is hoarse). In this case, the telephone service company, having determined that it is impossible to recognize the main key, requires the caller to provide his back-up key.
In a particular implementation callers may be provided with the facility to deactivate the authentication key, which reduces security but improves ergonomics.
The following description with reference to the accompanying drawings, which are provided by way of non-limiting example, explains in what the invention consists and how it can be put into effect.
Implementations of a method in accordance with the invention of identifying a caller with a telephone service are described below with reference to
They are all based on the capabilities of existing voice recognition systems to recognize a word in a list of N words, where N is of the order of several thousand, and have in common the following steps:
The
If each list includes 3000 literal expressions, so that 6000 literal expressions must be defined for the two lists, taking all possible pairs of the literal expressions contained in the two lists produces a total of 9,000,000 identifiers.
The total number of identifiers actually used can greatly exceed the above number, especially if the identifiers are associated with circulating prepaid telephone cards (with each card having a word1/word2 combination when two lists are used, so a card A would be represented as having the combination word1cardA+word2cardA), the number of which can greatly exceed a few tens of millions; in this case, it is all of the possible word1/word2 combinations that form the set of recognized identifiers.
However, in the fight against fraud, this solution has the limitation that all word1/word2 pairs are valid a priori. By purchasing a card A and a card B, a would-be fraudster could obtain two new valid combinations, namely “word 1 card A+word 2 card B” and “word 1 card B+word 2 card A”.
To prevent all possibility of fraud, it is advantageous to provide a complementary authentication key with the identifier of the caller. Each word1/word2 combination is then authenticated by an authentication key.
The authentication key can be four digits to be entered in DTMF code, another literal expression recorded by the caller the first time he connects to the telephone service, or a voiceprint that is established during the first few calls on the basis of the spoken combinations of N words constituting the identifier of the caller. For example, as soon as the voiceprint is considered to be sufficiently reliable, voice authentication is activated and substituted for the digits entered in DTMF code. Authentication is then effected by comparing the voiceprint of the sound signal heard during identification with the stored voiceprint.
For improved ergonomics, there can be provision for the caller to deactivate the authentication key.
Thus the number of potential identifiers can be greatly increased and security greatly enhanced without degrading the ergonomics, i.e. still limiting to two the number of literal expressions constituting the identifier.
In the
The valid combinations are thus the pairs “word 1 category n list 1+word 2 list 2 associated with category n”.
Clearly, unlike the previous situation, if a fraudster were to purchase two prepaid cards A and B, he could not be sure that the combinations “word 1 card A+word 2 card B” and “word 1 card B+word 2 card A” would be valid.
Taking 5000 literal expressions for the first list and five categories of second lists, each of 2000 literal expressions, 10,000,000 combinations are obtained by defining 15,000 expressions for the various lists.
Of course, an authentication key as defined above can be associated with the identifier determined as shown in
To be more precise, the identifiers that can be allocated to callers consist of a combination of three successive literal expressions each taken from one of three lists of literal expressions drawn up beforehand.
In the case of prepaid cards, by purchasing a card A and a card B a fraudster could potentially obtain six new combinations that might be valid, namely “word 1 card A+word 2 card A+word 3 card B”, “word 1 card A+word 2 card B+word 3 card A”, etc.
A probability calculation shows that a total of 125,000,000,000 combinations is obtained by defining 5000 literal expressions per list. Also, if the installed base of cards contains 10,000,000 units, it can be deduced that the probability of a person who knows all 5000 words finding a valid combination is one in 12,500 on each attempt.
Since in practice it seems very improbable that a person could know all the literal expressions, the security of the
The prepaid card includes, in an area to be scratched off, an identifier consisting of one or more literal expressions to be spoken by a purchaser to identify himself with a telephone service company by an identification method of the invention. By way of redundancy, the card can also include, in another area to be scratched off, a multidigit code to be used if voice recognition is not possible (for example in a noisy environment). Similarly, the card can further include an authentication key.
Charlet, Delphine, Grimault, Jean-Luc, Morel, Thierry, Feuillet, Thibaut
Patent | Priority | Assignee | Title |
8468584, | Apr 02 2010 | Wells Fargo Bank, N.A. | Authentication code with associated confirmation words |
Patent | Priority | Assignee | Title |
5479494, | Oct 05 1992 | AT&T IPM Corp | Virtual calling card system |
5517558, | May 15 1990 | Nuance Communications, Inc | Voice-controlled account access over a telephone network |
5737701, | Oct 03 1995 | AT&T Corp | Automatic authentication system |
6173261, | Sep 30 1998 | AT&T Properties, LLC; AT&T INTELLECTUAL PROPERTY II, L P | Grammar fragment acquisition using syntactic and semantic clustering |
6389397, | Dec 23 1998 | Alcatel Lucent | User identification system using improved voice print identification processing |
DE4443226, | |||
EP756410, | |||
WO9716915, |
Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
Jul 25 2001 | France Telecom | (assignment on the face of the patent) | / | |||
Feb 04 2003 | FEUILLET, THIBAUT | France Telecom | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 014400 | /0883 | |
Feb 05 2003 | GRIMAULT, JEAN-LUC | France Telecom | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 014400 | /0883 | |
Feb 05 2003 | MOREL, THIERRY | France Telecom | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 014400 | /0883 | |
Feb 10 2003 | CHARLET, DELPHINE | France Telecom | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 014400 | /0883 |
Date | Maintenance Fee Events |
May 25 2009 | M1551: Payment of Maintenance Fee, 4th Year, Large Entity. |
May 26 2009 | ASPN: Payor Number Assigned. |
May 27 2013 | M1552: Payment of Maintenance Fee, 8th Year, Large Entity. |
Jul 14 2017 | REM: Maintenance Fee Reminder Mailed. |
Jan 01 2018 | EXP: Patent Expired for Failure to Pay Maintenance Fees. |
Date | Maintenance Schedule |
Dec 06 2008 | 4 years fee payment window open |
Jun 06 2009 | 6 months grace period start (w surcharge) |
Dec 06 2009 | patent expiry (for year 4) |
Dec 06 2011 | 2 years to revive unintentionally abandoned end. (for year 4) |
Dec 06 2012 | 8 years fee payment window open |
Jun 06 2013 | 6 months grace period start (w surcharge) |
Dec 06 2013 | patent expiry (for year 8) |
Dec 06 2015 | 2 years to revive unintentionally abandoned end. (for year 8) |
Dec 06 2016 | 12 years fee payment window open |
Jun 06 2017 | 6 months grace period start (w surcharge) |
Dec 06 2017 | patent expiry (for year 12) |
Dec 06 2019 | 2 years to revive unintentionally abandoned end. (for year 12) |