Abstract: Various embodiments of the present disclosure provide a distributed ledger platform for electronic voting and/or polling. In one example, an embodiment provides for receiving a request to commit a transaction to a distributed ledger in the distributed ledger system. The transaction may include one or more encrypted votes, a cryptography authentication proof, and/or an input validation proof. Another embodiment provides for executing a smart contract to (i) authenticate a user identifier associated with the transaction based on the cryptography authentication proof and (ii) validate the one or more encrypted votes based on the input validation proof. In an instance in which the smart contract authenticates the user identifier and validates the one or more encrypted votes, a data block associated with the transaction is added to the distributed ledger.

Abstract: An exemplary transaction sharding method comprises splitting a distributed ledger into a plurality of shards; and storing a shard across the subgroup of computer nodes associated with the shard. Such a method further comprises assigning a new transaction to one of the plurality of shards, wherein assigning the new transaction comprises iteratively choosing one of the plurality of shards; in each iteration, determining a transaction-to-shard score measuring a probability that a subgroup of computing nodes associated with the chosen shard for the current iteration would be involved in a same-shard transaction for the new transaction; in each iteration, determining a latency-to-shard score by estimating a confirmation latency of the new transaction under the chosen shard for the current iteration; and selecting the new transaction to be assigned to the shard based on a combination of the transaction-to-shard score and the latency-to-shard score.

Abstract: An exemplary transaction sharding method comprises splitting a distributed ledger into a plurality of shards; and storing a shard across the subgroup of computer nodes associated with the shard. Such a method further comprises assigning a new transaction to one of the plurality of shards, wherein assigning the new transaction comprises iteratively choosing one of the plurality of shards; in each iteration, determining a transaction-to-shard score measuring a probability that a subgroup of computing nodes associated with the chosen shard for the current iteration would be involved in a same-shard transaction for the new transaction; in each iteration, determining a latency-to-shard score by estimating a confirmation latency of the new transaction under the chosen shard for the current iteration; and selecting the new transaction to be assigned to the shard based on a combination of the transaction-to-shard score and the latency-to-shard score.

Abstract: Methods are provided for constructing an on-the-fly circle of trust for a user of an online social network to enable the user to reduce the likelihood that information will be leaked to an unwanted target. In one embodiment, a maximum circle of trust is constructed by using an iterative greedy construction (IGC) algorithm with leakage estimation using disjoint cut-sets. In another embodiment, the maximum circle of trust is constructed by using the IGC algorithm with leakage estimation using a hybrid method where the initial CT is constructed using the disjoint cut-sets and then the neighbors not included in the CT are sorted in non-decreasing order of visibilities and then each of these neighbors is included in the CT one at a time while checking if the leakage is below a threshold using a Sampling algorithm. In yet another embodiment, randomized rounding is used to construct the maximum circle of trust.

Abstract: Embodiments of the invention provide systems and methods for deactivating reactive jamming attacks and other sophisticated attacks in wireless sensor networks (WSNs). In one system, trigger nodes (nodes whose transmissions invoke jammer nodes) are identified and communications between the sensor nodes of the WSN are routed to avoid sending (e.g., transmitting) information from identified trigger nodes. For example, identified trigger nodes are routed as receivers only. One method of identification uses an advanced randomized error-tolerant non-adaptive group testing technique and a clique-independent set problem solution. Another method of identification uses a hexagon tiling coloring and sequential group testing scheme.

Abstract: Methods are provided for constructing an on-the-fly circle of trust for a user of an online social network to enable the user to reduce the likelihood that information will be leaked to an unwanted target. In one embodiment, a maximum circle of trust is constructed by using an iterative greedy construction (IGC) algorithm with leakage estimation using disjoint cut-sets. In another embodiment, the maximum circle of trust is constructed by using the IGC algorithm with leakage estimation using a hybrid method where the initial CT is constructed using the disjoint cut-sets and then the neighbors not included in the CT are sorted in non-decreasing order of visibilities and then each of these neighbors is included in the CT one at a time while checking if the leakage is below a threshold using a Sampling algorithm. In yet another embodiment, randomized rounding is used to construct the maximum circle of trust.

Abstract: Embodiments of the invention provide systems and methods for deactivating reactive jamming attacks and other sophisticated attacks in wireless sensor networks (WSNs). In one system, trigger nodes (nodes whose transmissions invoke jammer nodes) are identified and communications between the sensor nodes of the WSN are routed to avoid sending (e.g., transmitting) information from identified trigger nodes. For example, identified trigger nodes are routed as receivers only. One method of identification uses an advanced randomized error-tolerant non-adaptive group testing technique and a clique-independent set problem solution. Another method of identification uses a hexagon tiling coloring and sequential group testing scheme.