The present invention relates to an orthogonal frequency division multiplexing (OFDM) communication system. More specifically, the present invention is related to using OFDM-related techniques to protect and authenticate digital information transmitted to and received from a user's wireless transmit/receive unit (WTRU).
Wireless systems are susceptible in many respects. These susceptibilities are increasing as new wireless technologies are growing in prevalence. Ad-hoc networks, where individual users communicate with each other directly without using intermediary network nodes, creates new susceptibilities to the users and networks. These susceptibilities can be categorized as “trust”, “rights”, “identity”, “privacy” and “security” related issues.
“Trust” refers to the assurance that information communicated in these systems can be shared. To illustrate, a wireless user may want to know that a communication was sent to it from a trusted source and using trusted communication nodes. The user in an ad-hoc network may have no knowledge that the communication was transferred over a hacker's wireless device with packet sniffing software. Additionally, with the use of tunneling, intermediate nodes transferring the communication may be transparent to the wireless user.
“Rights” (“rights management”) refers to the control of data. To illustrate, one wireless user may have limited rights in a wireless system. However, if that user colludes (knowingly or unknowingly) with a second node having superior rights, that user may gain rights above those that the user is allowed.
“Identity” refers to the control linked to the identity of the wireless user. To illustrate, a rogue wireless device may attempt to access a wireless network by pretending to be an authorized user of the network, by using that authorized user's identity. “Privacy” refers to maintaining privacy of the individual, data and context. A wireless user may not want others to know, which web sites he/she visits and, in particular, which information is sent to these sites, such as financial information, medical information, etc. “Security” refers to the security of the data and context, such as preventing an unauthorized individual access to a wireless user's information.
To reduce the susceptibility of wireless networks, techniques such as wired equivalent privacy (WEP), Wi-Fi protected access (WPA), extensible authentication protocol (EAP), IEEE 802.11i and global system for mobile communications (GSM) based encryption are used. Although these techniques provide some protection, they are still susceptible to the trusts, rights, identity, privacy and security issues discussed above. To illustrate, although a particular wireless communication node may have the correct WEP keys to communicate with a wireless user, that user may not know whether he/she can “trust” that node.
Additionally, authentication of the user using these keys typically occurs at higher layers of the communication stack. Accordingly, even when these controls are in place, a rogue wireless user or hacker may have some (although limited) access to the communication stack. This access creates vulnerabilities, such as to denial of service attacks, among others.
Steganography is the art of passing information in a manner that the very existence of the message is unknown. The goal of steganography is to avoid drawing suspicion to the transmission of a hidden message. If suspicion is raised, then this goal is defeated. Steganography encompasses methods of transmitting secret messages through innocuous cover carriers in such a manner that the very existence of the embedded messages is undetectable. Creative methods have been devised in the hiding process to reduce the visible detection of the embedded messages.
Watermarking is a well-known technique for protecting and tracking digital information, which has been successfully exploited in the area of music and video data storage and communication. The traditional framework for watermarking consists of three elements: 1) cover signal s, 2) watermark w, 3) embedding function E and 4) secret key k. The watermarked signal is then defined as sw=Ek{s,w}. The watermark carrying signal sw must be robust to common signal processing operations such as filtering, compression or any other operation that are the basic functionaelities of the network. Robustness is defined by the ability to extract the watermark from an altered signal. The second requirement of any watermarking scheme is imperceptibility, (i.e., the difference between s and sw must not alter the operation of the system in any perceptible manner). The watermark must also be transparent in the sense that the watermark-unaware portions of the network must be able to process sw without additional hardware or software. The watermark must also be secure even though the watermarking algorithm itself may be public. This security is frequently achieved through a secret key that is exchanged with the receiver through some form of secure key exchange.
Watermarks and signatures are techniques for adding metadata or unique information to media for signaling and/or security purposes. To reduce the susceptibilities of wireless communications, it is desirable to have alternate approaches to watermarking and adding signatures to wireless communications.
The present invention is a method and apparatus for protecting and authenticating wirelessly transmitted digital information using numerous techniques. The apparatus may be a wireless OFDM communication system, a base station, a WTRU, a transmitter, a receiver and/or an integrated circuit (IC). The wireless OFDM communication system includes a transmitter which steganographically embeds digital information in an OFDM communication signal and wirelessly transmits the OFDM communication signal. The system further includes a receiver which receives the OFDM communication signal and extracts the steganographically embedded digital information from the received OFDM communication signal.
A more detailed understanding of the invention may be had from the following description, given by way of example and to be understood in conjunction with the accompanying drawings wherein:
The present invention is applicable to communication systems using OFDM, code division multiple access (CDMA), CDMA 2000, time division synchronous CDMA (TDSCDMA), universal mobile telecommunications system (UMTS) frequency division duplex (FDD)—time division duplex (TDD) or the like. However, the present invention is envisioned to be applicable for incorporation into any type of communication system.
The present invention may be implemented in a WTRU or in a base station. The terminology “WTRU” includes but is not limited to user equipment, a mobile station, a fixed or mobile subscriber unit, a pager, or any other type of device capable of operating in a wireless environment. The terminology “TRU” may be any type of wireless communication device (e.g., a WTRU) or any type of non-wireless communication device. The terminology “base station” includes but is not limited to a Node-B, a site controller, an access point or any other type of interfacing device in a wireless environment.
The features of the present invention may be incorporated into an IC or be configured in a circuit comprising a multitude of interconnecting components.
The present invention discloses methods to implement Information Assurance (IA); Authentication (of User, WTRU, and base station), Data Confidentiality, Data Integrity and Network Availability. The present invention discloses IA implemented based on RF watermarking. Embedded physical channels (EPCHs) can be used to transport security related data from higher layers. The EPCHs may include watermarks or signatures (permanent or temporary) associated with users, WTRUs, and/or base stations. Depending upon the security level of the EPCHs, they may be sent in the clear or encrypted by higher layer schemes. The EPCHs may also be used to transport ‘challenge-words’ for generating session keys, which may be used for encryption or for specifying the structure of EPCHs. The advantage of the embedded channel approach is that it is better suited for long-term continual application, such as periodic authentication etc. Furthermore, the use of EPCHs (as opposed to regular physical channels, for example) allows security operations to be performed in a manner that is transparent to higher layer data or data processing. This implies that higher layer software and applications do not need to be modified. Finally, the operational load of the higher layer processing remains unaffected.
RF watermarks/signatures are powerful concepts that can be used for authentication, data confidentiality as well as data integrity. For example, the RF watermarks/signatures could be used as keys for data encryption and for generating message authentication codes. These keys may be used by themselves or in conjunction with other security keys.
For the following (excluding claims), ‘data’ and ‘signals’ refer to ‘binary data’ and ‘analog signals’ respectively, unless otherwise noted.
sw=E{s,w} or dw=E{d,w} Equation (1)
The binary watermark data may be generated by digitizing an analog watermark signal. For example, the finger print or a handwritten signature is an analog signal that can be digitized to produce binary watermark data.
Since embedding allows the watermark to be communicated along with the main source data, the embedding scheme may also be viewed as defining (perhaps implicitly) an Embedded Channel into the source data itself. As such, the embedding scheme may be said to define ‘watermarking channels’ or ‘embedded radio channels’. If these channels are defined at the Layer 1 or Layer 0 (RF), the corresponding embedded radio channels may also be referred to as ‘Embedded Physical Channels’.
The watermark/signature may be embedded in content 85 (ws) prior to compression (source coding) 86; embedded in content 87 (wc) after compression (source coding) 86; embedded during higher layer processing 88 (wHL); embedded during Layer 3 89 (w3), Layer 2 90 (w2), Layer 1 91 (w1) and Layer 0 (RF) 92 (w0).
Although the following refers to watermarks, signatures may be used instead of watermarks in the same context for wireless communications.
The layer 2/3 processed data is physical layer processed by a TX physical layer processing device 26. The physical layer processed data is processed for radio transmission by a TX RF processing device 28.
The TX TRU 20 (or alternate network node) receives tokens/keys for producing watermarks (step 202). The tokens/keys are processed by a watermark embedding device 30, which embeds the tokens/keys as a watermark in any one or across multiple ones of the TX layer 2/3, TX physical layer and TX RF layer (step 204). The watermark embedded RF communication is transmitted by an antenna or an antenna array 32 (step 206). The watermark embedded RF communication is received over the wireless interface 36 by an antenna or antenna array 34 of the receiving (RX) TRU 22 (step 208). The received watermark embedded RF communication is RF processed by an RX RF processing device 38. The RF processed communication is physical layer processed by an RX physical layer processing device 40. The physical layer processed communication is layer 2/3 processed by an RX layer 2/3 processing device 42 to produce the user data stream(s). During any one or across multiple ones of the RF layer, physical layer or layer 2/3 processing, the embedded watermark is extracted by a watermark extraction device 44 (step 210), producing tokens/keys such as for use in authentication and other trust, rights, identity, privacy or security purposes.
The various embodiments below describe various techniques for hiding or embedding digital watermarks or signatures at the physical or RF layer of a wireless local area network (WLAN). It should be understood, however, that any of the following embodiments can be implemented on any layer within a WLAN.
To begin, a description is provided of two primary watermarking techniques: 1) hiding watermark information on embedded physical channels; and 2) imprinting watermark information directly into one or more existing physical channels so as to provide information assurance by creating an authenticating signature. In the first primary technique, a new channel is defined to carry a watermark and the watermark channel is then embedded in a physical channel. To illustrate, one technique to produce such a channel is to slowly differentially amplitude modulate physical channel(s) to produce a new watermark channel co-existing with the existing physical channel(s). Watermarks are carried by these channels. This technique can be modeled as follows. The existing physical channel(s) can be viewed as a cover signal s. The watermark is w, an embedding function is E and the embedded physical channel is EPCH. The EPCH creation techniques are described below. The watermarked signal sw may be expressed according to Equation 2 as follows:
sw=EEPCH{s,w} Equation (2)
The first primary watermarking technique is illustrated in
To enhance security further, the embedded physical channels may be encrypted to prevent a rogue TRU from being able to copy the watermark, if the rogue TRU is somehow aware of the embedded channel. These embedded channels may be used to carry security related data from higher OSI layers. To illustrate, encryption and other keys from higher layers are carried by the embedded channel. Other data carried on these channels may include “challenge words”, so that a TRU can authenticate itself when challenged by another TRU or the network.
The embedded physical channels preferably occur on a long-term continual basis; although non-continuous and short term embedded channels may be used. In some implementations, the watermarking channels operate on their own without data being transmitted on the underlying physical channel(s). As a result, the underlying physical channel(s) may need to be maintained, even when they have no data to transmit. The physical channel can be viewed as a cover work for the watermarking channel. Preferably, the data transmitted on the cover work physical channel is configured so that it seems typical of data transmitted on that channel. The existence of uncharacteristic data on the channel, such as a long run of zeros, may draw an eavesdropper's attention to that channel. Such data preferably mimics data actually sent on the channel, which makes it difficult for the eavesdropper to ascertain when cover data is being transmitted. Alternately, a random bit pattern may be used on the cover channel. For encrypted or scrambled channels, a random bit pattern may provide adequate security for some implementations.
In a military application, for example, the cover data transmitted may be misleading information (misinformation). If an enemy unit encounters the communication node transferring the cover information, the enemy may leave the node intact as to attempt to decode the misleading data or cover data. In one embodiment, the generation of appropriate quality cover data is preferably automated, as manual operations to produce such data may be prone to errors and difficult to implement.
The watermarking channels can be used to increase the bandwidth of the overall communication system. The bandwidth available on the watermarking channel is (in some implementations) in addition to the bandwidth of the underlying physical channel. As a result, the overall bandwidth is increased. To add further security, when multiple watermarking channels are utilized, the watermarking data hops the channels in a predetermined or randomly determined pattern. As a result, an eavesdropper monitoring one channel may only have access to a portion of the watermark data.
The embedded physical channels can be used to allow security operations to be performed in a manner transparent to higher layers. As a result, added security can be achieved without modification to higher layer software and applications and without a change in the operational load of these layers.
In the second primary watermarking technique, the watermark is embedded (imprinted) into the physical channel. To illustrate, synchronization bits or unused bits in a physical channel can be varied to effectively carry the watermark in that physical channel. This technique can be modeled as follows. The existing physical channel(s) can be viewed as a cover signal s. The watermark is w, an embedding function is E and a secret key is k. The secret key k can be viewed as the specific physical channel embedding technique, which is described subsequently. The watermarked signal sw may be expressed according to Equation 3 as follows:
sw=Ek{s,w} Equation (3)
The watermarked signal sw is preferably robust with respect to common signal processing operations, such as filtering, compression or other typical wireless network functionalities. It is also desirable that the watermarked signal sw be imperceptible. The use of the watermark does not impact the operation of the wireless system in a perceptible manner. To illustrate, components of the wireless system not aware of the watermark can process the wireless communication without a hardware or software modification. Additionally, if the watermarking technique is publicly known, it is desirable that a form of secure key is used to secure the exchange.
This second primary technique is illustrated in
Below is a description of various other types of watermarking techniques. The watermarking techniques (one or more) discussed below may be implemented in conjunction with either of the two primary watermarking techniques discussed above.
Cyclic Prefix—Guard Intervals Between Data Packet Symbols
When an OFDM data packet is transmitted, guard intervals (GI) precede each OFDM data symbol that is to be demodulated at a receiver. These GIs are used to eliminate inter symbol interference (ISI) in the OFDM waveform by allowing the delay spread interference to have decayed enough not to corrupt the actual symbol samples used for demodulation. As a result, these GIs are typically ignored by a demodulator because they contain multi-path information from a previous symbol that is slowly deteriorating. GIs are typically an integer fraction of a full OFDM symbol, (ex: 1/5 of an entire symbol or 0.8 μs of GI and 3.2 μS of a data per symbol). Accordingly, if these GIs were grouped together, they could be used to form OFDM symbols.
The present embodiment proposes embedding extra OFDM symbols in a physical channel using consecutive groups of GIs. This concept is illustrated in
To process OFDM data packet 500 in accordance with the present embodiment, the last 3.2 μS of each 4.0 μS OFDM symbol is presented to a fast Fourier transform (FFT) operator for demodulation. The embedded 0.8 μS GIs that are initially ignored by the demodulator are saved and stored in sequential order. These GIs are then grouped four at a time to make a 3.2 μS OFDM symbols. These OFDM symbols are then presented to the FFT demodulator to uncover the embedded watermark data.
It should be noted that since data on these GIs is generally corrupted with the multi-path from a previous symbol, it is preferable to use very simple modulation schemes on the sub-carriers intended to modulate the GI samples.
Pilot Sub-Carriers
An OFDM PLCP PPDU is split across a multitude of sub-carriers before it is transmitted. The IEEE 802.11a and 802.11g standards specify, for example, that an OFDM physical layer split a PPDU across fifty-two (52) separate sub-carriers, four of which are dedicated to be pilot sub-carriers. Pilot sub-carriers allow a demodulator to identify gain slope across a spectrum of sub-carriers and provide a coherent reference required by a demodulator to demodulate the sub-carriers carrying data. The present embodiment proposes encoding watermark information on pilot sub-carriers.
Typically, all pilot sub-carriers are encoded with known data such as, for example, a +1 or −1, to serve as a ground reference for a demodulator. This pre-determined encoding is rolled from OFDM symbol to OFDM symbol. The present embodiment proposes manipulating a specified pilot sub-carrier with information that is the exact opposite of what it expected. For instance, a pilot sub-carrier expected to be encoded with a +1 can be manipulated to include a −1 instead. Alternatively, all pilot sub-carriers can be manipulated to roll in some identified manner to flip their ground references from symbol to symbol. In another variation, alternating pilot sub-carriers are manipulated so as to transmit watermark information.
Nulling (i.e. Puncturing) Data Sub-Carriers In A Deterministic Manner
In an alternate embodiment, OFDM PPDU data sub-carriers are punctured or nulled out in a deterministic manner so as to carry watermark information or generate an authentication signature. During transmission, data bits are interleaved across sub-carriers so that if a sub-carrier were to become corrupted or lost, information carried on that lost sub-carrier can be successfully received when run through a forward error coding (FEC) decoder.
The present embodiment intentionally nulls out the amplitude of pseudo-randomly selected sub-carriers. The pattern of nulled-out sub-carriers serves as an authenticating signature. This concept is illustrated in
Alternatively, nulled-out sub-carriers can be manipulated to transmit watermark information. In the present alternative, the absence or nulling-out of specific sub-carriers or the distance between nulled-out sub-carriers can be used to transmit hidden watermark information. As shown in
Amplitude Modulate Sub-Carriers
As described above, OFDM PPDUs are split across a multitude of data sub-carriers prior to their transmission. The data sub-carriers are each modulated by one of four modulating schemes: binary phase shift keying (BPSK), quadrature phase shift keying (QPSK), 16 quadrature amplitude modulation (QAM) or 64-QAM. When generated, data and pilot sub-carriers typically have the same gain. Similarly, the data and pilot sub-carriers are generally transmitted at the same amplitude level. The present embodiment proposes making minor adjustments to the amplitude levels of sub-carriers prior to their transmission in a predetermined manner.
During transmission, an OFDM symbol occurs every 4 μS, for example, in which only 3.2 μS of information is transmitted due to guard intervals. Channel characteristics in WLANs are such that differential encoding between common sub-carriers can be utilized to transmit watermark information. The differences in sub-carrier amplitude levels from one OFDM symbol to the next can serve to form an authentication signature. An intended, (and therefore informed), receiver is able to detect the amplitude pattern and authenticate the transmitter.
Alternatively, it may be adequate to encode a single bit of watermark information on each OFDM symbol by adjusting the amplitude levels of sub-carriers to represent a zero or a one. For example, the amplitude levels of odd numbered sub-carriers can be adjusted so that they are transmitted at a slightly lower power level than that of the even numbered sub-carriers. Such an amplitude modification could be used to encode one bit of data. This concept is illustrated in
Unused Sub-Carrier Locations
In an OFDM system, multiple sub-carrier frequencies are used to simultaneously transmit signals in parallel. Each signal is transmitted on its own frequency or sub-carrier, which may be modulated by data. These sub-carriers can be spaced close to one another because their frequencies are orthogonal, i.e., mathematically perpendicular, which means they will not interfere with one another. Each group of orthogonal OFDM sub-carriers is centered about a center frequency (fc) as illustrated in
The present embodiment proposes to add unspecified sub-carriers between the edge of the specified carriers and the +/−11 MHz boundary of the spectrum mask. These additional, peripheral sub-carriers may be added in unspecified frequency positions for the purpose of embedding low rate watermark information. Referring back to
To further illustrate, IEEE 802.11a and 802.11g specify that an OFDM physical layer splits an information signal across 52 sub-carriers for transmission. The present embodiment could add a 53rd or 54th (or more) sub-carrier at a peripheral frequency range and embed low power watermark information in these unspecified sub-carriers.
Scrambling Code
An alternate embodiment proposes modifying a polynomial for a given scrambling code as a means of transmitting watermark information. Phase reference of pilot sub-carriers are determined by a scrambling sequence that defines in which constellation quadrant each of the pilot sub-channels is located. The scrambling sequence polynomial could be modified in a predetermined manner such that only a cognizant receiver is able to unscramble the sequence. Data packets successfully descrambled according to the modified scrambling sequence are deemed to originate from an authenticated source.
It should be noted that modification of a polynomial is applicable to cyclic redundancy checks (CRC) (discussed below), calculation polynomials, PNs, scrambling codes, and the like.
As an alternative, one or two of the synchronization bits of a scrambling code can be manipulated so as to not affect the synchronization function. Rather, these one or two bits of manipulated information could be used to carry watermark information to a receiver. As an example,
Vary Synchronization Bits
Most OFDM data packets have preambles with scrambler initialization bits (ex: bit 0 to bit 6 in Service field) to synchronize data scrambling. Scrambling data prevents long runs of ones or zeros (which impedes transmission) by equally distributing ones and zeros. A scrambler is synchronized by a default set of synchronization (sync) bits, such as for example, a string of zeros. These synchronization bits actually aid receivers in signal acquisition in that they “alert” the receivers that a message is about to arrive. Sync bits synchronize various receiver functions such as, for example, detection, automatic gain control (AGC), fine and coarse frequency, timing, channel estimation, diversity decisions, and the like. Once this synchronization (i.e., “training”) period has ended, the OFDM data packets indicate to receivers that a message is about to follow.
The present embodiment proposes pseudo-randomly varying the number of sync bits or training symbols periodically or according to message embedding pattern. For added security, the sync bits and training symbols may be scrambled. However, it should be understood that even if left unscrambled, the mere increase or decrease in the number of OFDM sync bits or training symbols can serve as authenticating watermark signatures or watermark information. Additionally, the pseudo-random synchronization sequence of the present embodiment may be altered for every data packet transmission according to a predefined method. Advantages of the present embodiment include preventing eavesdroppers from achieving frequency or timing synchronization. In addition, the present embodiment can potentially secure a WLAN link at the lowest possible level in a protocol stack.
Only an intended receiver in possession of the modified synchronization sequence can descramble and properly process transmitted data. As a result, the receiver can authenticate the origin of received transmissions. The implemented pseudo-random synchronization sequence is defined and controlled by a higher protocol layer in a transmitter and signaled to a receiver through a receiver's higher protocol layer. It should be noted that receivers without the appropriate scrambling initialization sequence will likely ignore transmission with a modified synchronization sequence. If such transmissions are not ignored, however, the data will be scrambled and unintelligible.
To illustrate,
It should be noted that the number of pre-pended bits are adjustable and do not necessarily have to have values of 8, 16, or 128 bits, as illustrated in
Unused Bits in PLCP
Most OFDM data packets include header fields that provide information such as data rate, packet length, service information, and the like. For example, IEEE 802.11 specifies that each PLCP PPDU frame have a PLCP header. Such a PLCP header includes a Rate field (4-bits); a Reserved field (1-bit), a Length field (12-bits) and Parity field (1-bit) and a Service field (16-bits). (See IEEE 802.11a PPDU 1100 in
Alternatively, these unused bits can be utilized to generate authentication signatures. Intended receivers demodulate embedded physical channels seeking to uncover the hidden watermark information. The presence of watermark information is used to authenticate the transmitter. Absence of hidden watermark information denotes an unknown or unauthorized transmitter.
One example of the present embodiment utilizes reserved bits 1121 or 1131 within the Service field 1120 and Signal field 1130, respectively. A Service field 1120 and a Signal field 1130 of OFDM PPDU 1100 are illustrated in
Unspecified Bit Maps
Another embodiment utilizes a Rate field of a PLCP header. A Rate field provides rate information by mapping specified bit patterns to pre-defined rates. For example, IEEE 802.11a and 802.11g utilize four bits with a total of 16 binary combinations to provide rate information. As shown in
The present embodiment proposes to map these remaining, unspecified bit patterns to an already specified bit pattern. For example, rather than utilizing bit pattern 1101 to represent a rate of 6 Mbits/s, bit pattern 1100 could be specified in its place. A receiver would know to map rate pattern 1100 to rate pattern 1101 or to an information stream which indicates the desired 6 Mbit/s rate information. Only messages received with the unspecified even numbered bit patterns will be processed as originating from authenticated sources.
Alternatively, a rate field in an OFDM data packet can intentionally be incorrectly mapped at a predetermined time or at specified time intervals in order to authenticate the data source. Additionally, by having two pit patterns that map to the same desired rate information, the least significant bit (LSB) that creates an even or odd table entry could be used to encode a single bit “one” or “zero” of watermark information per PPDU.
Tail Bits
Tail bits (i.e., 0 bits) are inserted into the PLCP header portion of an OFDM PPDU, just before the Service field in order to facilitate a reliable and timely detection of the data packet's Rate and Length fields. Examples of these PLCP header tail bits are shown in
A second set of tail bits 1341 is shown appended to the physical layer sublayer service data unit (PSDU) 1361 of OFDM PPDU 1300 (see
The present embodiment proposes to manipulate either the header tail bits or the convolutional tail bits (or both) so as to encode them with watermark information. As an example, specific, predetermined tail bits can be flipped from zeros to ones in a predetermined pattern to form an embedded physical channel wherein the tail bit pattern represents a bit or bits of data.
Alternatively, either set of tail bits can be manipulated so as to generate an authorization signature. As long as both the transmitter and receiver know what known state the decoder wants to achieve, these tail bits can be manipulated without affecting the decoding function. As an example, a set of tail bits can be flipped from all zeros to all ones.
Pad Bits
The number of data bits in an IEEE 802.11a OFDM Data field (Service field+PSDU) is a multiple of NDBPS, the number of data bits in an OFDM symbol (i.e., 48, 96, 192, or 288 bits). After a PSDU has been appended to a Service field to form an OFDM Data field, the resulting bit string is extended with pad bits (at least six to accommodate convolutional tail bits discussed above) so that the resulting string length is an integer multiple of NDBPS. An OFDM PPDU 1400 is shown in
These pad bits are used only as space holders and are typically given values of zero. The present embodiment proposes encoding these pad bits with watermark information. Since a receiver can determine how many of these pad bits are being utilized for tail bits, a subsequent demodulation can be used to retrieve any non-tail bit encoded pad bits. (It is noted that the demodulator can still traverse a Viterbi trellis with the existing six tail bits). The receiver can then combine watermark information from multiple OFDM data burst to form a complete watermark message. The option also exists not to encode these pad bits.
Alternatively, these pad bits can be manipulated so as to create an authentication signature.
Time Diversity Delay Modulation
In an OFDM system, relative time is irrelevant because information is transmitted in data packet bursts. However, if the start of orthogonal codes is staggered by one shift, (similar to a temporal delay), such a delay could serve as an authenticating signature. Such a delay does not affect a receiver. The receiver can still receive the delayed OFDM symbols, only they will arrive a modified times.
Alternatively, OFDM symbols can be delayed such that the delay periods between data packet bursts represent watermark information. So long as a receiver is aware of the delay patterns, or can detect such patterns, it can authenticate and process the watermark information.
Frequency Hopping
An alternate embodiment utilizes OFDM carrier frequencies to transmit watermark information. In current WLAN implementations, receivers must acquire a RF carrier frequency offset of a transmitter for every OFDM data packet transmission. The present embodiment proposes to modify this transmitted carrier frequency by adding or subtracting a few hundred or thousand hertz within an automatic frequency control (AFC) capture range in a predetermined pattern. The pattern in which the center frequency fluctuates over time serves to provide hidden bit information, i.e., a watermark. For instance, determining in a receiving demodulator that a carrier frequency is higher than expected (or the last data packet) could represent a “one”, whereas receiving a carrier frequency that is lower than expected (or the last data packet) could be used to represent a “zero”.
It should be understood that the present embodiment does not propose changing channels, but rather modifying a center frequency several hundred or thousand hertz while staying within a specified capture frequency range. This concept is illustrated in
To uncover hidden watermark information, a higher layer must know the origin of a given data transmission in order to properly assign the information bits, (eg., high frequency=+1, low frequency=0). Depending on frequency resolution, more than one bit of information can be encoded per data packet. Such an embodiment would distinguish between carrier frequencies that are, for example, very much higher than expected, higher than expected, very much lower than expected or lower than expected, yet within the required capture range. Corresponding bit information could be represented as follows: very much higher=11; higher=10; lower=01; and very much lower=00.
Alternatively, carrier frequency could be intentionally altered from data packet to data packet so as to produce a predetermined pattern over time. This pattern serves as an authenticating signature and could be used to identify friendly transmitters.
Multi User OFDM w/Channelization Code
IEEE 802.11 specifies that all sub-carriers of a given OFDM data packet be transmitted to the same user. Other OFDM physical layer standards specify that only a portion of OFDM sub-carriers shall be transmitted to one user with the remainder being transmitted to other users (multi users). The present embodiment proposes creating an embedded physical channel or creating an authenticating signature by alternating the sub-carriers dedicated to specified users in a predetermined manner.
Code Puncturing
Code puncturing is a method utilized to increase the data transmission rates of OFDM waveforms. A forward error coding (FEC) encoder creates parity bits on a transmitter side and the transmitter discards specific encoded bits. Standard FEC schemes perform code puncturing at rates of 1/2, 2/3, and 3/4. This allows more information to be transmitted and hence, received. A receiver, aware of the rate at which these encoded bits are being discarded, ‘replaces’ the discarded bits with either a 0 or 1, thereby recreating the discarded bits.
The present embodiment proposes performing a secondary code puncturing scheme on a portion of data already encoded with an FEC scheme. This secondary code puncturing is performed at a higher coding rate thereby puncturing or discarding additional bits of information. These additional discarded bits are then replaced with watermark information such that all of the data appears to be encoded at the original, lower FEC rate. The encoded data is then transmitted as an embedded physical channel at the original, lower FEC rate.
This concept is illustrated in
The structure of this EPCH, (i.e., specification of the watermark carrying blocks, FEC rates, etc.), is determined in the transmitter and signaled to an intended receiver by a higher layer protocol. This information may be randomized and exchanged using various encryption protocols to increase the security of the transmission.
Pulse Shaping
The RF spectrum of WLAN is specified in IEEE 802.11, for example, within certain tolerance limits, so that more than one set of pulse shaping filters can satisfy the standard's requirements. This provides an opportunity to predefine a number of filter coefficients. The present embodiment proposes cycling through these predefined filters in a pseudo-random manner in order to modify the shape of a pulse.
It should be understood that the filter coefficients should be selected so as to cause only subtle variations in the shape of the pulse 1720. An RF watermark can be created through these subtle variations of the pulse shaping filters. A receiver, aware of the predefined pulse shapes, analyzes the received spectrum and identifies/authenticates their origin. This technique makes it difficult for an intruder to spoof an RF signal.
Alternatively, one could manipulate the discrete time windowing function so as to produce an authenticating watermark signature.
DC Term
Typically, OFDM waveforms do not have a sub-carrier transmitted in the DC term of the waveform. Accordingly, this sub-carrier is unmodulated and blank.
Channel Switching Time
Channel switching time is the time between the receipt of a data packet in a receiver and the sending of an acknowledgment (ACK) from the receiver. The present embodiment proposes manipulating this channel switching time as a means of transmitting watermark information. In an IEEE 802.11 OFDM system, WTRUs are either transmitting or receiving, but not both. When transmitting, a window is left open by a receiver before others can receive the transmitted signal. The receiver's ACK response time can be varied in a predetermined matter so as to provide an authenticating signature. For example, a receiver may delay transmitting an ACK for every other packet received. Alternatively, a receiver may transmit an ACK at some consistent time interval.
Transmit Modulation Accuracy for its constellation
The present embodiment proposes to manipulate OFDM symbol constellation patterns so as to produce an authenticating signature, while continuing to meet transmit modulation mask standards. This concept is illustrated in
As an alternative, OFDM symbol constellations could be phase-rotated by predetermined amounts, which are changed on a slow basis and in a pseudo-random manner. An example of such a manipulation is shown in column B of
It should be noted that although described with reference to BPSK and QPSK, the present embodiment is applicable to other modulation schemes including QAM, 64-QAM, and the like and higher rate modulation schemes such as, for example, complementary code keying (CCK), defined in IEEE 802.11b.
Antenna Polarization
The present embodiment varies antenna polarization in a synchronized pseudo-random manner in order to create a watermark or an authenticating signature. This concept is illustrated in
Alternatively, if either of receivers 2020 and 2030 had multiple antennas, one of which was vertically polarized and one of which was horizontally polarized, they would recognize that alternating data packets are received better on one of their antennas versus the other. As described above, this alternating polarization pattern authenticates transmitter 2010 as a desired data source. By differentially encoding the transmit polarization choice, some watermark data could be communicated using this method.
Network Availability
Network availability is the ability to prevent a communications service from becoming unavailable for use by legitimate users. One means for attempting to make a service unavailable is known as a denial of service (DoS) attack. This attack attempts to use up all of a communications service's resources. As one device tries to establish communications with another device, resources are expended in the receiving device as the received data unit is processed. An increasingly greater degree of resources are expended as a data unit makes its way up the protocol stack. The present embodiment proposes to perform authentication of a sender as early as possible at the physical layer using efficient hardware based algorithms. This way, a minimum of resources are expended on denying service to those devices that are unauthorized and possibly malevolent.
A receiver will search for an authentication signature early in the processing of a received data packet. If an expected signature does not exist early in the data packet, the transmitter immediately ceases the processing of that data packet. Accordingly, the receiver is able to preserve its battery and processing resources for authenticated data packets. The sooner a data packet is able to be authenticated, the less susceptible receivers will be to DoS attacks. This concept is illustrated in
Shown in
Authentication Key Change
If an unauthenticated transmission is detected via any of the authentication methods discussed above, or through any other means, the present embodiment proposes a method of preventing the unauthorized user from continuing to associate with a servicing base station. Upon detection of an unauthenticated user, a base station or a WTRU communicates the need to disassociate and the need for a new secret key. All authenticated users would have prior knowledge of the next secret key or know how to generate it. Key generation will depend on the type of breach of the system. If the intruder has not gained access to the session key, then the existing channel can be used to exchange information needed to generate the new key. A new key can be generated utilizing a predefined algorithm such as, for example, a function of the old key, a function of the time of day or a function of information relayed in the message sent to disassociate. This key regeneration may be done to increase the cryptographic strength of the session key. If the intruder has gained access to the session key then an alternate channel made secure using shared secret information is used to generate new keys.
Once all users dissociate from the servicing base station, authenticated users would re-authenticate with the new key and re-associate with the servicing base station. Since unauthenticated users are unaware of the new authentication key, they would no longer be able to associate with the servicing base station.
Alternatively, a WEP key can be manipulated such that unauthorized users may still be able to associate, but they will be unable to communicate data.
Intentional PLCP Header CRC or Parity Bit Failure
An alternate embodiment proposes to intentionally corrupt, at some predetermined interval, the cyclic redundancy check (CRC) or a parity check of an OFDM PPDU.
STBC transmit Diversity
An alternate embodiment is best described with reference to
SFBC Transmit Diversity
A similar watermarking process can be implemented in an SFBC encoder structure, as shown in
Hadamard P-Spreading
The channel matrix in an OFDM-Multiple In, Multiple Out (MIMO) system may be represented by the following,
where submatrices Hij are diagonal matrices which contain the frequency response of the channel impulse response from transmit antenna j to receive antenna i. Since the channel correlation matrix is characterized by HHH, spreading may be accomplished by pre and post multiplying by a unitary spreading matrix S: SHHHHS. Since one dimension is space (antenna) and the other is frequency space-frequency, spreading may be accomplished by this operation. If S is chosen to be a Hadamard matrix SHS=1 as required. Spreading is accomplished by using permutations of S for each symbol transmission. By using a unique permutation sequence identified by a sequence W, a watermark may be communicated via the spreading matrix.
Eigen-Space
By Eigen-decomposition of a channel correlation matrix, optimum transmit and receive beam-forming may be applied provided that information about the channel correlation matrix is available at the transmitter and receiver. The optimum transmit and receive beam-forms are characterized by their Eigen-modes via Eigen-decomposition of the channel matrix H as shown in Equation 4:
H=UDVH Equation (4)
If a precoder operation T and postcoder operation R is done, the Equation is:
THR=TUDVHR Equation (5)
Therefore the pre-coder and post-coder operations respectively are:
T=DUH,R=VD Equation (6)
By this decomposition, the channel is decomposed into N equivalent channels characterized by the N Eigen-modes of the channel, where N is the number of antennas given by min{Nt,Nr}. Since the channel is able to support N equivalent channels, it is possible to spread watermark information bits across the channels in a deterministic manner for example by using a permutation sequence as is done with Hadamard spreading.
Utilizing a PAR reduction Technique for Watermarking:
It is well known that the main limitation of OFDM systems is the high peak-to-average power ratio (PAR) of OFDM signals, due to the superposition of a high number of modulated sub-carrier channel signals. Furthermore, large peaks will occasionally reach the amplifier saturation region and result in signal distortion causing Bit-Error Rate (BER) degradation. A typical solution for the PAR reduction is to generate a set of OFDM signals by multiplying the modulating user data in the frequency domain with a set of different phase vectors (or a set of pseudo-random vectors) known to both the transmitter and receiver, before applying the Inverse Discrete Fourier Transform (IDFT). The transmitter will then choose the resulting OFDM symbol exhibiting the lowest peak factor and transmits this together with the chosen phase (or pseudo-random) vector's identification. The present embodiment proposes embedding watermark information into the set of different phase (or pseudo-random) vectors designed for the PAR reduction, by multiplying each vector in the vector set by the watermark message. In other words, the individual vector in the set is modified by multiplying it by the watermark message. The resulting set is then used for the PAR reduction solution. As a consequence, the watermark information is carried on the PAR controlled OFDM signal.
Other possible schemes of steganographically embedding digital information in communication signals are disclosed in copending patent application Ser. No. 11/034,987 entitled “Code Division Multiple Access (CDMA) Method and Apparatus for Protecting and Authenticating Wirelessly Transmitted Digital Information” filed Jan. 13, 2005, and copending patent application Ser. No. 11/032,780 entitled “Watermarks/Signatures for Wireless Communications” filed Jan. 11, 2005, which are incorporated by reference as if fully set forth.
Although the features and elements of the present invention are described in the preferred embodiments in particular combinations, each feature or element can be used alone without the other features and elements of the preferred embodiments or in various combinations with or without other features and elements of the present invention. Although the various embodiments discussed above are described with reference to certain layers, it should be understood that any of the embodiments can be implemented in any layer or any combination of layers. Further, the features and elements of the present invention may be implemented on a single IC, such as an application specific integrated circuit (ASIC), multiple ICs, discrete components, or a combination of discrete components and ICs. Moreover, the present invention may be implemented in any type of wireless communication system.
While the present invention has been described in terms of the preferred embodiment, other variations which are within the scope of the invention as outlined in the claims below will be apparent to those skilled in the art.
This application claims the benefit of U.S. Provisional Application No. 60/536,133 filed on Jan. 13, 2004 and U.S. Provisional Application No. 60/536,144 filed on Jan. 13, 2004 which are incorporated by reference as if fully set forth.
Number | Name | Date | Kind |
---|---|---|---|
5201000 | Matyas et al. | Apr 1993 | A |
5274666 | Dowdell et al. | Dec 1993 | A |
5568483 | Padovani et al. | Oct 1996 | A |
5602916 | Grube et al. | Feb 1997 | A |
5778304 | Grube et al. | Jul 1998 | A |
5808296 | McMonagle et al. | Sep 1998 | A |
5872519 | Issa et al. | Feb 1999 | A |
5953424 | Vogelesang et al. | Sep 1999 | A |
5960081 | Vynne et al. | Sep 1999 | A |
5966441 | Calamera | Oct 1999 | A |
6018374 | Wrobleski | Jan 2000 | A |
6035398 | Bjorn | Mar 2000 | A |
6115580 | Chuprun et al. | Sep 2000 | A |
6185682 | Tang | Feb 2001 | B1 |
6266541 | Noda | Jul 2001 | B1 |
6307936 | Ober et al. | Oct 2001 | B1 |
6343213 | Steer et al. | Jan 2002 | B1 |
6353778 | Brown | Mar 2002 | B1 |
6359998 | Cooklev | Mar 2002 | B1 |
6393254 | Pousada | May 2002 | B1 |
6473560 | Linnartz et al. | Oct 2002 | B1 |
6492897 | Mowery, Jr. | Dec 2002 | B1 |
6496928 | Deo et al. | Dec 2002 | B1 |
6529600 | Epstein et al. | Mar 2003 | B1 |
6559883 | Fancher et al. | May 2003 | B1 |
6591096 | Ezuriko | Jul 2003 | B2 |
6625455 | Ariga | Sep 2003 | B1 |
6661373 | Holliday | Dec 2003 | B1 |
6662023 | Helle | Dec 2003 | B1 |
6664976 | Lofgren et al. | Dec 2003 | B2 |
6687375 | Matyas et al. | Feb 2004 | B1 |
6687497 | Parvulescu et al. | Feb 2004 | B1 |
6728323 | Chen et al. | Apr 2004 | B1 |
6738572 | Hunter | May 2004 | B2 |
6771946 | Oyaski | Aug 2004 | B1 |
6792130 | Jones et al. | Sep 2004 | B1 |
6868229 | Balogh | Mar 2005 | B2 |
6880009 | Charas | Apr 2005 | B2 |
6915002 | Gustafson | Jul 2005 | B2 |
6928287 | Trott et al. | Aug 2005 | B2 |
6937843 | Foschini et al. | Aug 2005 | B2 |
6983376 | Maggenti | Jan 2006 | B2 |
7055033 | Guthery | May 2006 | B2 |
7079480 | Agee | Jul 2006 | B2 |
7171020 | Rhoads et al. | Jan 2007 | B2 |
7173972 | Thomson et al. | Feb 2007 | B2 |
7203527 | Czaja et al. | Apr 2007 | B2 |
7266217 | Rhoads et al. | Sep 2007 | B2 |
20010031631 | Pitts | Oct 2001 | A1 |
20010037465 | Hart, III et al. | Nov 2001 | A1 |
20020021721 | Jiang et al. | Feb 2002 | A1 |
20020039896 | Brown | Apr 2002 | A1 |
20020055361 | McDonnell et al. | May 2002 | A1 |
20020058497 | Jeong | May 2002 | A1 |
20020066111 | Rodriguez | May 2002 | A1 |
20020076084 | Tian et al. | Jun 2002 | A1 |
20020107032 | Agness et al. | Aug 2002 | A1 |
20020186845 | Dutta et al. | Dec 2002 | A1 |
20030009683 | Schwenck et al. | Jan 2003 | A1 |
20030030680 | Cofta et al. | Feb 2003 | A1 |
20030040326 | Levy et al. | Feb 2003 | A1 |
20030072450 | Maggenti | Apr 2003 | A1 |
20030078076 | Kuwajima et al. | Apr 2003 | A1 |
20030086371 | Walton et al. | May 2003 | A1 |
20030122671 | Jespersen | Jul 2003 | A1 |
20030123659 | Forstrom et al. | Jul 2003 | A1 |
20030133573 | Himmel et al. | Jul 2003 | A1 |
20030169342 | Steinberg et al. | Sep 2003 | A1 |
20030174858 | Kim et al. | Sep 2003 | A1 |
20030219231 | Vernon | Nov 2003 | A1 |
20040001553 | Steentra et al. | Jan 2004 | A1 |
20040029560 | Ariga | Feb 2004 | A1 |
20040057456 | He et al. | Mar 2004 | A1 |
20040081131 | Walton et al. | Apr 2004 | A1 |
20040100897 | Shattil | May 2004 | A1 |
20040109566 | Yamamoto | Jun 2004 | A1 |
20040110515 | Blumberg et al. | Jun 2004 | A1 |
20040143750 | Kulack et al. | Jul 2004 | A1 |
20040155969 | Hayashi | Aug 2004 | A1 |
20040157620 | Nyu | Aug 2004 | A1 |
20040198306 | Singh et al. | Oct 2004 | A1 |
20040204021 | Cocita | Oct 2004 | A1 |
20040252837 | Harvey et al. | Dec 2004 | A1 |
20040264699 | Meandzija et al. | Dec 2004 | A1 |
20040264701 | Lee et al. | Dec 2004 | A1 |
20050007456 | Lee et al. | Jan 2005 | A1 |
20050008324 | Balogh | Jan 2005 | A1 |
20050039020 | Levy | Feb 2005 | A1 |
20050043548 | Cates | Feb 2005 | A1 |
20050064865 | Goldberg | Mar 2005 | A1 |
20050094719 | Young | May 2005 | A1 |
20050180315 | Chitrapu et al. | Aug 2005 | A1 |
20050220322 | Olesen et al. | Oct 2005 | A1 |
20060156009 | Shin et al. | Jul 2006 | A1 |
20060200673 | Zhang et al. | Sep 2006 | A1 |
20070071241 | Caprella et al. | Mar 2007 | A1 |
20070121939 | Olesen et al. | May 2007 | A1 |
Number | Date | Country |
---|---|---|
2454761 | Feb 2003 | CA |
1377180 | Apr 2002 | CN |
0 505 266 | Mar 1992 | EP |
0 830 046 | Mar 1998 | EP |
1 130 500 | Sep 2001 | EP |
1 139 684 | Oct 2001 | EP |
1 172 270 | Jan 2002 | EP |
1 182 901 | Feb 2002 | EP |
1 379 098 | Jan 2004 | EP |
1 381 234 | Jan 2004 | EP |
1 185 923 | Mar 2004 | EP |
1 445 923 | Aug 2004 | EP |
1 499 148 | Jan 2005 | EP |
211612 | Feb 1927 | GB |
2 329 794 | Mar 1999 | GB |
2 343 339 | May 2000 | GB |
2 348 573 | Oct 2000 | GB |
2 367 720 | Apr 2002 | GB |
2 374 986 | Oct 2002 | GB |
2 393 075 | Mar 2004 | GB |
2000013497 | Jan 2000 | JP |
2000032557 | Jan 2000 | JP |
2000152217 | May 2000 | JP |
2000165952 | Jun 2000 | JP |
2000332890 | Nov 2000 | JP |
2001313006 | Nov 2001 | JP |
2002044736 | Feb 2002 | JP |
2002125267 | Apr 2002 | JP |
2002159059 | May 2002 | JP |
2003058173 | Feb 2003 | JP |
2003070058 | Mar 2003 | JP |
2003143649 | May 2003 | JP |
2003219466 | Jul 2003 | JP |
2004056769 | Feb 2004 | JP |
2004088273 | Mar 2004 | JP |
2004153324 | May 2004 | JP |
2004242096 | Aug 2004 | JP |
2004260631 | Sep 2004 | JP |
2004260796 | Sep 2004 | JP |
2005033799 | Feb 2005 | JP |
529281 | Apr 2003 | TW |
563305 | Nov 2003 | TW |
9834412 | Aug 1998 | WO |
9959335 | Nov 1999 | WO |
0060556 | Oct 2000 | WO |
02103968 | Dec 2002 | WO |
03028342 | Apr 2003 | WO |
03040898 | May 2003 | WO |
03047207 | Jun 2003 | WO |
2004089021 | Oct 2004 | WO |
2004102313 | Nov 2004 | WO |
Number | Date | Country | |
---|---|---|---|
20050180315 A1 | Aug 2005 | US |
Number | Date | Country | |
---|---|---|---|
60536133 | Jan 2004 | US | |
60536144 | Jan 2004 | US |