65,357 research outputs found
Fixed-to-Variable Length Distribution Matching
Fixed-to-variable length (f2v) matchers are used to reversibly transform an
input sequence of independent and uniformly distributed bits into an output
sequence of bits that are (approximately) independent and distributed according
to a target distribution. The degree of approximation is measured by the
informational divergence between the output distribution and the target
distribution. An algorithm is developed that efficiently finds optimal f2v
codes. It is shown that by encoding the input bits blockwise, the informational
divergence per bit approaches zero as the block length approaches infinity. A
relation to data compression by Tunstall coding is established.Comment: 5 pages, essentially the ISIT 2013 versio
PKI Safety Net (PKISN): Addressing the Too-Big-to-Be-Revoked Problem of the TLS Ecosystem
In a public-key infrastructure (PKI), clients must have an efficient and
secure way to determine whether a certificate was revoked (by an entity
considered as legitimate to do so), while preserving user privacy. A few
certification authorities (CAs) are currently responsible for the issuance of
the large majority of TLS certificates. These certificates are considered valid
only if the certificate of the issuing CA is also valid. The certificates of
these important CAs are effectively too big to be revoked, as revoking them
would result in massive collateral damage. To solve this problem, we redesign
the current revocation system with a novel approach that we call PKI Safety Net
(PKISN), which uses publicly accessible logs to store certificates (in the
spirit of Certificate Transparency) and revocations. The proposed system
extends existing mechanisms, which enables simple deployment. Moreover, we
present a complete implementation and evaluation of our scheme.Comment: IEEE EuroS&P 201
Informational Divergence and Entropy Rate on Rooted Trees with Probabilities
Rooted trees with probabilities are used to analyze properties of a variable
length code. A bound is derived on the difference between the entropy rates of
the code and a memoryless source. The bound is in terms of normalized
informational divergence. The bound is used to derive converses for exact
random number generation, resolution coding, and distribution matching.Comment: 5 pages. With proofs and illustrating exampl
Network correlated data gathering with explicit communication: NP-completeness and algorithms
We consider the problem of correlated data gathering by a network with a sink node and a tree-based communication structure, where the goal is to minimize the total transmission cost of transporting the information collected by the nodes, to the sink node. For source coding of correlated data, we consider a joint entropy-based coding model with explicit communication where coding is simple and the transmission structure optimization is difficult. We first formulate the optimization problem definition in the general case and then we study further a network setting where the entropy conditioning at nodes does not depend on the amount of side information, but only on its availability. We prove that even in this simple case, the optimization problem is NP-hard. We propose some efficient, scalable, and distributed heuristic approximation algorithms for solving this problem and show by numerical simulations that the total transmission cost can be significantly improved over direct transmission or the shortest path tree. We also present an approximation algorithm that provides a tree transmission structure with total cost within a constant factor from the optimal
IMPROVING SMART GRID SECURITY USING MERKLE TREES
AbstractâPresently nations worldwide are starting to convert their aging electrical power infrastructures into modern, dynamic power grids. Smart Grid offers much in the way of efficiencies and robustness to the electrical power grid, however its heavy reliance on communication networks will leave it more vulnerable to attack than present day grids. This paper looks at the threat to public key cryptography systems from a fully realized quantum computer and how this could impact the Smart Grid. We argue for the use of Merkle Trees in place of public key cryptography for authentication of devices in wireless mesh networks that are used in Smart Grid applications
- âŠ