Related papers: Asymptotically Ideal Hierarchical Secret Sharing B…
Asymptotically good sequences of linear ramp secret sharing schemes have been intensively studied by Cramer et al. in terms of sequences of pairs of nested algebraic geometric codes. In those works the focus is on full privacy and full…
In a multiuser MIMO broadcast channel, the rate performance is affected by the multiuser interference when the Channel State Information at the Transmitter (CSIT) is imperfect. To tackle the detrimental effect of the multiuser interference,…
Cheque Truncation System(CTS) is an automatic cheque clearance system implemented by RBI.CTS uses cheque image, instead of the physical cheque itself, for cheque clearance thus reducing the turn around time drastically. This approach holds…
Compressive sensing (CS) has been widely studied and applied in many fields. Recently, the way to perform secure compressive sensing (SCS) has become a topic of growing interest. The existing works on SCS usually take the sensing matrix as…
In this letter, we propose to exploit an intelligent reflecting surface (IRS) to secure multiuser two-way communications. Specifically, two end users simultaneously transmit their signals, where the signal of one user is exploited as…
In this work we revisit the fundamental findings by Chen et al. in [5] on general information transfer in linear ramp secret sharing schemes to conclude that their method not only gives a way to establish worst case leakage [5, 25] and best…
A new concept of quantum secret sharing is introduced, in which collaboration among participants are encourage. And the dealer can ask the participants to send back their share and revoke the secret before a predefined date or event, i.e.…
This paper investigates the integration of a reconfigurable intelligent surface (RIS) into a secure multiuser massive multiple-input multiple-output (MIMO) system in the presence of transceiver hardware impairments (HWI), imperfect channel…
Quantum secret sharing (QSS) is a typical multipartite cryptographic primitive, which is an important part of quantum communication network. Existing QSS protocols generally require basis selection and matching, which would increase the…
In this paper, we employ Cooperative Rate-Splitting (CRS) technique to enhance the Secrecy Sum Rate (SSR) for the Multiple Input Single Output (MISO) Broadcast Channel (BC), consisting of two legitimate users and one eavesdropper, with…
We propose a framework for constructing efficient code-based encryption schemes from codes that do not hide any structure in their public matrix. The framework is in the spirit of the schemes first proposed by Alekhnovich in 2003 and based…
In Internet of Things (IoT) systems with security demands, there is often a need to distribute sensitive information (such as encryption keys, digital signatures, or login credentials, etc.) among the devices, so that it can be retrieved…
We study the arithmetic circuit complexity of threshold secret sharing schemes by characterizing the graph-theoretic properties of arithmetic circuits that compute the shares. Using information inequalities, we prove that any unrestricted…
We investigate the concept of quantum secret sharing. In a ((k,n)) threshold scheme, a secret quantum state is divided into n shares such that any k of those shares can be used to reconstruct the secret, but any set of k-1 or fewer shares…
This paper presents a perfectly secure matrix multiplication (PSMM) protocol for multiparty computation (MPC) of $\mathrm{A}^{\top}\mathrm{B}$ over finite fields. The proposed scheme guarantees correctness and information-theoretic privacy…
We first explain the notion of secret sharing and also threshold schemes, which can be implemented with the Shamir's secret sharing. Subsequently, we review social secret sharing (NSG'10,NS'10) and its trust function. In a secret sharing…
In this paper, we examine the physical-layer security for a spectrum sharing system consisting of multiple source-destination pairs, which dynamically access their shared spectrum for data transmissions in the presence of an eavesdropper.…
Threshold secret sharing schemes do not prevent any malicious behavior of the dealer or shareholders and so we need verifiable secret sharing, to detect and identify the cheaters, to achieve fair reconstruction of a secret. The problem of…
This paper presents a recursive secret sharing technique that distributes k-1 secrets of length b each into n shares such that each share is effectively of length (n/(k-1))*b and any k pieces suffice for reconstructing all the k-1 secrets.…
In this paper a secret sharing scheme based on the word problem in groups is introduced. The security of the scheme and possible variations are discussed in section 2. The article concludes with the suggestion of two categories of platform…