Abstract:
A method for secure communication of a message. The method includes providing a message including a plurality of message packets, providing a nodal network including a plurality of nodes, where nodal operations are capable of execution on the message packets at the nodes, gaining, by a first node of the network, a first message packet, processing the first message packet by the first node, relinquishing the first message packet as processed by the first node, gaining, by any other node of the network, at least one other message packet, processing the other message packet by the other node, relinquishing the other message packet as processed by the other node, receiving, by a message destination node of the network, a first message packet, receiving, by the message destination node, at least a second message packet, and processing the first message packet and the second message packet to provide a reproduced message.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
       [0001]    This application is a continuation of and claims priority to U.S. application Ser. No. 11/931,720, filed Oct. 31, 2007, and entitled “Secure Messaging,” which is now U.S. Pat. No. 8,189,768. 
     
    
     BACKGROUND 
       [0002]    1. Technical Field 
         [0003]    The following relates to secure transmission of a message within a nodal network. 
         [0004]    2. Related Art 
         [0005]    Security of a message transmitted over the Internet from a first node to a second node of the Internet may be of concern. Thus the message may be encrypted to prevent an uninvited third-party eavesdropper from learning of the substantive content of the message. Unfortunately, the uninvited third-party eavesdropper may be sophisticated enough to access and encrypt the message. Thus, there is a need for improved security for protecting a message transmitted over the Internet from a first node to a second node of the Internet. 
       SUMMARY OF THE INVENTION 
       [0006]    A first aspect of the present invention provides method for secure communication of a message, comprising:
       providing a message comprising a plurality of message packets;   providing a nodal network comprising a plurality of nodes, wherein nodal operations are capable of execution on said message packets at said nodes;   gaining, by a first node of said nodal network, a first message packet;   processing the first message packet by the first node;   relinquishing the first message packet as processed by the first node;   gaining, by any other node of said nodal network, at least one other message packet;   processing the at least one other message packet by said any other node;   relinquishing the at least one other message packet as processed by said any other node;   receiving, by a message destination node of said nodal network, a first message packet;   receiving, by the message destination node, at least a second message packet; and   processing the first message packet and the at least a second message packet to provide a reproduced message.       
 
         [0018]    A second aspect of the present invention provides a nodal network for secure communication of a message, said nodal network comprising a plurality of nodes, said message including a first message packet and at least one other message packet, said plurality of nodes comprising a first node, said first node adapted to gain the first message packet as encrypted and to process the first message packet; and reproducing the message. 
         [0019]    A third aspect of the present invention provides a method for secure communication of a message, comprising:
       receiving, by a first node of a plurality of nodes of a nodal network, a first true message that has been transmitted from a second node of the plurality of nodes, wherein the second node has also transmitted a first dummy message to a node selected from the group consisting of the first node, a third node of the plurality of nodes, and a combination thereof;   processing, by the first node, the first true message; and   reproducing the true message.       
 
         [0023]    The present invention provides improved security for protecting a message transmitted from a first node to a second node within a nodal network. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0024]      FIG. 1  depicts a nodal network with message packets and dummy packets transmitted between nodes of the nodal network, in accordance with embodiments of the present invention. 
           [0025]      FIG. 2A  depicts transformation of a message into encrypted packets, in accordance with embodiments of the present invention. 
           [0026]      FIG. 2B  depicts transformation of the encrypted packets of  FIG. 2A  into the message of  FIG. 2A , in accordance with embodiments of the present invention. 
           [0027]      FIG. 3A  depicts transformation of a message into encryption packets, in accordance with embodiments of the present invention. 
           [0028]      FIG. 3B  depicts transformation of the encryption packets of  FIG. 3A  into the message of  FIG. 3A , in accordance with embodiments of the present invention. 
           [0029]      FIG. 4A  depicts transformation of a portion of a message into encrypted packets, in accordance with embodiments of the present invention. 
           [0030]      FIG. 4B  depicts transformation of the packets generated as shown in  FIG. 4A  into the message of  FIG. 4A , in accordance with embodiments of the present invention. 
           [0031]      FIG. 5A  depicts transformation of a portion of a message into encryption packets, in accordance with embodiments of the present invention. 
           [0032]      FIG. 5B  depicts transformation of the packets generated as shown in  FIG. 5A  into the message of  FIG. 5A , in accordance with embodiments of the present invention. 
           [0033]      FIG. 6  depicts the nodal network of  FIG. 1  with true messages and dummy messages transmitted between nodes of the nodal network, in accordance with embodiments of the present invention. 
       
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
       [0034]      FIG. 1  depicts a nodal network  100 , in accordance with embodiments of the present invention. The nodal network  100  comprises nodes  1 - 20 , wherein any one of nodes  1 - 20  may communicate with any other of nodes  1 - 20  over a data communication path of the nodal network  100 . The nodal network  100  may be of any communication medium type such as, inter alia, an Internet nodal network, a postal nodal network, a parcel nodal network a wireless nodal network, a vehicle communication network, an animal communication system, a multimedia nodal network, etc. An Internet nodal network may be embodied, inter alia, in an E-Mail communication system. A postal nodal network may be embodied in the United States Postal System. A parcel nodal network may be embodied in a package transport service such as, inter alia, United Parcel Service, Airborne Express, etc. A wireless nodal network may be embodied in, inter alia, a satellite communication system. A vehicle communication network may be embodied in, inter alia, message transport via taxicab, truck, train, boat, spacecraft (e.g., nodes may be distributed on different planets). An animal communication system may include, inter alia, message transport via horses, camels, donkeys, carrier pigeons, etc. A multimedia nodal network includes a plurality of communication media. In a multimedia nodal network, for example, communication between or among some nodes may be via the Internet, while communication between or among other nodes may be via the United States Postal System. In summary, the scope of the nodal network  100  of the present invention includes any and all communication media, individually or in combination. 
         [0035]    The nodes  1 - 20  of the nodal network  100  may be located anywhere such as, inter alia: in a business office, in a residence, anywhere on the surface of planet Earth including on land or water (e.g., the Atlantic Ocean); in an airplane; ship, or spacecraft; underwater; underground; on any planet (e.g., Mars) of our local solar system; on any planet or other body in our galaxy, etc. 
         [0036]    The messages of the present invention may be represented in any format or “modality” such as, inter alia, a text modality, a visual modality, an audio modality, or combinations thereof. The text modality denotes an expression of information in terms of written language (e.g., words, sentences, numbers, symbols, etc.). The visual modality includes, inter alia, a video modality (e.g., a feed or stream of video frames) and a graphics modality (i.e., synthetic imagery such as any synthetic graphics representation of information such as a graph, a pictorial bit pattern, etc.). The audio modality denotes an expression of information in terms of sound such as, inter alia, speech, music, etc. A message could include multiple modalities. For example, a first portion of the message could be expressed in a text modality and a second portion of the message could be expressed in an audio modality. As another example, a first portion of the message could be expressed in a text modality and a second portion of the message could be expressed in a visual (e.g., graphics) modality. If the message has multiple modalities then the different modalites could be transmitted from a first node to a second node over a same communication medium (e.g., the Internet) or over different communication media. As an example of transmission over different communication media, a first portion of the message expressed in a text modality could be transmitted over Internet nodes, while a second portion of the message expressed in an audio modality (e.g., expressed on an audio tape) could be transmitted over parcel nodes. 
         [0037]      FIG. 1  illustrates transmitting a message from node  1  to node  2 , with security protection by use of packetization and encryption.  FIGS. 2A-2B ,  3 A- 3 B,  4 A- 4 B, and  5 A- 5 B illustrate how packetization and encryption may be combined, in accordance with embodiments of the present invention. 
         [0038]    In  FIG. 2A , a message M is packetized into message packets M 1 , M 2 , and M 3 . Then the packets M 1 , M 2 , and M 3  are respectively encrypted into the encrypted packets M 1E , M 2E , and M 3E . In  FIG. 2B , the process of  FIG. 2A  is reversed such that the encrypted packets M 1E , M 2E , and M 3E  are respectively decrypted into the packets M 1 , M 2 , and M 3 . Then the packets M 1 , M 2 , and M 3  in  FIG. 2B  are synthesized into the message M. 
         [0039]    In  FIG. 3A , a message M is encrypted into the encrypted message M E . Then the encrypted message M E . is packetized into encryption packets M E1 , M E2 , and M E3 . In  FIG. 3B , the process of  FIG. 3A  is reversed such that the encryption packets M E1 , M E2 , and M E3  are synthesized into the encrypted message M E . Then the encrypted message M E . is decrypted into the message M. Note that an “encrypted packet” (e.g., M 1E , M 2E , and M 3E  in  FIGS. 2A-2B ) results from packetization followed by encryption, while an “encryption packet” (e.g., M E1 , M E2 , and M E3  in  FIGS. 3A-3B ) results from encryption followed by packetization. 
         [0040]    As shown in  FIGS. 4A-4B  and  5 A- 45 B, use of encrypted packets or encryption packets for transmitting the message M from node  1  to node  2  may be structured such that all or some portions of the message M are encrypted. For example, if encrypted packets are used, all of the message packets M 1 , M 2 , and M 3  could be encrypted into the encrypted packets M 1E , M 2E , and M 3E  as shown in  FIG. 2A , but as an alternative message packets M 1  and M 2  could encrypted into the encrypted packets M 1E  and M 2E  while the packet M 3  remains unencrypted as shown in  FIG. 4A , with the reverse process of reconstructing the message M shown in  FIG. 4B . As another example, if encryption packets are used, all three encryption packets M E1 , M E2 , and M E3  could be generated as shown in  FIG. 3A , but as an alternative the message M could be divided into an encrypted portion M E12  (such as, inter alia, by forming an unencrypted portion M 12  followed by encrypting M 12  into M E12 ) and an unencrypted portion M 3  such that M E12  could be packetized into encryption packets M E1  and M E2  while unencrypted portion M 3  remains as unencrypted as shown in  FIG. 5A , with the reverse process of reconstructing the message M shown in  FIG. 5B . A packetization of the message M such as (M 1E , M 2E , and M 3 ), or (M E1 , M E2 , and M 3 ) is labeled herein as “hybrid packetization with encryption.” 
         [0041]    Packetizing M E12  into M E1  and M E2  illustrate that an encrypted packet can be divided into at least two smaller encrypted packets. It is also within the scope of the present invention for unencrypted packets to be divided into at least two smaller unencrypted packets. 
         [0042]    Although a message can be wholly expressed in one modality, packetization of a message lends itself optionally to a first message packet (encrypted or otherwise) of the message having content expressed in a first modality and a second message packet (encrypted or otherwise) of the message having content expressed in a second modality. The first modality could be a text modality, a visual modality, or an audio modality. The second modality could likewise be a text modality, a visual modality, or an audio modality provided that the second modality differs from the first modality. 
         [0043]    Encryption may comprise single encryption or multiple encryption. A message packet is singly encrypted if it is encrypted once. A message packet is multiply encrypted if it is encrypted more than once. For example, a message packet that is doubly encrypted has been encrypted a first time according to a first encryption method or algorithm and subsequently encrypted a second time according to a second encryption method or algorithm. 
         [0044]    Returning to  FIG. 1 , which illustrates transmitting a message from node  1  to node  2  with security protection by use of packetization and encryption, a message M at node  1  is packetized into the three message packets M 1 , M 2 , and M 3 . The packet M 1  is transmitted from node  1  to node  2  via nodes  7  and  11 . The packet M 2  is transmitted from node  1  to node  2  via nodes  8  and  12 . The packet M 3  is transmitted from node  1  to node  2  via nodes  9  and  13 . 
         [0045]    Alternatively, any or all of the packets M 1 , M 2 , and M 3  could be transmitted from node  1  directly to node  2  without using any intermediate node in the transmission path from node  1  to node  2 , such as the intermediate nodes  7  and  11  for transmission of packet M 1  from node  1  to node  2 . Hence, a message transmitted from node  1  to node  2  is said to be “indirectly transmitted” from node  1  to node  2  when intermediate nodes are used in the transmission path from node  1  to node  2 , and the message transmitted from node  1  to node  2  is said to be “directly transmitted” from node  1  to node  2  when intermediate nodes are not used in the transmission path from node  1  to node  2 . Accordingly, “the word “transmitted” includes “indirectly transmitted” and “directly transmitted” as special cases. Similarly, a message received by node  2  from node  1  is said to be “indirectly received” by node  2  from node  1  when intermediate nodes are used in the transmission path from node  1  by node  2 , and the message received by node  2  from node  1  is said to be “directly received” by node  2  from node  1  when intermediate nodes are not used in the transmission path from node  1  to node  2 . Thus in  FIG. 1 , message packet M 1  is indirectly transmitted from node  1  to node  2 , and indirectly received by node  2  from node  1 , via intermediate nodes  7  and  11 . Also in  FIG. 1 , message packet M 1  is directly transmitted from node  1  to node  19 , and directly received by node  19  from node  1 . Accordingly, “the word “received” includes “indirectly received” and “directly received” as special cases. 
         [0046]    The packet M 1  could be replaced in  FIG. 1  by an encrypted form as an encrypted packet (see  FIGS. 2A-2B  and  4 A- 4 B, and accompanying description) or an encryption packet (see  FIGS. 3A-3B  and  5 A- 5 B, and accompanying description). 
         [0047]    If the packet M 1  is replaced in  FIG. 1  by an encrypted packet, then packetization of the message M into packets M 1 , M 2 , and M 3  has preceded encryption into the encrypted packets M 1E , M 2E , and M 3E . Such packetization of the message M has occurred at the node  1  and the packet M 1  could be encrypted into the encrypted packet M 1E  at any of the nodes  1 ,  7 , or  11 . If M 1E  is generated at node  1 , then M 1E  replaces M 1  in  FIG. 1  between nodes  1  and  7 , between nodes  7  and  11 , and between nodes  11  and  2  (as well as between nodes  2  and  15 , if relevant, as will be discussed infra). Similarly, if M 1E  is generated at node  7 , then M 1E  replaces M 1  in  FIG. 1  between nodes  7  and  11 , and between nodes  11  and  2  (as well as between nodes  2  and  15 , if relevant). Again similarly, if M 1E  is generated at node  11 , then M 1E  replaces M 1  in  FIG. 1  between nodes  11  and  2  (as well as between nodes  2  and  15 , if relevant). Alternatively, each of M 1E , M 2E , and M 3E  may be generated independently at  1 ,  7 , and  11  such that M 1E , M 2E , and M 3E  may be generated at the same node or at different nodes. 
         [0048]    If the packet M 1  is replaced in  FIG. 1  by an encryption packet, then encryption of the message M at the node  1  to generate the encrypted message M E  has preceded packetization at the node  1  to generate the encryption packets M E1 , M E2 , and M E3 . Thus if the packet M 1  is replaced by an encryption packet in  FIG. 1 , then encryption packet M E1  replaces M 1  in  FIG. 1  between nodes  1  and  7 , between nodes  7  and  11 , and between nodes  11  and  2  (as well as between nodes  2  and  15 , if relevant, as will be discussed infra). 
         [0049]    The preceding discussion relating to message packet M 1  and the associated encrypted packet M 1E  as well as the associated encryption packet M E1  applies analogously to message packet M 2  and the associated encrypted packet M 2E  as well as the associated encryption packet M E2 , and also applies analogously to message packet M 3  and the associated encrypted packet M 3E  as well as the associated encryption packet M E3 . 
         [0050]    In a “single-source” embodiment, the message M exists at node  1 , because the message M is generated at node  1 . In a “distributed-source” embodiment, the message M exists at node  1 , because some or all of the message packets M 1 , M 2 , and M 3  are transmitted to from nodes  3 ,  4 , and  5 , respectively, as shown in  FIG. 1  and in accordance with various alternatives. In a first alternative, the message packets M 1 , M 2 , and M 3  could be transmitted to node  1  from nodes  3 ,  4 , and  5 , respectively, followed by packetization and encryption of M 1 , M 2 , and M 3  to generate M 1E , M 2E , and M 3E  as described supra, or followed by encryption and packetization of M 1 , M 2 , and M 3  to generate M E1 , M E2 , and M E3  as described supra. In a second alternative, the encrypted packets M 1E , M 2E , and M 3E  could be transmitted to node  1  from nodes  3 ,  4 , and  5 , respectively, followed by transmission of M 1E , M 2E , and M 3E  to node  2  by any of the nodal paths described supra. In a third alternative, the encrypted packets M E1 , M E2 , and M E3  could be transmitted to node  1  from nodes  3 ,  4 , and  5 , respectively, followed by trans mission of M E1 , M E2 , and M E3  to node  2  by any of the nodal paths described supra. In a fourth alternative, node  1  receives from nodes  3 ,  4 , and  5  a combination of encrypted and unencrypted variants of packets M 1 , M 2 , and M 3  in analogy with the hybrid packetization with encryption described supra. In a fifth alternative, some but not all of M 1 , M 2 , and M 3  (or M 1E , M 2E , and M 3E ; or M E1 , M E2 , and M E3 ) are generated at node  2  and a remainder of M 1 , M 2 , and M 3  (or M 1E , M 2E , and M 3E ; or M E1 , M E2 , and M E3 ) are transmitted to node  1  from a subset of nodes  3 ,  4 , and  5 . 
         [0051]    Thus for either the single-source embodiment or the distributed-source embodiment, the node  1  “gains” message packets by: generating of the message packets (at node  1 ); receiving (by node  1 ) the message packets from nodes  3 ,  4 , and  5 ; or a combination of said generating and said receiving. 
         [0052]    In  FIG. 1 , node  2  receives: the message packets (M 1 , M 2 , and M 3 ); or (M 1E , M 2E , and M 3E ); or (M E1 , M E2 , and M E3 ); or a hybrid packetization with encryption such as (M 1E , M 2E , and M 3 ) or (M E1 , M E2 , and M 3 ); etc. If node  2  has received all message packets associated with the message M, then node  2  may generate the message using all of said message packets. If all of the message packets received by node  2  are the encrypted packets M 1E , M 2E , and M 3E , then the node  2  could generate the message M in accordance with the procedure described supra in conjunction with  FIG. 2B ; i.e., by decrypting M 1E , M 2E , and M 3E  into M 1 , M 2 , and M 3 , followed by synthesizing M 1 , M 2 , and M 3  into the message M. With hybrid packetization with encryption such as with M 1E , M 2E , and M 3  (see  FIG. 4B ), the preceding procedure is modified to decrypt only those packets that are encrypted, so that M 1E  and M 2E  would be decrypted into M 1  and M 2 , followed by synthesizing M 1 , M 2 , and M 3  into the message M. If all of the message packets received by node  2  are the encryption packets M E1 , M E2 , and M E3 , then the node  2  could generate the message M in accordance with the procedure described supra in conjunction with  FIG. 3B ; i.e., by synthesizing M E1 , M E2 , and M E3  into M E , followed by decrypting M E  into the message M. With hybrid packetization with encryption such as with M E1 , M E2 , and M 3  (see  FIG. 5B ), the preceding procedure is modified to synthesize only encryption packets, so that M E1  and M E2  would be synthesized into encrypted portion M E12 , followed by synthesizing decrypting M E12  into unencrypted portion M 12  and synthesizing M 12  and M 3  into the message M. 
         [0053]    While it is natural for node  2 , as a destination of the message M, to decrypt message packets, any node of the nodal network  100  may decrypt a message packet. For example node  11  may receive message packet M 1  in an encrypted form (e.g., M 1E  or M E1 ) and then decrypt M 1E  or M E1  into M 1 , followed by re-encryption of M 1  into a different encrypted form, or followed by transmission of M 1  from node  11  to node  19  where M 1  is re-encrypted into the same encrypted form as previously or into a different encrypted form, followed by transmission of message packet M 1  (in an encrypted form) from node  19  to node  2 . 
         [0054]    After the message M is generated at node  2 , a test at node  2  may be performed to determine whether M is really the message. An example of such a test is a “Make Sense” test which is an examination of M to determine whether M makes sense to a person, algorithm, machine, etc. If M makes sense then M is considered to be the message. M is considered as making sense to a person if M is intelligible to the person. M is considered as making sense to an algorithm if the algorithm processes the message as input, and is able to successfully execute and generate meaningful output. M is considered as making sense to a machine if the M is fed into the machine, the machine processes M, and the machine properly performs a function based on M (e.g., making a product that is a function of M). If M passes the Make Sense test then M is the message. If M does not pass the Make Sense test then M is not the message. 
         [0055]    Another example of a test to determine whether M is really the message is an “Algorithmic” test, which performs a logical test on the message. For example, the Algorithmic test could be used to determine whether M contains a predetermined number of binary bits. As another example, the Algorithmic test could be to determine whether M includes a predetermined sequence of bits (e.g., “0011110101”). 
         [0056]    In addition to generating M and determining that M is the message, the node  2  could send portions of M (e.g., M 1 , M 2 , M 3 , M 1E , M 2E , M 3E , M E1 , M E2 , M E3 ) to other nodes of the nodal network  100 , which could deter uninvited third-party eavesdroppers from knowing that the message M has been received at the node  2 . This is illustrated by in  FIG. 1  by transmission of message packets M 1  and M 2  from node  2  to nodes  15  and  16  respectively. Generally, any of M 1 , M 2 , M 3 , M 1E , M 2E , M 3E , M E1 , M E2 , M E3  could be transmitted from node  2  to any node(s) of the nodal network  100 . Additionally for decoy purposes or for any other purpose, any given node of the nodal network  100  could send any portion of M that is accessible to the given node, to any node(s) of the nodal network  100 . As an example, although node  12  is sending message portion M 2  (or alternatively M 2E  or M E2 ) to the node  2  which is the intended destination of the message M, node  12  is also sending message portion M 2  (or alternatively (M 2E  or M E2 ) to node  13  (for decoy purposes), and node  13  is sending message portion M 2  (or alternatively (M 2E  or M E2 ) to node  14  (also for decoy purposes). As another example, although node  1  (which may be the source of the message M) is sending message portion M 1  (or alternatively (M 1E  or M E1 ) to the node  7  for eventual transmission to node  2 , the node  1  is also sending message portion M 1  (or alternatively (M 1E  or M E1 ) to node  19  (for decoy purposes). 
         [0057]    A message packet can be killed at any node of the nodal network  100 . For example, the message M and message packets M 1 , M 2 , and M 3  (or M 1E , M 2E , and M 3E  ; or M E1 , M E2 , and M E3 , etc.) could be killed at node  2  after the message M is generated. As another example, node  14  could kill message packet M 2  (or M 2E , M E2 , etc.). 
         [0058]    Any node of the nodal network  100  may add content to a message packet which increases the size of the message packet. Any node of the nodal network  100  may delete content from a message packet which decreases the size of the message packet. 
         [0059]      FIG. 1  shows dummy message packets D 1 , D 2 , D 3 , D 4 , D 5 , and D 6 . A dummy message packet is packet of information, data, etc., wherein the message M does not comprise the dummy packet. Each of said dummy packets may be encrypted or unencrypted. The dummy packet D 1  is transmitted from node  1  to node  2  via nodes  10  and  14 . The dummy packet D 2  is transmitted from node  20  to node  1 . The dummy packet D 3  is transmitted from node  2  to node  18 . The dummy packet D 4  is transmitted from node  19  to node  3 . The dummy packet D 5  is transmitted from node  3  to node  19 . The dummy packet D 6  is transmitted from node  9  to node  1 . Dummy packets serve to distract uninvited third-party eavesdroppers who desire to learn the content of the message M. The dummy packet D 1  at node  1  may be gained at node  1  by being generated at node  1  or by being transmitted to node  1  from another node of the nodal network  100 . Any of the dummy packets D 1 , D 2 , D 3 , D 4 , D 5 , and D 6  may be encrypted at any node having access to said dummy packets. Any of the dummy packets D 1 , D 2 , D 3 , D 4 , D 5 , and D 6 , if encrypted, may be decrypted at any node having access to said encrypted dummy packets. Any of the dummy packets D 1 , D 2 , D 3 , D 4 , D 5 , and D 6  may be killed at any node having access to said dummy packets. 
         [0060]      FIG. 6  depicts the nodal network  100  of  FIG. 1  with true messages and dummy messages transmitted between nodes of the nodal network, in accordance with embodiments of the present invention.  FIG. 6  illustrates transmission of a “true message” m 1  from node  1  to node  2 , as well as transmission of “dummy messages” d 1 , d 2 , and d 3  from node  1  to node  2 . A “true message” from node  1  to node  2  is a message intended by node  1  to be received and understood at node  2 . 
         [0061]    A “true message” in conjunction with  FIG. 6  is analogous to a “message” in conjunction with  FIG. 1 . A dummy message in conjunction with  FIG. 6  is a decoy message intended to distract an uninvited third-party eavesdropper from discovering the content of a true message. In  FIG. 6 , the dummy messages comprising d 1 , d 2 , and d 3  (and other dummy messages as will be identified and discussed infra) are intended to distract an uninvited third-party eavesdropper from discovering the true message m 1  and other true messages in  FIG. 1  that will be identified and discussed infra. The idea behind the node  1  sending the true message m 1  and dummy messages (e.g., d 1 , d 2 , d 3 , and also d 5  as will be discussed infra) is that an uninvited third-party eavesdropper attempting to discover or learn the content of the true message m 1  will be unable, or find it difficult, to distinguish between the true message m 1  and the dummy message. Thus, if many dummy messages are transmitted between nodes of the nodal network  100 , the task by an uninvited third-party eavesdropper of attempting to discover or learn the content of the true message m 1  will be like trying to “find a needle in a haystack.” 
         [0062]    For the subsequent discussion of  FIG. 6  and for the claims herein, the terms “transmitted”, “directly transmitted”, “indirectly transmitted”, “received”, “directly received”, and “indirectly received” have the same or analogous meanings in conjunction with  FIG. 6  as described supra in conjunction with  FIG. 1 . 
         [0063]    In  FIG. 6 , node  1  transmits the true message m 1  from node  1  to node  2  via nodes  7  and  11 . Alternatively, node  1  could directly transmit the true message m 1  from node  1  to node  2 . Additionally node  1  directly transmits a true message m 2  to node  20 , and node  1  indirectly transmits the true message m 2  to node  10  via node  20 . While node  1  could generate true messages m 1  and m 2 , node  1  could alternatively receive true messages m 1  and/or m 2  from other nodes of the nodal network  100 .  FIG. 1  shows that node  1  receives the true message m 1  from node  4 , and also receives a true message m 3  from node  5 . 
         [0064]    Node  1  indirectly transmits the dummy message d 1  from node  1  to node  2  via nodes  8  and  12 , but could alternatively directly transmit the dummy message d 1  from node  1  to node  2 . Node  1  indirectly transmits the dummy message d 2  from node  1  to node  2  via nodes  9  and  13 , but could alternatively directly transmit the dummy message d 2  from node  1  to node  2 . Node  1  indirectly transmits the dummy message d 3  from node  1  to node  2  via nodes  10  and  14 , but could alternatively directly transmit the dummy message d 3  from node  1  to node  2 . Node  14  transmits the dummy message d 3  both node  2  and node  18 . Node  1  directly transmits the dummy message d 1  to node  19 , and indirectly transmits the dummy message d 1  from node  1  to node  7  via node  19 . Node  1  directly transmits the dummy message d 3  to node  10 , and node  1  directly transmits the dummy message d 5  to node  3 . Node  1  receives the dummy message d 6  from node  6 . 
         [0065]    Any of the true messages and dummy messages transmitted and/or received by node  1  (or by any other node of the nodal network  100  may be encrypted. 
         [0066]    Node  2  receives from node  1  the true message m 1  and the dummy messages d 1 , d 2 , and d 3  as described supra. Node  2  also receives dummy messages d 8  and d 9  from nodes  17  and  18 , respectively. Node  2  transmits the dummy message d 1  directly to node  16 , and indirectly to node  17  via node  16 . 
         [0067]    If the true message m 1  is encrypted, then node  2  may decrypt the true message m 1 . Node  2  may distinguish between the true message m 1  and the dummy messages (e.g., d 1 , d 2 , d 3 , d 8 , and d 9 ) by such methods or techniques as, inter alia, a Make Sense test or an Algorithmic test, as described supra in conjunction with  FIG. 1 . Node  2  may read and/or interpret the true message m 1 . Node  2  may retain the true message m 1 , transmit the true message m 1  to another node (e.g., to node  15  as shown in  FIG. 6 ), or kill true message m 1 . 
         [0068]    Any given node of the nodal network  100  may kill: the true message m 1 ; and/or any other true message accessible to the given node; and/or any dummy message accessible to the given node. 
         [0069]    While embodiments of the present invention have been described herein for purposes of illustration, many modifications and changes will become apparent to those skilled in the art. Accordingly, the appended claims are intended to encompass all such modifications and changes as fall within the true spirit and scope of this invention.