System and method for routing-based internet security

• US 9,634,995 B2
• Filed: 10/01/2015
• Issued: 04/25/2017
• Est. Priority Date: 12/22/2010
• Status: Active Grant

• Current Assignee: May Patents Ltd.
• Original Assignee: MAT Patents Limited
• Inventors: Binder, Yehuda
• Primary Examiner(s): Bayard, Djenane
• Application Number:
  US14/872,165
• Publication Number:
  US 20160028695A1
• Time in Patent Office: 572 Days
• CPC Class Codes: G06F 21/602 Providing cryptographic facilities or services
• CPC Class Codes: G06F 21/78 to assure secure storage of data address-based protection against unauthorised use of memory G06F12/14; record carriers for use with machines and with at least a part designed to carry digital markings G06K19/00
• CPC Class Codes: G06F 21/80 in storage media based on magnetic or optical technology, e.g. disks with sectors preventing unauthorised reproduction or copying of disc-type recordable media G11B20/00
• CPC Class Codes: G06F 21/85 interconnection devices, e.g. bus-connected or in-line devices
• CPC Class Codes: G06F 7/58 Random or pseudo-random number generators
• CPC Class Codes: H04L 51/046 Interoperability with other network applications or services
• CPC Class Codes: H04L 63/0281 Proxies
• CPC Class Codes: H04L 63/0428 wherein the data content is protected, e.g. by encrypting or encapsulating the payload
• CPC Class Codes: H04L 63/18 using different networks or channels, e.g. using out of band channels cryptographic mechanisms or cryptographic arrangements for key distribution involving distinctive intermediate devices or communication paths H04L9/0827; cryptographic mechanisms or cryptographic arrangements for authentication using a plurality of channels H04L9/3215
• CPC Class Codes: H04L 67/63 Routing a service request depending on the request content or context

Abstract

Method and system for improving the security of storing digital data in a memory or its delivery as a message over the Internet from a sender to a receiver using one or more hops is disclosed. The message is split at the sender into multiple overlapping or non-overlapping slices according to a slicing scheme, and the slices are encapsulated in packets each destined to a different relay server as an intermediate node according to a delivery scheme. The relay servers relay the received slices to another other relay server or to the receiver. Upon receiving all the packets containing all the slices, the receiver combines the slices reversing the slicing scheme, whereby reconstructing the message sent.

Claims

1. A method for transferring a message that includes a succession of message elements from a sender location to a recipient location over multiple paths using a plurality of M intermediate servers in the Internet, wherein the sender location, the recipient location and the servers are each addressable in the Internet using a respective IP (Internet Protocol) address, the method comprising at the sender location:

receiving the message and the IP address of the recipient location over the Internet;

partitioning the message into a plurality of N message slices, each message slice contains at least one of the message elements, wherein M>

N;

randomly selecting N intermediate servers from the plurality of intermediate servers;

assigning an intermediate server, selected from the randomly selected N intermediate servers, to each of the message slices; and

sending each of the message slices together with the IP address of the recipient location to the intermediate server assigned to the message slice.

2. The method according to claim 1, further comprising encrypting one or more of the message slices.

3. The method according to claim 1, further comprising, at the recipient location, the steps of receiving and identifying the plurality of the message slices;

and reconstructing at least part of the message.

4. The method according to claim 1, further preceded by determining a number of message slices into which the message is partitioned, and wherein the partitioning of the message comprises the partitioning the message into the determined number of message slices.

5. The method according to claim 4, wherein the number of message slices for the message partitioning is a randomly generated number.

6. The method according to claim 1, wherein part of or all message slices have the same number of message elements.

7. The method according to claim 1, wherein the number of message elements included in each of the message slices is a randomly generated number.

8. The method according to claim 1, wherein each of the message elements is included in only one message slice.

9. The method according to claim 1, wherein each of the message elements is included in at least two message slices.

10. The method according to claim 1, wherein the message elements in at least one of the message slices follow one another in the same order as in the message.

11. The method according to claim 1, wherein the message elements in at least one of the message slices follow one another in an order different from the order of the same message elements in the message.

12. The method according to claim 11, where the message elements in at least one of the message slices are separated by at least one intervening another element in the message.

13. The method according to claim 1, wherein each of the message elements consists of, or comprises, a bit, a nibble, a byte, or a multi-byte word.

14. The method according to claim 1, wherein each of the message elements consists of, comprises, or represents a number, a character, or a letter.

15. The method according to claim 1, further comprising padding the message.

16. The method according to claim 1, wherein at least one of the message slices is padded.

17. The method according to claim 1, wherein the partitioning into slices is performed based on the current date or the current TOD (Time-of-Day).

18. The method according to claim 1, wherein information about the partitioning is sent together with one or more of the message slices.

19. The method according to claim 1, wherein information about a message slice is sent with a different slice.

20. The method according to claim 1, further comprising encrypting at least part of the message slices.

21. The method according to claim 1, wherein at least two of the intermediate servers are located at geographically disparate locations.

22. The method according to claim 21, wherein at least two of the intermediate servers are located in different cities, in different states, in different countries, or on different continents.

23. The method according to claim 21, further comprising providing at least two of the intermediate servers that are located at geographically disparate locations.

24. The method according to claim 1, further comprising receiving or storing a list composed of a plurality of IP addresses of two or more intermediate servers.

25. The method according to claim 1, wherein a geographical location is associated with each of the intermediate servers, and the intermediate servers are selected for assignment based on their geographical location.

26. The method according to claim 1, wherein the order of sending the message slices is based on the order of the first message element in each message slice in the message.

27. The method according to claim 1, wherein the order of sending the message slices is selected at random.

28. The method according to claim 1, wherein at least one of the intermediate servers is integrated with other server having a specific distinct, different functionality.

29. The method according to claim 28, wherein the other servers is one of:

a web server;

a database server;

a mail server;

a FTP server; and

a DNS server.

30. The method according to claim 1 wherein the message includes audio or video data.

31. The method according to claim 30 wherein the message is part of a VoIP, video conferencing, IPTV, or Internet telephony service.

32. The method according to claim 1 further comprising generating a random number, and wherein the random number is used as part of the partition of the message or association of the message slices with the intermediate servers.

33. The method according to claim 32, wherein the generating of said random number is based on a physical process.

34. The method according to claim 33, wherein the physical process is one out of thermal noise, shot noise, nuclear decaying radiation, photoelectric effect, and quantum phenomenon.

35. The method according to claim 32, wherein the generating of said random number is based on an algorithm for generating pseudo-random numbers.