Abstract:
A method for orchestrating peer authentication during a call (e.g., a telephone call, a conference call between three or more parties, an instant messaging [IM] chat session, etc.) is disclosed. In particular, a user is first authenticated in order to participate in a call (e.g., via entering a password, etc.), and subsequently during the call the user may be peer authenticated. In accordance with the illustrative embodiment, a user who participates in a call might be prompted to authenticate another user on the call based on particular events or user behavior during the call.

Description:
CROSS REFERENCE TO RELATED APPLICATIONS 
     The underlying concepts, but not necessarily the language, of the following case are incorporated by reference: 
     U.S. patent application Ser. No. 11/832,574, filed 1 Aug. 2007, which is published as U.S. Patent Application Publication No. 2009/0037985. If there are any contradictions or inconsistencies in language between this application and the case that has been incorporated by reference that might affect the interpretation of the claims in this case, the claims in this case should be interpreted to be consistent with the language in this case. 
     FIELD OF THE INVENTION 
     The present invention relates to security in general, and, more particularly, to authentication. 
     BACKGROUND OF THE INVENTION 
     Peer authentication is a method by which a first user is authenticated by a second user. (Note that, as in the term peer-to-peer communication, the word “peer” is used generically and has no connotation regarding the professional or social standing of the users.) An example of peer authentication is illustrated by the following familiar scenario: an employee in the lobby of a corporate building realizes that she accidentally left her corporate badge at home, and that therefore she will not be allowed to enter the building proper without some other means of authentication. She therefore approaches the guard in the lobby and tells the guard that she is an employee, but that she doesn&#39;t have her badge. 
     The guard then:
         asks the employee for her name;   looks up the name in a computer database;   notes the employee&#39;s office number;   submits a query to the database to determine who the employee&#39;s officemate is; and   calls the officemate, asking him to come to the lobby to identify the alleged employee.       

     The officemate arrives at the lobby, and then either:
         verifies that the alleged employee is indeed an employee of the company, or   tells the guard that he does not recognize the alleged employee.
 
