Related papers: Asymptotically ideal Disjunctive Hierarchical Secr…
A computational secret-sharing scheme is a method that enables a dealer, that has a secret, to distribute this secret among a set of parties such that a "qualified" subset of parties can efficiently reconstruct the secret while any…
A $(t,m)$-threshold secret sharing and multisecret-sharing scheme based on Shamir's SSS are introduced with two-level security using a one-way function. Besides we give its application in smart contract-enabled consortium blockchain…
This paper investigates the differentially private bipartite consensus algorithm over signed networks. The proposed algorithm protects each agent's sensitive information by adding noise with time-varying variances to the…
In this work we present hbAVSS, the Honey Badger of Asynchronous Verifiable Secret Sharing (AVSS) protocols - an AVSS protocol that guarantees linear amortized communication overhead even in the worst case. The best prior work can achieve…
In this paper we study the protocol implementation and property analysis for several practical quantum secret sharing (QSS) schemes with continuous variable graph state (CVGS). For each QSS scheme, an implementation protocol is designed…
Hiding a secret is needed in many situations. Secret sharing plays an important role in protecting information from getting lost, stolen, or destroyed and has been applicable in recent years. A secret sharing scheme is a cryptographic…
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…
We construct general schemes for multi-partite quantum secret sharing using multi-level systems, and find that the consistent conditions for valid measurements can be summarized in two simple algebraic conditions. The scheme using the very…
In the paradigm of decentralized learning, a group of agents collaborates to learn a global model using distributed datasets without a central server. However, due to the heterogeneity of the local data across the different agents, learning…
In this paper we analyze the (im)possibility of the exact distinguishability of orthogonal multipartite entangled states under {\em restricted local operation and classical communication}. Based on this local distinguishability analysis we…
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.…
Secret sharing allows a user to split a secret into many shares so that the secret can be recovered if, and only if, an authorized set of shares is collected. Although secret sharing typically does not require any computational hardness…
Direct-sequence spread spectrum (DSSS) has been recognized as an effective jamming resilient technique. However, the effectiveness of DSSS relies on the use of either pre-shared unique secret keys or a bank of public codes, which can be…
Sequential Quantum Secret Sharing schemes (QSS) do not use entangled states for secret sharing, rather they rely on sequential operations of the players on a single state which is circulated between the players. In order to check the…
Ramp secret sharing (SS) schemes can be classified into strong ramp SS schemes and weak ramp SS schemes. The strong ramp SS schemes do not leak out any part of a secret explicitly even in the case where some information about the secret…
The volume-wise labeling of 3D medical images is expertise-demanded and time-consuming; hence semi-supervised learning (SSL) is highly desirable for training with limited labeled data. Imbalanced class distribution is a severe problem that…
Recently, Li et al. [Phys. Rev. A, 82(2), 022303] presented two semi-quantum secret sharing (SQSS) protocols using GHZ-like states. The proposed schemes are rather practical because only the secret dealer requires to equip with advanced…
In the $\left( {t,n} \right)$ threshold quantum secret sharing scheme, it is difficult to ensure that internal participants are honest. In this paper, a verifiable $\left( {t,n} \right)$ threshold quantum secret sharing scheme is designed…
In the first part of the paper, we have studied the computational privacy risks in distributed computing protocols against local or global dynamics eavesdroppers, and proposed a Privacy-Preserving-Summation-Consistent (PPSC) mechanism as a…
Split Learning (SL) -- splits a model into two distinct parts to help protect client data while enhancing Machine Learning (ML) processes. Though promising, SL has proven vulnerable to different attacks, thus raising concerns about how…