18,348 research outputs found
On Oblivious Amplification of Coin-Tossing Protocols
We consider the problem of amplifying two-party coin-tossing protocols: given a protocol where it is possible to bias the common output by at most ?, we aim to obtain a new protocol where the output can be biased by at most ?* < ?. We rule out the existence of a natural type of amplifiers called oblivious amplifiers for every ?* < ?. Such amplifiers ignore the way that the underlying ?-bias protocol works and can only invoke an oracle that provides ?-bias bits.
We provide two proofs of this impossibility. The first is by a reduction to the impossibility of deterministic randomness extraction from Santha-Vazirani sources. The second is a direct proof that is more general and also rules outs certain types of asymmetric amplification. In addition, it gives yet another proof for the Santha-Vazirani impossibility
Comparison Between Asymmetric and Symmetric Channel-Based Authentication for MIMO Systems
Authentication is a key element of security, by which a receiver confirms the
sender identity of a message. Typical approaches include either key-based
authentication at the application layer or physical layer authentication (PLA),
where a message is considered authentic if it appears to have gone through the
legitimate channel. In both cases a source of randomness is needed, whereas for
PLA the random nature of the communication channel is exploited. In this paper
we compare the various approaches using in all cases the channel as a source of
randomness. We consider a multiple-input multiple-output (MIMO) system with a
finite number of antennas. Simple auto-regressive (AR) models for its evolution
as well as the relation of the legitimate and attacker channel are considered.
In this setting the attacker can either predict the key used for key-based
authentication or forge the channel estimated at the legitimate receiver for
PLA. The analysis includes both symmetric and asymmetric key-based
authentication. We compare the schemes in terms of false alarm and missed
detection probability and we outline best attack strategies.Comment: Updated version (with typos correction) of paper accepted for WSA
conferenc
Achieving Secrecy Capacity of the Gaussian Wiretap Channel with Polar Lattices
In this work, an explicit wiretap coding scheme based on polar lattices is
proposed to achieve the secrecy capacity of the additive white Gaussian noise
(AWGN) wiretap channel. Firstly, polar lattices are used to construct
secrecy-good lattices for the mod- Gaussian wiretap channel. Then we
propose an explicit shaping scheme to remove this mod- front end and
extend polar lattices to the genuine Gaussian wiretap channel. The shaping
technique is based on the lattice Gaussian distribution, which leads to a
binary asymmetric channel at each level for the multilevel lattice codes. By
employing the asymmetric polar coding technique, we construct an AWGN-good
lattice and a secrecy-good lattice with optimal shaping simultaneously. As a
result, the encoding complexity for the sender and the decoding complexity for
the legitimate receiver are both O(N logN log(logN)). The proposed scheme is
proven to be semantically secure.Comment: Submitted to IEEE Trans. Information Theory, revised. This is the
authors' own version of the pape
Certified randomness in quantum physics
The concept of randomness plays an important role in many disciplines. On one
hand, the question of whether random processes exist is fundamental for our
understanding of nature. On the other hand, randomness is a resource for
cryptography, algorithms and simulations. Standard methods for generating
randomness rely on assumptions on the devices that are difficult to meet in
practice. However, quantum technologies allow for new methods for generating
certified randomness. These methods are known as device-independent because do
not rely on any modeling of the devices. Here we review the efforts and
challenges to design device-independent randomness generators.Comment: 18 pages, 3 figure
How to Achieve the Capacity of Asymmetric Channels
We survey coding techniques that enable reliable transmission at rates that
approach the capacity of an arbitrary discrete memoryless channel. In
particular, we take the point of view of modern coding theory and discuss how
recent advances in coding for symmetric channels help provide more efficient
solutions for the asymmetric case. We consider, in more detail, three basic
coding paradigms.
The first one is Gallager's scheme that consists of concatenating a linear
code with a non-linear mapping so that the input distribution can be
appropriately shaped. We explicitly show that both polar codes and spatially
coupled codes can be employed in this scenario. Furthermore, we derive a
scaling law between the gap to capacity, the cardinality of the input and
output alphabets, and the required size of the mapper.
The second one is an integrated scheme in which the code is used both for
source coding, in order to create codewords distributed according to the
capacity-achieving input distribution, and for channel coding, in order to
provide error protection. Such a technique has been recently introduced by
Honda and Yamamoto in the context of polar codes, and we show how to apply it
also to the design of sparse graph codes.
The third paradigm is based on an idea of B\"ocherer and Mathar, and
separates the two tasks of source coding and channel coding by a chaining
construction that binds together several codewords. We present conditions for
the source code and the channel code, and we describe how to combine any source
code with any channel code that fulfill those conditions, in order to provide
capacity-achieving schemes for asymmetric channels. In particular, we show that
polar codes, spatially coupled codes, and homophonic codes are suitable as
basic building blocks of the proposed coding strategy.Comment: 32 pages, 4 figures, presented in part at Allerton'14 and published
in IEEE Trans. Inform. Theor
A High Order Stochastic Asymptotic Preserving Scheme for Chemotaxis Kinetic Models with Random Inputs
In this paper, we develop a stochastic Asymptotic-Preserving (sAP) scheme for
the kinetic chemotaxis system with random inputs, which will converge to the
modified Keller-Segel model with random inputs in the diffusive regime. Based
on the generalized Polynomial Chaos (gPC) approach, we design a high order
stochastic Galerkin method using implicit-explicit (IMEX) Runge-Kutta (RK) time
discretization with a macroscopic penalty term. The new schemes improve the
parabolic CFL condition to a hyperbolic type when the mean free path is small,
which shows significant efficiency especially in uncertainty quantification
(UQ) with multi-scale problems. The stochastic Asymptotic-Preserving property
will be shown asymptotically and verified numerically in several tests. Many
other numerical tests are conducted to explore the effect of the randomness in
the kinetic system, in the aim of providing more intuitions for the theoretic
study of the chemotaxis models
Corrections of the NIST Statistical Test Suite for Randomness
It is well known that the NIST statistical test suite was used for the
evaluation of AES candidate algorithms. We have found that the test setting of
Discrete Fourier Transform test and Lempel-Ziv test of this test suite are
wrong. We give four corrections of mistakes in the test settings. This suggests
that re-evaluation of the test results should be needed
- …