# Patent

## Title
Communications with interaction detection

## Abstract

Aspects of the disclosure are directed to detecting interactions with signals, such as by an attacker attempting to gain access to a vehicle. Signal waveforms used for authentication are evaluated, for communications between respective circuits. Possible interaction by a third circuit is analyzed by detecting variations in characteristics of a leading portion of a data symbol relative to known characteristics of the leading portion of the data signal. A condition indicative of whether the signal waveform has been interacted with and retransmitted is determined, based on the detected variations. For instance, if the variations are indicative of a known type of variation induced by interaction and retransmission, such interaction and transmission can be detected. Where the determined condition is not deemed an attack, an output signal that provides vehicle access is generated based on the determined condition.

## Background
Aspects of various embodiments are directed to communication of data and in which interaction with the communication is detected.
Many applications involve detecting a distance between communicating devices synchronization and authentication, which have been implemented using a multitude of approaches. For instance, radio frequency (RF) ranging systems often employ a time-of-flight principle to determine a distance between two objects, or markers on objects, that are communicating between one another. Proximity can be used from a security and authentication perspective, such as by ensuring that a remote device to be connected to a local device is within a predetermined threshold distance of the local device (e.g., to prevent unwanted connections to other devices in relative proximity). Security information can also be communicated, in connection with the time-of-flight communication. In vehicle-key systems, the vehicle can be unlocked if it is determined that the key is close. In other systems, proximity is used to ensure that the communication is between the two truly close-by devices.
Relay attacks can be performed by intercepting communication symbols and replaying at least a portion of the symbols. This is possible on encrypted communication without knowing anything about the content. These attacks can be used to gain access to a vehicle or other aspects relating to the intercepted communication.
These and other matters have presented challenges to communications, such as those involving time-of-flight/distance-based authentication, for a variety of applications.
Various example embodiments are directed to communicating a signal waveform, having a data symbol with a leading portion and authentication information therein, between a first remote circuit and a second local circuit via which authenticated vehicle access is facilitated. These embodiments are amenable, for example, to implementation to detecting interaction with a remote keyless entry system by an attacker attempting to gain unauthorized access to a vehicle. For instance, such an attacker may attempt to accelerate receipt of the signal at the vehicle, which may make a remote transponder appear closer to the vehicle than the transponder really is. At the local circuit, interaction with the signal waveform, by a third circuit, as transmitted from the remote circuit, is identified by detecting variations in characteristics of the leading portion of the data symbol, relative to known characteristics of the leading portion of the data signal.
A condition indicative of whether the signal waveform has been interacted with and retransmitted is determined or otherwise identified when the detected variations in characteristics are indicative of a known type of variation induced by interaction and retransmission. An output signal is generated which provides vehicle access based on the determined condition. In this context, attack attempts, such as those discussed above, can be detected based on interactions between the attacker and the signal. Further, such an approach can be carried out in a manner that is tolerant of noise within a signal waveform, by distinguishing variations due to noise from variations due to attacker interaction.
Another embodiment is directed to an apparatus having a first communication circuit, a second detection circuit and a third output circuit. The first communication circuit communicates a signal waveform, having a data symbol with a leading portion and authentication information therein, between a remote circuit and a local circuit via which authenticated vehicle access is facilitated. The second detection circuit detects interaction, by a third circuit, with the signal waveform transmitted from the remote circuit by detecting variations in characteristics of the leading portion of the data symbol relative to known characteristics of the leading portion of the data signal.
A condition indicative of whether the signal waveform has been interacted with and retransmitted is then determined in response to the detected variations in characteristics being indicative of a known type of variation induced by interaction and retransmission. The third output circuit generates an output signal that provides vehicle access based on the determined condition.
Another embodiment is directed to an apparatus (e.g., or system) including a remote communication circuit that communicates data for accessing a vehicle, and a vehicle access circuit that operates with the remote communication circuit to control locking of an entry door to the vehicle. A signal waveform corresponding to a signal transmitted by the remote communication circuit is detected, the signal waveform having a data symbol with a leading portion and authentication information therein. Variations in characteristics of the leading portion of the data symbol are compared, relative to known characteristics of the leading portion of the (intended/uninterrupted) signal waveform.
A condition indicative of whether the signal waveform has been interacted with and retransmitted is determined, based on the comparison of the variations in characteristics indicating a known type of variation induced by interaction and retransmission. An output signal that controls locking of the entry door is generated based on the determined condition.
The above discussion/summary is not intended to describe each embodiment or every implementation of the present disclosure. The figures and detailed description that follow also exemplify various embodiments.



BRIEF DESCRIPTION OF FIGURES
Various example embodiments may be more completely understood in consideration of the following detailed description and in connection with the accompanying drawings, in which:
FIGS. 1A-1C show an approach to mitigating cross-correlation attacks, in accordance with various embodiments;
FIGS. 2A-2B show an embodiment in which interaction is detected with two attackers, as may be implemented in accordance with one or more embodiments; and
FIGS. 3A-3C show an approach for detecting an attack with regard to a cumulative sum, in accordance with another embodiment.



While various embodiments discussed herein are amenable to modifications and alternative forms, aspects thereof have been shown by way of example in the drawings and will be described in detail. It should be understood, however, that the intention is not to limit the invention to the particular embodiments described. On the contrary, the intention is to cover all modifications, equivalents, and alternatives falling within the scope of the disclosure including aspects defined in the claims. In addition, the term “example” as may be used throughout this application is by way of illustration, and not limitation.
DETAILED DESCRIPTION
Aspects of the present disclosure are believed to be applicable to a variety of different types of apparatuses, systems and methods involving authentication of communications, mitigating interference with communications, and to interference-type attacks that may result in detectable changes in a signal waveform. In certain implementations, aspects of the present disclosure have been shown to be beneficial when used in the context of detecting relay attacks for remote vehicle access, such as for keyless entry or keyless go (e.g., energizing a vehicle drive system). While not necessarily so limited, various aspects may be appreciated through a discussion of examples using such exemplary contexts.
According to various example embodiments, aspects of the present disclosure are directed to facilitating time-of-flight distance bounding protocols for secure communication, such as to detect so-called “Early detect-late commit” relay attacks. Such attacks may be implemented with communication symbol detectors (e.g., matched filter) to signal shape deviation and interference. This type of attack can result in a detected distance being shorter than an actual distance, where the attacker detects the start of a symbol and then emits a tail of the symbol. The received symbol (e.g., at a vehicle communication circuit) therefore is missing the first part of the regular symbol. This type of attack is possible even if the symbol sequence is encoded. Deviations in the start of the symbol are detected and used to detect (and, e.g., prevent) relay attacks, which can be carried out on a physical level. In various implementations, distance bounding is based on a sequence of symbols. Such embodiments may provide detection of interaction/attacks with encrypted symbol sequences in which the attack is performed using known symbol shapes, based on symbol shape deviation, and can be implemented to detect a number of unpredictable symbols. For instance, attacks can be detected for time-of-flight distance bounding protocols involving IEEE 802.15.4 or ISO/IEC 24730 CSS.
Certain embodiments employ knowledge of a limit upon which a physical distance can be made to appear shorter by the relay attack, as may depend on the length of the symbols and the speed at which the communications are made. A symbol detector, such as a matched filter, can be used in a manner that is robust to missing symbol parts and interference, and the start of symbol deviation introduced during a relay attack is detected relative to other signal modifications, such as those due to interference.
Various embodiments are directed to mitigating attacks in scenarios involving a matched filter (e.g., with a cross correlation approach) on input signal and template signal, which provides a measure of similarity between the respective signals. This measure of similarity can be used to detect the presence and position of a certain sequence inside a received signal stream. When the output of a correlator is beyond some threshold, the template signal can be considered as found in the input signal. Such a matched filter can be used to enhance a signal-to-noise ratio (SNR) in the presence of additive stochastic noise. By definition, for signal x(t) and template signal tp (t), the cross-correlation function between a template and partial sequence is given by the following equation.