In the former case, the guard issues the employee temporary identification and permits both employees to advance past the lobby, while in the latter case, the guard stops the alleged employee from advancing past the lobby, and perhaps takes some additional action (e.g., calls the police, etc.).
       

     In a variation of the above scenario, the guard, rather than asking the officemate to come to the lobby, might ask the officemate to talk to the alleged employee over the phone. The officemate talks to the alleged employee over the phone, and determines whether the alleged employee is in fact who she claims to be, based on the telephone conversation (e.g., based on her voice, based on her answers to one or more questions, etc.). The officemate then informs the guard whether the alleged employee should be allowed to advance past the lobby. 
     SUMMARY OF THE INVENTION 
     The present invention provides a mechanism for orchestrating peer authentication during an ongoing electronic communication session, which we will term a call (e.g., a telephone call, a conference call between three or more parties, an instant messaging [IM] chat session, etc.). The mechanism is particularly useful in detecting malicious behavior that might occur during a conference call. For example, during an important business conference call—say, concerning the merger of two corporations—one of the participants might have to sneak out of his office momentarily for a bathroom break, during which a malicious user could come in to the office and overhear confidential information, or even impersonate the other person. 
     In accordance with the illustrative embodiment of the present invention, a user is first authenticated in order to participate in a call (e.g., via entering a password, etc.), and subsequently during the call the user may be peer authenticated. In particular, a user who participates in a call might be prompted to authenticate another user on the call based on particular events or user behavior during the call. For example, if a first user is silent for a given length of time during the call, a second user on the call (i.e., a “peer”) might be prompted to authenticate the first user (the theory being that, perhaps, another person has maliciously taken the first user&#39;s place and is passively listening to the call). As another example, if a first user is participating in a call via a wireless telecommunications terminal, a second user on the call might be prompted to authenticate the first user if the first user has entered a public area in which there is a greater likelihood of malicious behavior. 
     In accordance with the present invention, a peer might be prompted to authenticate a user in a variety of ways. In some embodiments, for example, a text message might appear on the display of the peer&#39;s terminal, asking the peer whether or not a particular user&#39;s voice sounds correct. Alternatively, in some other embodiments of the present invention, a text message might prompt the peer to (1) ask a particular user a question that only the actual user would know the answer to, and (2) enter a number between 1 and 5 indicating the peer&#39;s confidence in the user&#39;s identity. 
     When there are three or more users participating in a call, then in some embodiments of the present invention the selection of the peer might occur randomly, while in some other embodiments the selection might be based on a variety of criteria (e.g., based on an indication of how well the users know each other, as disclosed in U.S. patent application Ser. No. 11/832,574, which is published as U.S. Patent Application Publication No. 2009/0037985, incorporated by reference, etc.) 
     The illustrative embodiment comprises: presenting an authentication challenge to a first user who wishes to participate in a call; admitting the first user to the call when the authentication challenge is met; and generating during the call, after the admission of the first user, a signal that prompts a second user participating in the call to authenticate the first user. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         FIG. 1  depicts a flowchart of salient tasks of the method of the present invention, in accordance with the illustrative embodiment of the present invention. 
         FIG. 2  depicts a detailed flowchart for task  170 , as shown in  FIG. 1 , in accordance with the illustrative embodiment of the present invention. 
     
    
    
     DETAILED DESCRIPTION 
     For the purposes of this specification, the term “peer” is defined as a user. In accordance with the illustrative embodiment, two users are considered peers if they participate in a particular call; the term does not impose any constraints on the relative ranks, status, etc. of the users. 
       FIG. 1  depicts a flowchart of salient tasks of the method of the present invention, in accordance with the illustrative embodiment of the present invention. As will be appreciated by those skilled in the art, in some embodiments of the present invention one or more tasks of  FIG. 1  might be performed by a telecommunications terminal, while in some other embodiments, one or more tasks of  FIG. 1  might be performed by another telecommunications or data-processing system (e.g., a teleconferencing system, a private branch exchange [PBX], a gateway, a server, etc.), while in still some other embodiments, the tasks of  FIG. 1  might be performed by different entities (for example, task  110  performed by the user of a terminal, task  120  performed by the terminal itself, task  130  performed by a gateway, and so forth). In any case, it will be clear to those skilled in the art, after reading this disclosure, how to make and use such embodiments of the present invention. Moreover, it will be clear to those skilled in the art, after reading this disclosure, which tasks depicted in  FIG. 1  can be performed simultaneously or in a different order than that depicted. 
     At task  110 , user U attempts to participate in a call via his or her telecommunications terminal T, in well-known fashion. 
     At task  120 , user U is presented with one or more authentication challenges (e.g., a username/password challenge, etc.), in well-known fashion. 
     At task  130 , the method branches based on whether the authentication challenge(s) presented at task  120  were met by user U. If so, execution continues at task  140 , otherwise, the method of  FIG. 1  terminates. 
     At task  140 , user U is admitted to the call, and the current time and geo-location of terminal Tare recorded, in well-known fashion. 
     Task  150  determines whether user U should be peer authenticated based on a variety of criteria, including:
         the current time,   the time at which user U was admitted to call,   the time of the most recent peer authentication of user U (if any),   the current geo-location of terminal T,   the geo-location history of terminal T during the call,   the current geo-locations of other call participants&#39; terminals,   one or more rules concerning user U&#39;s speech, and   one or more rules concerning terminal geo-locations and history.       

     Some examples of rules concerning user U&#39;s speech might include:
         peer authenticate when user U speaks for the first time   peer authenticate when user U has been silent for at least N seconds, where N is a positive number   peer authenticate when user U speaks for the first time after being silent for at least M seconds, where M is a positive number   peer authenticate when user U speaks for less than a given fraction f of the time over a given time interval       

     Some examples of rules concerning terminal geo-locations and history might include:
         peer authenticate when terminal T moves to a new geo-location   peer authenticate every K minutes when terminal T is in an area that is deemed to be particularly vulnerable to security attacks, where K is a positive number   peer authenticate when terminal T has been in three or more different areas in the last L minutes, where L is a positive number   peer authenticate when terminal T has moved from being within 5 meters of another call participant to being at least 100 meters away from any other call participant       

     At task  160 , the method branches based on whether it was determined at task  150  to peer authenticate user U. If so, execution continues at task  170 , otherwise, execution proceeds to task  185 . 
     At task  170 , peer authentication of user U is performed, as described in detail below and with respect to  FIG. 2 . 
     At task  180 , the method branches based on whether the verdict received by the peer is deemed to be “satisfactory”. As described below and with respect to task  230  of  FIG. 2 , in some embodiments of the present invention the peer might provide a simple yes/no verdict, while in some other embodiments, the peer might provide a degree of confidence (e.g., an integer between 1 and 5 inclusive, etc.). As will be appreciated by those skilled in the art, in the latter case, the notion of whether a verdict is judged satisfactory is an implementation-specific issue that might be determined by a systems administrator, a Chief Information Officer of an enterprise, a programmer, etc. 
     If the verdict is satisfactory, execution continues at task  185 , otherwise execution continues at task  195 . 
     At task  185 , the current geo-locations of the call participants&#39; terminals are recorded, and information about user U&#39;s speech is updated (e.g., how long user U has been silent, the fraction of time during the call that user U speaks, etc.). 
     Task  190  checks whether the call has terminated or user U has hung up. If either of these events has occurred, the method of  FIG. 1  terminates, otherwise execution continues back at task  150 . 
     At task  195 , user U is disconnected from the call, and any appropriate action is taken (e.g., alerting security personnel, etc.). After task  195 , the method of  FIG. 1  terminates. 
       FIG. 2  depicts a detailed flowchart for task  170 , in accordance with the illustrative embodiment of the present invention. 
     At task  210 , a peer P is selected from among the call participants for authenticating user V. (Naturally, if there is only one other call participant besides user V, then that person must be peer P.) As will be appreciated by those skilled in the art, there are a variety of possible criteria by which a peer might be selected; several such criteria, along with selection methods based on these criteria, are disclosed in U.S. patent application Ser. No. 11/832,574, which is published as U.S. Patent Application Publication No. 2009/0037985, which is incorporated by reference. 
     At task  220 , peer P is prompted to authenticate user U (e.g., via a text message, via an audible message, etc.). As will be appreciated by those skilled in the art, in some embodiments of the present invention the prompting might specify particular instructions for authenticating user U (e.g., “ask user U a question only he or she would know”, etc.), while in some other embodiments, the prompt might simply ask peer P to indicate whether he thinks user U is who she claims to be. 
     At task  230 , the “verdict” from peer P (e.g., a yes/no answer, a degree of confidence on a numerical scale, etc.) is received. After task  230 , execution continues at task  180  of  FIG. 1 . 
     It is to be understood that the disclosure teaches just one example of the illustrative embodiment and that many variations of the invention can easily be devised by those skilled in the art after reading this disclosure and that the scope of the present invention is to be determined by the following claims.