1. Field
This application relates generally to wireless communication and more specifically, but not exclusively, to synchronization tests for device authentication.
2. Background
Wireless devices may employ a pairing process in an attempt to form a level of trust with one another in conjunction with authenticating with each other or exchanging cryptographic keys that may be used for services that are protected by cryptographic techniques. For example, in Bluetooth, authentication between two devices may involve the exchange of a passcode between the devices. In some implementations such a procedure may involve the use of a sophisticated user interface for passcode input. Conversely, in implementations that employ relatively simple user interface devices for passcode input, the associated provisioning cost may be relatively high. Moreover, a typical passcode used by users may be four to eight digits long, which may not be strong enough to prevent the security of the devices from being compromised by conventional cryptanalysis.
Bluetooth V2.1 proposes using elliptic curve Diffie-Hellman for key exchange. Here, based on a secret derived from elliptic curve Diffie-Hellman, device authentication may be based on numeric comparison or passkey entry. However, these methods may utilize a sophisticated user interface and may be relatively susceptible to man-in-the-middle attacks.
Near field communication technology also may be used for device authentication. For example, near field communication devices may be designed to perform a handshake only when they are brought within a defined “touching” distance of each other. It may be possible, however, to design a near field communication device with a custom antenna that extends the working distance for the handshake. In this case, an unauthorized person or device may be able to authenticate with another device from relatively long range thereby thwarting the security otherwise provided the requirement of relatively close proximity of the devices. Consequently, authentication that is based on a relatively small touching distance as provided by near field communication may not provide a sufficient level of security.
A summary of sample aspects of the disclosure follows. It should be understood that any reference to aspects herein may refer to one or more aspects of the disclosure.
The disclosure relates in some aspects authenticating devices or performing other similar operations based on the ability of a human to synchronize the movements of his or her fingers. For example, a person may be able to press or release two buttons in a simultaneous manner or in a substantially simultaneous manner. In contrast, it may be relatively difficult for an onlooker to anticipate and synchronize to the timings of the finger movements of the other person. Consequently, a pairing procedure for two wireless devices may involve a synchronization test that is based on the relative timing of actuations of input devices on each of the wireless devices. Here, it is unlikely that an onlooker would be able to press or release a button on his or her own wireless device in an attempt to interfere with the pairing of the wireless devices by the other person.
In some aspects, for purposes of device authentication, presence management, or other operations a pair of wireless devices may be deemed trustable with respect to one another if the same person is physically holding the two wireless devices. Consequently, when two wireless devices being held by the same person communicate with each other, a message sent by a first one of the wireless devices relating to a local synchronization event (e.g., actuation of a user input device) at the first device may be deemed trustable by a second one of the wireless devices that receives the message. To ensure that the same person is holding the devices, the receiving device verifies that the timing of the received message is substantially synchronized with a similar local synchronization event at the second device. Consequently, an authentication or other similar procedure may involve determining whether an input device on a first device is actuated (e.g., depressed and/or released) at substantially the same time or times that an input device on a second device is actuated.
The disclosure relates in some aspects to a synchronization test that involves determining whether actuations of user input devices on two different wireless devices occurred within a defined time interval with respect to one another. Here, a user may be instructed to simultaneously actuate a user input device on each wireless device. A first one of the wireless devices may determine the actuation time associated with a second one of the wireless devices based on the time at which the first device receives a message from the second device relating to the actuation of the second device. The first device may thus compare the actuation time of its user input device with the time it received the message from the second device. The second device may perform a similar synchronization test. In the event the synchronization tests pass on both devices, the devices may authenticate one another. In some aspects a cryptographic key agreement scheme may be employed in conjunction with the synchronization tests. In addition, in some aspects the synchronization tests may be based on the timings of more than one actuation of each user input device.
The disclosure relates in some aspects to a synchronization test that involves comparing time intervals between multiple actuations of user input devices on two different wireless devices. Here, a user may be instructed to simultaneously actuate a user input device on each wireless device in a repeated (e.g., random) manner. That is, the user may repeatedly actuate each user input device at the same time. In this way a set of time intervals corresponding to the times between actuations will be defined on each wireless device. Each of the devices may then send a commitment value (e.g., a hash code or a message authentication code) that is based on its set of time intervals to the other device. The description that follows describes the use of a hash value, a message authentication code or other schemes to illustrate sample ways to implement a commitment scheme. It should be appreciated that other cryptographic techniques may be used to generate a commitment value in accordance with the teachings herein. As one step of the verification process, each of the devices may compare an actuation time of its user input device with the time it received the commitment (e.g., hash) message from the other device. Assuming this step of the verification process passes, after a delay period the devices may each send its set of time intervals to the other device. In this way, in another step of the verification process the devices may determine whether corresponding pairs of time intervals from each of the two sets of time intervals are sufficiently similar. In addition, in yet another step of the verification process, the devices may generate a commitment (e.g., hash) value based on the set of time intervals it received from the other device and compare that commitment value with the commitment value it previously received from the other device to verify that both received messages relate to the same set of time intervals. In the event the synchronization tests pass on both devices, the devices may authenticate one another.
These and other aspects of the disclosure will be more fully understood when considered with respect to the following detailed description, appended claims, and accompanying drawings, wherein:
The various features illustrated in the drawings may not be drawn to scale and may be simplified for clarity. Consequently, the drawings may not depict every aspect of a particular apparatus (e.g., device) or method. In addition, similar reference numerals may be used to denote similar features herein.
Various aspects of the disclosure are described below. It should be apparent that the teachings herein may be embodied in a wide variety of forms and that any specific structure, function, or both being disclosed herein is merely representative. Based on the teachings herein one skilled in the art should appreciate that an aspect disclosed herein may be implemented independently of any other aspects and that two or more of these aspects may be combined in various ways. For example, an apparatus may be implemented or a method may be practiced using any number of the aspects set forth herein. In addition, such an apparatus may be implemented or such a method may be practiced using other structure, functionality, or structure and functionality in addition to or other than one or more of the aspects set forth herein. As an example of the above, as discussed below first and second actuation timing-related indications may be compared to determine whether at least one time of actuation of a first user input device is sufficiently similar to at least one time of actuation of a second user input device. In some aspects each of the at least one time of actuation of the first and second user input devices relates to a single time of actuation of each input device. In contrast, in some aspects each of the at least one time of actuation of the first and second user input devices relates to a set of time intervals defined by a series of actuations of each of the input devices.
Sample operations of the system 100 will be discussed in more detail in conjunction with the flowchart of
As represented by block 202 of
In some aspects the pairing mode may be initiated through the use of user interfaces 106 and 108 of the devices 102 and 104, respectively. For example, a user may actuate input devices 110 and 112 of the user interfaces 106 and 108, respectively, to commence the pairing mode. In conjunction with these operations, the user interfaces 106 and 108 may respectively include output devices 114 and 116 that provide one or more indications relating to the progress of the pairing mode operations. As an example, once the devices 102 and 104 are ready to commence a synchronization test an appropriate indication may be generated by one or both of the output devices 114 and 116 to inform the user that he or she should simultaneously actuate the input devices 110 and 112.
The user interfaces 106 and 108 may be implemented in a variety of ways. For example, in some implementations, each device 102 and 104 has a user input device (e.g., a button-type switch) and at least one of the devices 102 and 104 has a relatively simple user output device (e.g., a LED). As an example, a device 102 (e.g., a mobile phone) may have a keypad and a display screen that may serve as the user input device 110 and the user output device 114, respectively. The device 104 may then simply employ a button or some other user input device 112 that the user may actuate in conjunction with the actuation of the keypad. In this case, an indication may be provided on the display screen to inform the user when to commence simultaneous actuation of the input devices 110 and 112.
In general, a user input device may comprise one or more of a variety of components that enable a user to provide some form of input to an associated device. For example, the user input device may comprise one or more switches such as a pushbutton or a keypad. The user input device also may comprise a touch-screen, a touchpad, or other similar input mechanism. The user input device may comprise a pointing device such as a mouse, trackball, an electronic pen, a pointing stick, etc. The user input device also may be adapted to receive other forms of input such as an audio (e.g., voice) input, an optical-based input, an RF-based input, or some other suitable form of input.
As represented by block 204 of
To enable each device to compare its actuation timing with the actuation timing of the other device, each of the devices may transmit one or more indications relating to its actuation timing to the other device. For example, upon actuation of the input device 110 a transceiver 118 (e.g., including transmitter and receiver components) of the device 102 may transmit a message to a similar transceiver 120 of the device 104 to indicate that the input device 110 has been actuated. In addition, the indication may include information relating to the timing of that actuation (e.g., the time of actuation or a set of time intervals defined by multiple actuations). As discussed below conjunction with
As represented by block 206, the device 104 (e.g., the transceiver 120) may thus receive one or more indications from the device 102 relating to the timing of one or more actuations for the device 102, and vice versa. As mentioned above, in some implementations the indication of block 206 may simply comprise the time at which a message was received from the other device.
As represented by block 208, authentication processors 122 and 124 on each device may then compare one or more indications relating to its actuation timing with one or more received indications that relate to the actuation timing of the other device. For example, as discussed below conjunction with
As represented by block 210, if the results above the above synchronization tests indicate that there is a sufficient probability that the input devices 110 and 112 were actuated by the same person, the devices 102 and 104 may complete the pairing process. For example, in some implementations the authentication processor 122 of the device 102 may authenticate the device 104, and the authentication processor 124 of the device 104 may authenticate the device 102. In conjunction with this operation or at some other point in time, the devices 102 and 104 may exchange or otherwise cooperate to create one or more cryptographic keys to facilitate secure communications between the devices or to facilitate some other form of device interaction.
In some implementations the synchronization test may be performed before the commencement of an authentication procedure (e.g., as a prerequisite to commencing an authentication procedure) or as part of an authentication procedure. In addition, in some implementations a synchronization test may serve as both a prerequisite to an authentication procedure and form a part of an authentication procedure.
With the above overview in mind, additional details relating to one type of synchronization test will be discussed in conjunction with the flowchart of
For illustration purposes, the operations of
In addition, for convenience the operations of both an initiator device and responder device will be discussed in conjunction with the single wireless device 400 depicted in
At blocks 302 and 304 the two devices are set to pairing mode. In some implementations pairing mode may be initiated by a user using a user interface (e.g., interface 106 in
In
In some implementations similar operations may be performed here by the responding devices. Alternatively, one of the devices may simply be set to pairing mode upon reception of an appropriate message from the other device. In this case, a receiver 410 may receive the message from the other device and provide the associated information to the pairing mode controller 402 that invokes pairing mode operations on that device (e.g., device 104).
The devices 102 and 104 may be in pairing mode for a designated period of time (e.g., for Tpair
In some implementations the initiator device and/or the responder device may generate an indication to inform the user when to commence actuating the input devices of the initiator and responder devices. Such an indication may comprise, for example, a visual command on a display, a specific configuration of lighting elements (e.g., turning on or turning off LEDs), a vibration, or an audio command.
At block 306 the initiator device waits until its local input device (e.g., device 404) has been actuated. As mentioned above, in some implementations this may involve a user pressing a button of the initiator device at the same time he or she presses a button on the responder device. Once the initiator device detect the local actuation event, at block 308 a timing indicator 412 and the transmitter 408 of the initiator device cooperate to transmit a pair-request message to the responder device. The receiver 410 of the responder device receives this pair-request message as represented by block 310. As mentioned above, this time at which this message is received may serve as an indication as to the timing of the actuation at block 306.
Similar to the initiator device operation of block 306, at block 312 the responder device waits until its local input device (e.g., device 404) has been actuated. In practice, the detection operation of block 312 may be made before or after the pair-request message is received at block 310, depending on the relative timings of the actuations of the devices and the processing time for each device to identify an actuation and to process the pair-request message.
At block 314 a comparator 414 of the responder device compares the timing of the actuation of block 312 with the timing of the receipt of the request message at block 310. The operation may involve, for example, determining the difference between these two timings and comparing the resulting difference with a threshold.
For example, assuming the button was pressed (block 312) before the pair-request message was received, upon receipt of the pair-request message the comparator 414 may compare the current time t with the recorded timing of a button-pressing event at block 312, denoted by Tresp
Here, Tmax denotes the maximal allowable time interval between t and Tresp
As represented by block 316, if the synchronization test did not pass the responder device transmits a pair-deny message at block 318 to the initiator device. The operations of both devices may then go back to the beginning of the pairing process. In this case, there may be no change in the user interface (e.g., LED still blinking).
If, on the other hand, the synchronization test did pass at block 316, the pairing process may continue. In some implementations the synchronization test involves multiple actuations by the user. For example, a subsequently detected actuation may involve the user releasing the buttons. Consequently, one or both of the devices may inform the user to keep holding the buttons (e.g., as indicated by maintaining the LED continuously ON). It should be appreciated here that similar functionality may be provided in other ways (e.g., by waiting for the local button to be pressed again).
At block 320 the responder device than waits for a defined period of time before performing the next operation (e.g., waiting for another actuation). Similarly, as represented by block 322, the initiator device waits for the defined period of time after transmitting a message at block 308 before performing its next operation (e.g., waiting for another actuation). Here, the defined period of time may comprise a fixed time TFIXED plus a random time TRAND.
At block 324 the responder device waits until its local button is released. Here, at the expiration of the time period of block 320, the responder device may inform the user to simultaneously release the two buttons (e.g., LED blinking).
As represented by block 326, once the local actuation is detected at block 324, the responder device transmits a pair-acknowledgment message to the initiator device. Again, this operation may be performed by the cooperation of the timing indicator 412 and the transmitter 408 of the responder.
The receiver 410 of the initiator device receives this pair-acknowledgement message as represented by block 328. The time at which this message is received may thus serve as an indication as to the timing of the actuation at block 324.
As represented by block 330, the initiator device waits until its local input device (e.g., device 404) has again been actuated. As mentioned above, in some implementations this may involve the user releasing a button or performing some other suitable act. In practice, the detection operation of block 330 may occur before or after the pair-request message is received at block 328.
At block 332 the comparator 414 of the initiator device compares the timing of the actuation of block 330 with the timing of the receipt of the acknowledgment message at block 328. Again, this operation may involve determining the difference between these two timings and comparing the resulting difference with a threshold. For example, the initiator device may compare the current time t with the recorded time of, for example, the local button releasing event, denoted by Tinit
As represented by block 334, if the synchronization test did not pass, at block 336 the initiator device transmits a pair-deny message to the responder device. The pairing process may then be aborted.
If, on the other hand, the synchronization test did pass at block 334, the cryptographic processor component 416 may optionally perform a key agreement calculation at block 338. This operation may relate to, for example, providing one or more keys for use in subsequent operations of the initiator and responder devices.
At block 340 the initiator device may transmit a pair-confirm message to the responder device. In some implementations this message may include authentication-related information (e.g., that is used to generate a key to be used for subsequent secure operations). In the event this message is not received at the responder device the current pairing operation is aborted as represented by block 342.
On the other hand, if the confirmation message is received a block 342, the responding device may optionally perform its own key agreement calculation at block 344. Here, the pair-request and pair-acknowledgement messages may have their own payloads. Consequently, a key to be used for securing subsequent operations may be generated from them. The key agreement scheme may be a Diffie-Hellman algorithm or any entropy mixing scheme (e.g., SHA-256(payload1∥payload2)). When a Diffie-Hellman algorithm is used, the payload may comprise the sender's public key information and the confidentiality of the exchange key is protected. For example, the pair-request message may include the initiator's public key and the pair-acknowledgement message may include the responder's public key.
As represented by blocks 346 and 348 the initiator and responder devices may then successfully terminate the pairing mode. Here, the responder device may inform the user of a successful pairing (e.g., the LED is continuously ON for a period of time, and is then turned OFF). An authenticator component 418 of each device may then perform any other operations that need to be performed in conjunction with authenticating these devices to one another.
It should be appreciated that various modifications may be made to one or more of the above operations. For example, holding the buttons may not be considered necessary, or multiple clicks of buttons may be used for additional assurance.
A number of advantages may be provided through the use of the above pairing operations. For example, if a hacker wants to launch a man-in-the-middle attack, the hacker has to send pair-request or pair-confirm synchronized with the two target devices. Since the two target devices are being physically held by their real owner, it is highly unlikely that the hacker can figure out the right timing to send these messages. That is, one person can click the buttons within a time limit that is much smaller than the normal human reaction time. Consequently, by the time an observer sees a button being pressed and tries to press the button on their intruding device, it will be too late.
A hacker also may mount an attack that involves sending a large number of fake pair-request or pair-confirm messages continuously with the intent that one of them is received within the legal time interval. To thwart such an attack, the receiver of the target device (either the initiator or the responder) may only record the first valid message from the other end and may reject (e.g., ignore or discard) the repeated messages of the same type. By doing so, only the first of these fake messages will be recorded. In this case, however, it is unlikely that this fake message will be received within the legal time interval. For example, the fake message would likely be received before actuation of a receiving device's input device.
Referring now to
Sample operations that may be performed by wireless devices A and B will now be discussed in more detail in conjunction with
At block 502 the wireless devices commence the pairing procedure. These operations may be similar to the pairing commencement operations discussed above in conjunction with blocks 302 and 304.
At block 504 the wireless devices may exchange key information or otherwise cooperate to enable each wireless device to obtain one or more keys to be used in conjunction with the pairing operation. In some implementations the operations of block 504 are performed before the commencement of the pairing procedure. Here, the cryptographic processors 416 (
One method of generating such a key is this is through the use of a Diffie-Hellman key agreement. As noted above, the key K used in the message authentication code is determined by both sides of the key exchange. Thus, a man-in-the-middle could try to set up this protocol separately with the two devices. However, when the Diffie-Hellman key exchange is used, it is relatively infeasible for the man-in-the-middle to establish the same key K for two separate processes. Here, replaying the same message authentication code between the two targets would fail.
To save manufacturing cost, the two devices may use ephemeral Diffie-Hellman keys to derive the key K. By doing so, each device may generate a Diffie-Hellman key pair when it boots up or each time before device authentication is required. Also, in devices with restricted memory and computation power, elliptic curve Diffie-Hellman may be used for key exchange.
To perform device authentication, or some other operation, the user again physically holds the two devices (e.g., one in each hand). The user then picks several random timings to simultaneously press and/or release a button on each device.
At block 506 the timing indicator 412 of each wireless device detects the series of actuations at its respective input device (e.g., device 404) and defines a respective set of time intervals. Here, there are two sequences of timings, one recorded by device A: (T0, T1, T2, . . . , TN), and another recorded by device B: (T′0, T′1, T′2, . . . , T′N).
Two sequences of time differences may thus be computed from these series of timings for device A and device B, respectively: (ΔT1, ΔT2, . . . , ΔTN) and (ΔT′1, ΔT′2, . . . , ΔT′N), where ΔTi=Ti−Ti-1 and ΔT′i=T′i−T′i-1, where (1≦i≦N).
Each time interval in a set thus indicates the amount of time that elapsed between unique pairs of successive actuations. For example, the first time interval in a set may correspond to the elapsed time between the first actuation and the second actuation. The second time interval in a set may then correspond to the elapsed time between the second actuation and the third actuation.
Although the two devices may not have synchronized clocks, the two sequences of time differences should contain very similar values since these button events are triggered by two fingers that are well synchronized by a human being. Consequently, their difference (ΔTi−ΔT′i) should be less than a threshold, ΔTth.
At block 508 a commitment generator 420 (e.g., a hash or message authentication code generator) of each wireless device generates a commitment value (e.g., hash code or message authentication code) or performs some other suitable operation based that device's set of time intervals. For example, in some implementations the wireless device A generates a message authentication code based on (ΔT1∥ΔT2∥ . . . ∥ΔTN) and K while the wireless device B generates a message authentication code based on (ΔT′1∥ΔT′2∥ . . . ∥ΔT′N) and K. Here, “∥” denotes concatenation, and all time differences may be expressed as bit strings. It should be appreciated that in other implementations the time interval data may be manipulated in other ways (e.g., summed). In addition, it should be appreciated that the commitment generator 420 may implement other types of keyed hash algorithms including, for example, HMAC or may implement a block cipher in CBC-MAC or CMAC mode.
In some aspects, a commitment scheme may involve generating a commitment based on a “secret” such as the time intervals and, optionally, other data to be authenticated and providing the commitment to another device. The other device performs complementary operations. Here, it may be impossible or impractical for a device to determine the “secret” of the other device based on the received commitment. Thus, a given device may not use the other device's “secret” to generate its commitment. After the above exchange, a subsequent verification operation involves sending the “secret” (e.g., the time intervals) to the other device. In this way, each device may use the “secret” and the commitment it received to authenticate the other device.
In general, the operations of block 508 (and block 530 discussed below) relate to performing a cryptographic operation on the data to be transmitted. Consequently, similar functionality may be provided through the use of other cryptographic techniques such as a digital signature. Thus, in this case the commitment generator 420 may comprise a digital signature generator.
At block 510 each wireless device transmits its commitment (e.g., message authentication code) to the other wireless device. In some aspects this message comprises an indication relating to the timing of the actuations of block 506. This transmission may be asynchronous with respect to the other wireless device. That is, the time at which one wireless device transmits its message authentication code may not be based on the time at which the other wireless device transmits its message authentication code.
As represented by block 512, each device waits to receive a commitment (e.g., message authentication code) from the other device. For example, in the event the message authentication code is not received within a defined period of time the process may be aborted as represented by block 514 (e.g., and the process is restarted from button event detection). In some implementations the operations of block 512 involve the comparator 414 determining the time difference between a time relating to the actuation times (e.g., the last local button event time TN or T′N) and the time of receipt of the incoming message authentication code at block 512. In some aspects, this difference value must be less than a predefined threshold ΔTα. The incoming message authentication code for device A may thus be deemed valid if: (Tα−TN)<ΔTα-max. Similarly, the incoming message authentication code for device B may be deemed valid if: (T′α−T′N)<ΔTα-max.
As represented by block 516, the process may be aborted in the event the two devices send identical commitments (e.g., message authentication codes) to each other. In this way, the pairing scheme prevents another device from simply transmitting back, for example, a message authentication code that it received from either device A or device B (e.g., in an attempted “replay attack”).
If the incoming message authentication code is valid, at block 518 each device remains idle until more than a defined period of time (e.g., ΔTβ-min) elapses after a designated time relating to the corresponding actuation times (e.g., the last local button event TN or T′N). Here, ΔTβ-min may be defined to be less than or equal to ΔTα-max. Thus, for device A: (Tβ−TN)>ΔTβ-min, and for device B: (T′β−T′N)>ΔTβ-min.
The use of timing constraints as described above may prevent a man-in-the-middle attack where the attacker fails in authentication with one target but obtains the genuine sequence of time differences. In such a case, the attacker could try to use this sequence to authenticate to the other target. However, the man-in-the-middle will not pass the timing check for Tα and Tβ because it is too late to send the correct message authentication code. That is, under the scheme set forth above a device will not transmit its set of time intervals (line 610 or 612 in
At block 520 each wireless device transmits its set of time intervals to the other side for verification. As represented by block 522, each wireless device thereby receives the corresponding set of time intervals from the other device. This message thus comprises an indication relating to the timing of the actuations of block 506.
At block 524 the comparator 414 calculates the difference between corresponding time intervals of each set of time intervals. For example, the comparator 414 determines the difference in time between the first time interval in the set of intervals generated at device A and the first time interval in the set of intervals generated at device B. A similar time difference may then be calculated for each time interval in each set.
At block 526 the comparator 414 generates a verification count based on these time differences. As an example, the operations of blocks 524-528 may take the form of Equation 1.
where f(x, y) returns 1 if x<y and 0 if x≧y.
Here, the defined value m is the minimum number of successful tests that is deemed acceptable to pass the verification process (m≦n). In other words, this test determines whether an acceptable number of the time differences are within the range defined by ΔTth. At block 528, in the event an acceptable number of the time differences are not within the range defined by ΔTth, the pairing process may be aborted.
On the other hand, if the synchronization test passed at block 528, the wireless device may verify that a commitment (e.g., message authentication code) generated from the set of time intervals received at block 522 matches the commitment (e.g., message authentication code) received at block 512. For example, at block 530 the message authentication code generator 420 may generate a message authentication code based on the set of time intervals received at block 522 and the key K. The comparator 414 may then compare this message authentication code with the message authentication code received from the other wireless device at block 512. Exchanging the message authentication code at the beginning of the protocol (e.g., at blocks 510-512) may thereby prevent either side from cheating. For example, once the message authentication code is transmitted, it may be infeasible to find another input message (e.g., sequence of time differences) with the same message authentication code.
At block 532, if the commitment (e.g., message authentication code) based on the incoming message from block 522 does not match the commitment (e.g., message authentication code) from block 512, the pairing process may be aborted. Otherwise, the other wireless device may be deemed successfully authenticated (block 534).
Various advantages may be achieved through the use of the teachings herein. For example, in some aspects the techniques taught herein may be employed to prevent a malicious device from capturing finger movement timings through eavesdropping and analysis of wireless traffic during device pairing. In some aspects an implementation based on the teachings herein may not require complicated protocol or high cost device provisioning.
The use of the MAC associates the key K with the device authentication process. As a result, K is authenticated at block 534 as well. In other words, K may have been initially exchanged between devices that did not trust one another. By using K in the message authentication code, however, K is authenticated by the above distance-based authentication whereby trust derives from the same person operating the devices. Once authenticated, K may be used for subsequent cryptographic operations (e.g., encryption, authentication, and so on).
It should be appreciated that a commitment operation may be implemented in a variety of ways. For example, cryptographic operations other than MAC-based operations may be employed here. In addition, any of the operations taught herein may be used to associate additional data for authentication. Also, a pre-shared secret key K may not be required. For example, the commitment value can be the hash of (time intervals∥Diffie-Hellman public key∥device identifier) so that the Diffie-Hellman public key and the identifier of the other device are authenticated at block 534. An advantage of such an approach is that a time consuming and computationally intensive key exchange (e.g., a Diffie-Hellman operation to provide K to each device) need not be performed until after the devices authenticate one another. Also, it should be appreciated that the commitment may be based on any type of data that needs to be authenticated. Thus, the above MAC operation may be based on other data in addition to or other than one or more of the pre-shared key K, the public key, and the device ID discussed above.
In some implementations a commitment scheme may employ encryption and decryption operations. For example, the commitment scheme may involve using a key to encrypt a secret (e.g., time interval information). The resulting cipher text is transmitted to another device. Once the complementary cipher text is received from the other device, the key is transmitted to the other device. Each device may then use the key it receives to decrypt the received cipher text to thereby obtain the “secret” of the other device. This restored “secret” may then be compared with the received “secret” (e.g., the time intervals) to authenticate the other device.
In some implementations a commitment may be based on information that is provided to prevent a replay attack. For example, a first device may generate a MAC based on the time intervals and some type of information (referred to as a device identifier in the following discussion) that distinguishes the first device (e.g., an initiator) from a second device (e.g., a responder). The first device transmits the MAC to the second device that is expected to perform a complementary operation. After receiving a MAC from the other device, each device transmits its device identifier (e.g., “0” for the first device and “1” for the second device) in the clear. For example, the device identifier may be transmitted in the plain text of the MAC message (e.g., at block 510 in
The teachings herein may be incorporated into a device employing various components for communicating with at least one other device.
Initially, components involved in sending information from the device 702 to the device 704 (e.g., a reverse link) will be treated. A transmit (“TX”) data processor 708 receives traffic data (e.g., data packets) from a data buffer 710 or some other suitable component. The transmit data processor 708 processes (e.g., encodes, interleaves, and symbol maps) each data packet based on a selected coding and modulation scheme, and provides data symbols. In general, a data symbol is a modulation symbol for data, and a pilot symbol is a modulation symbol for a pilot (which is known a priori). A modulator 712 receives the data symbols, pilot symbols, and possibly signaling for the reverse link, and performs modulation (e.g., OFDM or some other suitable modulation) and/or other processing as specified by the system, and provides a stream of output chips. A transmitter (“TMTR”) 714 processes (e.g., converts to analog, filters, amplifies, and frequency upconverts) the output chip stream and generates a modulated signal, which is then transmitted from an antenna 716.
The modulated signals transmitted by the device 702 (along with signals from other devices in communication with the device 704) are received by an antenna 718 of the device 704. A receiver (“RCVR”) 720 processes (e.g., conditions and digitizes) the received signal from the antenna 718 and provides received samples. A demodulator (“DEMOD”) 722 processes (e.g., demodulates and detects) the received samples and provides detected data symbols, which may be a noisy estimate of the data symbols transmitted to the device 704 by the other device(s). A receive (“RX”) data processor 724 processes (e.g., symbol demaps, deinterleaves, and decodes) the detected data symbols and provides decoded data associated with each transmitting device (e.g., device 702).
Components involved in sending information from the device 704 to the device 702 (e.g., a forward link) will be now be treated. At the device 704, traffic data is processed by a transmit (“TX”) data processor 726 to generate data symbols. A modulator 728 receives the data symbols, pilot symbols, and signaling for the forward link, performs modulation (e.g., OFDM or some other suitable modulation) and/or other pertinent processing, and provides an output chip stream, which is further conditioned by a transmitter (“TMTR”) 730 and transmitted from the antenna 718. In some implementations signaling for the forward link may include power control commands and other information (e.g., relating to a communication channel) generated by a controller 732 for all devices (e.g. terminals) transmitting on the reverse link to the device 704.
At the device 702, the modulated signal transmitted by the device 704 is received by the antenna 716, conditioned and digitized by a receiver (“RCVR”) 734, and processed by a demodulator (“DEMOD”) 736 to obtain detected data symbols. A receive (“RX”) data processor 738 processes the detected data symbols and provides decoded data for the device 702 and the forward link signaling. A controller 740 receives power control commands and other information to control data transmission and to control transmit power on the reverse link to the device 704.
The controllers 740 and 732 direct various operations of the device 702 and the device 704, respectively. For example, a controller may determine an appropriate filter, reporting information about the filter, and decode information using a filter. Data memories 742 and 744 may store program codes and data used by the controllers 740 and 732, respectively.
A wireless device may include various components that perform functions based on signals that are transmitted by or received at the wireless device. For example, a wireless headset may include a transducer adapted to provide an audio output based on a signal received via the receiver. A wireless watch may include a user interface adapted to provide an indication based on a signal received via the receiver. A wireless sensing device may include a sensor adapted to provide data to be transmitted to another device.
A wireless device may communicate via one or more wireless communication links that are based on or otherwise support any suitable wireless communication technology. For example, in some aspects a wireless device may associate with a network. In some aspects the network may comprise a body area network or a personal area network (e.g., an ultra-wideband network). In some aspects the network may comprise a local area network or a wide area network. A wireless device may support or otherwise use one or more of a variety of wireless communication technologies, protocols, or standards such as, for example, CDMA, TDMA, OFDM, OFDMA, WiMAX, and Wi-Fi. Similarly, a wireless device may support or otherwise use one or more of a variety of corresponding modulation or multiplexing schemes. A wireless device may thus include appropriate components (e.g., air interfaces) to establish and communicate via one or more wireless communication links using the above or other wireless communication technologies. For example, a device may comprise a wireless transceiver with associated transmitter and receiver components (e.g., transmitter 408 and receiver 410) that may include various components (e.g., signal generators and signal processors) that facilitate communication over a wireless medium.
In some aspects a wireless device may communicate via an impulse-based wireless communication link. For example, an impulse-based wireless communication link may utilize ultra-wideband pulses that have a relatively short length (e.g., on the order of a few nanoseconds) and a relatively wide bandwidth. In some aspects the ultra-wideband pulses may have a fractional bandwidth on the order of approximately 20% or more and/or have a bandwidth on the order of approximately 500 MHz or more.
The teachings herein may be incorporated into (e.g., implemented within or performed by) a variety of apparatuses (e.g., devices). For example, one or more aspects taught herein may be incorporated into a phone (e.g., a cellular phone), a personal data assistant (“PDA”), an entertainment device (e.g., a music or video device), a headset (e.g., headphones, an earpiece, etc.), a microphone, a medical device (e.g., a biometric sensor, a heart rate monitor, a pedometer, an EKG device, etc.), a user I/O device (e.g., a watch, a remote control, a light switch, a keyboard, a mouse, etc.), a tire pressure monitor, a computer, a point-of-sale device, an entertainment device, a hearing aid, a set-top box, or any other suitable device.
These devices may have different power and data requirements. In some aspects, the teachings herein may be adapted for use in low power applications (e.g., through the use of an impulse-based signaling scheme and low duty cycle modes) and may support a variety of data rates including relatively high data rates (e.g., through the use of high-bandwidth pulses).
In some aspects a wireless device may comprise an access device (e.g., a Wi-Fi access point) for a communication system. Such an access device may provide, for example, connectivity to another network (e.g., a wide area network such as the Internet or a cellular network) via a wired or wireless communication link. Accordingly, the access device may enable another device (e.g., a Wi-Fi station) to access the other network or some other functionality. In addition, it should be appreciated that one or both of the devices may be portable or, in some cases, relatively non-portable.
The components described herein may be implemented in a variety of ways. Referring to
The apparatus 800 may include one or more modules that may perform one or more of the functions described above with regard to various figures. For example, an ASIC for transmitting 802 may correspond to, for example, a transmitter as discussed herein. An ASIC for receiving 804 may correspond to, for example, a receiver as discussed herein. An ASIC for inputting 806 may correspond to, for example, an input device as discussed herein. An ASIC for providing time of actuation indication 808 may correspond to, for example, a timing indicator as discussed herein. An ASIC for comparing 810 may correspond to, for example, a comparator as discussed herein. An ASIC for calculating key agreement 812 may correspond to, for example, a cryptographic processor as discussed herein. An ASIC for generating a commitment (hash, MAC) 814 may correspond to, for example, a commitment (e.g., hash/MAC) generator as discussed herein. An ASIC for activating pairing mode 816 may correspond to, for example, a pairing mode controller as discussed herein. An ASIC for generating indication 818 may correspond to, for example, an output device as discussed herein. An ASIC for authenticating 820 may correspond to, for example, an authenticator as discussed herein.
As noted above, in some aspects these components may be implemented via appropriate processor components. These processor components may in some aspects be implemented, at least in part, using structure as taught herein. In some aspects a processor may be adapted to implement a portion or all of the functionality of one or more of these components. In some aspects one or more of the components represented by dashed boxes are optional.
As noted above, the apparatus 800 may comprise one or more integrated circuits. For example, in some aspects a single integrated circuit may implement the functionality of one or more of the illustrated components, while in other aspects more than one integrated circuit may implement the functionality of one or more of the illustrated components.
In addition, the components and functions represented by
Also, it should be understood that any reference to an element herein using a designation such as “first,” “second,” and so forth does not generally limit the quantity or order of those elements. Rather, these designations are used herein as a convenient method of distinguishing between two or more different devices, sets, etc. Thus, a reference to first and second devices or sets does not mean that only two devices or sets may be employed there or that the first device or set must precede the second device or set in some manner.
Those of skill in the art would understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.
Those of skill would further appreciate that any of the various illustrative logical blocks, modules, processors, means, circuits, and algorithm steps described in connection with the aspects disclosed herein may be implemented as electronic hardware (e.g., a digital implementation, an analog implementation, or a combination of the two, which may be designed using source coding or some other technique), various forms of program or design code incorporating instructions (which may be referred to herein, for convenience, as “software” or a “software module”), or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.
The various illustrative logical blocks, modules, and circuits described in connection with the aspects disclosed herein may be implemented within or performed by an integrated circuit (“IC”), an access terminal, or an access point. The IC may comprise a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, electrical components, optical components, mechanical components, or any combination thereof designed to perform the functions described herein, and may execute codes or instructions that reside within the IC, outside of the IC, or both. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
It is understood that any specific order or hierarchy of steps in any disclosed process is an example of a sample approach. Based upon design preferences, it is understood that the specific order or hierarchy of steps in the processes may be rearranged while remaining within the scope of the present disclosure. The accompanying method claims present elements of the various steps in a sample order, and are not meant to be limited to the specific order or hierarchy presented.
The steps of a method or algorithm described in connection with the aspects disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module (e.g., including executable instructions and related data) and other data may reside in a data memory such as RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, a hard disk, a removable disk, a CD-ROM, or any other form of computer-readable storage medium known in the art. A sample storage medium may be coupled to a machine such as, for example, a computer/processor (which may be referred to herein, for convenience, as a “processor”) such the processor can read information (e.g., code) from and write information to the storage medium. A sample storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in user equipment. In the alternative, the processor and the storage medium may reside as discrete components in user equipment. Moreover, in some aspects any suitable computer-program product may comprise a computer-readable medium comprising codes (e.g., executable by at least one computer) relating to one or more of the aspects of the disclosure. In some aspects a computer program product may comprise packaging materials.
The previous description of the disclosed aspects is provided to enable any person skilled in the art to make or use the present disclosure. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects without departing from the scope of the disclosure. Thus, the present disclosure is not intended to be limited to the aspects shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
This application claims the benefit of and priority to commonly owned U.S. Provisional Patent Application No. 60/908,271, filed Mar. 27, 2007, the disclosure of which is hereby incorporated by reference herein.
Number | Name | Date | Kind |
---|---|---|---|
4006477 | Yost, Jr. et al. | Feb 1977 | A |
5382957 | Blume | Jan 1995 | A |
5687169 | Fullerton | Nov 1997 | A |
5764696 | Barnes et al. | Jun 1998 | A |
5812081 | Fullerton | Sep 1998 | A |
5832035 | Fullerton | Nov 1998 | A |
5907427 | Scalora et al. | May 1999 | A |
5952956 | Fullerton | Sep 1999 | A |
5960031 | Fullerton et al. | Sep 1999 | A |
5963581 | Fullerton et al. | Oct 1999 | A |
5969663 | Fullerton et al. | Oct 1999 | A |
5970148 | Meier | Oct 1999 | A |
5995534 | Fullerton et al. | Nov 1999 | A |
6025795 | Hulderman et al. | Feb 2000 | A |
6031862 | Fullerton et al. | Feb 2000 | A |
6091374 | Barnes | Jul 2000 | A |
6111536 | Richards et al. | Aug 2000 | A |
6133876 | Fullerton et al. | Oct 2000 | A |
6177903 | Fullerton et al. | Jan 2001 | B1 |
6218979 | Barnes et al. | Apr 2001 | B1 |
6295019 | Richards et al. | Sep 2001 | B1 |
6297773 | Fullerton et al. | Oct 2001 | B1 |
6300903 | Richards et al. | Oct 2001 | B1 |
6304623 | Richards et al. | Oct 2001 | B1 |
6332193 | Glass et al. | Dec 2001 | B1 |
6351652 | Finn et al. | Feb 2002 | B1 |
6354946 | Finn | Mar 2002 | B1 |
6400307 | Fullerton et al. | Jun 2002 | B2 |
6400329 | Barnes | Jun 2002 | B1 |
6421389 | Jett et al. | Jul 2002 | B1 |
6430208 | Fullerton et al. | Aug 2002 | B1 |
6437756 | Schantz | Aug 2002 | B1 |
6462701 | Finn | Oct 2002 | B1 |
6466125 | Richards et al. | Oct 2002 | B1 |
6469628 | Richards et al. | Oct 2002 | B1 |
6483461 | Matheney et al. | Nov 2002 | B1 |
6489893 | Richards et al. | Dec 2002 | B1 |
6492904 | Richards | Dec 2002 | B2 |
6492906 | Richards et al. | Dec 2002 | B1 |
6501393 | Richards et al. | Dec 2002 | B1 |
6504483 | Richards et al. | Jan 2003 | B1 |
6512455 | Finn et al. | Jan 2003 | B2 |
6512488 | Schantz | Jan 2003 | B2 |
6519464 | Santhoff et al. | Feb 2003 | B1 |
6529568 | Richards et al. | Mar 2003 | B1 |
6538615 | Schantz | Mar 2003 | B1 |
6539213 | Richards et al. | Mar 2003 | B1 |
6549567 | Fullerton | Apr 2003 | B1 |
6552677 | Barnes et al. | Apr 2003 | B2 |
6556621 | Richards et al. | Apr 2003 | B1 |
6560463 | Santhoff | May 2003 | B1 |
6571089 | Richards et al. | May 2003 | B1 |
6573857 | Fullerton et al. | Jun 2003 | B2 |
6577691 | Richards et al. | Jun 2003 | B2 |
6585597 | Finn | Jul 2003 | B2 |
6593886 | Schantz | Jul 2003 | B2 |
6606051 | Fullerton et al. | Aug 2003 | B1 |
6611234 | Fullerton et al. | Aug 2003 | B2 |
6611811 | Deaton et al. | Aug 2003 | B1 |
6614384 | Hall et al. | Sep 2003 | B2 |
6614387 | Deadman | Sep 2003 | B1 |
6621462 | Barnes | Sep 2003 | B2 |
6636566 | Roberts et al. | Oct 2003 | B1 |
6636567 | Roberts et al. | Oct 2003 | B1 |
6636573 | Richards et al. | Oct 2003 | B2 |
6642903 | Schantz | Nov 2003 | B2 |
6650894 | Berstis et al. | Nov 2003 | B1 |
6661342 | Hall et al. | Dec 2003 | B2 |
6667724 | Barnes et al. | Dec 2003 | B2 |
6670909 | Kim | Dec 2003 | B2 |
6671310 | Richards et al. | Dec 2003 | B1 |
6674396 | Richards et al. | Jan 2004 | B2 |
6677796 | Brethour et al. | Jan 2004 | B2 |
6700538 | Richards | Mar 2004 | B1 |
6710736 | Fullerton et al. | Mar 2004 | B2 |
6717992 | Cowie et al. | Apr 2004 | B2 |
6748040 | Johnson et al. | Jun 2004 | B1 |
6750757 | Gabig, Jr. et al. | Jun 2004 | B1 |
6759948 | Grisham et al. | Jul 2004 | B2 |
6760387 | Langford et al. | Jul 2004 | B2 |
6762712 | Kim | Jul 2004 | B2 |
6763057 | Fullerton et al. | Jul 2004 | B1 |
6763282 | Glenn et al. | Jul 2004 | B2 |
6774764 | Ghosh et al. | Aug 2004 | B2 |
6774846 | Fullerton et al. | Aug 2004 | B2 |
6774859 | Schantz et al. | Aug 2004 | B2 |
6778603 | Fullerton et al. | Aug 2004 | B1 |
6781530 | Moore | Aug 2004 | B2 |
6782048 | Santhoff | Aug 2004 | B2 |
6788730 | Richards et al. | Sep 2004 | B1 |
6822604 | Hall et al. | Nov 2004 | B2 |
6823022 | Fullerton et al. | Nov 2004 | B1 |
6836223 | Moore | Dec 2004 | B2 |
6836226 | Moore | Dec 2004 | B2 |
6844816 | Melton et al. | Jan 2005 | B1 |
6845253 | Schantz | Jan 2005 | B1 |
6847675 | Fullerton et al. | Jan 2005 | B2 |
6862575 | Anttila et al. | Mar 2005 | B1 |
6879878 | Glenn et al. | Apr 2005 | B2 |
6882301 | Fullerton | Apr 2005 | B2 |
6895034 | Nunally et al. | May 2005 | B2 |
6895236 | Shuster | May 2005 | B2 |
6898434 | Pradhan et al. | May 2005 | B2 |
6900732 | Richards | May 2005 | B2 |
6906625 | Taylor et al. | Jun 2005 | B1 |
6907244 | Santhoff et al. | Jun 2005 | B2 |
6907270 | Blanz | Jun 2005 | B1 |
6912240 | Kumar et al. | Jun 2005 | B2 |
6914949 | Richards et al. | Jul 2005 | B2 |
6917284 | Grisham et al. | Jul 2005 | B2 |
6919838 | Santhoff | Jul 2005 | B2 |
6922166 | Richards et al. | Jul 2005 | B2 |
6922177 | Barnes et al. | Jul 2005 | B2 |
6925109 | Richards et al. | Aug 2005 | B2 |
6933882 | Fullerton | Aug 2005 | B2 |
6937639 | Pendergrass et al. | Aug 2005 | B2 |
6937663 | Jett et al. | Aug 2005 | B2 |
6937667 | Fullerton et al. | Aug 2005 | B1 |
6937674 | Santhoff et al. | Aug 2005 | B2 |
6947492 | Santhoff et al. | Sep 2005 | B2 |
6950485 | Richards et al. | Sep 2005 | B2 |
6954480 | Richards et al. | Oct 2005 | B2 |
6959031 | Haynes et al. | Oct 2005 | B2 |
6959032 | Richards et al. | Oct 2005 | B1 |
6961285 | Niemiec et al. | Nov 2005 | B2 |
6961541 | Overy et al. | Nov 2005 | B2 |
6963727 | Shreve | Nov 2005 | B2 |
6980613 | Krivokapic | Dec 2005 | B2 |
6989751 | Richards | Jan 2006 | B2 |
7002473 | Glick et al. | Feb 2006 | B2 |
7003289 | Kolls | Feb 2006 | B1 |
7010290 | Dent | Mar 2006 | B2 |
7015793 | Gabig, Jr. et al. | Mar 2006 | B2 |
7020224 | Krivokapic | Mar 2006 | B2 |
7026983 | Spratt | Apr 2006 | B2 |
7027425 | Fullerton et al. | Apr 2006 | B1 |
7027483 | Santhoff et al. | Apr 2006 | B2 |
7027493 | Richards | Apr 2006 | B2 |
7030806 | Fullerton | Apr 2006 | B2 |
7039392 | McCorkle et al. | May 2006 | B2 |
7042417 | Santhoff et al. | May 2006 | B2 |
7046187 | Fullerton et al. | May 2006 | B2 |
7046618 | Santhoff et al. | May 2006 | B2 |
7058414 | Rofheart et al. | Jun 2006 | B1 |
7069111 | Glenn et al. | Jun 2006 | B2 |
7075476 | Kim | Jul 2006 | B2 |
7079827 | Richards et al. | Jul 2006 | B2 |
7098769 | Ott | Aug 2006 | B2 |
7099367 | Richards et al. | Aug 2006 | B2 |
7099368 | Santhoff et al. | Aug 2006 | B2 |
7116266 | Vesel et al. | Oct 2006 | B1 |
7119659 | Bonalle et al. | Oct 2006 | B2 |
7129886 | Hall et al. | Oct 2006 | B2 |
7132975 | Fullerton et al. | Nov 2006 | B2 |
7139647 | Larsen | Nov 2006 | B2 |
7145954 | Pendergrass et al. | Dec 2006 | B1 |
7148791 | Grisham et al. | Dec 2006 | B2 |
7149533 | Laird et al. | Dec 2006 | B2 |
7151490 | Richards | Dec 2006 | B2 |
7167525 | Santhoff et al. | Jan 2007 | B2 |
7170408 | Taylor et al. | Jan 2007 | B2 |
7178719 | Silverbrook et al. | Feb 2007 | B2 |
7181192 | Panasik et al. | Feb 2007 | B2 |
7184938 | Lansford et al. | Feb 2007 | B1 |
7188244 | Matsuno | Mar 2007 | B2 |
7190722 | Lakkis et al. | Mar 2007 | B2 |
7190729 | Siwiak | Mar 2007 | B2 |
7206334 | Siwiak | Apr 2007 | B2 |
7206559 | Meade et al. | Apr 2007 | B2 |
7209724 | Richards et al. | Apr 2007 | B2 |
7209753 | Raith | Apr 2007 | B2 |
7230980 | Langford et al. | Jun 2007 | B2 |
7239277 | Fullerton et al. | Jul 2007 | B2 |
7245900 | Lamb et al. | Jul 2007 | B1 |
RE39759 | Fullerton | Aug 2007 | E |
7256727 | Fullerton et al. | Aug 2007 | B2 |
7271779 | Hertel | Sep 2007 | B2 |
7308356 | Melaku et al. | Dec 2007 | B2 |
7310532 | Knauerhase et al. | Dec 2007 | B2 |
7363494 | Brainard et al. | Apr 2008 | B2 |
7366509 | Akgun et al. | Apr 2008 | B2 |
7383984 | Silverbrook et al. | Jun 2008 | B2 |
7398392 | Weber | Jul 2008 | B2 |
7505443 | McNew et al. | Mar 2009 | B2 |
7554979 | Ikeda | Jun 2009 | B2 |
7581113 | Smith et al. | Aug 2009 | B2 |
7724705 | Erola et al. | May 2010 | B2 |
7739157 | Bonner et al. | Jun 2010 | B2 |
7783532 | Hsu et al. | Aug 2010 | B2 |
7818762 | Liu et al. | Oct 2010 | B2 |
7870021 | Mankoff | Jan 2011 | B2 |
7870229 | Spector | Jan 2011 | B2 |
20010014870 | Saito et al. | Aug 2001 | A1 |
20010042010 | Hassell | Nov 2001 | A1 |
20020002504 | Engel et al. | Jan 2002 | A1 |
20020004783 | Paltenghe et al. | Jan 2002 | A1 |
20020010627 | Lerat | Jan 2002 | A1 |
20020046084 | Steele et al. | Apr 2002 | A1 |
20020065713 | Awada et al. | May 2002 | A1 |
20020091569 | Kitaura et al. | Jul 2002 | A1 |
20020091571 | Thomas et al. | Jul 2002 | A1 |
20020107738 | Beach et al. | Aug 2002 | A1 |
20020111140 | Kim | Aug 2002 | A1 |
20020111907 | Ling | Aug 2002 | A1 |
20020116271 | Mankoff | Aug 2002 | A1 |
20020128903 | Kernahan | Sep 2002 | A1 |
20020138345 | Dickson et al. | Sep 2002 | A1 |
20020138346 | Kodaka et al. | Sep 2002 | A1 |
20020169665 | Hughes et al. | Nov 2002 | A1 |
20020169668 | Bank et al. | Nov 2002 | A1 |
20020169892 | Miyaoku et al. | Nov 2002 | A1 |
20020178060 | Sheehan | Nov 2002 | A1 |
20020194303 | Suila et al. | Dec 2002 | A1 |
20030004808 | Elhaoussine et al. | Jan 2003 | A1 |
20030004821 | Dutta et al. | Jan 2003 | A1 |
20030055726 | Sohya et al. | Mar 2003 | A1 |
20030074259 | Slyman, Jr. et al. | Apr 2003 | A1 |
20030093283 | Morsa | May 2003 | A1 |
20030093314 | Leung et al. | May 2003 | A1 |
20030115152 | Flaherty | Jun 2003 | A1 |
20030117635 | Roberts | Jun 2003 | A1 |
20030158796 | Balent | Aug 2003 | A1 |
20030195806 | Willman et al. | Oct 2003 | A1 |
20030217153 | Rao et al. | Nov 2003 | A1 |
20030233190 | Jones | Dec 2003 | A1 |
20040054592 | Hernblad | Mar 2004 | A1 |
20040054732 | Carter et al. | Mar 2004 | A1 |
20040064351 | Mikurak | Apr 2004 | A1 |
20040117250 | Lubow et al. | Jun 2004 | A1 |
20040137886 | Ross et al. | Jul 2004 | A1 |
20040143500 | Lopez et al. | Jul 2004 | A1 |
20040158492 | Lopez et al. | Aug 2004 | A1 |
20040203963 | Shivaram et al. | Oct 2004 | A1 |
20040218574 | Sata et al. | Nov 2004 | A1 |
20040222302 | Matsumori | Nov 2004 | A1 |
20040233621 | Maeoka et al. | Nov 2004 | A1 |
20040240565 | Santhoff et al. | Dec 2004 | A1 |
20040243519 | Perttila et al. | Dec 2004 | A1 |
20040254836 | Emoke Barabas et al. | Dec 2004 | A1 |
20050027984 | Saito et al. | Feb 2005 | A1 |
20050038574 | Gila et al. | Feb 2005 | A1 |
20050040230 | Swartz et al. | Feb 2005 | A1 |
20050114213 | Smith et al. | May 2005 | A1 |
20050131761 | Trika et al. | Jun 2005 | A1 |
20050132234 | Dawson | Jun 2005 | A1 |
20050135304 | Wentink et al. | Jun 2005 | A1 |
20050138576 | Baumert et al. | Jun 2005 | A1 |
20050184145 | Law et al. | Aug 2005 | A1 |
20050200671 | Mistry et al. | Sep 2005 | A1 |
20050204152 | Breitbach | Sep 2005 | A1 |
20050230473 | Fajkowski | Oct 2005 | A1 |
20050237270 | Adams et al. | Oct 2005 | A1 |
20060003776 | Natori et al. | Jan 2006 | A1 |
20060014532 | Seligmann et al. | Jan 2006 | A1 |
20060015404 | Tran | Jan 2006 | A1 |
20060026070 | Sun | Feb 2006 | A1 |
20060030341 | Pham | Feb 2006 | A1 |
20060068822 | Kalhan | Mar 2006 | A1 |
20060073851 | Colando et al. | Apr 2006 | A1 |
20060074784 | Brown | Apr 2006 | A1 |
20060111967 | Forbes | May 2006 | A1 |
20060130100 | Pentland | Jun 2006 | A1 |
20060177030 | Rajagopalan et al. | Aug 2006 | A1 |
20060178932 | Lang | Aug 2006 | A1 |
20060180664 | Barrett et al. | Aug 2006 | A1 |
20060194569 | Hsueh | Aug 2006 | A1 |
20060293968 | Brice et al. | Dec 2006 | A1 |
20070017259 | Cho et al. | Jan 2007 | A1 |
20070043626 | Duvall et al. | Feb 2007 | A1 |
20070057051 | Bortolin et al. | Mar 2007 | A1 |
20070061302 | Ramer et al. | Mar 2007 | A1 |
20070087732 | Hsueh | Apr 2007 | A1 |
20070131759 | Cox et al. | Jun 2007 | A1 |
20070136657 | Blumenthal et al. | Jun 2007 | A1 |
20070136775 | MacKay et al. | Jun 2007 | A1 |
20070138270 | Reblin | Jun 2007 | A1 |
20070150339 | Retter et al. | Jun 2007 | A1 |
20070173266 | Barnes | Jul 2007 | A1 |
20070174116 | Keith et al. | Jul 2007 | A1 |
20070174259 | Amjadi | Jul 2007 | A1 |
20070182546 | Virk et al. | Aug 2007 | A1 |
20070200671 | Kelley et al. | Aug 2007 | A1 |
20070203792 | Rao | Aug 2007 | A1 |
20070241189 | Slavin et al. | Oct 2007 | A1 |
20070249288 | Moallemi et al. | Oct 2007 | A1 |
20070259690 | Julian et al. | Nov 2007 | A1 |
20070270129 | Luo | Nov 2007 | A1 |
20070276537 | Walker et al. | Nov 2007 | A1 |
20070285306 | Julian et al. | Dec 2007 | A1 |
20070287386 | Agrawal et al. | Dec 2007 | A1 |
20080040229 | Gholston | Feb 2008 | A1 |
20080052169 | O'Shea et al. | Feb 2008 | A1 |
20080072066 | Vogler et al. | Mar 2008 | A1 |
20080074264 | Sharpe et al. | Mar 2008 | A1 |
20080120186 | Jokinen et al. | May 2008 | A1 |
20080133349 | Nazer et al. | Jun 2008 | A1 |
20080133366 | Evans et al. | Jun 2008 | A1 |
20080154827 | Connors | Jun 2008 | A1 |
20080167991 | Carlson et al. | Jul 2008 | A1 |
20080189170 | Ramachandra | Aug 2008 | A1 |
20080208688 | Byerley et al. | Aug 2008 | A1 |
20080221984 | Abhyanker | Sep 2008 | A1 |
20080238615 | Carpenter | Oct 2008 | A1 |
20080262928 | Michaelis | Oct 2008 | A1 |
20080270231 | Li et al. | Oct 2008 | A1 |
20080300970 | Scheibe | Dec 2008 | A1 |
20080300984 | Li | Dec 2008 | A1 |
20090061884 | Rajan et al. | Mar 2009 | A1 |
20090076911 | Vo et al. | Mar 2009 | A1 |
20090076912 | Rajan et al. | Mar 2009 | A1 |
20090088182 | Piersol et al. | Apr 2009 | A1 |
20090098903 | Donaldson et al. | Apr 2009 | A1 |
20090108064 | Fernandes et al. | Apr 2009 | A1 |
20090164309 | Mgrdechian et al. | Jun 2009 | A1 |
20090178144 | Redlich et al. | Jul 2009 | A1 |
20090233575 | Morrison | Sep 2009 | A1 |
20100153205 | Retter et al. | Jun 2010 | A1 |
20100185504 | Rajan et al. | Jul 2010 | A1 |
20100205043 | Edwards | Aug 2010 | A1 |
20100241574 | Salazar | Sep 2010 | A1 |
20100257020 | Bryant et al. | Oct 2010 | A1 |
20100280960 | Ziotopoulos et al. | Nov 2010 | A1 |
20100289640 | Annamalai | Nov 2010 | A1 |
20100299224 | Borom et al. | Nov 2010 | A1 |
20110028160 | Roeding et al. | Feb 2011 | A1 |
20110119132 | Morton et al. | May 2011 | A1 |
20110215138 | Crum | Sep 2011 | A1 |
20110276385 | Keller | Nov 2011 | A1 |
Number | Date | Country |
---|---|---|
1432949 | Jul 2003 | CN |
1633660 | Jun 2005 | CN |
1672382 | Sep 2005 | CN |
1694122 | Nov 2005 | CN |
1716223 | Jan 2006 | CN |
1799061 | Jul 2006 | CN |
1879121 | Dec 2006 | CN |
101384031 | Mar 2009 | CN |
1758308 | Feb 2007 | EP |
1926335 | May 2008 | EP |
11353555 | Dec 1999 | JP |
2000275328 | Oct 2000 | JP |
2001034658 | Feb 2001 | JP |
2002074131 | Mar 2002 | JP |
2002109237 | Apr 2002 | JP |
2002149945 | May 2002 | JP |
2002525641 | Aug 2002 | JP |
2002251555 | Sep 2002 | JP |
2002279274 | Sep 2002 | JP |
2002291047 | Oct 2002 | JP |
2002374261 | Dec 2002 | JP |
2003006543 | Jan 2003 | JP |
2003023367 | Jan 2003 | JP |
2003051771 | Feb 2003 | JP |
2003067606 | Mar 2003 | JP |
2003187140 | Jul 2003 | JP |
2003208381 | Jul 2003 | JP |
2003256705 | Sep 2003 | JP |
2003263582 | Sep 2003 | JP |
2004094543 | Mar 2004 | JP |
2004516989 | Jun 2004 | JP |
2004220522 | Aug 2004 | JP |
2004236166 | Aug 2004 | JP |
2004248215 | Sep 2004 | JP |
2004272463 | Sep 2004 | JP |
2004326303 | Nov 2004 | JP |
2004328542 | Nov 2004 | JP |
2004362470 | Dec 2004 | JP |
2005011318 | Jan 2005 | JP |
2005020350 | Jan 2005 | JP |
2005045756 | Feb 2005 | JP |
2005078173 | Mar 2005 | JP |
2005128903 | May 2005 | JP |
2005128965 | May 2005 | JP |
2005141686 | Jun 2005 | JP |
2005209114 | Aug 2005 | JP |
2005528016 | Sep 2005 | JP |
2005533316 | Nov 2005 | JP |
2005534260 | Nov 2005 | JP |
2006011806 | Jan 2006 | JP |
2006018511 | Jan 2006 | JP |
2006018824 | Jan 2006 | JP |
2006020004 | Jan 2006 | JP |
2006091355 | Apr 2006 | JP |
2006129000 | May 2006 | JP |
2006139431 | Jun 2006 | JP |
2006197458 | Jul 2006 | JP |
2006227901 | Aug 2006 | JP |
2006295249 | Oct 2006 | JP |
2007502087 | Feb 2007 | JP |
2007201851 | Aug 2007 | JP |
2007213276 | Aug 2007 | JP |
2008225540 | Sep 2008 | JP |
2008293123 | Dec 2008 | JP |
2009188922 | Aug 2009 | JP |
2010515168 | May 2010 | JP |
1020020068945 | Aug 2002 | KR |
20020096946 | Dec 2002 | KR |
20030018741 | Mar 2003 | KR |
20040069122 | Aug 2004 | KR |
100512362 | Sep 2005 | KR |
20060014942 | Feb 2006 | KR |
20060018235 | Feb 2006 | KR |
20060064222 | Jun 2006 | KR |
20060124430 | Dec 2006 | KR |
20070016301 | Feb 2007 | KR |
2150790 | Jun 2000 | RU |
2267156 | Dec 2005 | RU |
20050100782 | Feb 2006 | RU |
2301450 | Jun 2007 | RU |
1228364 | Feb 2005 | TW |
1252324 | Apr 2006 | TW |
1252628 | Apr 2006 | TW |
1252639 | Apr 2006 | TW |
1252671 | Apr 2006 | TW |
WO9613920 | May 1996 | WO |
WO0178423 | Oct 2001 | WO |
0221478 | Mar 2002 | WO |
WO0225823 | Mar 2002 | WO |
0250732 | Jun 2002 | WO |
WO02054353 | Jul 2002 | WO |
WO03107289 | Dec 2003 | WO |
2004008276 | Jan 2004 | WO |
WO-2004014037 | Feb 2004 | WO |
WO-2005045455 | May 2005 | WO |
WO-2005064515 | Jul 2005 | WO |
WO-2005110208 | Nov 2005 | WO |
2005122483 | Dec 2005 | WO |
WO2006030341 | Mar 2006 | WO |
WO2006092772 | Sep 2006 | WO |
2007026745 | Mar 2007 | WO |
WO2008027965 | Mar 2008 | WO |
2008146576 | Dec 2008 | WO |
WO2008157806 | Dec 2008 | WO |
Entry |
---|
International Search Report, PCT/US2008/058503, European Patent Office, Mar. 31, 2009. |
Written Opinion of the International Searching Authority, PCT/US2008/058503, Mar. 31, 2009. |
Co-pending U.S Appl. No. 13/048,060, filed on Mar. 15, 2011. |
Co-pending U.S. Appl. No. 13/363,580, filed on Feb. 1, 2012. |
Bardia Alavi, et al., “Indoor Geolocation Distance Error Modeling using UWB Channel Measurements” , 2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications, Sep. 11-14, 2005. |
Blundo, C. et al.: “Secure E-Coupons,” Electronic Commerce Research, vol. 5, No. 1, pp. 117-139, Kluwer, Dordrecth, NL, (Jan. 1, 2005), XP002380651, ISSN: 1389-5753, Section 8.4. |
Okazaki, “Eight Methods for Capitalizing on Access Log Analysis, which are Essential to SEO, Marketing and Redesign”, Web Creators, NdN Corporation, Japan, Mar. 1, 2005, vol. 39, pp. 148-155. |
“Examples of Judging whether Business-Related Inventions are Patentable” http://www.jpo.go.jp/tetuzuki/t—tokkyo/bijinesu/biz—pat—case.htm.; Apr. 18, 2003. |
Lester, J et al., “Are You With Me ?—Using Accelerometers to Determine if Two Devices are Carried by the Same Person”, LNCS, Pervasive Computing, Apr. 2004,vol. 3001, pp. 33-50. |
Roumeliotis, T., “Five geofencing ideas for mobile marketing from brands and retailers,” Mobile Commerce Daily, Jul. 16, 2010, 2 pages, Retrieved from http://www.mobilecommercedaily.com/five-geofencing-ideas-for-mobile-marketing-from-brands-and-retailers. |
Number | Date | Country | |
---|---|---|---|
20080240440 A1 | Oct 2008 | US |
Number | Date | Country | |
---|---|---|---|
60908271 | Mar 2007 | US |