R(t)=x(t)*tp*(−t)=∫−∞+∞x(τ)·tp*(τ−t)dτ

If the input signal is only part of the template signal rather than the whole one, cross-correlation will still generate a peak with less magnitude and earlier in time. This peak is proportional to the ratio between the partial input signal and the whole template and might still be high enough to be recognized as a match.

Turning now to the figures, FIGS. 1A-1C show an approach to mitigating cross-correlation attacks, in accordance with another example embodiment. The insets 101 and 102 illustrated by FIGS. 1B and 1C show an example implementation in which an input signal includes part of a template signal, in which a peak is generated with a discrete version of cross-correlation. The sequence in inset 102 includes an initial portion from 0-10 that is a template, with the portion thereafter being an input signal. Inset 101 shows a cross-correlation result with a peak 103 and an autocorrelation function of the template itself with a peak 104. Due to the partial similarity between the input signal and template, a peak is still generated when the input is overlapped with the corresponding part of the template. Though not as high as the peak in the autocorrelation function, it is still higher than a threshold (shown as a dashed line), which may cause recognition as a match. Further, the peak 103 occurs earlier than the peak 104, which means a matched filter based detection block will identify the presence of the input of a partial symbol earlier than a full sequence of a normal symbol signal, thus resulting a shorter time-of-flight and related distance calculation. Due to the presence of noise and actual setting of decision threshold, the correlation peak generated by the partial sequence might be lower than the threshold which will result in a failure in a ranging session or an increased bit error rate (BER) in data communication.
Interference in such a scenario can be mitigated as follows and as illustrated by FIG. 1A. At block 110, a signal waveform is communicated between a remote circuit and a local circuit (e.g., with the remote circuit operating as a transponder and the local circuit being within a vehicle and via which authenticated vehicle access is facilitated). The signal waveform has a data symbol with a leading portion and authentication information therein. Interaction by a third circuit with the signal waveform transmitted from the remote circuit is detected as follows. At block 120, variations in characteristics of the leading portion of the data symbol are analyzed relative to known characteristics of the leading portion of the data signal. If the variations are indicative of a known attack, a condition indicative of whether the signal waveform has been interacted with and retransmitted is determined at block 130. If the variations are not indicative of a known attack, a condition indicative that the signal waveform has not been interacted with and retransmitted is determined at block 140. At block 150, an output signal is generated, which provides vehicle access based on the determined condition.
In some implementations, the signal waveform is known and fixed, with different signal forms corresponding to different symbols. The order of the symbols is encrypted such that an attacker needs to detect the order before retransmitting.
FIGS. 2A-2B show an embodiment in which interaction is detected with two attackers, as may be implemented with various embodiments. Interference detection may be carried out, as illustrated by FIG. 2B, at block 210, as may be implemented within a vehicle (car) as shown, and as may be used to detect partial sequence correlation. Normal (non-attack) operation shown is shown in dashed lines. An attacker (Ac) is shown beside the car while another (Ak) is shown as being close to a key (e.g., that an owner of the car may carry away from the car). The car periodically sends a message Rmsg which is intercepted by Ac. Early Detection is used by Ac to perform quick detection on the Rmsg, and may be limited by the minimum equipment delay of τfixed. In some implementations, Ac adds arbitrary delay τarb following τfixed. Ac sends a tail part (Rtail) of the Rmsg with a length kτseq. Though short, this Rtail might still generate a peak high enough in the key (e.g., in an ACQ/SYNC detection block) to be recognized as a proper Rmsg which exploits the correlation effect discussed above.
At t′1 the key starts its timer and after some processing time τp it starts to send back an Rmsg. This Rmsg will be detected by Ak with the same method used by Ac in the beginning and Rtail is sent to the car immediately after the equipment delay τfixed. This Rtail may otherwise cause the car to operate as if an Rmsg is detected, and stop its timer at t′3. According to Eq. 1, the distance measured by the car is calculated in the following way:




  
    
      
        
          D
          ′
        
        =
        
          
            
              1
              2
            
            ⁢
            
              (
              
                
                  τ
                  car
                
                -
                
                  τ
                  key
                
              
              )
            
            ⁢
            c
          
          ⁢
          
          =
          
            
              
                1
                2
              
              ⁡
              
                [
                
                  
                    (
                    
                      
                        t
                        3
                        ′
                      
                      -
                      
                        t
                        0
                      
                    
                    )
                  
                  -
                  
                    (
                    
                      
                        t
                        2
                        ′
                      
                      -
                      
                        t
                        1
                        ′
                      
                    
                    )
                  
                
                ]
              
            
            ⁢
            c
          
        
      
    
  
  
    
      
        
        ⁢
        
          =
          
            
              (
              
                
                  τ
                  d
                
                +
                
                  τ
                  fixed
                
                +
                
                  
                    (
                    
                      k
                      -
                      1
                    
                    )
                  
                  ⁢
                  
                    τ
                    seq
                  
                
                +
                
                  0.5
                  ⁢
                  
                    τ
                    arb
                  
                
              
              )
            
            ⁢
            c
          
        
      
    
  




So the distance reduced by the attack is:

ΔD=D−D′=[(1−k)τseq−0.5τarb−τfixed]c 

Where D is the distance measured by the car in the normal operation. When k is approaching zero, the Rtail is merely a strong pulse and the distance reduction reaches its maximum value which is (τseq−0.5τarb−τfixed)c. If the attacker's equipment delay and arbitrary delay are neglected, the theoretical upper bound of distance reduction is:

ΔDmax=τseqc 

To distinguish between normal operation and attack, features are used as decision criterion. In one embodiment, a cumulative correlation (CC) feature is used. The attack detection is done at the peak of the correlation R[n]n=Np where the partial sequence is recognized by the correlator in the receiver as a predefined Rmarker. The cross correlation is expanded at Np and the cumulative sum of the products is computed as the CC, which is defined as:

C[m]=Σn=1mtp[n]·in[n]

