搜索结果: 1-15 共查到“密码学 3 out of 5 secret sharing”相关记录111条 . 查询时间(0.11 秒)
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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
font style='font-size:12px;'>
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...
Continuously Non-Malleable Secret Sharing for General Access Structures
Secret sharing Non-malleability Leakage resilience
font style='font-size:12px;'>
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...
On relaxed security notions for secret sharing
security notions secret sharing
font style='font-size:12px;'>
2019/5/31
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
font style='font-size:12px;'>
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...
Towards optimal robust secret sharing with security against a rushing adversary
security against rushing adversary
font style='font-size:12px;'>
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...
Exponential Lower Bounds for Secret Sharing
Secret Sharing Lower Bound
font style='font-size:12px;'>
2019/3/1
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
font style='font-size:12px;'>
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...
CHURP: Dynamic-Committee Proactive Secret Sharing
secret sharing threshold cryptography blockchains
font style='font-size:12px;'>
2019/1/9
We introduce CHURP (CHUrn-Robust Proactive secret sharing). CHURP enables secure secret-sharing in dynamic settings, where the committee of nodes storing a secret changes over time. Designed for block...
Multi-Party Oblivious RAM based on Function Secret Sharing and Replicated Secret Sharing Arithmetic
cryptographic protocols RAM
font style='font-size:12px;'>
2019/1/2
In this work, we study the problem of constructing oblivious RAM for secure multi-party computation to obliviously access memory at private locations during secure computation. We build on recent two-...
Revisiting Non-Malleable Secret Sharing
tampering attacks Non-Malleable Secret Sharing
font style='font-size:12px;'>
2018/12/3
A threshold secret sharing scheme (with threshold tt) allows a dealer to share a secret among a set of parties such that any group of tt or more parties can recover the secret and no group of at most ...
Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures
Non-malleable secret sharing Leakage-resilient secret sharing Non-malleable extractors
font style='font-size:12px;'>
2018/12/3
In this work we present a collection of compilers that take secret sharing schemes for an arbitrary access structures as input and produce either leakage-resilient or non-malleable secret sharing sche...
Asymptotically Ideal CRT-based Secret Sharing Schemes for Multilevel and Compartmented Access Structures
cryptographic protocols secret sharing
font style='font-size:12px;'>
2018/11/8
Multilevel and compartmented access structures are two important classes of access structures where participants are grouped into levels/compartments with different degrees of trust and privileges. Th...
Space Efficient Computational Multi-Secret Sharing and Its Applications
multi-secret sharing fair MPC dynamic threshold
font style='font-size:12px;'>
2018/11/2
In a (t_1,...,t_l)-multi-secret sharing scheme (MSSS), l independent secrets s_1,...,s_l are shared with n parties in such a way that at least t_i parties are required to recover the secret s_i (while...