Related papers: Multi-Use Multi-Secret Sharing Scheme for General …
A secret key shared through quantum key distribution between two cooperative players is secure against any eavesdropping attack allowed by the laws of physics. Yet, such a key can be established only when the quantum channel error rate due…
Nowadays, the utilization of the ever expanding amount of data has made a huge impact on web technologies while also causing various types of security concerns. On one hand, potential gains are highly anticipated if different organizations…
With the development of machine learning, it is difficult for a single server to process all the data. So machine learning tasks need to be spread across multiple servers, turning the centralized machine learning into a distributed one.…
This paper shows that structured transmission schemes are a good choice for secret communication over interference networks with an eavesdropper. Structured transmission is shown to exploit channel asymmetries and thus perform better than…
We offer a public key exchange protocol in the spirit of Diffie-Hellman, but we use (small) matrices over a group ring of a (small) symmetric group as the platform. This "nested structure" of the platform makes computation very efficient…
This paper introduces the first two-dimensional XOR-based secret sharing scheme for layered multipath communication networks. We present a construction that guarantees successful message recovery and perfect privacy when an adversary…
In modern cryptography, the secret sharing scheme is an important cryptographic primitive and it is used in various situations. In this paper, a timed-release secret sharing scheme (TR-SS) with information-theoretic security is first…
A ($t$, $n$) threshold quantum secret sharing (QSS) is proposed based on a single $d$-level quantum system. It enables the ($t$, $n$) threshold structure based on Shamir's secret sharing and simply requires sequential communication in…
In this work, we consider the multi-access combinatorial topology with $C$ caches where each user accesses a unique set of $r$ caches. For this setup, we consider secrecy, where each user should not know anything about the files it did not…
General cryptographic schemes are presented where keys can be one-time or ephemeral. Processes for key exchange are derived. Public key cryptographic schemes based on the new systems are easily established. Authentication and signature…
This paper develops a novel framework for sharing secret keys using existing Automatic Repeat reQuest (ARQ) protocols. Our approach exploits the multi-path nature of the wireless environment to hide the key from passive eavesdroppers. The…
We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver.…
The security of neural cryptography is investigated. A key-exchange protocol over a public channel is studied where the parties exchanging secret messages use multilayer neural networks which are trained by their mutual output bits and…
In this work, inspired by secret sharing schemes, we introduce a privacy-preserving approach for network consensus, by which all nodes in a network can reach an agreement on their states without exposing the individual state to neighbors.…
A single-state multiparty semiquantum secret sharing (MSQSS) scheme with d-dimensional Bell states is proposed, which can accomplish the goal that only when all receivers work together can they restore the sender's secret key. This protocol…
The dynamic establishment of shared information (e.g. secret key) between two entities is particularly important in networks with no pre-determined structure such as wireless sensor networks (and in general wireless mobile ad-hoc networks).…
A general theory for constructing linear secret sharing schemes over a finite field $\Fq$ from toric varieties is introduced. The number of players can be as large as $(q-1)^r-1$ for $r\geq 1$. We present general methods for obtaining the…
The purpose of this paper is to do a general survey on the existing communication modes inside a smart grid, the existing security loopholes and their countermeasures. Then we suggest a detailed countermeasure, building upon the Jigsaw…
We consider a Gaussian multiple access channel with $K$ transmitters, a (intended) receiver and an external eavesdropper. The transmitters wish to reliably communicate with the receiver while concealing their messages from the eavesdropper.…
In this paper we review the Habeeb-Kahrobaei-Shpilrain secret sharing scheme and introduce a variation based on the shortlex order on a free group. Drawing inspiration from adjustments to classical schemes, we also present a method that…