Here, C[N] is the cross-correlation between in[n] and tp[n] at this specific moment, and assumes the system uses bipolar sequences that contain −1 and +1. In normal operation, the received signal is sampled and stored in the input FIFO and the cross-correlation is maximized when an input FIFO sequence is the same (corrupted by noises) with a template. Each product is relatively maximized towards +1 (1×1=1, −1×−1=1). Accordingly, the C[n] curve is monotonic and increasing with a relatively fixed slope.
In connection with one or more embodiments, it has been discovered/recognized that, while the cross-correlation C[N] may be above the decision threshold when an attack occurs, the cumulative sum may not increase with constant slope. This can be used to identify variations in a signal as being due to interference and/or retransmission.
Referring to FIGS. 3A-3C, an approach is shown for detecting an attack with regard to a cumulative sum as above. An input FIFO receives an input signal 310 which can be compared with a template signal 312, as illustrated by FIG. 3A. Part of a forged signal may simply be random noise, such as when an attacker sends Os or randomly guessed values, which tends to cancel. The CC curve will first be relatively flat and then increase with a smaller slope. This feature is graphically represented in insets 320 and 330 as illustrated by FIGS. 3B and 3C respectively under attack and normal scenarios, by way of example using the same full sequence (of length 25) and partial sequence in FIG. 1A. In normal operation, when a symbol is detected based on the cross-correlation peak, the C[n] curve may resemble the inset 330, while inset 320 shows a first-flat CC curve under an LC attack. Attack detection can thus involve distinguishing between two kinds of CC curves or CC features.
In various implementations, a CC curve threshold approach is used to detect an attack. A threshold is used with a C[n] curve to identify variations, such as an abnormal knee in the curve shape. An algorithm as followed is carried out:
Choose a threshold Cth;
Choose a sample index q;
If C[q]≧Cth then
Accept symbol and range measurement;
Else
Reject symbol and range measurement.
The choice of Cth and q may be implemented to influence detection performance. A large Cth may be used to eliminate most of the attack symbols while also making the chance of rejecting a normal symbol higher due to the presence of noise. A lower/minimum detectable distance reduction is determined by q, in which a smaller q results in detection based on fewer received samples, and the usable LC time is less for the attacker. If a perfect down conversion and automatic gain control (AGC) are assumed, after analog-digital conversion and sampling, a discrete version of a demodulated signal is obtained as:

Snor[n]=TP[n]+N[n]

where N[n] is additive Gaussian noise from the channel with zero mean and a variance of σ2. TP and N can be regarded as two independent random processes. For a certain n, TP[n] is a discrete random variable with PMF of p (TP[n]=1)=p(TP[n]=−1)=0.5 and N[n] is a discrete random variable with Gaussian distribution N(0, σ2). In baseband, a symbol is correlated with the template TP [n] in a ranging engine and at the correlation peak, CC is obtained:





  
    
      
        
          
            
              
                
                  C
                  nor
                
                ⁡
                
                  [
                  m
                  ]
                
              
              =
              
                
                  ∑
                  
                    n
                    =
                    1
                  
                  m
                
                ⁢
                
                  
                    
                      S
                      nor
                    
                    ⁡
                    
                      [
                      n
                      ]
                    
                  
                  ·
                  
                    TP
                    ⁡
                    
                      [
                      n
                      ]
                    
                  
                
              
            
          
        
        
          
            
              =
              
                
                  ∑
                  
                    n
                    =
                    1
                  
                  m
                
                ⁢
                
                  
                    (
                    
                      
                        TP
                        ⁡
                        
                          [
                          n
                          ]
                        
                      
                      +
                      
                        N
                        ⁡
                        
                          [
                          n
                          ]
                        
                      
                    
                    )
                  
                  ·
                  
                    TP
                    ⁡
                    
                      [
                      n
                      ]
                    
                  
                
              
            
          
        
      
    
    
      
        (
        1.
        )
      
    
  




Again C[m] is random variable as a function of TP[n] and N[n] and the expected value of the random variable, or E{C[m]} is:

E{Cnor[m]}=E{Σn=1m(TP[n]+N[n])·TP[n]}=Σn=1m{E{TP[n]·TP[n]}+E{N[n]·TP[n]}}  (2.)

For binary symbol sequence of +1 and −1, TP[n]·TP[n]≡1. N[n] and TP[n] are independent and TP[n] is a balanced sequence (the chance of 1 and −1 are equal), so E{N[n]·TP[n]}=E{N[n]}·E{TP[n]}=0. Then Equation 2.) reduces to: E{Cnor[m]}=m The variance of random variable Cnor[m] is:




  
    
      
        
          Var
          ⁢
          
            {
            
              
                C
                nor
              
              ⁡
              
                [
                m
                ]
              
            
            }
          
        
        =
        
          Var
          ⁢
          
            {
            
              
                
                  ∑
                  
                    n
                    =
                    1
                  
                  m
                
                ⁢
                
                  
                    TP
                    ⁡
                    
                      [
                      n
                      ]
                    
                  
                  ·
                  
                    TP
                    ⁡
                    
                      [
                      n
                      ]
                    
                  
                
              
              +
              
                
                  N
                  ⁡
                  
                    [
                    n
                    ]
                  
                
                ·
                
                  TP
                  ⁡
                  
                    [
                    n
                    ]
                  
                
              
            
            }
          
        
      
    
  
  
    
      
        =
        
          
            
              Σ
              n
            
            ⁢
            Var
            ⁢
            
              {
              
                
                  N
                  ⁡
                  
                    [
                    n
                    ]
                  
                
                ·
                
                  TP
                  ⁡
                  
                    [
                    n
                    ]
                  
                
              
              }
            
          
          +
          
            
              Σ
              n
            
            ⁢
            
              Σ
              
                l
                ≠
                n
              
            
            ⁢
            Cov
            ⁢
            
              {
              
                
                  
                    N
                    ⁡
                    
                      [
                      n
                      ]
                    
                  
                  ·
                  
                    TP
                    ⁡
                    
                      [
                      n
                      ]
                    
                  
                
                ,
                
                  
                    N
                    ⁡
                    
                      [
                      l
                      ]
                    
                  
                  ·
                  
                    TP
                    ⁡
                    
                      [
                      l
                      ]
                    
                  
                
              
              }
            
          
        
      
    
  




Because the two terms in the covariance are independent and N [n] and TP [n] are independent, the above equation reduces to:





  
    
      
        
          Var
          ⁢
          
            {
            
              
                N
                ⁡
                
                  [
                  n
                  ]
                
              
              ·
              
                TP
                ⁡
                
                  [
                  n
                  ]
                
              
            
            }
          
        
        =
        
          
            Var
            ⁢
            
              {
              
                N
                ⁡
                
                  [
                  n
                  ]
                
              
              }
            
            ⁢
            Var
            ⁢
            
              {
              
                TP
                ⁡
                
                  [
                  n
                  ]
                
              
              }
            
          
          +
          
            Var
            ⁢
            
              {
              
                N
                ⁡
                
                  [
                  n
                  ]
                
              
              }
            
            ⁢
            
              E
              2
            
            ⁢
            
              {
              
                TP
                ⁡
                
                  [
                  n
                  ]
                
              
              }
            
          
          +
          
            Var
            ⁢
            
              {
              
                TP
                ⁡
                
                  [
                  n
                  ]
                
              
              }
            
            ⁢
            
              E
              2
            
            ⁢
            
              {
              
                N
                ⁡
                
                  [
                  n
                  ]
                
              
              }
            
          
        
      
    
  
  
    
      
        =
        
          
            
              
                σ
                2
              
              ×
              1
            
            +
            0
            +
            0
          
          =
          
            σ
            2
          
        
      
    
  




Then:

Var{Cnor[m]}=Σn=1mVar{N[n]·TP[n]}=m·σ2 

An alternative deduction can lead to the same above result and provide distribution information of Cnor[m]. When m is large which is to say the symbol spreading sequence is long, Cnor[m]=Σn=1mG[n] is a summation of large numbers of i.i.d. random variables where G[n]=Snor[n]. TP[n]. According to Central Limit Theorem, Cnor[m] is Gaussian-distributed with mean of nE{G[n]} and variance of nVar{G[n]} which lead to the same expected value and variance in the above deduction. In summary, Cumulative Correlation under normal operation fulfils:

