Multiple observations for secret-key binding with SRAM PUFs

We present a new Multiple-Observations (MO) helper data scheme for secret-key binding to an SRAM-PUF. This MO scheme binds a single key to multiple enrollment observations of the SRAM-PUF. Performance is improved in comparison to classic schemes which generate helper data based on a single enrollment observation. The performance increase can be explained by the fact that the reliabilities of the different SRAM cells are modeled (implicitly) in the helper data. We prove that the scheme achieves secret-key capacity for any number of enrollment observations, and, therefore, it is optimal. We evaluate performance of the scheme using Monte Carlo simulations, where an off-the-shelf LDPC code is used to implement the linear error-correcting code. Another scheme that models the reliabilities of the SRAM cells is the so-called Soft-Decision (SD) helper data scheme. The SD scheme considers the one-probabilities of the SRAM cells as an input, which in practice are not observable. We present a new strategy for the SD scheme that considers the binary SRAM-PUF observations as an input instead and show that the new strategy is optimal and achieves the same reconstruction performance as the MO scheme. Finally, we present a variation on the MO helper data scheme that updates the helper data sequentially after each successful reconstruction of the key. As a result, the error-correcting performance of the scheme is improved over time

Probabilistic Shaping for Finite Blocklengths: Distribution Matching and Sphere Shaping

In this paper, we provide for the first time a systematic comparison of distribution matching (DM) and sphere shaping (SpSh) algorithms for short blocklength probabilistic amplitude shaping. For asymptotically large blocklengths, constant composition distribution matching (CCDM) is known to generate the target capacity-achieving distribution. As the blocklength decreases, however, the resulting rate loss diminishes the efficiency of CCDM. We claim that for such short blocklengths and over the additive white Gaussian channel (AWGN), the objective of shaping should be reformulated as obtaining the most energy-efficient signal space for a given rate (rather than matching distributions). In light of this interpretation, multiset-partition DM (MPDM), enumerative sphere shaping (ESS) and shell mapping (SM), are reviewed as energy-efficient shaping techniques. Numerical results show that MPDM and SpSh have smaller rate losses than CCDM. SpSh--whose sole objective is to maximize the energy efficiency--is shown to have the minimum rate loss amongst all. We provide simulation results of the end-to-end decoding performance showing that up to 1 dB improvement in power efficiency over uniform signaling can be obtained with MPDM and SpSh at blocklengths around 200. Finally, we present a discussion on the complexity of these algorithms from the perspective of latency, storage and computations.Comment: 18 pages, 10 figure

Partial Enumerative Sphere Shaping

The dependency between the Gaussianity of the input distribution for the additive white Gaussian noise (AWGN) channel and the gap-to-capacity is discussed. We show that a set of particular approximations to the Maxwell-Boltzmann (MB) distribution virtually closes most of the shaping gap. We relate these symbol-level distributions to bit-level distributions, and demonstrate that they correspond to keeping some of the amplitude bit-levels uniform and independent of the others. Then we propose partial enumerative sphere shaping (P-ESS) to realize such distributions in the probabilistic amplitude shaping (PAS) framework. Simulations over the AWGN channel exhibit that shaping 2 amplitude bits of 16-ASK have almost the same performance as shaping 3 bits, which is 1.3 dB more power-efficient than uniform signaling at a rate of 3 bit/symbol. In this way, required storage and computational complexity of shaping are reduced by factors of 6 and 3, respectively.Comment: 6 pages, 6 figure

Information Theoretical Analysis of Identification based on Active Content Fingerprinting

Content fingerprinting and digital watermarking are techniques that are used for content protection and distribution monitoring. Over the past few years, both techniques have been well studied and their shortcomings understood. Recently, a new content fingerprinting scheme called {\em active content fingerprinting} was introduced to overcome these shortcomings. Active content fingerprinting aims to modify a content to extract robuster fingerprints than the conventional content fingerprinting. Moreover, contrary to digital watermarking, active content fingerprinting does not embed any message independent of contents thus does not face host interference. The main goal of this paper is to analyze fundamental limits of active content fingerprinting in an information theoretical framework.Comment: 35th WIC Symposium on Information Theory in the Benelu

Achievable Information Rates for Probabilistic Amplitude Shaping: An Alternative Approach via Random Sign-Coding Arguments

Probabilistic amplitude shaping (PAS) is a coded modulation strategy in which constellation shaping and channel coding are combined. PAS has attracted considerable attention in both wireless and optical communications. Achievable information rates (AIRs) of PAS have been investigated in the literature using Gallager's error exponent approach. In particular, it has been shown that PAS achieves the capacity of the additive white Gaussian noise channel (B\"ocherer, 2018). In this work, we revisit the capacity-achieving property of PAS and derive AIRs using weak typicality. Our objective is to provide alternative proofs based on random sign-coding arguments that are as constructive as possible. Accordingly, in our proofs, only some signs of the channel inputs are drawn from a random code, while the remaining signs and amplitudes are produced constructively. We consider both symbol-metric and bit-metric decoding.Comment: 19 pages, 6 figures (v3: proofs of Theorems 3 and 4 are generalized for M-ASK.

Does virulence assessment of Vibrio anguillarum using sea bass (Dicentrarchus labrax) larvae correspond with genotypic and phenotypic characterization?

Background: Vibriosis is one of the most ubiquitous fish diseases caused by bacteria belonging to the genus Vibrio such as Vibrio (Listonella) anguillarum. Despite a lot of research efforts, the virulence factors and mechanism of V. anguillarum are still insufficiently known, in part because of the lack of standardized virulence assays. Methodology/Principal Findings: We investigated and compared the virulence of 15 V. anguillarum strains obtained from different hosts or non-host niches using a standardized gnotobiotic bioassay with European sea bass (Dicentrarchus labrax L.) larvae as model hosts. In addition, to assess potential relationships between virulence and genotypic and phenotypic characteristics, the strains were characterized by random amplified polymorphic DNA (RAPD) and repetitive extragenic palindromic PCR (rep-PCR) analyses, as well as by phenotypic analyses using Biolog's Phenotype MicroArray (TM) technology and some virulence factor assays. Conclusions/Significance: Virulence testing revealed ten virulent and five avirulent strains. While some relation could be established between serotype, genotype and phenotype, no relation was found between virulence and genotypic or phenotypic characteristics, illustrating the complexity of V. anguillarum virulence. Moreover, the standardized gnotobiotic system used in this study has proven its strength as a model to assess and compare the virulence of different V. anguillarum strains in vivo. In this way, the bioassay contributes to the study of mechanisms underlying virulence in V. anguillarum