Robust Secret Sample Clauses
The 'Robust Secret' clause is designed to ensure the secure handling and protection of confidential information exchanged between parties. In practice, this clause typically outlines the obligations of each party to maintain the secrecy of sensitive data, restricts disclosure to unauthorized individuals, and may specify security measures or protocols to be followed. Its core function is to safeguard proprietary or confidential information, thereby reducing the risk of data breaches and protecting the interests of the parties involved.
Robust Secret. Sharing We recall the definition of a robust secret sharing scheme, slightly simplified for our purposes from ▇▇▇▇▇▇ et al. [22]. For a vector c ∈ Fn and a set A ⊆ [n], we denote with c the projection Fn → F|A|,
i. e., the sub-vector (ci)i∈A. A q q
Robust Secret. Sharing We recall the definition of a robust secret sharing scheme, slightly simplified for our purposes from [CDD+15]. For a vector
Robust Secret. Sharing We recall the definition of a robust secret sharing scheme, slightly simplified for our purposes from ▇▇▇▇▇▇ et al. [CDD+15]. For a vector c ∈ Fn and a set A ⊆ [n], we denote with c the projection Fn → F|A|, i.e., the sub-vector (ci)i∈A. A q q Definition 2. Let λ ∈ N, q a λ-bit prime, Fq a finite field and n, t, m, r ∈ N with t < r ≤ n and m < r. An (n, t, r)q robust secret sharing scheme (RSS) consists of two probabilistic algorithms Share : Fq → Fn and Reconstruct : Fn → Fq with the following – t-privacy: for any s, sj ∈ Fq, A ⊂ [n] with |A| ≤ t, the projections cA of c ←$ Share(s) and cjA of cj ← Share(sj) are identically distributed. $ – r-robustness: for any s Fq, A [n] with A r, any c output by Share(s), and any c˜ such that cA = c˜A, it holds that Reconstruct(c˜) = s. In other words, an (n, t, r)q-RSS is able to reconstruct the shared secret even if the adversary tampered with up to n r shares, while each set of t shares is distributed independently of the shared secret s and thus reveals nothing about it. We note that we allow for a gap, i.e., r ≥ t + 1. Schemes with r > t + 1 are called ramp RSS.