Related papers: A class of optimal authentication codes with secre…
The two-terminal key agreement problem with biometric or physical identifiers is considered. Two linear code constructions based on Wyner-Ziv coding are developed. The first construction uses random linear codes and achieves all points of…
In network communications, information transmission often encounters wiretapping attacks. Secure network coding is introduced to prevent information from being leaked to adversaries. The investigation of performance bounds on the numbers of…
In this paper, for an odd prime $p$, by extending Li et al.'s construction \cite{CL2016}, several classes of two-weight and three-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from a defining set, and then their…
We study the ensemble performance of biometric authentication systems, based on secret key generation, which work as follows. In the enrollment stage, an individual provides a biometric signal that is mapped into a secret key and a helper…
Conventionally, secrecy is achieved using cryptographic techniques beyond the physical layer. Recent studies raise the interest of performing encryption within the physical layer by exploiting some unique features of the physical wireless…
Recently, constructions of optimal linear codes from simplicial complexes have attracted much attention and some related nice works were presented. Let $q$ be a prime power. In this paper, by using the simplicial complexes of ${\mathbb…
Tensor network codes enable structured construction and manipulation of stabilizer codes out of small seed codes. Here, we apply reinforcement learning to tensor network code geometries and demonstrate how optimal stabilizer codes can be…
Suppose Alice wishes to send messages to Bob through a communication channel C_1, but her transmissions also reach an eavesdropper Eve through another channel C_2. The goal is to design a coding scheme that makes it possible for Alice to…
In the past few years, linear codes with few weights and their weight analysis have been widely studied. In this paper, we further investigate a class of two-weight or three-weight linear codes from defining sets and determine their weight…
In this work, message authentication over noisy channels is studied. The model developed in this paper is the authentication theory counterpart of Wyner's wiretap channel model. Two types of opponent attacks, namely impersonation attacks…
We had recently shown that every positive integer can be represented uniquely using a recurrence sequence, when certain restrictions on the digit strings are satisfied. We present the details of how such representations can be used to build…
In network coding, we discuss the effect of sequential error injection on information leakage. We show that there is no improvement when the operations in the network are linear operations. However, when the operations in the network…
Index codes reduce the number of bits broadcast by a wireless transmitter to a number of receivers with different demands and with side information. It is known that the problem of finding optimal linear index codes is NP-hard. We…
Information leakage to a guessing adversary in index coding is studied, where some messages in the system are sensitive and others are not. The non-sensitive messages can be used by the server like secret keys to mitigate leakage of the…
This paper introduces a privacy-preserving distributed learning framework via private-key homomorphic encryption. Thanks to the randomness of the quantization of gradients, our learning with error (LWE) based encryption can eliminate the…
Under the emerging network coding paradigm, intermediate nodes in the network are allowed not only to store and forward packets but also to process and mix different data flows. We propose a low-complexity cryptographic scheme that exploits…
This study proposes a quantum secret authentication code for protecting the integrity of secret quantum states. Since BB84[1] was first proposed, the eavesdropper detection strategy in almost all quantum cryptographic protocols is based on…
Machine-learning techniques are widely used in security-related applications, like spam and malware detection. However, in such settings, they have been shown to be vulnerable to adversarial attacks, including the deliberate manipulation of…
We consider the problem of communicating information over a network secretly and reliably in the presence of a hidden adversary who can eavesdrop and inject malicious errors. We provide polynomial-time, rate-optimal distributed network…
At ASIACRYPT 2018, a digital attack based on linear least squares was introduced for a variant of the learning with errors (LWE) problem which omits modular reduction known as the integer learning with errors problem (ILWE). In this paper,…