Cnor[m] ̃N(m,mσ2)

In attack operations, the input signal becomes:

Satt[n]=u[n−K]TP[n]+N[n]

where u[n] is a step function and K is a Late Commit delay expressed in sample counts used by the attacker. The cumulative correlation function under attack becomes:





  
    
      C
      att
    
    ⁡
    
      [
      m
      ]
    
  
  =
  
    {
    
      
        
          
            
              (
              
                m
                -
                K
              
              )
            
            +
            
              
                ∑
                
                  n
                  =
                  1
                
                m
              
              ⁢
              
                
                  N
                  ⁡
                  
                    [
                    n
                    ]
                  
                
                ·
                
                  TP
                  ⁡
                  
                    [
                    n
                    ]
                  
                
              
            
          
        
        
          
            m
            >
            K
          
        
      
      
        
          
            
              
                ∑
                
                  n
                  =
                  1
                
                m
              
              ⁢
              
                
                  N
                  ⁡
                  
                    [
                    n
                    ]
                  
                
                ·
                
                  TP
                  ⁡
                  
                    [
                    n
                    ]
                  
                
              
            
            ⁢
            
              
            
          
        
        
          
            m
            ≤
            K
          
        
      
    
  




The expected value of Catt[M] is:





  
    E
    ⁢
    
      {
      
        
          C
          att
        
        ⁡
        
          [
          m
          ]
        
      
      }
    
  
  =
  
    {
    
      
        
          
            (
            
              m
              -
              K
            
            )
          
        
        
          
            m
            >
            K
          
        
      
      
        
          
            0
            ⁢
            
              
            
          
        
        
          
            m
            ≤
            K
          
        
      
    
  




According to the previous discussions: Var{Catt[m]}=m·σ2 Under attack operation:





  
    
      C
      att
    
    ⁡
    
      [
      m
      ]
    
  
  ~
  
    {
    
      
        
          
            N
            ⁡
            
              (
              
                
                  (
                  
                    m
                    -
                    K
                  
                  )
                
                ,
                
                  m
                  ⁢
                  
                    
                  
                  ⁢
                  
                    σ
                    2
                  
                
              
              )
            
          
        
        
          
            m
            >
            K
          
        
      
      
        
          
            N
            ⁡
            
              (
              
                0
                ,
                
                  m
                  ⁢
                  
                    
                  
                  ⁢
                  
                    σ
                    2
                  
                
              
              )
            
          
        
        
          
            m
            ≤
            K
          
        
      
    
  




From the above discussion, both distribution under normal operation and attack operation are Gaussian and the variance is the same under two different conditions. The expected value is proportional to a partial sequence length the attack uses, which can be determined in consideration of an accumulation of the energy in the sequence with the variance from the accumulation of the AWGN. The distance between the two expected values under normal and attack operation may be a constant K after the Kth term.
Another embodiment is directed to an approach involving the use of a likelihood ratio. An algorithm as follows may be implemented in this context:
Choose a threshold μ;
Compute the likelihood ratio λ=p({right arrow over (C)}|H1)/p({right arrow over (C)}|H2);
If λ≧μ then
Accept symbol and range measurement;
Else
Reject symbol and range measurement.
The above algorithm may be implemented for K values smaller or equal to q, such as when an attacker's LC delay is known to the system. However, attackers may choose arbitrary length of LC delay for an attack sequence thus making it difficult or impossible to determine an appropriate q for the above algorithms in advance. Such scenarios may be addressed as follows.
Normal operation and attack operation are represented by H1 and H2 respectively. Two likelihood functions are p({right arrow over (C)}|H1) and p({right arrow over (C)}|H2) where {right arrow over (C)}=(C1, C2, . . . CN). From previous discussion,

p(C1|H1)=N(1,ρ2)

and according to Bayes theorem, we have:

p(C1,C2|H1)=p(C2|C1,H1)·p(C1|H1)

in which p(C2|C1, H1) represents, under normal operation, when C1 is observed, the probability density function of C2. In addition, C1 is now regarded as a constant number and it has a linear relationship with C2:

C2=C1+1+n2 

where 1 results from the correlation operation between input sequence and the template. n2 ̃N(0, σ2) is the noise. A shifted Gaussian distribution relates as follows:

p(C2|C1,H1)=N(1+C1,σ2)

Similarly p(C3|C2, C1, H1)=N(1+C2,σ2), and





  
    p
    ⁡
    
      (
      
        
          
            C
            N
          
          ❘
          
            C
            
              N
              -
              1
            
          
        
        ,
        
          C
          
            N
            -
            2
          
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          C
          1
        
        ,
        
          H
          1
        
      
      )
    
  
  =
  
    
      N
      ⁡
      
        (
        
          
            1
            +
            
              C
              
                N
                -
                1
              
            
          
          ,
          
            σ
            2
          
        
        )
      
    
    =
    
      
        
          1
          
            σ
            ⁢
            
              
                2
                ⁢
                
                  
                
                ⁢
                π
              
            
          
        
        ⁢
        exp
      
      -
      
        
          
            (
            
              
                C
                N
              
              -
              
                (
                
                  
                    C
                    
                      N
                      -
                      1
                    
                  
                  +
                  1
                
                )
              
            
            )
          
          2
        
        
          2
          ⁢
          
            
          
          ⁢
          
            σ
            2
          
        
      
    
  




Using the chain rule of conditional probability:





  
    p
    ⁡
    
      (
      
        
          C
          ⇀
        
        ❘
        
          H
          1
        
      
      )
    
  
  =
  
    
      
        p
        ⁡
        
          (
          
            
              
                C
                N
              
              ❘
              
                C
                
                  N
                  -
                  1
                
              
            
            ,
            
              C
              
                N
                -
                2
              
            
            ,
            ...
            ⁢
            
              
            
            ,
            
              C
              1
            
            ,
            
              H
              1
            
          
          )
        
      
      ·
      
        p
        ⁡
        
          (
          
            
              
                C
                
                  N
                  -
                  1
                
              
              ❘
              
                C
                
                  N
                  -
                  2
                
              
            
            ,
            ...
            ⁢
            
              
            
            ,
            
              C
              1
            
            ,
            
              H
              1
            
          
          )
        
      
      ·
      
        
      
      ⁢
      ...
      ⁢
      
        
      
      ·
      
        p
        ⁡
        
          (
          
            
              C
              1
            
            ❘
            
              H
              1
            
          
          )
        
      
    
    =
    
      
        
          (
          
            1
            
              σ
              ⁢
              
                
                  2
                  ⁢
                  
                    
                  
                  ⁢
                  π
                
              
            
          
          )
        
        N
      
      ⁢
      
        
          ∏
          
            i
            =
            1
          
          N
        
        ⁢
        
          exp
          (
          
            -
            
              
                
                  (
                  
                    
                      C
                      i
                    
                    -
                    
                      C
                      
                        i
                        -
                        1
                      
                    
                    -
                    1
                  
                  )
                
                2
              
              
                2
                ⁢
                
                  
                
                ⁢
                
                  σ
                  2
                
              
            
          
          )
        
      
    
  




where C0=0. Taking a natural logarithm of both side of the equation, the log-likelihood is:





  
    log
    ⁡
    
      (
      
        p
        ⁢
        
          (
          
            
              C
              ⇀
            
            ❘
            
              H
              1
            
          
          )
        
      
      )
    
  
  =
  
    
      N
      ⁢
      
        
      
      ⁢
      log
      ⁢
      
        1
        
          σ
          ⁢
          
            
              2
              ⁢
              
                
              
              ⁢
              π
            
          
        
      
    
    +
    
      
        ∑
        
          i
          =
          1
        
        N
      
      ⁢
      
        -
        
          
            
              (
              
                
                  C
                  i
                
                -
                
                  C
                  
                    i
                    -
                    1
                  
                
                -
                1
              
              )
            
            2
          
          
            2
            ⁢
            
              
            
            ⁢
            
              σ
              2
            
          
        
      
    
  




Similarly, under attack operation with certain K value, we have:





  
    p
    ⁡
    
      (
      
        
          
            C
            ⇀
          
          ❘
          
            H
            2
          
        
        ,
        K
      
      )
    
  
  =
  
    
      
        
          (
          
            1
            
              σ
              ⁢
              
                
                  2
                  ⁢
                  
                    
                  
                  ⁢
                  π
                
              
            
          
          )
        
        N
      
      ·
      
        exp
        (
        
          
            -
            
              
                (
                
                  
                    C
                    1
                  
                  -
                  
                    C
                    0
                  
                
                )
              
              2
            
          
          
            2
            ⁢
            
              
            
            ⁢
            
              σ
              2
            
          
        
        )
      
    
    ⁢
    
      
    
    ⁢
    ...
    ⁢
    
      
    
    ⁢
    
      
        exp
        (
        
          
            -
            
              
                (
                
                  
                    C
                    K
                  
                  -
                  
                    C
                    
                      K
                      -
                      1
                    
                  
                
                )
              
              2
            
          
          
            2
            ⁢
            
              
            
            ⁢
            
              σ
              2
            
          
        
        )
      
      ·
      
        exp
        (
        
          
            -
            
              
                (
                
                  
                    C
                    
                      K
                      +
                      1
                    
                  
                  -
                  
                    C
                    K
                  
                  -
                  1
                
                )
              
              2
            
          
          
            2
            ⁢
            
              
            
            ⁢
            
              σ
              2
            
          
        
        )
      
    
    ⁢
    
      
    
    ⁢
    ...
    ⁢
    
      
    
    ⁢
    
      exp
      (
      
        
          -
          
            
              (
              
                
                  C
                  N
                
                -
                
                  C
                  
                    N
                    -
                    1
                  
                
                -
                1
              
              )
            
            2
          
        
        
          2
          ⁢
          
            
          
          ⁢
          
            σ
            2
          
        
      
      )
    
  




And the corresponding log-likelihood is:





  
    log
    ⁡
    
      (
      
        p
        ⁢
        
          (
          
            
              
                C
                ⇀
              
              ❘
              
                H
                2
              
            
            ,
            K
          
          )
        
      
      )
    
  
  =
  
    
      N
      ⁢
      
        
      
      ⁢
      log
      ⁢
      
        1
        
          σ
          ⁢
          
            
              2
              ⁢
              
                
              
              ⁢
              π
            
          
        
      
    
    +
    
      
        ∑
        
          i
          =
          1
        
        K
      
      ⁢
      
        -
        
          
            
              (
              
                
                  C
                  i
                
                -
                
                  C
                  
                    i
                    -
                    1
                  
                
              
              )
            
            2
          
          
            2
            ⁢
            
              
            
            ⁢
            
              σ
              2
            
          
        
      
    
    +
    
      
        ∑
        
          i
          =
          
            K
            +
            1
          
        
        N
      
      ⁢
      
        -
        
          
            
              (
              
                
                  C
                  i
                
                -
                
                  C
                  
                    i
                    -
                    1
                  
                
                -
                1
              
              )
            
            2
          
          
            2
            ⁢
            
              
            
            ⁢
            
              σ
              2
            
          
        
      
    
  




The difference between the two log-likelihood is:





  
    
      log
      ⁢
      
        (
        
          p
          ⁢
          
            (
            
              
                C
                ⇀
              
              ❘
              
                H
                1
              
            
            )
          
        
        )
      
    
    -
    
      log
      ⁡
      
        (
        
          p
          ⁡
          
            (
            
              
                
                  C
                  ⇀
                
                ❘
                
                  H
                  2
                
              
              ,
              K
            
            )
          
        
        )
      
    
  
  =
  
    
      ∑
      
        i
        =
        1
      
      K
    
    ⁢
    
      
        
          2
          ⁢
          
            (
            
              
                C
                i
              
              -
              
                C
                
                  i
                  -
                  1
                
              
            
            )
          
        
        -
        1
      
      
        2
        ⁢
        
          
        
        ⁢
        
          σ
          2
        
      
    
  




or equivalently:





  
    p
    ⁡
    
      (
      
        
          
            C
            ⇀
          
          ❘
          
            H
            2
          
        
        ,
        K
      
      )
    
  
  =
  
    
      p
      ⁡
      
        (
        
          
            C
            ⇀
          
          ❘
          
            H
            1
          
        
        )
      
    
    ·
    
      exp
      ⁡
      
        (
        
          
            ∑
            
              i
              =
              1
            
            K
          
          ⁢
          
            
              
                
                  -
                  2
                
                ⁢
                
                  (
                  
                    
                      C
                      i
                    
                    -
                    
                      C
                      
                        i
                        -
                        1
                      
                    
                  
                  )
                
              
              +
              1
            
            
              2
              ⁢
              
                
              
              ⁢
              
                σ
                2
              
            
          
        
        )
      
    
  




Applying total probability theorem to p({right arrow over (C)}|H2):





  
    p
    ⁡
    
      (
      
        
          C
          ⇀
        
        ❘
        
          H
          2
        
      
      )
    
  
  =
  
    
      
        ∑
        
          K
          =
          1
        
        N
      
      ⁢
      
        
      
      ⁢
      
        
          p
          ⁡
          
            (
            
              
                
                  C
                  ⇀
                
                ❘
                
                  H
                  2
                
              
              ,
              K
            
            )
          
        
        ·
        
          p
          ⁡
          
            (
            K
            )
          
        
      
    
    =
    
      
        ∑
        
          K
          =
          1
        
        N
      
      ⁢
      
        
          [
          
            
              p
              ⁡
              
                (
                
                  
                    C
                    ⇀
                  
                  ❘
                  
                    H
                    1
                  
                
                )
              
            
            ·
            
              exp
              ⁡
              
                (
                
                  
                    ∑
                    
                      i
                      =
                      1
                    
                    K
                  
                  ⁢
                  
                    
                      
                        
                          -
                          2
                        
                        ⁢
                        
                          (
                          
                            
                              C
                              i
                            
                            -
                            
                              C
                              
                                i
                                -
                                1
                              
                            
                          
                          )
                        
                      
                      +
                      1
                    
                    
                      2
                      ⁢
                      
                        
                      
                      ⁢
                      
                        σ
                        2
                      
                    
                  
                
                )
              
            
          
          ]
        
        ·
        
          p
          ⁡
          
            (
            K
            )
          
        
      
    
  




p(K) is the probability mass function of the LC length that the attacker chooses. Assuming an attacker may use all possible LC delay length K with equal chance, means p(K)=1/N where N is the normal sequence length. The inner summation terms will cancel each other and give:





  
    p
    ⁢
    
      (
      
        
          C
          ⇀
        
        ❘
        
          H
          2
        
      
      )
    
  
  =
  
    
      1
      N
    
    ⁢
    p
    ⁢
    
      (
      
        
          C
          ⇀
        
        ❘
        
          H
          1
        
      
      )
    
    ⁢
    
      
        ∑
        
          K
          =
          1
        
        N
      
      ⁢
      
        
      
      ⁢
      
        exp
        ⁡
        
          (
          
            
              
                
                  -
                  2
                
                ⁢
                
                  C
                  K
                
              
              +
              K
            
            
              2
              ⁢
              
                σ
                2
              
            
          
          )
        
      
    
  




The likelihood ratio is:





  λ
  =
  
    
      
        p
        ⁡
        
          (
          
            
              C
              ⇀
            
            ❘
            
              H
              1
            
          
          )
        
      
      
        p
        ⁡
        
          (
          
            
              C
              ⇀
            
            ❘
            
              H
              2
            
          
          )
        
      
    
    =
    
      N
      
        
          ∑
          
            K
            =
            1
          
          N
        
        ⁢
        
          
        
        ⁢
        
          exp
          ⁡
          
            (
            
              
                
                  
                    -
                    2
                  
                  ⁢
                  
                    C
                    K
                  
                
                +
                K
              
              
                2
                ⁢
                
                  σ
                  2
                
              
            
            )
          
        
      
    
  




In some implementations in which an attacker LC delay length K is known, p({right arrow over (C)}|H2) reduces to:




  
    
      
        
          p
          ⁡
          
            (
            
              
                C
                ⇀
              
              ❘
              
                H
                2
              
            
            )
          
        
        =
        
        ⁢
        
          
            
              ∑
              
                K
                =
                1
              
              N
            
            ⁢
            
              
            
            ⁢
            
              
                p
                ⁡
                
                  (
                  
                    
                      
                        C
                        ⇀
                      
                      ❘
                      
                        H
                        2
                      
                    
                    ,
                    K
                  
                  )
                
              
              ·
              
                p
                ⁡
                
                  (
                  K
                  )
                
              
            
          
          =
          
            
              p
              ⁡
              
                (
                
                  
                    
                      C
                      ⇀
                    
                    ❘
                    
                      H
                      2
                    
                  
                  ,
                  
                    K
                    known
                  
                
                )
              
            
            ·
            1
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
            p
            ⁡
            
              (
              
                
                  C
                  ⇀
                
                ❘
                
                  H
                  1
                
              
              )
            
          
          ·
          
            exp
            ⁡
            
              (
              
                
                  
                    
                      -
                      2
                    
                    ⁢
                    
                      C
                      
                        K
                        known
                      
                    
                  
                  +
                  
                    K
                    known
                  
                
                
                  2
                  ⁢
                  
                    σ
                    2
                  
                
              
              )
            
          
        
      
    
  




The likelihood ratio is then:





  
    λ
    K
  
  =
  
    
      
        p
        ⁡
        
          (
          
            
              C
              ⇀
            
            ❘
            
              H
              1
            
          
          )
        
      
      
        p
        ⁡
        
          (
          
            
              C
              ⇀
            
            ❘
            
              H
              2
            
          
          )
        
      
    
    =
    
      1
      
        exp
        ⁡
        
          (
          
            
              
                
                  -
                  2
                
                ⁢
                
                  C
                  
                    K
                    known
                  
                
              
              +
              
                K
                known
              
            
            
              2
              ⁢
              
                σ
                2
              
            
          
          )
        
      
    
  




Under this case, similar to algorithms above, the judgment parameter (λ, C[q] or d[q]) depends on one term in C [m] or d [m] sequence.

Another embodiment involves multiple symbol protocols and detection. Such an approach may be implemented for distance measuring and detection of a possible attack on a single symbol, and with communication messages having multiple symbols that are encrypted and having a sequence that is difficult to predict. The likelihood of the detection of the attack, and in that way the protection, can be increased by detecting the attack and detecting (e.g., estimating) distance traveled on each of the symbols of the message.
An example distance bounding protocol is carried out as followed. First, a distance measurement is carried out on each symbol in an encrypted sequence. For example let there be M symbols and M distance measurements d1, . . . , dM. Actual distance is computed as some combination of the M measured distances. For example a median value of the M measurements can be taken as a robust estimate of the distance. If the symbol sequence is not predictable, this may force an attacker to perform a relay attack on multiple symbols, increasing the chance of detection. Detection is performed on all message symbols if the distance is small for an action to be performed (e.g., to open a car door if a measured distance is less than 2m). An above described attack detection can be applied.
Using this approach, the chance for detecting the attack will increase in this way. For example let the chance for not detecting the attack on a single symbol be as large as 0.3 (that means 30% chance of attack to succeed) and false alarm rate be 1/10^6. If the sequence has 10 symbols the chance of the successful attack will reduce to 0.3^10 ̃5e-6, while the false detection rate will increase only to 1/10^5. This can be even further improved by modeling a complete multiple symbol sequence for detection, as an extension of the algorithms described above.
In some implementations, due to multipath measurements some of the distances may appear larger than the median measured distance. An attacker might attack only a few symbols such that they are smaller than the median distance but the median distance will still be large and correct. Smaller than median measurements can be used as an indication of such unsuccessful relay attack on a small number of the message symbols.
In some embodiments, additional protection is achieved based on the physical limitations and attacker inaccuracy. In certain implementations, a measured/estimated distance may be negative, which fails the attacks, where the following holds:

Dreal−Dfake<ΔD<Dreal  (3.)

where Dreal is the real distance between the key and the car and Dfake is the attacker's desired fake distance. We have:





   
  
    {
    
      
        
          
            k
            >
            
              1
              -
              
                
                  
                    D
                    real
                  
                  +
                  
                    
                      (
                      
                        
                          0.5
                          ⁢
                          
                            
                          
                          ⁢
                          
                            τ
                            arb
                          
                        
                        +
                        
                          τ
                          fixed
                        
                      
                      )
                    
                    ⁢
                    c
                  
                
                
                  c
                  ⁢
                  
                    
                  
                  ⁢
                  
                    τ
                    seq
                  
                
              
            
          
        
      
      
        
          
            k
            <
            
              1
              -
              
                
                  
                    D
                    real
                  
                  -
                  
                    D
                    fake
                  
                  +
                  
                    
                      (
                      
                        
                          0.5
                          ⁢
                          
                            
                          
                          ⁢
                          
                            τ
                            arb
                          
                        
                        +
                        
                          τ
                          fixed
                        
                      
                      )
                    
                    ⁢
                    c
                  
                
                
                  c
                  ⁢
                  
                    
                  
                  ⁢
                  
                    τ
                    seq
                  
                
              
            
          
        
      
    
  




Translate the range of k to time by multiplying the length of the Rmsg:





  
    Δ
    ⁢
    
      
    
    ⁢
    
      k
      ·
      
        τ
        seq
      
    
  
  =
  
    
      D
      fake
    
    c
  




Using the example in which an attacker intends to steal a car by convincing the system that its owner is just 1 meter away while the owner is actually 100 meters away and the ranging system uses 500 ns long Rmsg, Dreal=100m and Dfake=1 m which results in 0.3329<k<0.3395. This is equivalent to 1m/c=3 ns timing accuracy. If the attacker is not so ambitious, let's say for a fake distance of 10 meters, then we have 0.3329<k<0.3996 which is equivalent to 10/c=30 ns timing accuracy.
Various example embodiments are directed to communicating a signal waveform, having a data symbol with a leading portion and authentication information therein, between a first remote circuit and a second local circuit via which authenticated vehicle access is facilitated. These embodiments are amenable, for example, to implementation to detecting interaction with a remote keyless entry system by an attacker attempting to gain unauthorized access to a vehicle. For instance, such an attacker may attempt to accelerate receipt of the signal at the vehicle, which may make a remote transponder appear closer to the vehicle than it really is. At the local circuit, interaction with the signal waveform, by a third circuit, as transmitted from the remote circuit is identified by detecting variations in characteristics of the leading portion of the data symbol, relative to known characteristics of the leading portion of the data signal. A condition of the signal waveform indicative of whether the signal waveform has been interacted with and retransmitted is determined or otherwise identified when the detected variations in characteristics are indicative of a known type of variation induced by interaction and retransmission. An output signal is generated which provides vehicle access based on the determined condition. For instance, the output signal may be generated for unlocking an entry door to the vehicle when the determined condition is not indicative of interaction and retransmission. In this context, attack attempts such as those discussed above can be detected based on interactions between the attacker and the signal. Further, such an approach can be carried out in a manner that is tolerant of noise within the signal waveform, by distinguishing variations due to noise from variations due to attacker interaction.
The condition of the signal waveform and related authentication is determined in a variety of manners, to suit particular embodiments. In some embodiments, changes in the leading portion of the data symbol are compared with a retransmission profile that corresponds to changes induced by interaction and retransmission of the signal waveform. A distance between the first remote circuit and the second local circuit is determined based on the data symbol. The output signal is generated in response to both the determined distance being less than a predetermined threshold, and the changes in the leading portion of the data signal not matching the retransmission profile (i.e., indicative that the signal waveform has not been tampered with).
In other embodiments, determining the condition of the signal waveform involves distinguishing between noise-based variations in the signal waveform and the variations induced by interaction and retransmission. In some implementations, such an approach involves assessing a statistical component of the signal waveform relative to statistical components of known interaction and retransmission techniques. In other implementations, the signal waveform is cross-correlated with a template waveform and the variations are detected based on characteristics of the cross-correlation, relative to expected cross-correlation characteristics of the signal waveform. Another cross-correlating approach involves cross-correlating the signal waveform with a template waveform, computing a cumulative correlation as a sum of products of the cross-correlation, and detecting the variations as being induced by interaction and retransmission based on a slope of values of the cumulative correlation, relative to an expected slope of values of a cumulative correlation of the signal waveform.
In certain embodiments, the condition of the signal waveform is determined by cross-correlating the signal waveform with a template waveform, a cumulative correlation is computed as a sum of products of the cross-correlation (e.g., a set of intermediate values of the cross correlation), and the variations are detected based on the cumulative correlation. Cross-correlating in this context may, for example, include cross-correlating
respective portions of each waveform pertaining to a common time period, and producing a product for each of the respective portions that are cross-correlated with one another. The cumulative correlation is then computed by summing the products.
Variations in characteristics of a leading portion of a data symbol can be detected using a variety of approaches. In some implementations, a position of a portion of the data symbol in which the detected variations occur is identified and the condition is determined based on the identified position. Further, detecting such variations may be carried out over a plurality of symbols, each of which is used in determining that the signal waveform has been interacted with and retransmitted.
In certain embodiments, a ratio is computed between a first likelihood function employing characteristics in the data symbol and a second likelihood function employing the known characteristics. A more particular embodiment involves computing a ratio between a first likelihood function employing characteristics in the leading edge and a second likelihood function employing the known characteristics. In either embodiment, the variations may be detected based on the computed ratio and a threshold indicative of variations. In a further implementation, the ratio is computed based on a probability mass function characterizing timing of interaction within the data symbol (e.g., of an unknown timing).
Another embodiment is directed to an apparatus having a communication circuit, a detection circuit and an output circuit. The communication circuit communicates a signal waveform, having a data symbol with a leading portion and authentication information therein, between a remote circuit and a local circuit via which authenticated vehicle access is facilitated. The detection circuit detects interaction, by another (e.g., attacker-operated) circuit, with the signal waveform transmitted from the remote circuit by detecting variations in characteristics of the leading portion of the data symbol relative to known characteristics of the leading portion of the data signal. The variations may, for example, be detected based upon a computed a ratio between a first likelihood function employing characteristics in the leading portion and a second likelihood function employing the known characteristics. A condition indicative of whether the signal waveform has been interacted with and retransmitted is then determined in response to the detected variations in characteristics being indicative of a known type of variation induced by interaction and retransmission. The output circuit generates an output signal that provides vehicle access based on the determined condition (e.g., by unlocking an entry door).
The detection circuit operates in a variety of manners, to suit particular embodiments. In some embodiments, changes in the leading portion of the data symbol are compared with a retransmission profile that corresponds to changes induced by interaction and retransmission of the signal waveform. A distance between the remote circuit and the second local circuit is determined based on the data symbol. The output signal is generated in response to both the determined distance being less than a predetermined threshold, and the compared changes not matching the retransmission profile. In this context, the output signal may be inhibited in response to the changes in the leading portion of the data symbol matching the retransmission profile.
In some embodiments, the apparatus distinguishes noise-based variations in the signal waveform from variations induced by interaction and retransmission by cross-correlating the signal waveform with a template waveform, computing a cumulative correlation as a sum of products of the cross-correlation, and detecting the variations based on the cumulative correlation.
Various blocks, modules or other circuits may be implemented to carry out one or more of the operations and activities described herein and/or shown in the figures. In these contexts, a “block” (also sometimes “logic circuitry” or “module”) is a circuit that carries out one or more of these or related operations/activities (e.g., cumulative correlation, thresholding, or ratio comparison). For example, in certain of the above-discussed embodiments, one or more modules are discrete logic circuits or programmable logic circuits configured and arranged for implementing these operations/activities, as in the circuit modules shown in FIG. 1A. In certain embodiments, such a programmable circuit is one or more computer circuits programmed to execute a set (or sets) of instructions (and/or configuration data). The instructions (and/or configuration data) can be in the form of firmware or software stored in and accessible from a memory (circuit). As an example, first and second modules include a combination of a CPU hardware-based circuit and a set of instructions in the form of firmware, where the first module includes a first CPU hardware circuit with one set of instructions and the second module includes a second CPU hardware circuit with another set of instructions.
Certain embodiments are directed to a computer program product (e.g., nonvolatile memory device), which includes a machine or computer-readable medium having stored thereon instructions which may be executed by a computer (or other electronic device) to perform these operations/activities.
Based upon the above discussion and illustrations, those skilled in the art will readily recognize that various modifications and changes may be made to the various embodiments without strictly following the exemplary embodiments and applications illustrated and described herein. For example, implementations described with keyless entry may be applied to keyless go (e.g., engaging a vehicle's drive system), or to other short-range communications such as with smart cards and other transaction-related communication. Such modifications do not depart from the true spirit and scope of various aspects of the invention, including aspects set forth in the claims.

## Claims

1. A method comprising:
communicating a signal waveform, having a data symbol with a leading portion and authentication information therein, between a first remote circuit and a second local circuit via which access to a vehicle is facilitated;
at the local circuit, detecting interaction, by a third circuit, with the signal waveform transmitted from the first remote circuit by
detecting variations in characteristics of the leading portion of the data symbol relative to characteristics of the leading portion of the signal waveform,
determining a condition indicative of whether the signal waveform has been interacted with and retransmitted, in response to the detected variations in characteristics being indicative of a type of variation induced by interaction and retransmission; and

generating an output signal that provides vehicle access based on the determined condition.

2. The method of claim 1, wherein the access to the vehicle includes controlled unlocking of an entry door to the vehicle;
wherein determining the condition includes comparing changes in the leading portion of the data symbol with a retransmission profile that corresponds to changes induced by interaction and retransmission of the signal waveform,
further including determining a distance between the first remote circuit and the second local circuit based on the data symbol, and
wherein generating the output signal based on the determined condition includes,
generating the output signal in response to the determined distance being less than a predetermined threshold and the comparing of the changes in the leading portion of the data signal not matching the retransmission profile, and
inhibiting the output signal in response to the changes in the leading portion of the data symbol matching the retransmission profile.

3. The method of claim 1, wherein characteristics of the leading portion of the signal waveform include expected characteristics of the signal waveform as uninterrupted by the third circuit, wherein determining the condition includes distinguishing between noise-based variations in the signal waveform and the variations induced by interaction and retransmission.

4. The method of claim 3, wherein distinguishing between noise-based variations in the signal waveform and the variations induced by interaction and retransmission includes assessing a statistical component of the signal waveform relative to statistical components of known interaction and retransmission techniques.

5. The method of claim 3, wherein distinguishing between noise-based variations in the signal waveform and the variations induced by interaction and retransmission includes cross-correlating the signal waveform with a template waveform and detecting the variations based on characteristics of the cross-correlation, relative to expected cross-correlation characteristics of the signal waveform.

6. The method of claim 3, wherein distinguishing between noise-based variations in the signal waveform and the variations induced by interaction and retransmission includes:
cross-correlating the signal waveform with a template waveform,
computing a cumulative correlation as a sum of products of the cross correlation, and
detecting the variations based on the cumulative correlation.

7. The method of claim 6, wherein
cross-correlating the signal waveform with a template waveform includes cross-correlating respective portions of each waveform pertaining to a common time period, and producing a product for each of the respective portions that are cross-correlated with one another, and
computing the cumulative correlation includes summing the products.

8. The method of claim 3, wherein distinguishing between noise-based variations in the signal waveform and the variations induced by interaction and retransmission includes:
cross-correlating the signal waveform with a template waveform,
computing a cumulative correlation as a sum of products relating to the cross correlation, and
detecting the variations as being induced by interaction and retransmission based on a slope of values of the cumulative correlation, relative to an expected slope of values of a cumulative correlation of the signal waveform.

9. The method of claim 3, wherein
detecting variations in characteristics of the leading portion of the data symbol includes identifying a position of a portion of the data symbol in which the detected variations occur, and
determining the condition is based on the identified position.

10. The method of claim 3, wherein
detecting variations in characteristics of the leading portion of the data symbol is carried out for a plurality of symbols, and
determining that the signal waveform has been interacted with and retransmitted is based on the detected variations in each of the plurality of symbols.

11. The method of claim 3, wherein detecting variations in characteristics of the leading portion of the data symbol relative to known characteristics of the leading portion of the data signal includes:
computing a ratio between a first likelihood function employing characteristics in the data symbol and a second likelihood function employing the known characteristics; and
detecting variations based on the computed ratio and a threshold indicative of variations.

12. The method of claim 1, wherein detecting variations in characteristics of the leading portion of the data symbol relative to known characteristics of the leading portion of the data signal includes:
computing a ratio between a first likelihood function employing characteristics in the leading edge and a second likelihood function employing the known characteristics; and
detecting variations based on the computed ratio and a threshold indicative of variations.

13. The method of claim 12, wherein computing the ratio includes computing the ratio based on a probability mass function characterizing timing of interaction within the data symbol.

14. The method of claim 1, wherein generating an output signal that provides vehicle access based on the determined condition includes unlocking an entry door to the vehicle via the generated output signal, in response to the condition not being indicative of interaction and retransmission of the signal.

15. An apparatus comprising:
a first communication circuit configured and arranged to communicate a signal waveform, having a data symbol with a leading portion and authentication information therein, between a remote circuit and a local circuit via which access to a vehicle is facilitated;
a second detection circuit configured and arranged to detect interaction, by a third circuit, with the signal waveform transmitted from the remote circuit by
detecting variations in characteristics of the leading portion of the data symbol relative to characteristics of the leading portion of the signal waveform,
determining a condition indicative of whether the signal waveform has been interacted with and retransmitted, in response to the detected variations in characteristics being indicative of a type of variation induced by interaction and retransmission; and
a third output circuit configured and arranged to generate an output signal that provides vehicle access based on the determined condition.

16. The apparatus of claim 15, wherein
the second detection circuit is configured and arranged to
determine the condition by comparing changes in the leading portion of the data symbol with a retransmission profile that corresponds to changes induced by interaction and retransmission of the signal waveform, and
determine a distance between the remote circuit and the local circuit based on the data symbol; and

the third output circuit is configured and arranged to
generate the output signal in response to the determined distance being less than a predetermined threshold and the comparing of the changes in the leading portion of the data signal not matching the retransmission profile, and
inhibit the output signal in response to the changes in the leading portion of the data symbol matching the retransmission profile.

17. The apparatus of claim 15, wherein the second detection circuit is configured and arranged to determine the condition via distinguishing between noise-based variations in the signal waveform and variations induced by interaction and retransmission by
cross-correlating the signal waveform with a template waveform,
computing a cumulative correlation as a sum of products of the cross correlation, and
detecting the variations based on the cumulative correlation.

18. The apparatus of claim 15, wherein the second detection circuit is configured and arranged to detect variations in characteristics of the leading portion of the data symbol relative to known characteristics of the leading portion of the data signal by:
computing a ratio between a first likelihood function employing characteristics in the leading portion and a second likelihood function employing the known characteristics; and
detecting variations based on the computed ratio and a threshold indicative of variations.

19. The apparatus of claim 15, wherein the third output circuit is configured and arranged to unlock an entry door to the vehicle via the generated output signal, in response to the condition being determined as not being indicative of interaction and retransmission of the signal.

20. An apparatus comprising:
a remote communication circuit configured and arranged to communicate data for access to a vehicle that is distance-limited; and
a vehicle access circuit configured and arranged with the remote communication circuit to control locking of an entry door to the vehicle by
detecting a signal waveform corresponding to a signal transmitted by the remote communication circuit, the signal waveform having a data symbol with a leading portion and authentication information therein,
comparing variations in characteristics of the leading portion of the data symbol relative to characteristics of the leading portion of the signal waveform,
determining a condition indicative of whether the signal waveform has been interacted with and retransmitted, based on the comparing of the variations in characteristics being indicative of a type of variation induced by interaction and retransmission, and
generating an output signal that controls locking of the entry door based on the determined condition.