IP Library › Granted Patent US 12,335,160
Granted Patent B2
US 12,335,160 · App. 18/345,847 · Granted Jun 17, 2025

Secure data routing with dynamic packet spoofing

Inventors: John G. Andrews (Cleveland Heights, OH); John P. Keyerleber (Richmond Heights, OH)
Assignee: SCATR LLC
H04L47/431H04L45/24H04L63/1483H04L69/08
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,335,160
App. No.
18/345,847
Granted
Jun 17, 2025
Kind
B2
Abstract

A method of secure data routing with dynamic packet spoofing is disclosed that comprises a scatter network node receiving data packets from a user communication device and a scattering application selecting a logical communication channel from a plurality of logical communication channels. The method also comprises a channel controller receiving channel information that comprises a size limit corresponding to data packets being transmitted over the logical communication channel and modifying a received data packet based on the channel information such that a size of the modified data packet satisfies the size limit. The method additionally comprises a channel adapter wrapping the modified data packet to correspond to a particular protocol that is different than an initial protocol of the modified data packet. The method further comprises transmitting the modified data packet wrapped to correspond to the particular protocol via the logical communication channel to a counterpart scatter network device.

Claims (51)

1. A method of secure data routing with dynamic packet spoofing, comprising:

receiving, by a scatter network node comprising at least one non-transitory memory and at least one processor, a plurality of data packets from a user communication device;

selecting, by a scattering application stored in the at least one non-transitory memory and executable by the at least one processor, a logical communication channel of a plurality of logical communication channels;

receiving, by a channel controller stored in the at least one non-transitory memory and executable by the at least one processor, channel information corresponding to the logical communication channel, wherein the channel information comprises a size limit corresponding to data packets being transmitted over the logical communication channel;

modifying, by the channel controller, a data packet of the plurality of data packets based on the channel information such that a size of the modified data packet satisfies the size limit;

encrypting, by the scattering application, a portion of the modified data packet;

wrapping, by a channel adapter associated with the logical communication channel and stored in the at least one non-transitory memory and executable by the at least one processor, the modified data packet to correspond to a particular protocol that is different than an initial protocol of the modified data packet, wherein data packets being transmitted over the logical communication channel comprise the particular protocol; and

transmitting the modified data packet wrapped to correspond to the particular protocol via the logical communication channel to a counterpart scatter network device, wherein the modified data packet wrapped to correspond to the particular protocol is obfuscated with other traffic on the logical communication channel.

2. The method of claim 1 , wherein the size limit is dynamically updated over time based on at least one of a time of day, day of the week, or a location.

3. The method of claim 1 , wherein modifying the data packet to satisfy the size limit comprises making the data packet larger by padding the data packet or making the data packet smaller by selecting only a portion of the data packet.

4. The method of claim 1 , wherein the plurality of data packets are stored in a buffer.

5. The method of claim 1 , wherein the particular protocol is dynamically updated based on at least one of a time of day, day of the week, or a location.

6. The method of claim 1 , wherein wrapping the modified data packet to correspond with the particular protocol comprises one or more of changing a first byte of the payload to correspond to the particular protocol, adding bytes present in the particular protocol, or adding a counter such that data packets being transmitted via the logical communication channel appear sequential.

7. The method of claim 1 , wherein wrapping the modified data packet to correspond with the particular protocol does not change the encrypted port of the modified data packet.

8. A scatter network device, comprising:

at least one non-transitory memory;

at least one physical interface;

at least one processor;

a scattering application stored in the at least one non-transitory memory that, when executed by the at least one processor:

establishes a plurality of logical channels, and

selects a logical communication channel of the plurality of logical communication channels to transmit a data packet received from a user communication device; and

a channel controller stored in the at least one non-transitory memory that, when executed by the at least one processor:

receives channel information from the logical communication channel, wherein the channel information comprises a size limit corresponding to data packets being transmitted over the logical communication channel,

