-20Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
DETAILED ACTION
This office action is in response to the amendment filed 9/26/2025 in which Claims 1-20 are pending.
Response to Arguments
Applicant’s arguments with respect to claim(s) 1, 10 and 18 have been considered but are moot because the new ground of rejection does not rely on any reference applied in the prior rejection of record for any teaching or matter specifically challenged in the argument.
Claim Rejections - 35 USC § 112
The following is a quotation of 35 U.S.C. 112(b):
(b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention.
The following is a quotation of 35 U.S.C. 112 (pre-AIA ), second paragraph:
The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention.
Claims 1, 10, 18 rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor (or for applications subject to pre-AIA 35 U.S.C. 112, the applicant), regards as the invention. It is unclear how the permutation of the bitstream to change from the bit domain to a real domain applies to encoding the bitstream to an encoded noise signal.
Claim Rejections - 35 USC § 103
In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status.
The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action:
A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made.
The text of those sections of Title 35, U.S. Code not included in this action can be found in a prior Office action.
The factual inquiries for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows:
1. Determining the scope and contents of the prior art.
2. Ascertaining the differences between the prior art and the claims at issue.
3. Resolving the level of ordinary skill in the pertinent art.
4. Considering objective evidence present in the application indicating obviousness or nonobviousness.
This application currently names joint inventors. In considering patentability of the claims the examiner presumes that the subject matter of the various claims was commonly owned as of the effective filing date of the claimed invention(s) absent any evidence to the contrary. Applicant is advised of the obligation under 37 CFR 1.56 to point out the inventor and effective filing dates of each claim that was not commonly owned as of the effective filing date of the later invention in order for the examiner to consider the applicability of 35 U.S.C. 102(b)(2)(C) for any potential 35 U.S.C. 102(a)(2) prior art against the later invention.
Claim(s) 1, 5, 8, 10, 14, 16, 18 are rejected under 35 U.S.C. 103(a) as being unpatentable over U.S. Patent Publication 2021/0352053 to Melodia et al (“Melodia”) in view of U.S. Patent Publication 2017/0026146 to Tollefson et al (“Tollefson”).
As to Claim 1, Melodia teaches a system for transmitting one or more covert wireless signals within an overt wireless signal, comprising: an encoder configured to: receive a bitstream (the transmitter comprising a covert packet generator [encoder] operative to receive…a primary data stream of primary in-phase and quadrature (I/Q) symbols [receive a bitstream], see ¶ 0007; Primary data is processed through standard scheduling and signal processing procedures (e.g., modulation) of the primary system. This data results in a sequence of primary symbols which are fed to the steganographic system covert packet generator 52, see ¶ 0291); encoding the bitstream to an encoded noise signal, the encoded noise signal replicating a noise signal of a predetermined hardware device (covert packet generator…can generate displacements in the primary I/Q symbols in a constellation diagram randomly in a plurality of transmissions to mimic channel noise [encode the received bitstream to an encoded noise signal replicating a noise signal of a predetermined hardware device], see Abstract; Primary data is processed through standard scheduling and signal processing procedures (e.g., modulation) of the primary system. This data results in a sequence of primary symbols which are fed to the steganographic system covert packet generator 52, see ¶ 0291; the steganographic system implements a mechanism that “mimics” I/Q displacements introduced by noise on the wireless channel by randomizing the covert embedding procedures. Rather than utilizing a fixed distance between covert symbols, the steganographic system randomly changes the distance between the covert symbols, see ¶ 0308); and combine a covert modulated signal with the encoded noise signal to form at least one covert wireless signal, the at least one covert wireless signal distinct from the received bitstream (covert packet generator…can generate displacements in the primary I/Q symbols in a constellation diagram randomly in a plurality of transmissions to mimic channel noise, see Abstract; a covert packet generator operative to receive a covert data stream of covert data…and to embed the covert data as covert data symbols within the primary I/Q symbols in a covert packet [combine a covert modulated signal with the encoded noise signal to form a covert wireless signal], see ¶ 0007; Primary and covert data streams are separate and independent from one another [covert wireless signal distinct from received bitstream], see ¶ 0291; The generated packet is then modulated through the covert modulator 54 according to the set covert modulation parameters. Finally, the resulting covert modulated symbols are embedded in the primary symbols through the covert embedder 56, see ¶ 0293; The coding map uniquely associates covert packets (i.e., bit sequences) to modulated covert symbols. Covert symbols are, then, embedded in primary symbols through the covert embedder block, see ¶ 0296; Similarly, this procedure modulates the amplitude of the primary symbols based on the amplitude of the modulated covert symbols (by each covert symbol). The output is a sequence of primary symbols with embedded covert data, see ¶ 0297; Figure 7 illustrates the modulated covert symbols output by the covert modulator 54 combined with the primary symbols from packet generator 64); and transmit the at least one covert wireless signal within an overt wireless signal (a covert packet generator operative to receive a covert data stream of covert data…and to embed the covert data as covert data symbols within the primary I/Q symbols in a covert packet, see ¶ 0007; a radio frequency (RF) front end and antenna operative to transmit and receive radio frequency signals, the RF front end in communication with the covert packet generator to receive the covert packet for transmission [transmit the covert wireless signal within an overt wireless signal], see ¶ 0008; Once covert symbols have been generated, the covert embedder 56 embeds them (see FIG. 7). Similarly, this procedure modulates the amplitude of the primary symbols based on the amplitude of the modulated covert symbols (by each covert symbol). The output is a sequence of primary symbols with embedded covert data. The symbols are then processed by mapping and precoding blocks and transmitted through the RF front-end, see ¶ 0297); and
a decoder operably coupled to the encoder via the overt wireless signal, the decoder configured to: receive the at least one covert wireless signal (a covert packet detector [decoder] operative to receive incoming transmissions from the transmitter, to detect a presence of the covert packet, see ¶ 0054); remove the covert modulated signal from the received at least one covert wireless signal to isolate the encoded noise signal (Upon detecting a covert packet, the covert packet detector 82 reads the length of the covert payload and CRC32 fields (i.e., L.sub.P+L.sub.PC), the packet number and the modulation parameters contained in the info field of the header (see FIG. 3). Then it extracts the symbols corresponding to the encoding L.sub.P+L.sub.PC bytes of the covert packet [remove the covert modulated signal from the received covert wireless signal], see ¶ 0303; The covert demodulator 84 extracts the encoded covert information from each packet [isolate encoded noise signal]. As shown in FIG. 3, covert modulation parameters necessary to demodulate covert packets, such as employed covert modulation, packet length, and the packet type, are specified in the header, see ¶ 0304; the packets carry a threshold flag field (see Section 2.1.1) instructing the receiver on the covert constellation used by the transmitter. The value of this flag is changed on a per-packet basis, thus reducing the probability of successful steganalysis attacks. In one implementation of the steganographic system, this field includes 2 bits encoding the 4 different distance configurations, see ¶ 0309); and convert the isolated encoded noise signal into a decoded bitstream (The covert demodulator 84 extracts the encoded covert information from each packet [isolated encoded noise signal]. As shown in FIG. 3, covert modulation parameters necessary to demodulate covert packets, such as employed covert modulation, packet length, and the packet type, are specified in the header. This way, the demodulator block can reconstruct the decoding map and use it to demodulate the received symbols into covert data (e.g., bit sequence), see ¶ 0304).
Melodia does not explicitly disclose receive a bitstream including a bit domain; perform a permutation of the bitstream to change the bit domain of the bitstream to a real domain; encoding the bitstream including the real domain to an encoded noise signal.
Tollefson teaches receive a bitstream including a bit domain (data source generates modulated data signal [bitstream], see ¶ 0064); perform a permutation of the bitstream to change the bit domain of the bitstream to a real domain (a vector of mask coefficients (or “scrambling vector”) can be randomly generated on a per-symbol basis, see ¶ 0054; mask coefficient vectors are permutations of each other, the mask coefficient generator 306 may be initialized with a random vector and then perform a random shuffling routine, such as the Fisher-Yates algorithm, to generate a new random permutation for each update, see ¶ 0055. In lieu of the 112, 2nd rejection, Examiner construes the permutation as a modulated data signal that is permuted by a scrambling vector to transform the bitstream from the bit domain to a real domain); encoding the bitstream including the real domain to an encoded noise signal (the masking transmitter 300 includes a noise source 312. As discussed below in conjunction with FIGS. 4 and 5, introducing noise into the data signal can improve security. As shown, the noise source 312 generates a noise signal 330 which is added to the modulated data signal 314 to generate a “noisy” data signal 314′. The noise source 312 may use a PRNG, or other suitable device, with the amplitude fixed or variable for different modulation types. The noise source 312 may generate AWGN or any other suitable type of noise, see ¶ 0056; The masking signals 322 are combined with the modulated data signal 314 (or with the noisy data signal 314′) to generate a plurality of masked data signals 326, see ¶ 0057).
Before the effective filing date of the claimed invention, it would have been obvious to one of ordinary skill in the art to modify Melodia with Tollefson to teach receive a bitstream including a bit domain; perform a permutation of the bitstream to change the bit domain of the bitstream to a real domain; encoding the bitstream including the real domain to an encoded noise signal. The suggestion/motivation would have been in order to reduce computational costs (see ¶ 0055).
As to Claim 5, Melodia and Tollefson depending on Claim 1, Melodia teaches wherein the encoded noise signal is within a transmission bandwidth defined by at least one predetermined regulatory communication standard (This software allows to measure network statistics, e.g., throughput and packet loss, and supports TCP and UDP protocols [predetermined regulatory communication standard] with different target bandwidths, see ¶ 0316; FIGS. 16A and 16B depict the covert throughput [encoded noise signal] (FIG. 16A) and percentage of covert packet retransmissions (FIG. 16B) under UDP primary traffic. The iperf3 UDP target bandwidth parameter was set as follows: (i) 0.5 Mbps for Case A; (ii) 2 Mbps for Case B, and (iii) 5 Mbps for Case C, see ¶ 0318).
As to Claim 8, Melodia and Tollefson depending on Claim 1, Melodia teaches wherein the at least one covert wireless signal is a plurality of orthogonal frequency-division multiplexing (OFDM) carrier signals or quadrature amplitude modulation (QAM) carrier signals (the cover modulation parameters including a modulation order, coding map associating covert bit sequences to modulated covert symbols, and a packet type…wherein the modulation parameters are indicative of an amplitude shift keying modulation scheme, phase shift keying modulation scheme, frequency shift keying modulation scheme, or quadrature amplitude modulation scheme, see ¶ 0174-0175).
As to Claim 10, Melodia teaches a method for transmitting one or more covert wireless signals within an overt wireless signal, comprising: receiving a bitstream at an encoder (the transmitter comprising a covert packet generator [encoder] operative to receive…a primary data stream of primary in-phase and quadrature (I/Q) symbols [receive a bitstream], see ¶ 0007; Primary data is processed through standard scheduling and signal processing procedures (e.g., modulation) of the primary system. This data results in a sequence of primary symbols which are fed to the steganographic system covert packet generator 52, see ¶ 0291); encoding the bitstream, at the encoder, into an encoded noise signal, the encoded noise signal replicating a noise signal of a predetermined hardware device (covert packet generator…can generate displacements in the primary I/Q symbols in a constellation diagram randomly in a plurality of transmissions to mimic channel noise [encode the received bitstream to an encoded noise signal replicating a noise signal of a predetermined hardware device], see Abstract; Primary data is processed through standard scheduling and signal processing procedures (e.g., modulation) of the primary system. This data results in a sequence of primary symbols which are fed to the steganographic system covert packet generator 52, see ¶ 0291; the steganographic system implements a mechanism that “mimics” I/Q displacements introduced by noise on the wireless channel by randomizing the covert embedding procedures. Rather than utilizing a fixed distance between covert symbols, the steganographic system randomly changes the distance between the covert symbols, see ¶ 0308); combining a covert modulated signal with the encoded noise signal to form at least one covert wireless signal, the at least one covert wireless signal distinct from the received bitstream (covert packet generator…can generate displacements in the primary I/Q symbols in a constellation diagram randomly in a plurality of transmissions to mimic channel noise, see Abstract; a covert packet generator operative to receive a covert data stream of covert data…and to embed the covert data as covert data symbols within the primary I/Q symbols in a covert packet [combine a covert modulated signal with the encoded noise signal to form a covert wireless signal], see ¶ 0007; Primary and covert data streams are separate and independent from one another [covert wireless signal distinct from received bitstream], see ¶ 0291; The generated packet is then modulated through the covert modulator 54 according to the set covert modulation parameters. Finally, the resulting covert modulated symbols are embedded in the primary symbols through the covert embedder 56, see ¶ 0293; The coding map uniquely associates covert packets (i.e., bit sequences) to modulated covert symbols. Covert symbols are, then, embedded in primary symbols through the covert embedder block, see ¶ 0296; Similarly, this procedure modulates the amplitude of the primary symbols based on the amplitude of the modulated covert symbols (by each covert symbol). The output is a sequence of primary symbols with embedded covert data, see ¶ 0297; Figure 7 illustrates the modulated covert symbols output by the covert modulator 54 combined with the primary symbols from packet generator 64); transmitting the at least one covert wireless signal from the encoder within an overt wireless signal (a covert packet generator operative to receive a covert data stream of covert data…and to embed the covert data as covert data symbols within the primary I/Q symbols in a covert packet, see ¶ 0007; a radio frequency (RF) front end and antenna operative to transmit and receive radio frequency signals, the RF front end in communication with the covert packet generator to receive the covert packet for transmission [transmit the covert wireless signal within an overt wireless signal], see ¶ 0008; Once covert symbols have been generated, the covert embedder 56 embeds them (see FIG. 7). Similarly, this procedure modulates the amplitude of the primary symbols based on the amplitude of the modulated covert symbols (by each covert symbol). The output is a sequence of primary symbols with embedded covert data. The symbols are then processed by mapping and precoding blocks and transmitted through the RF front-end, see ¶ 0297); and receiving the at least one covert wireless signal at a decoder (a covert packet detector [decoder] operative to receive incoming transmissions from the transmitter, to detect a presence of the covert packet, see ¶ 0054); removing, at the decoder, the covert modulated signal from the received at least one covert wireless signal to isolate the encoded noise signal (Upon detecting a covert packet, the covert packet detector 82 reads the length of the covert payload and CRC32 fields (i.e., L.sub.P+L.sub.PC), the packet number and the modulation parameters contained in the info field of the header (see FIG. 3). Then it extracts the symbols corresponding to the encoding L.sub.P+L.sub.PC bytes of the covert packet [remove the covert modulated signal from the received covert wireless signal], see ¶ 0303; The covert demodulator 84 extracts the encoded covert information from each packet [isolate encoded noise signal]. As shown in FIG. 3, covert modulation parameters necessary to demodulate covert packets, such as employed covert modulation, packet length, and the packet type, are specified in the header, see ¶ 0304; the packets carry a threshold flag field (see Section 2.1.1) instructing the receiver on the covert constellation used by the transmitter. The value of this flag is changed on a per-packet basis, thus reducing the probability of successful steganalysis attacks. In one implementation of the steganographic system, this field includes 2 bits encoding the 4 different distance configurations, see ¶ 0309); and converting, at the decoder, the isolated encoded noise signal into a decoded bitstream (The covert demodulator 84 extracts the encoded covert information from each packet [isolated encoded noise signal]. As shown in FIG. 3, covert modulation parameters necessary to demodulate covert packets, such as employed covert modulation, packet length, and the packet type, are specified in the header. This way, the demodulator block can reconstruct the decoding map and use it to demodulate the received symbols into covert data (e.g., bit sequence), see ¶ 0304).
Melodia does not explicitly disclose receiving a bitstream at an encoder, the bitstream including a bit domain; performing a permutation of the bitstream to change the bit domain of the bitstream to a real domain; encoding the bitstream including the real domain, at the encoder, into an encoded noise signal.
Tollefson teaches receiving a bitstream at an encoder, the bitstream including a bit domain (data source generates modulated data signal [bitstream], see ¶ 0064); performing a permutation of the bitstream to change the bit domain of the bitstream to a real domain (a vector of mask coefficients (or “scrambling vector”) can be randomly generated on a per-symbol basis, see ¶ 0054; mask coefficient vectors are permutations of each other, the mask coefficient generator 306 may be initialized with a random vector and then perform a random shuffling routine, such as the Fisher-Yates algorithm, to generate a new random permutation for each update, see ¶ 0055. In lieu of the 112, 2nd rejection, Examiner construes the permutation as a modulated data signal that is permuted by a scrambling vector to transform the bitstream from the bit domain to a real domain); encoding the bitstream including the real domain, at the encoder, to an encoded noise signal (the masking transmitter 300 includes a noise source 312. As discussed below in conjunction with FIGS. 4 and 5, introducing noise into the data signal can improve security. As shown, the noise source 312 generates a noise signal 330 which is added to the modulated data signal 314 to generate a “noisy” data signal 314′. The noise source 312 may use a PRNG, or other suitable device, with the amplitude fixed or variable for different modulation types. The noise source 312 may generate AWGN or any other suitable type of noise, see ¶ 0056; The masking signals 322 are combined with the modulated data signal 314 (or with the noisy data signal 314′) to generate a plurality of masked data signals 326, see ¶ 0057).
Before the effective filing date of the claimed invention, it would have been obvious to one of ordinary skill in the art to modify Melodia with Tollefson to teach receiving a bitstream at an encoder, the bitstream including a bit domain; performing a permutation of the bitstream to change the bit domain of the bitstream to a real domain; encoding the bitstream including the real domain, at the encoder, into an encoded noise signal. The suggestion/motivation would have been in order to reduce computational costs (see ¶ 0055).
As to Claim 14, Melodia and Tollefson depending on Claim 10, Melodia teaches wherein encoding the received bitstream, at the encoder, into to the encoded noise signal is encoding within a transmission bandwidth defined by at least one predetermined regulatory communication standard (This software allows to measure network statistics, e.g., throughput and packet loss, and supports TCP and UDP protocols [predetermined regulatory communication standard] with different target bandwidths, see ¶ 0316; FIGS. 16A and 16B depict the covert throughput [encoded noise signal] (FIG. 16A) and percentage of covert packet retransmissions (FIG. 16B) under UDP primary traffic. The iperf3 UDP target bandwidth parameter was set as follows: (i) 0.5 Mbps for Case A; (ii) 2 Mbps for Case B, and (iii) 5 Mbps for Case C, see ¶ 0318).
As to Claim 16, Melodia and Tollefson depending on Claim 10, Melodia teaches in the at least one covert wireless signal, a plurality of orthogonal frequency-division multiplexing (OFDM) carrier signals or a plurality of quadrature amplitude modulation (QAM) carrier signals (the cover modulation parameters including a modulation order, coding map associating covert bit sequences to modulated covert symbols, and a packet type…wherein the modulation parameters are indicative of an amplitude shift keying modulation scheme, phase shift keying modulation scheme, frequency shift keying modulation scheme, or quadrature amplitude modulation scheme, see ¶ 0174-0175).
As to Claim 18, Melodia teaches a system for transmitting one or more covert wireless signals within an overt wireless signal, comprising: an encoding means for: receiving a bitstream (the transmitter comprising a covert packet generator [encoder] operative to receive…a primary data stream of primary in-phase and quadrature (I/Q) symbols [receive a bitstream], see ¶ 0007; Primary data is processed through standard scheduling and signal processing procedures (e.g., modulation) of the primary system. This data results in a sequence of primary symbols which are fed to the steganographic system covert packet generator 52, see ¶ 0291); encoding the bitstream to an encoded noise signal, the encoded noise signal replicating a noise signal of a predetermined hardware device (covert packet generator…can generate displacements in the primary I/Q symbols in a constellation diagram randomly in a plurality of transmissions to mimic channel noise [encode the received bitstream to an encoded noise signal replicating a noise signal of a predetermined hardware device], see Abstract; Primary data is processed through standard scheduling and signal processing procedures (e.g., modulation) of the primary system. This data results in a sequence of primary symbols which are fed to the steganographic system covert packet generator 52, see ¶ 0291; the steganographic system implements a mechanism that “mimics” I/Q displacements introduced by noise on the wireless channel by randomizing the covert embedding procedures. Rather than utilizing a fixed distance between covert symbols, the steganographic system randomly changes the distance between the covert symbols, see ¶ 0308; and combining a covert modulated signal with the encoded noise signal to form at least one covert wireless signal, the at least one covert wireless signal distinct from the received bitstream (covert packet generator…can generate displacements in the primary I/Q symbols in a constellation diagram randomly in a plurality of transmissions to mimic channel noise, see Abstract; a covert packet generator operative to receive a covert data stream of covert data…and to embed the covert data as covert data symbols within the primary I/Q symbols in a covert packet [combine a covert modulated signal with the encoded noise signal to form a covert wireless signal], see ¶ 0007; Primary and covert data streams are separate and independent from one another [covert wireless signal distinct from received bitstream], see ¶ 0291; The generated packet is then modulated through the covert modulator 54 according to the set covert modulation parameters. Finally, the resulting covert modulated symbols are embedded in the primary symbols through the covert embedder 56, see ¶ 0293; The coding map uniquely associates covert packets (i.e., bit sequences) to modulated covert symbols. Covert symbols are, then, embedded in primary symbols through the covert embedder block, see ¶ 0296; Similarly, this procedure modulates the amplitude of the primary symbols based on the amplitude of the modulated covert symbols (by each covert symbol). The output is a sequence of primary symbols with embedded covert data, see ¶ 0297; Figure 7 illustrates the modulated covert symbols output by the covert modulator 54 combined with the primary symbols from packet generator 64); transmitting the at least one covert wireless signal within an overt wireless signal (a covert packet generator operative to receive a covert data stream of covert data…and to embed the covert data as covert data symbols within the primary I/Q symbols in a covert packet, see ¶ 0007; a radio frequency (RF) front end and antenna operative to transmit and receive radio frequency signals, the RF front end in communication with the covert packet generator to receive the covert packet for transmission [transmit the covert wireless signal within an overt wireless signal], see ¶ 0008; Once covert symbols have been generated, the covert embedder 56 embeds them (see FIG. 7). Similarly, this procedure modulates the amplitude of the primary symbols based on the amplitude of the modulated covert symbols (by each covert symbol). The output is a sequence of primary symbols with embedded covert data. The symbols are then processed by mapping and precoding blocks and transmitted through the RF front-end, see ¶ 0297); and
and a decoding means operably coupled to the encoding means via the overt wireless signal, the decoding the means for: receiving the at least one covert wireless signal (a covert packet detector [decoder] operative to receive incoming transmissions from the transmitter, to detect a presence of the covert packet, see ¶ 0054); removing the covert modulated signal from the received at least one covert wireless signal to isolate the encoded noise signal (Upon detecting a covert packet, the covert packet detector 82 reads the length of the covert payload and CRC32 fields (i.e., L.sub.P+L.sub.PC), the packet number and the modulation parameters contained in the info field of the header (see FIG. 3). Then it extracts the symbols corresponding to the encoding L.sub.P+L.sub.PC bytes of the covert packet [remove the covert modulated signal from the received covert wireless signal], see ¶ 0303; The covert demodulator 84 extracts the encoded covert information from each packet [isolate encoded noise signal]. As shown in FIG. 3, covert modulation parameters necessary to demodulate covert packets, such as employed covert modulation, packet length, and the packet type, are specified in the header, see ¶ 0304; the packets carry a threshold flag field (see Section 2.1.1) instructing the receiver on the covert constellation used by the transmitter. The value of this flag is changed on a per-packet basis, thus reducing the probability of successful steganalysis attacks. In one implementation of the steganographic system, this field includes 2 bits encoding the 4 different distance configurations, see ¶ 0309) ; and converting the isolated encoded noise signal into a decoded bitstream (The covert demodulator 84 extracts the encoded covert information from each packet [isolated encoded noise signal]. As shown in FIG. 3, covert modulation parameters necessary to demodulate covert packets, such as employed covert modulation, packet length, and the packet type, are specified in the header. This way, the demodulator block can reconstruct the decoding map and use it to demodulate the received symbols into covert data (e.g., bit sequence), see ¶ 0304).
Melodia does not explicitly disclose receiving a bitstream including a bit domain; performing a permutation of the bitstream to change the bit domain of the bitstream to a real domain; encoding the bitstream including the real domain to an encoded noise signal.
Tollefson teaches receiving a bitstream including a bit domain (data source generates modulated data signal [bitstream], see ¶ 0064); performing a permutation of the bitstream to change the bit domain of the bitstream to a real domain (a vector of mask coefficients (or “scrambling vector”) can be randomly generated on a per-symbol basis, see ¶ 0054; mask coefficient vectors are permutations of each other, the mask coefficient generator 306 may be initialized with a random vector and then perform a random shuffling routine, such as the Fisher-Yates algorithm, to generate a new random permutation for each update, see ¶ 0055. In lieu of the 112, 2nd rejection, Examiner construes the permutation as a modulated data signal that is permuted by a scrambling vector to transform the bitstream from the bit domain to a real domain); encoding the bitstream including the real domain to an encoded noise signal (the masking transmitter 300 includes a noise source 312. As discussed below in conjunction with FIGS. 4 and 5, introducing noise into the data signal can improve security. As shown, the noise source 312 generates a noise signal 330 which is added to the modulated data signal 314 to generate a “noisy” data signal 314′. The noise source 312 may use a PRNG, or other suitable device, with the amplitude fixed or variable for different modulation types. The noise source 312 may generate AWGN or any other suitable type of noise, see ¶ 0056; The masking signals 322 are combined with the modulated data signal 314 (or with the noisy data signal 314′) to generate a plurality of masked data signals 326, see ¶ 0057).
Before the effective filing date of the claimed invention, it would have been obvious to one of ordinary skill in the art to modify Melodia with Tollefson to teach receiving a bitstream including a bit domain; performing a permutation of the bitstream to change the bit domain of the bitstream to a real domain; encoding the bitstream including the real domain to an encoded noise signal. The suggestion/motivation would have been in order to reduce computational costs (see ¶ 0055).
Claim(s) 2-3, 11-12, 19 are rejected under 35 U.S.C. 103 as being unpatentable over U.S. Patent Publication 2021/0352053 to Melodia et al (“Melodia”) in view of U.S. Patent Publication 2017/0026146 to Tollefson et al (“Tollefson”) in further view of Chinese Patent Publication 107819568 to Xie et al (“Xie”) (relied upon English Translation).
As to Claim 2, Melodia and Tollefson depending on Claim 1, Melodia teaches determine statistical properties for each of the encoded noise signal and the noise signal of the predetermined hardware device (Through steganalysis an eavesdropper may analyze the statistical properties of the captured I/Q samples [noise signal] and infer whether there is an anomaly suggesting the presence of a covert slice [encoded noise signal], see ¶ 0305; Such a statistical behavior is inherited from the 4-ASK covert scheme in FIG. 8b, whose functioning results in 4 covert points per primary symbol with amplitude equal to 0.25, 0.5, 0.75, and 1. Steganalysis can easily identify such an abnormal statistical pattern, thus raising the eavesdropper's concerns about the existence of ongoing covert transmissions, see ¶ 0305, 0307).
Melodia and Tollefson do not expressly disclose a critic module operably coupled to the encoder, the critic module configured to: compare the encoded noise signal generated by the encoder and the noise signal of the predetermined hardware device.
Xie teaches a critic module operably coupled to the encoder, the critic module configured to: compare the encoded noise signal generated by the encoder and the noise signal of the predetermined hardware device (determination unit [critic module], determining a first distance between the corresponding points and a second distance between adjacent constellation points on the constellation diagram, see ¶ 0029; judging unit, whether the first distance is greater than the second distance, see ¶ 0030; determination unit is configured to determine that secret information exists in the first carrier information when the determination unit determines that the first distance is greater than a second distance, see ¶ 0031; sending device is divided into two paths, one is the carrier information encoded, and the other is the secret information encoded. After the two are encoded, the secret information is embedded in the carrier information, see ¶ 0055; corresponding points with consistent constellation points may include random noise [noise signal], while corresponding points with different constellation points may include random noise and secret information [encoded noise signal]…therefore, it is possible to determine whether there is secret information based on the distance between corresponding points [compare the encoded noise signal and noise signal], see ¶ 0084; The noise is random Gaussian noise, so the existence of the noise causes the first carrier information to jitter near the constellation point, see ¶ 0085; determination unit is further configured to determine that no secret information exists in the first carrier information when the determination unit determines that the first distance is less than or equal to the second distance, see ¶ 0038. Examiner construes that the determination unit is coupled to an encoder).
Before the effective filing date of the claimed invention, it would have been obvious to one of ordinary skill in the art to modify Melodia and Tollefson with Xie to teach a critic module operably coupled to the encoder, the critic module configured to: compare the encoded noise signal generated by the encoder and the noise signal of the predetermined hardware device. The suggestion/motivation would have been in order to detect the secret information through the judgment of multiple features (see ¶ 0005).
As to Claim 3, Melodia, Tollefson and Xie depending on Claim 2, Melodia teaches wherein the encoder is further configured to adjust characteristics of the encoded noise signal in response to the critic module determining that the statistical properties for the encoded noise signal differ from the statistical properties of the noise signal of the predetermined hardware device (Through steganalysis an eavesdropper may analyze the statistical properties of the captured I/Q samples [noise signal] and infer whether there is an anomaly suggesting the presence of a covert slice [encoded noise signal], see ¶ 0305; Such a statistical behavior is inherited from the 4-ASK covert scheme in FIG. 8b, whose functioning results in 4 covert points per primary symbol with amplitude equal to 0.25, 0.5, 0.75, and 1. Steganalysis can easily identify such an abnormal statistical pattern, thus raising the eavesdropper's concerns about the existence of ongoing covert transmissions…for steganographic communications to be undetectable, they must statistically behave like primary ones. In practice, this is achieved by reducing the value of the K-S distance, see ¶ 0305, 0307; the steganographic system implements a mechanism that “mimics” I/Q displacements introduced by noise on the wireless channel by randomizing the covert embedding procedures. Rather than utilizing a fixed distance between covert symbols, the steganographic system randomly changes the distance between the covert symbols [adjust characteristics of the encoded noise signal in response to the critic module determining that the statistical properties of the encoded noise signal differ from the statistical properties of the noise signal], providing the undetectability mechanism, see ¶ 0308).
As to Claim 11, Melodia and Tollefson depending on Claim 10, Melodia teaches determining statistical properties for each of the encoded noise signal and the noise signal of the predetermined hardware device (Through steganalysis an eavesdropper may analyze the statistical properties of the captured I/Q samples [noise signal] and infer whether there is an anomaly suggesting the presence of a covert slice [encoded noise signal], see ¶ 0305; Such a statistical behavior is inherited from the 4-ASK covert scheme in FIG. 8b, whose functioning results in 4 covert points per primary symbol with amplitude equal to 0.25, 0.5, 0.75, and 1. Steganalysis can easily identify such an abnormal statistical pattern, thus raising the eavesdropper's concerns about the existence of ongoing covert transmissions, see ¶ 0305, 0307).
Melodia and Tollefson do not expressly disclose comparing, at the critic module, the encoded noise signal generated by the encoder and the noise signal of the predetermined hardware device.
Xie teaches comparing, at the critic module, the encoded noise signal generated by the encoder and the noise signal of the predetermined hardware device (determination unit [critic module], determining a first distance between the corresponding points and a second distance between adjacent constellation points on the constellation diagram, see ¶ 0029; judging unit, whether the first distance is greater than the second distance, see ¶ 0030; determination unit is configured to determine that secret information exists in the first carrier information when the determination unit determines that the first distance is greater than a second distance, see ¶ 0031; sending device is divided into two paths, one is the carrier information encoded, and the other is the secret information encoded. After the two are encoded, the secret information is embedded in the carrier information, see ¶ 0055; corresponding points with consistent constellation points may include random noise [noise signal], while corresponding points with different constellation points may include random noise and secret information [encoded noise signal]…therefore, it is possible to determine whether there is secret information based on the distance between corresponding points [compare the encoded noise signal and noise signal], see ¶ 0084; The noise is random Gaussian noise, so the existence of the noise causes the first carrier information to jitter near the constellation point, see ¶ 0085; determination unit is further configured to determine that no secret information exists in the first carrier information when the determination unit determines that the first distance is less than or equal to the second distance, see ¶ 0038. Examiner construes that the determination unit is coupled to an encoder).
Before the effective filing date of the claimed invention, it would have been obvious to one of ordinary skill in the art to modify Melodia and Tollefson with Xie to teach comparing, at the critic module, the encoded noise signal generated by the encoder and the noise signal of the predetermined hardware device. The suggestion/motivation would have been in order to detect the secret information through the judgment of multiple features (see ¶ 0005).
As to Claim 12, Melodia, Tollefson and Xie depending on Claim 10, Melodia teaches adjusting, at the encoder, characteristics of the encoded noise signal in response to the critic module; and determining, at the encoder, that the statistical properties for the encoded noise signal differ from the statistical properties of the noise signal of the predetermined hardware device (Through steganalysis an eavesdropper may analyze the statistical properties of the captured I/Q samples [noise signal] and infer whether there is an anomaly suggesting the presence of a covert slice [encoded noise signal], see ¶ 0305; Such a statistical behavior is inherited from the 4-ASK covert scheme in FIG. 8b, whose functioning results in 4 covert points per primary symbol with amplitude equal to 0.25, 0.5, 0.75, and 1. Steganalysis can easily identify such an abnormal statistical pattern, thus raising the eavesdropper's concerns about the existence of ongoing covert transmissions…for steganographic communications to be undetectable, they must statistically behave like primary ones. In practice, this is achieved by reducing the value of the K-S distance, see ¶ 0305, 0307; the steganographic system implements a mechanism that “mimics” I/Q displacements introduced by noise on the wireless channel by randomizing the covert embedding procedures. Rather than utilizing a fixed distance between covert symbols, the steganographic system randomly changes the distance between the covert symbols [adjust characteristics of the encoded noise signal in response to the critic module determining that the statistical properties of the encoded noise signal differ from the statistical properties of the noise signal], providing the undetectability mechanism, see ¶ 0308).
As to Claim 19, Melodia and Tollefson depending on Claim 18, Melodia teaches determining statistical properties for each of the encoded noise signal and the noise signal of the predetermined hardware device (Through steganalysis an eavesdropper may analyze the statistical properties of the captured I/Q samples [noise signal] and infer whether there is an anomaly suggesting the presence of a covert slice [encoded noise signal], see ¶ 0305; Such a statistical behavior is inherited from the 4-ASK covert scheme in FIG. 8b, whose functioning results in 4 covert points per primary symbol with amplitude equal to 0.25, 0.5, 0.75, and 1. Steganalysis can easily identify such an abnormal statistical pattern, thus raising the eavesdropper's concerns about the existence of ongoing covert transmissions, see ¶ 0305, 0307).
Melodia and Tollefson do not expressly disclose a critic means, operably coupled to the encoding means, the critic means for: comparing the encoded noise signal generated by the encoder and the noise signal of the predetermined hardware device. Xie teaches a critic means, operably coupled to the encoding means, the critic means for: comparing the encoded noise signal generated by the encoder and the noise signal of the predetermined hardware device (determination unit [critic module], determining a first distance between the corresponding points and a second distance between adjacent constellation points on the constellation diagram, see ¶ 0029; judging unit, whether the first distance is greater than the second distance, see ¶ 0030; determination unit is configured to determine that secret information exists in the first carrier information when the determination unit determines that the first distance is greater than a second distance, see ¶ 0031; sending device is divided into two paths, one is the carrier information encoded, and the other is the secret information encoded. After the two are encoded, the secret information is embedded in the carrier information, see ¶ 0055; corresponding points with consistent constellation points may include random noise [noise signal], while corresponding points with different constellation points may include random noise and secret information [encoded noise signal]…therefore, it is possible to determine whether there is secret information based on the distance between corresponding points [compare the encoded noise signal and noise signal], see ¶ 0084; The noise is random Gaussian noise, so the existence of the noise causes the first carrier information to jitter near the constellation point, see ¶ 0085; determination unit is further configured to determine that no secret information exists in the first carrier information when the determination unit determines that the first distance is less than or equal to the second distance, see ¶ 0038. Examiner construes that the determination unit is coupled to an encoder).
Before the effective filing date of the claimed invention, it would have been obvious to one of ordinary skill in the art to modify Melodia and Tollefson with Xie to teach a critic means, operably coupled to the encoding means, the critic means for: comparing the encoded noise signal generated by the encoder and the noise signal of the predetermined hardware device. The suggestion/motivation would have been in order to detect the secret information through the judgment of multiple features (see ¶ 0005).
Claim(s) 4, 6, 7, 9, 13, 15, 17, 20 are rejected under 35 U.S.C. 103 as being unpatentable over U.S. Patent Publication 2021/0352053 to Melodia et al (“Melodia”) in view of U.S. Patent Publication 2017/0026146 to Tollefson et al (“Tollefson”) in further view of U.S. Patent Publication 2024/0104681 to Kishore et al (“Kishore”).
As to Claim 4, Melodia and Tollefson depending on Claim 1, Melodia and Tollefson do not expressly disclose wherein each of the encoder and the decoder includes a multi-node neural network. Kishore teaches wherein each of the encoder and the decoder includes a multi-node neural network (applying a first image and a message to an encoder of a steganographic encoder-decoder neural network, generating in the encoder, based at least in part on the first image and the message, a perturbed image containing the message, decoding the perturbed image in a decoder of the steganographic encoder-decoder neural network, and providing information characterizing the decoded perturbed image to the encoder, see ¶ 0006).
Before the effective filing date of the claimed invention, it would have been obvious to one of ordinary skill in the art to modify Melodia and Tollefson with Kishore to teach wherein each of the encoder and the decoder includes a multi-node neural network. The suggestion/motivation would have been in order to detect the secret information through the judgment of multiple features (see ¶ 0005).
As to Claim 6, Melodia and Tollefson depending on Claim 1, Melodia and Tollefson do not expressly disclose wherein: the encoder further configured to transmit the bitstream to the decoder for a predetermined training session; and the decoder further configured to: receive the bitstream from the encoder during the training session; and compare the received bitstream with the decoded bitstream to thereby determine a decoding accuracy. Kishore teaches wherein: the encoder further configured to transmit the bitstream to the decoder for a predetermined training session (The input secret message 110, also illustratively denoted in the figure as input secret message M, is illustratively a secret digital message to be inserted into the input image 111 by incorporating one or more bits of the input secret message 110 into each of a plurality of pixels of the input image 111, see ¶ 0029; Given a trained encoder-decoder pair, F is defined as a pre-trained decoder and {tilde over (X)} is initialized as Enc(X,M), where Enc is the trained encoder that is paired with the decoder F, see ¶ 0063); and the decoder further configured to: receive the bitstream from the encoder during the training session (The critic network illustratively comprises a neural classifier, in some embodiments configured as one or more generative adversarial network (GAN) discriminators, that is trained to identify whether a given image is an original cover image or a steganographic image with a hidden message, see ¶ 0086; As these components are fully differentiable, the iterative encoder, the decoder, and the critic network can all be learned jointly, see ¶ 0087); and compare the received bitstream with the decoded bitstream to thereby determine a decoding accuracy (the secret message includes no redundancy for error correction, and there is zero tolerance for even a single incorrectly recovered bit. This includes certain applications in which the secret message is encrypted, as the encrypted message comprises a random bit string that must be recovered with zero error for successful decryption, see ¶ 0005).
Before the effective filing date of the claimed invention, it would have been obvious to one of ordinary skill in the art to modify Melodia and Tollefson with Kishore to teach wherein: the encoder further configured to transmit the bitstream to the decoder for a predetermined training session; and the decoder further configured to: receive the bitstream from the encoder during the training session; and compare the received bitstream with the decoded bitstream to thereby determine a decoding accuracy. The suggestion/motivation would have been in order to provide zero error recovery of the secret message (see ¶ 0005).
As to Claim 7, Melodia, Tollefson and Kishore depending on Claim 6, Kishore teaches wherein the decoder further configured to transmit the decoding accuracy to the encoder (applying a first image and a message to an encoder of a steganographic encoder-decoder neural network, generating in the encoder, based at least in part on the first image and the message, a perturbed image containing the message, decoding the perturbed image in a decoder of the steganographic encoder-decoder neural network, and providing information characterizing the decoded perturbed image to the encoder, see ¶ 0006).
As to Claim 9, Melodia and Tollefson depending on Claim 1, Melodia and Tollefson do not expressly disclose wherein the at least one covert wireless signal is encrypted. Kishore teaches wherein the at least one covert wireless signal is encrypted (certain applications in which the secret message [covert wireless signal] is encrypted, as the encrypted message comprises a random bit string that must be recovered with zero error for successful decryption, see ¶ 0005).
Before the effective filing date of the claimed invention, it would have been obvious to one of ordinary skill in the art to modify Melodia and Tollefson with Kishore to teach wherein: the encoder further configured to transmit the bitstream to the decoder for a predetermined training session; and the decoder further configured to: receive the bitstream from the encoder during the training session; and compare the received bitstream with the decoded bitstream to thereby determine a decoding accuracy. The suggestion/motivation would have been in order to recover the encrypted message with zero error for successful decryption (see ¶ 0005).
As to Claim 13, Melodia and Tollefson depending on Claim 10, Melodia and Tollefson do not expressly disclose creating a multi-node neural network at each of the encoder and the decoder. Kishore teaches creating a multi-node neural network at each of the encoder and the decoder (applying a first image and a message to an encoder of a steganographic encoder-decoder neural network, generating in the encoder, based at least in part on the first image and the message, a perturbed image containing the message, decoding the perturbed image in a decoder of the steganographic encoder-decoder neural network, and providing information characterizing the decoded perturbed image to the encoder, see ¶ 0006).
Before the effective filing date of the claimed invention, it would have been obvious to one of ordinary skill in the art to modify Melodia and Tollefson with Kishore to teach wherein each of the encoder and the decoder includes a multi-node neural network. The suggestion/motivation would have been in order to detect the secret information through the judgment of multiple features (see ¶ 0005).
As to Claim 15, Melodia and Tollefson depending on Claim 10, Melodia and Tollefson do not expressly disclose transmitting the bitstream from the encoder to the decoder for a predetermined training session; receiving the bitstream at the decoder during the training session; and comparing, at the decoder, the received bitstream with the decoded bitstream to thereby determine a decoding accuracy. Kishore teaches transmitting the bitstream from the encoder to the decoder for a predetermined training session (The input secret message 110, also illustratively denoted in the figure as input secret message M, is illustratively a secret digital message to be inserted into the input image 111 by incorporating one or more bits of the input secret message 110 into each of a plurality of pixels of the input image 111, see ¶ 0029; Given a trained encoder-decoder pair, F is defined as a pre-trained decoder and {tilde over (X)} is initialized as Enc(X,M), where Enc is the trained encoder that is paired with the decoder F, see ¶ 0063); receiving the bitstream at the decoder during the training session (The critic network illustratively comprises a neural classifier, in some embodiments configured as one or more generative adversarial network (GAN) discriminators, that is trained to identify whether a given image is an original cover image or a steganographic image with a hidden message, see ¶ 0086; As these components are fully differentiable, the iterative encoder, the decoder, and the critic network can all be learned jointly, see ¶ 0087); and comparing, at the decoder, the received bitstream with the decoded bitstream to thereby determine a decoding accuracy (the secret message includes no redundancy for error correction, and there is zero tolerance for even a single incorrectly recovered bit. This includes certain applications in which the secret message is encrypted, as the encrypted message comprises a random bit string that must be recovered with zero error for successful decryption, see ¶ 0005).
Before the effective filing date of the claimed invention, it would have been obvious to one of ordinary skill in the art to modify Melodia and Tollefson with Kishore to teach transmitting the bitstream from the encoder to the decoder for a predetermined training session; receiving the bitstream at the decoder during the training session; and comparing, at the decoder, the received bitstream with the decoded bitstream to thereby determine a decoding accuracy. The suggestion/motivation would have been in order to provide zero error recovery of the secret message (see ¶ 0005).
As to Claim 17, Melodia and Tollefson depending on Claim 10, Melodia and Tollefson do not expressly disclose encrypting the at least one covert wireless signal. Kishore teaches encrypting the at least one covert wireless signal (certain applications in which the secret message [covert wireless signal] is encrypted, as the encrypted message comprises a random bit string that must be recovered with zero error for successful decryption, see ¶ 0005).
Before the effective filing date of the claimed invention, it would have been obvious to one of ordinary skill in the art to modify Melodia and Tollefson with Kishore to teach encrypting the at least one covert wireless signal. The suggestion/motivation would have been in order to recover the encrypted message with zero error for successful decryption (see ¶ 0005).
As to Claim 20, Melodia and Tollefson depending on Claim 18, Melodia and Tollefson do not expressly disclose the encoding means further transmitting the bitstream to the decoding means for a predetermined training session; and the decoding means further: receiving the bitstream from the encoder during the training session; and comparing the received bitstream with the decoded bitstream to thereby determine a decoding accuracy. Kishore teaches the encoding means further transmitting the bitstream to the decoding means for a predetermined training session (The input secret message 110, also illustratively denoted in the figure as input secret message M, is illustratively a secret digital message to be inserted into the input image 111 by incorporating one or more bits of the input secret message 110 into each of a plurality of pixels of the input image 111, see ¶ 0029; Given a trained encoder-decoder pair, F is defined as a pre-trained decoder and {tilde over (X)} is initialized as Enc(X,M), where Enc is the trained encoder that is paired with the decoder F, see ¶ 0063); and the decoding means further: receiving the bitstream from the encoder during the training session (The critic network illustratively comprises a neural classifier, in some embodiments configured as one or more generative adversarial network (GAN) discriminators, that is trained to identify whether a given image is an original cover image or a steganographic image with a hidden message, see ¶ 0086; As these components are fully differentiable, the iterative encoder, the decoder, and the critic network can all be learned jointly, see ¶ 0087); and comparing the received bitstream with the decoded bitstream to thereby determine a decoding accuracy (the secret message includes no redundancy for error correction, and there is zero tolerance for even a single incorrectly recovered bit. This includes certain applications in which the secret message is encrypted, as the encrypted message comprises a random bit string that must be recovered with zero error for successful decryption, see ¶ 0005).
Before the effective filing date of the claimed invention, it would have been obvious to one of ordinary skill in the art to modify Melodia and Tollefson with Kishore to teach the encoding means further transmitting the bitstream to the decoding means for a predetermined training session; and the decoding means further: receiving the bitstream from the encoder during the training session; and comparing the received bitstream with the decoded bitstream to thereby determine a decoding accuracy. The suggestion/motivation would have been in order to provide zero error recovery of the secret message (see ¶ 0005).
Conclusion
Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a).
A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action.
Any inquiry concerning this communication or earlier communications from the examiner should be directed to EBONI N GILES whose telephone number is (571)270-7453. The examiner can normally be reached Monday - Friday 9 am - 6 pm EST.
Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, PATRICK EDOUARD can be reached on (571)272-7603. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
/EBONI N GILES/ Examiner, Art Unit 2622
/PATRICK N EDOUARD/ Supervisory Patent Examiner, Art Unit 2622