OBFUSCATION AND ANONYMIZATION TECHNIQUES FOR NETWORK DATA SETS FOR MACHINE LEARNING

Techniques are described herein for securing data used for a machine learning algorithm. The frequency or top-k values calculated over time of the respective network traffic feature data sets are used instead of the actual data or a set thereof (this can also be extended to any other data sets). Here, the frequency represents the actual data and thereby obfuscates potential sensitive information that should not be used within an oftentimes shared cloud machine learning application

DYNAMIC GENESIS AND COLD DEATH OF DISTRIBUTED LEDGER SYSTEMS

Techniques described herein provide innovation directed to forming a temporary, ad hoc network. A first node can receive a request to initiate an ad hoc distributed network with at least a second node. A connection with the second node can be initiated based on a determination that the second node is an authorized member of the ad hoc distributed network in which the determination is based on fulfilling a condition within a smart contract that manages membership. A tunnel can be generated from the first node to the second node to send packets to the second node. Based on an event within a distributed ledger of the first node describing shutting down the ad-hoc distributed network, a copy of the distributed ledger can be sent to storage and the connection with the second node can be shut down. Previously available blockchain systems do not employ abilities to track products beyond mere custody information

SUPPLY CHAIN DEVICE PROVENANCE

Techniques described herein provide innovation directed to authenticating a device. An intrinsic attribute of the device can be received. The intrinsic attribute is a unique attribute that can be measured from the device. The device can be identified by looking up the intrinsic attribute in a distributed database. A match can be determined between the intrinsic attribute and a stored intrinsic attribute in the distributed database. If there is a match, the device is confirmed as authentic. Previously available blockchain systems do not employ abilities to track products beyond mere custody information

Belli Dithmarsici, Ab Inclyto Daniae Rege Friderico II. Et Illvstrissimis Holsasatiae Ducibus, Iohanne et Adolpho fratribus, gesti, Anno post Christum natum M.D.LIX. vera descriptio : Duobus libris comprehensa

http://tartu.ester.ee/record=b2566505~S1*es

HOP-BY-HOP AUTHENTICATION ROUTING USING DISTRIBUTED LEDGER SYSTEMS

Techniques described herein provide innovation directed to directing traffic through a distributed network. Packets can be received at a first node that is directed to a second node at a next hop. The second node can be determined to be a member of the distributed network based on information within a distributed ledger stored locally on the first node in which the second node is a member based on fulfilling a condition within a smart contract that manages membership. A one-time session symmetric key can be generated for the packets in which the packets are encrypted based on a distributed network public key target and a tunnel can be generated from the first node to the second node in order to send the packets to the second node. The second node can decrypt the packet using a private key registered with the distributed network and determine a forwarding action. Previously available blockchain systems do not employ abilities to track products beyond mere custody information

PUBLIC KEY BASED ADDRESSING USING DISTRIBUTED LEDGER SYSTEMS

Techniques described herein provide innovation directed to directing traffic through a distributed network. Packets can be at a first node that is directed to a recipient in which a location of the recipient is unknown. The recipient can be determined to be a member of the distributed network based on information within a distributed ledger stored locally on the first node. The location of the recipient can be determined to be within a geographical region based on a transaction recorded by the distributed ledger. Based on determining that a second node is within the geographical region, a tunnel can be generated from the first node to the second node in order to send the packets to the second node. Based on the geographical region being less than a threshold area, the packets can be sent to localized recipients in which the packets are encrypted based on a public key registered in the distributed network. Previously available blockchain systems do not employ abilities to track products beyond mere custody information

GROUP ADDRESSING USING DISTRIBUTED LEDGER SYSTEMS

Techniques described herein provide innovation directed to directing traffic through a distributed network. Packets can be received at a first node that is directed to a group of recipients in which a location of each recipient of the group is unknown and the first node is within a first geographical region. Each recipient of the group can be determined to be a member of the distributed network based on information within a distributed ledger stored locally on the first node. The location of a recipient of the group can be determined to be within a second geographical region that is smaller than the first geographical region based on a transaction recorded by the distributed ledger. Based on determining that the recipient of the group is within the second geographical region, a tunnel from the first node to a second node can be generated to send the packets to the recipient of the group in which the second node is within the second geographical region. This can be performed (routing all traffic hop-by-hop) until copies of the packets reach all the recipients of the group. Previously available blockchain systems do not employ abilities to track products beyond mere custody information

Laws for rewriting queries containing division operators

Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a group of tuples: Small divide discovers which sets in a dividend relation contain all elements of the set stored in a divisor relation. The great divide operator extends small divide by realizing many-to-many set containment tests. It is also similar to the set containment join operator for schemas that are not in first normal form. Neither small nor great divide has been implemented in commercial relational database systems although the operators solve important problems and many efficient algorithms for them exist. We present algebraic laws that allow rewriting expressions containing small or great divide, illustrate their importance for query optimization, and discuss the use of great divide for frequent itemset discovery, an important data mining primitive. A recent theoretic result shows that small divide must be implemented by special purpose algorithms and not be simulated by pure relational algebra expressions to achieve efficiency. Consequently, an efficient implementation requires that the optimizer treats small divide as a first-class operator and possesses powerful algebraic laws for query rewriting

ONION ROUTING FOR OBFUSCATING TRAFFIC USING DISTRIBUTED LEDGER SYSTEMS

Techniques described herein provide innovation directed to directing traffic through a distributed network. Packets can be received at a first node that is directed to a recipient in which the location of the recipient is unknown. The recipient can be determined to be a member of the distributed network based on information within a distributed ledger stored locally on the first node. The location can be determined to be within a geographical region based on a transaction recorded by the distributed ledger. The direction of the packets can be obfuscated based on determining that a second node is outside the geographical region and generating a tunnel from the first node to the second node to send the packets to that second node. A subsequent node to the second node can direct the packets to the geographical region

AD-HOC N-TIER GLOBAL OVERLAY USING DISTRIBUTED LEDGER SYSTEMS

Techniques described herein provide innovation directed to directing traffic through a distributed network. Packets can be received at a first node that is directed to a recipient in which a location of the recipient is unknown and the first node is within a first tier covering a first geographical region. The recipient of the packets can be determined to be a member of the distributed network based on information within a distributed ledger stored locally on the first node. The location can be determined to be within a second geographical region that is smaller than the first geographical region based on a transaction recorded by the distributed ledger. Based on determining that a second node is within the second geographical region, a tunnel can be generated from the first node to the second node in order to send the packets to the second node in which the second node is within a second tier covering the second geographical region. This can be repeated for N tiers. Previously available blockchain systems do not employ abilities to track products beyond mere custody information