modifies the data packet based on the channel information such that a size of the modified data packet satisfies the size limit, wherein the modified data packet is transmitted via the logical communication channel to a counterpart scatter network device,

monitors an amount of traffic on the logical communication channel,

in response to the amount of traffic on the logical communication channel exceeding a channel volume threshold, disables the logical communication channel for a period of time, and

in response to the amount of traffic on the logical communication channel being less than the channel volume threshold, transmits dummy packets that satisfy the size limit via the logical communication channel.

9. The scatter network device of claim 8 , wherein the scattering application is further configured to encrypt a portion of the modified data packet prior to the modified data packet being transmitted via the logical communication channel.

10. The scatter network device of claim 8 , wherein the channel volume threshold is dynamically updated based on at least one of a time of day, day of the week, or a location.

11. The scatter network device of claim 8 , wherein the channel volume threshold comprises a range.

12. The scatter network device of claim 8 , wherein the size limit is dynamically updated over time based on at least one of a time of day, day of the week, or a location.

13. The scatter network device of claim 8 , wherein modifying the size of the data packet to satisfy the size limit comprises making the data packet larger by padding the data packet or making the data packet smaller by selecting only a portion of the data packet.

14. The scatter network device of claim 8 , further comprising a buffer, wherein the data packet is stored in the buffer.

15. The scatter network device of claim 8 , further comprising:

a channel adapter associated with the logical communication channel, the channel adapter stored in the at least one non-transitory memory that, when executed by the at least one processor:

wrap the modified data packet to correspond to a particular protocol that is different than an initial protocol of the modified data packet, wherein data packets being transmitted over the logical communication channel comprise the particular protocol, wherein the modified data packet wrapped to correspond to the particular protocol is transmitted via the logical communication channel to the counterpart scatter network device, and wherein the modified data packet wrapped to correspond to the particular protocol is obfuscated with other traffic on the logical communication channel.

16. A method of secure data routing with dynamic packet spoofing, comprising:

receiving, by a scatter network node comprising at least one non-transitory memory and at least one processor, a plurality of data packets from a user communication device;

selecting, by a scattering application stored in the at least one non-transitory memory and executable by the at least one processor, a first logical communication channel of a plurality of logical communication channels for transmitting a data packet of the plurality of data packets;

wrapping, by a channel adapter associated with the first logical communication channel and stored in the at least one non-transitory memory and executable by the at least one processor, the data packet to correspond to a particular protocol that is different than an initial protocol of the data packet, wherein data packets being transmitted over the first logical communication channel comprise the particular protocol;

transmitting the data packet wrapped to correspond to the particular protocol via the first logical communication channel to a counterpart scatter network device, wherein the data packet wrapped to correspond to the particular protocol is obfuscated with other traffic on the first logical communication channel;

monitoring, by a channel controller stored in the at least one non-transitory memory and executable by the at least one processor, an amount of traffic on each of the plurality of logical communication channels;

in response to an amount of traffic on a second logical communication channel exceeding a channel volume threshold corresponding to the second logical communication channel, disabling, by the channel controller, the second logical communication channel for a period of time; and

in response to an amount of traffic on a third logical communication channel being less than a channel volume threshold corresponding to the third logical communication channel, transmitting, by the channel controller, dummy packets via the third logical communication channel.

17. The method of claim 16 , wherein the particular protocol is dynamically updated based on at least one of a time of day, day of the week, or a location.

18. The method of claim 16 , wherein wrapping the data packet to correspond with the particular protocol comprises one or more of changing a first byte of the payload to correspond to the particular protocol, adding bytes present in the particular protocol, or adding a counter such that data packets being transmitted via the logical communication channel appear sequential.

19. The method of claim 16 , further comprising:

receiving, by the channel controller, channel information from the first logical communication channel, wherein the channel information comprises a size limit corresponding to data packets being transmitted over the first logical communication channel;

modifying, by the channel controller, the data packet based on the channel information such that a size of the modified data packet satisfies the size limit; and

encrypting, by the scattering application, a portion of the modified data packet, wherein the modifying and the encrypting occur before the wrapping.

