Related papers: On asymptotically good ramp secret sharing schemes
The iterative conditional branchings appear in various sensitive algorithms, like the modular exponentiation in the RSA cryptosystem or the scalar multiplication in ellipticcurve cryptography. In this paper, we abstract away the desirable…
Secure communications can be impeded by eavesdroppers in conventional relay systems. This paper proposes cooperative jamming strategies for two-hop relay networks where the eavesdropper can wiretap the relay channels in both hops. In these…
Non-malleable secret sharing was recently proposed by Goyal and Kumar in independent tampering and joint tampering models for threshold secret sharing (STOC18) and secret sharing with general access structure (CRYPTO18). The idea of making…
The use of partial geometries to construct parity-check matrices for LDPC codes has resulted in the design of successful codes with a probability of error close to the Shannon capacity at bit error rates down to $10^{-15}$. Such…
We survey distributed deep learning models for training or inference without accessing raw data from clients. These methods aim to protect confidential patterns in data while still allowing servers to train models. The distributed deep…
Recent results have shown that lattice codes can be used to construct good channel codes, source codes and physical layer network codes for Gaussian channels. On the other hand, for Gaussian channels with secrecy constraints, efforts to…
Linear codes with few weights have many applications in secret sharing schemes, authentication codes, communication and strongly regular graphs. In this paper, we consider linear codes with three weights in arbitrary characteristic. To do…
We present two experimental schemes to perform continuous variable (2,3) threshold quantum secret sharing on the quadratures amplitudes of bright light beams. Both schemes require a pair of entangled light beams. The first scheme utilizes…
We analyze the fundamental trade-off of secret key-based authentication systems in the presence of an eavesdropper for correlated Gaussian sources. A complete characterization of trade-off among secret-key, storage, and privacy-leakage…
Complex systems, ranging from soft materials to wireless communication, are often organised as random geometric networks in which nodes and edges evenly fill up the volume of some space. Studying such networks is difficult because they…
In this paper we consider to use the quantum stabilizer codes as secret sharing schemes for classical secrets. We give necessary and sufficient conditions for qualified and forbidden sets in terms of quantum stabilizers. Then we give a…
This paper presents a recursive hiding scheme for 2 out of 3 secret sharing. In recursive hiding of secrets, the user encodes additional information about smaller secrets in the shares of a larger secret without an expansion in the size of…
We study the locally recoverable codes on algebraic curves. In the first part of this article, we provide a bound of generalized Hamming weight of these codes. Whereas in the second part, we propose a new family of algebraic geometric LRC…
The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one…
The random-energy model (REM), a solvable spin-glass model, has impacted an incredibly diverse set of problems, from protein folding to combinatorial optimization to many-body localization. Here, we explore a new connection to secret…
We generalize secret-sharing models that rely on correlated randomness and public communication, originally designed for a fixed access structure, to support a sequence of dynamic access structures, which we term an Additive Access…
Secret key agreement from correlated physical layer observations is a cornerstone of information-theoretic security. This paper proposes and rigorously analyzes a complete, constructive protocol for secret key agreement from Gaussian…
Recently, linear codes with a few weights were widely investigated due to their applications in secret sharing schemes and authentication schemes. In this letter, we present a class of $q$-ary linear codes derived from irreducible cyclic…
We propose a new covert communication scheme that operates without pre-sharing side information and channel estimation, utilizing a Gaussian-distributed Grassmann constellation for noncoherent detection. By designing constant-amplitude…
In the paper we discuss how to share the secrets, that are graphs. So, far secret sharing schemes were designed to work with numbers. As the first step, we propose conditions for "graph to number" conversion methods. Hence, the existing…