31,989 research outputs found
Channel Coding and Lossy Source Coding Using a Constrained Random Number Generator
Stochastic encoders for channel coding and lossy source coding are introduced
with a rate close to the fundamental limits, where the only restriction is that
the channel input alphabet and the reproduction alphabet of the lossy source
code are finite. Random numbers, which satisfy a condition specified by a
function and its value, are used to construct stochastic encoders. The proof of
the theorems is based on the hash property of an ensemble of functions, where
the results are extended to general channels/sources and alternative formulas
are introduced for channel capacity and the rate-distortion region. Since an
ensemble of sparse matrices has a hash property, we can construct a code by
using sparse matrices, where the sum-product algorithm can be used for encoding
and decoding by assuming that channels/sources are memoryless.Comment: submitted to IEEE Transactions on Information Theory, 42 page
Research of collision properties of the modified UMAC algorithm on crypto-code constructions
The transfer of information by telecommunication channels is accompanied by message hashing to control the integrity of the data and confirm the authenticity of the data. When using a reliable hash function, it is computationally difficult to create a fake message with a pre-existing hash code, however, due to the weaknesses of specific hashing algorithms, this threat can be feasible. To increase the level of cryptographic strength of transmitted messages over telecommunication channels, there are ways to create hash codes, which, according to practical research, are imperfect in terms of the speed of their formation and the degree of cryptographic strength. The collisional properties of hashing functions formed using the modified UMAC algorithm using the methodology for assessing the universality and strict universality of hash codes are investigated. Based on the results of the research, an assessment of the impact of the proposed modifications at the last stage of the generation of authentication codes on the provision of universal hashing properties was presented. The analysis of the advantages and disadvantages that accompany the formation of the hash code by the previously known methods is carried out. The scheme of cascading generation of data integrity and authenticity control codes using the UMAC algorithm on crypto-code constructions has been improved. Schemes of algorithms for checking hash codes were developed to meet the requirements of universality and strict universality. The calculation and analysis of collision search in the set of generated hash codes was carried out according to the requirements of a universal and strictly universal class for creating hash code
Interactive Channel Capacity Revisited
We provide the first capacity approaching coding schemes that robustly
simulate any interactive protocol over an adversarial channel that corrupts any
fraction of the transmitted symbols. Our coding schemes achieve a
communication rate of over any
adversarial channel. This can be improved to for
random, oblivious, and computationally bounded channels, or if parties have
shared randomness unknown to the channel.
Surprisingly, these rates exceed the interactive channel capacity bound
which [Kol and Raz; STOC'13] recently proved for random errors. We conjecture
and to be the optimal rates for their respective settings
and therefore to capture the interactive channel capacity for random and
adversarial errors.
In addition to being very communication efficient, our randomized coding
schemes have multiple other advantages. They are computationally efficient,
extremely natural, and significantly simpler than prior (non-capacity
approaching) schemes. In particular, our protocols do not employ any coding but
allow the original protocol to be performed as-is, interspersed only by short
exchanges of hash values. When hash values do not match, the parties backtrack.
Our approach is, as we feel, by far the simplest and most natural explanation
for why and how robust interactive communication in a noisy environment is
possible
Computationally-efficient stochastic cluster dynamics method for modeling damage accumulation in irradiated materials
An improved version of a recently developed stochastic cluster dynamics (SCD)
method {[}Marian, J. and Bulatov, V. V., {\it J. Nucl. Mater.} \textbf{415}
(2014) 84-95{]} is introduced as an alternative to rate theory (RT) methods for
solving coupled ordinary differential equation (ODE) systems for irradiation
damage simulations. SCD circumvents by design the curse of dimensionality of
the variable space that renders traditional ODE-based RT approaches inefficient
when handling complex defect population comprised of multiple (more than two)
defect species. Several improvements introduced here enable efficient and
accurate simulations of irradiated materials up to realistic (high) damage
doses characteristic of next-generation nuclear systems. The first improvement
is a procedure for efficiently updating the defect reaction-network and event
selection in the context of a dynamically expanding reaction-network. Next is a
novel implementation of the -leaping method that speeds up SCD
simulations by advancing the state of the reaction network in large time
increments when appropriate. Lastly, a volume rescaling procedure is introduced
to control the computational complexity of the expanding reaction-network
through occasional reductions of the defect population while maintaining
accurate statistics. The enhanced SCD method is then applied to model defect
cluster accumulation in iron thin films subjected to triple ion-beam
(, and \text{H\ensuremath{{}^{+}}})
irradiations, for which standard RT or spatially-resolved kinetic Monte Carlo
simulations are prohibitively expensive
A Covert Channel Using Named Resources
A network covert channel is created that uses resource names such as
addresses to convey information, and that approximates typical user behavior in
order to blend in with its environment. The channel correlates available
resource names with a user defined code-space, and transmits its covert message
by selectively accessing resources associated with the message codes. In this
paper we focus on an implementation of the channel using the Hypertext Transfer
Protocol (HTTP) with Uniform Resource Locators (URLs) as the message names,
though the system can be used in conjunction with a variety of protocols. The
covert channel does not modify expected protocol structure as might be detected
by simple inspection, and our HTTP implementation emulates transaction level
web user behavior in order to avoid detection by statistical or behavioral
analysis.Comment: 9 page
On the Gold Standard for Security of Universal Steganography
While symmetric-key steganography is quite well understood both in the
information-theoretic and in the computational setting, many fundamental
questions about its public-key counterpart resist persistent attempts to solve
them. The computational model for public-key steganography was proposed by von
Ahn and Hopper in EUROCRYPT 2004. At TCC 2005, Backes and Cachin gave the first
universal public-key stegosystem - i.e. one that works on all channels -
achieving security against replayable chosen-covertext attacks (SS-RCCA) and
asked whether security against non-replayable chosen-covertext attacks (SS-CCA)
is achievable. Later, Hopper (ICALP 2005) provided such a stegosystem for every
efficiently sampleable channel, but did not achieve universality. He posed the
question whether universality and SS-CCA-security can be achieved
simultaneously. No progress on this question has been achieved since more than
a decade. In our work we solve Hopper's problem in a somehow complete manner:
As our main positive result we design an SS-CCA-secure stegosystem that works
for every memoryless channel. On the other hand, we prove that this result is
the best possible in the context of universal steganography. We provide a
family of 0-memoryless channels - where the already sent documents have only
marginal influence on the current distribution - and prove that no
SS-CCA-secure steganography for this family exists in the standard
non-look-ahead model.Comment: EUROCRYPT 2018, llncs styl
On the Commitment Capacity of Unfair Noisy Channels
Noisy channels are a valuable resource from a cryptographic point of view.
They can be used for exchanging secret-keys as well as realizing other
cryptographic primitives such as commitment and oblivious transfer. To be
really useful, noisy channels have to be consider in the scenario where a
cheating party has some degree of control over the channel characteristics.
Damg\r{a}rd et al. (EUROCRYPT 1999) proposed a more realistic model where such
level of control is permitted to an adversary, the so called unfair noisy
channels, and proved that they can be used to obtain commitment and oblivious
transfer protocols. Given that noisy channels are a precious resource for
cryptographic purposes, one important question is determining the optimal rate
in which they can be used. The commitment capacity has already been determined
for the cases of discrete memoryless channels and Gaussian channels. In this
work we address the problem of determining the commitment capacity of unfair
noisy channels. We compute a single-letter characterization of the commitment
capacity of unfair noisy channels. In the case where an adversary has no
control over the channel (the fair case) our capacity reduces to the well-known
capacity of a discrete memoryless binary symmetric channel
- …