搜索结果: 1-15 共查到“密码学 Secret sharing”相关记录179条 . 查询时间(0.046 秒)
Asymptotically-Good Arithmetic Secret Sharing over Z/(p^\ell Z) with Strong Multiplication and Its Applications to Efficient MPC
multiparty computation amortization information-theoretical security
2019/7/18
This paper deals with (1) asymptotics of ``strongly-multiplicative'' arithmetic secret sharing over an arbitrary fixed ring Rℓ:=Z/pℓZ (p>0 prime, ℓ>0 an integer) and supporting an un...
Improved Building Blocks for Secure Multi-Party Computation based on Secret Sharing with Honest Majority
cryptographic protocols secret sharing
2019/6/19
Secure multi-party computation permits evaluation of any desired functionality on private data without disclosing the data to the participants and is gaining its popularity due to increasing collectio...
On the Local Leakage Resilience of Linear Secret Sharing Schemes
Secret Sharing leakage resilience information theory
2019/6/5
We consider the following basic question: to what extent are standard secret sharing schemes and protocols for secure multiparty computation that build on them resilient to leakage? We focus on a simp...
Information ratio of an access structure is an important measure for efficiency of the best secret sharing scheme realizing it. The most common notion of secret sharing security is that of total (perf...
Continuously Non-Malleable Secret Sharing for General Access Structures
Secret sharing Non-malleability Leakage resilience
2019/6/3
We study leakage-resilient continuously non-malleable secret sharing, as recently intro- duced by Faonio and Venturi (CRYPTO 2019). In this setting, an attacker can continuously tamper and leak from a...
Information ratio of an access structure is an important measure for efficiency of the best secret sharing scheme realizing it. The most common notion of secret sharing security is that of total (perf...
2-threshold Ideal Secret Sharing Schemes Can Be Uniquely Modeled by Latin Squares
secret sharing ideal secret sharing 2-threshold secret sharing
2019/5/31
In a secret sharing scheme, a secret value is encrypted into several shares, which are distributed among corresponding participants. It requires that only predefined subsets of participants can recons...
On Abelian Secret Sharing: duality and separation
Access structure Duality Characteristic-dependent information ratio
2019/5/29
Unlike linear secret sharing, very little is known about abelian secret sharing. In this paper, we present two results on abelian secret sharing. First, we show that the information ratio of access st...
Group-homomorphic Secret Sharing Schemes Are Group-characterizable with Normal Subgroups
homomorphic secret sharing schemes group-characterizable distribution quasi-uniform distribution
2019/5/29
A group-characterizable random variable [Chan and Yeung 2002] is induced by a joint distribution on the (left) cosets of some subgroups of a main group. A homomorphic secret sharing scheme [Benaloh 19...
Secret-Sharing from Robust Conditional Disclosure of Secrets
cryptographic protocols secret sharing
2019/5/21
A secret-sharing scheme is a method by which a dealer, holding a secret string, distributes shares to parties such that only authorized subsets of parties can reconstruct the secret. The collection of...
Nearly all secret sharing schemes studied so far are linear or multi-linear schemes. Although these schemes allow to implement any monotone access structure, the share complexity may be suboptimal -- ...
Secret-Sharing Schemes for General and Uniform Access Structures
secret sharing conditional disclosure of secrets protocols private simultaneous messages protocols
2019/3/4
A secret-sharing scheme allows some authorized sets of parties to reconstruct a secret; the collection of authorized sets is called the access structure. For over 30 years, it was known that any (mono...
Towards optimal robust secret sharing with security against a rushing adversary
security against rushing adversary
2019/3/2
Robust secret sharing enables the reconstruction of a secret-shared message in the presence of up to tt (out of nn) {\em incorrect} shares. The most challenging case is when n=2t+1n=2t+1, which is the...
A secret sharing scheme allows a dealer to distribute shares of a secret among a set of nn parties P={p1,…,pn}P={p1,…,pn} such that any authorized subset of parties can reconstruct the secret, yet any...
Lower Bounds for Leakage-Resilient Secret Sharing
Lower Bound Secret Sharing Leakage-Resilience
2019/3/1
Threshold secret sharing allows a dealer to split a secret into nn shares such that any authorized subset of cardinality at least tt of those shares efficiently reveals the secret, while at the same t...