20. The method of claim 19 , wherein the size limit is dynamically updated over time based on at least one of a time of day, day of the week, or a location, and wherein modifying the size of the data packet to satisfy the size limit comprises making the data packet larger by padding the data packet or making the data packet smaller by selecting only a portion of the data packet.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 30, 2024
From: SCATR, LLC
To: SCATR, CORP
Reel/Frame 068117/0434 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 17, 2024
From: ANDREWS, JOHN G.; KEYERLEBER, JOHN P.
To: SCATR LLC
Reel/Frame 067451/0038 →
Continuity (1)
Related Publication 20250007852A1 · Jan 2, 2025
References Cited (119)
US 6502135B1 · Munger et al. · 2002 [cited by applicant]
US 6765866B1 · Wyatt · 2004 [cited by applicant]
US 6990111B2 · Lemoff et al. · 2006 [cited by applicant]
US 7382782B1 · Ferguson et al. · 2008 [cited by applicant]
US 7697528B2 · Parry et al. · 2010 [cited by applicant]
US 7782782B1 · Ferguson et al. · 2010 [cited by applicant]
US 7895348B2 · Twitchell, Jr. · 2011 [cited by applicant]
US 7984495B1 · Aravind · 2011 [cited by applicant]
US 8274980B2 · Sato et al. · 2012 [cited by applicant]
US 8358658B2 · Flynn et al. · 2013 [cited by applicant]
US 8416686B2 · Ferguson et al. · 2013 [cited by applicant]
US 8924716B2 · Miyabayashi et al. · 2014 [cited by applicant]
US 8955110B1 · Twitchell, Jr. · 2015 [cited by applicant]
US 9116734B1 · Twitchell, Jr. et al. · 2015 [cited by applicant]
US 9185046B2 · Ferguson et al. · 2015 [cited by applicant]
US 9225699B2 · Biradar et al. · 2015 [cited by applicant]
US 9241026B2 · Twitchell · 2016 [cited by applicant]
US 9495194B1 · Twitchell, Jr. et al. · 2016 [cited by applicant]
US 9535805B2 · Ananthanarayanan et al. · 2017 [cited by applicant]
US 9629063B2 · Brown et al. · 2017 [cited by applicant]
US 9794797B2 · Hoffberg · 2017 [cited by applicant]
US 10356061B2 · Fiske · 2019 [cited by applicant]
US 10432526B2 · Gafni et al. · 2019 [cited by applicant]
US 10469375B2 · Twitchell, Jr. · 2019 [cited by applicant]
US 10541907B2 · Twitchell, Jr. et al. · 2020 [cited by applicant]
US 10637685B2 · Goel et al. · 2020 [cited by applicant]
US 10686729B2 · Sindhu et al. · 2020 [cited by applicant]
US 10826711B2 · Barry · 2020 [cited by applicant]
US 10826876B1 · Sinn · 2020 [cited by examiner]
US 10833972B2 · Vaughan et al. · 2020 [cited by applicant]
US 10904367B2 · Goel et al. · 2021 [cited by applicant]
US 10965586B2 · Goel et al. · 2021 [cited by applicant]
US 11153276B1 · Keyerleber · 2021 [cited by applicant]
US 11171934B2 · Fiske · 2021 [cited by applicant]
US 11178262B2 · Goel et al. · 2021 [cited by applicant]
US 11184147B2 · Ghorbani · 2021 [cited by applicant]
US 11381557B2 · Kim et al. · 2022 [cited by applicant]
US 11469922B2 · Goel et al. · 2022 [cited by applicant]
US 11533617B2 · Mihelich et al. · 2022 [cited by applicant]
US 11558422B2 · Twitchell, Jr. et al. · 2023 [cited by applicant]
US 11601359B2 · Goel et al. · 2023 [cited by applicant]
US 11637694B2 · Islamov · 2023 [cited by applicant]
US 11777839B2 · Sindhu et al. · 2023 [cited by applicant]
US 11805127B1 · Sundar et al. · 2023 [cited by applicant]
US 11895015B1 · Budhia et al. · 2024 [cited by applicant]
US 12021972B2 · Wang et al. · 2024 [cited by applicant]
US 12120028B1 · Andrews et al. · 2024 [cited by applicant]
US 20010050914A1 · Akahane et al. · 2001 [cited by applicant]
US 20010054158A1 · Jarosz · 2001 [cited by applicant]
US 20020191797A1 · Perlman · 2002 [cited by applicant]
US 20030112755A1 · McDysan · 2003 [cited by applicant]
US 20040103205A1 · Larson et al. · 2004 [cited by applicant]
US 20060008082A1 · Gluck · 2006 [cited by examiner]
US 20070217424A1 · Kim · 2007 [cited by examiner]
US 20100149988A1 · Matsubara et al. · 2010 [cited by applicant]
US 20110179136A1 · Twitchell, Jr. · 2011 [cited by applicant]
US 20110271096A1 · Bharrat et al. · 2011 [cited by applicant]
US 20150326603A1 · Deisinger et al. · 2015 [cited by applicant]
US 20150350245A1 · Twitchell, Jr. et al. · 2015 [cited by applicant]
US 20150350246A1 · Bergman · 2015 [cited by examiner]
US 20160065370A1 · Le Saint et al. · 2016 [cited by applicant]
US 20160255054A1 · Wan · 2016 [cited by examiner]
US 20170019256A1 · Rhelimi · 2017 [cited by applicant]
US 20170126626A1 · Datta et al. · 2017 [cited by applicant]
US 20170331794A1 · Lokman · 2017 [cited by examiner]
US 20170372048A1 · Liu et al. · 2017 [cited by applicant]
US 20180316598A1 · Twitchell, Jr. · 2018 [cited by applicant]
US 20180375663A1 · Le Saint et al. · 2018 [cited by applicant]
US 20190014092A1 · Malek · 2019 [cited by examiner]
US 20190294464A1 · Twitchell, Jr. et al. · 2019 [cited by applicant]
US 20190373458A1 · Dandekar · 2019 [cited by examiner]
US 20200014619A1 · Shelar et al. · 2020 [cited by applicant]
US 20200154272A1 · Uy et al. · 2020 [cited by applicant]
US 20200213111A1 · Leavy et al. · 2020 [cited by applicant]
US 20200213151A1 · Srivatsan · 2020 [cited by examiner]
US 20200259640A1 · Leavy et al. · 2020 [cited by applicant]
US 20210105301A1 · Anderson · 2021 [cited by examiner]
US 20210144004A1 · Gray et al. · 2021 [cited by applicant]
US 20210168138A1 · Paruchuri · 2021 [cited by examiner]
US 20210297351A1 · Vegesna et al. · 2021 [cited by applicant]
US 20210328779A1 · Ruan · 2021 [cited by applicant]
US 20210328976A1 · Leavy et al. · 2021 [cited by applicant]
US 20210360026A1 · Anderson · 2021 [cited by examiner]
US 20220247678A1 · Atwal et al. · 2022 [cited by applicant]
US 20220392286A1 · Elrad et al. · 2022 [cited by applicant]
US 20230097712A1 · Sullivan et al. · 2023 [cited by applicant]
US 20230164086A1 · York et al. · 2023 [cited by applicant]
US 20230198914A1 · Ranjan et al. · 2023 [cited by applicant]
US 20230208748A1 · Goel et al. · 2023 [cited by applicant]
US 20240007367A1 · Demchenko · 2024 [cited by examiner]
US 20240028367A1 · Mathew et al. · 2024 [cited by applicant]
US 20240214803A1 · Dandekar · 2024 [cited by examiner]
US 20240380726A1 · Ban et al. · 2024 [cited by applicant]
CN 112333152A · 2021 [cited by applicant]
EP 3651407A1 · 2020 [cited by applicant]
WO 2018160863A1 · 2018 [cited by applicant]
WO 2023134844A1 · 2023 [cited by applicant]
Notice of Allowance dated Jun. 22, 2021, U.S. Appl. No. 16/683,146, filed Nov. 13, 2019. [cited by applicant]
Office Action dated Apr. 12, 2023, U.S. Appl. No. 17/481,914, filed Sep. 22, 2022. [cited by applicant]
Final Office Action dated Jul. 24, 2023, U.S. Appl. No. 17/481,914, filed Sep. 22, 2022. [cited by applicant]
Keyerleber, John P., et al., “Secure Data Routing and Randomization,” filed Sep. 22, 2021, U.S. Appl. No. 17/481,914. [cited by applicant]
Andrews, John G., et al., “Secure Data Routing With Channel Resiliency,” filed Mar. 31, 2023, U.S. Appl. No. 18/194,413. [cited by applicant]
Andrews, John G., et al., “Out of Band Key Exchange,” filed Jun. 30, 2023, U.S. Appl. No. 18/345,819. [cited by applicant]
Andrews, John G., et al., “Network Traffic Obfuscation,” filed Jun. 30, 2023, U.S. Appl. No. 18/345,829. [cited by applicant]
Andrews, John G., et al., “Endpoint Validation Security,” filed Jun. 30, 2023, U.S. Appl. No. 18/345,837. [cited by applicant]
“Andrews, John G., et al., ““Secure Data Routing Andrandomization in Windows,”” filed Jul. 28, 2023, U.S. Appl. No. 18/361,721.” [cited by applicant]
Notice of Allowance dated Jun. 11, 2024, U.S. Appl. No. 18/194,413, filed Mar. 31, 2023. [cited by applicant]
Office Action dated Nov. 27, 2024, U.S. Appl. No. 18/345,829, filed Jun. 30, 2023. [cited by applicant]
Syed, et al., “Zero Trust Architecture (ZTA): A Comprehensive Survey”, IEEE Access—Digital Object Identifier, vol. 10, 37 pages, 2022. [cited by applicant]
Shu, et al., “Secure Data Collection in Wireless Sensor Networks Using Randomized Dispersive Routes”, IEEE Transactions on Mobile Computing, vol. 9, No. 7, Jul. 2010, 14 pages. [cited by applicant]
Andrews, John G., et al., “Secure Data Routing With Channel Resiliency,” filed Sep. 11, 2024, U.S. Appl. No. 11/882,552. [cited by applicant]
Advisory Action dated Oct. 5, 2023, U.S. Appl. No. 17/481,914, filed Sep. 22, 2022. [cited by applicant]
Examiner's Answer to Appeal Brief dated Feb. 23, 2024, U.S. Appl. No. 17/481,914, filed Sep. 22, 2022. [cited by applicant]
Office Action dated Feb. 13, 2024, U.S. Appl. No. 18/194,413, filed Mar. 31, 2023. [cited by applicant]
Keyerleber, John P., “Machine Learning Driven Network Traffic Obfuscation,” filed Jan. 24, 2024, U.S. Appl. No. 18/421,960. [cited by applicant]
Keyerleber, et al., “Optimizing Network Traffic Obfuscation Based on Network Performance Using Reinforcement Learning,” filed Jan. 24, 2024, U.S. Appl. No. 18/421,965. [cited by applicant]
Keyerleber, et al., “Optimizing Network Traffic Obfuscation Based on Aggregated Network Performance,” filed Jan. 24, 2024, Application No. Jan. 24, 2024. [cited by applicant]
Office Action dated May 7, 2025, U.S. Appl. No. 18/345,819, filed Jun. 30, 2023. [cited by applicant]
Office Action dated Apr. 23, 2025, U.S. Appl. No. 18/361,721, filed Jul. 28, 2023. [cited by applicant]
Cited By (8)
US 12,432,042 US 12,519,631 US 12,519,755 US 12,567,966 US 12,615,284 US 12,689,910 US 12,701,101 US 12,739,648