| 摘要 |
PROBLEM TO BE SOLVED: To suppress a data amount of variance of secret sharing schemes.SOLUTION: M-1 values v(m) are selected; M-1 values a(m)=P(v(m)) are obtained; a value a(M-1)=g(α, a(0)...,a(M-2)) is obtained to a value α which is an element of a set G; and variance T(α)=(v(i,0), v(I,1)...v(i,N-1))(i=0,...,N-1) of the value α is generated. Provided that a subset of a set A={a(0)...,a(M-1)} is S(α)={a(i,0)...,a(i,N-1)}; v(i, n) corresponding to (i, n)(nof {0...,N-1}) which is a(i, n)≠a(M-1) is P(a(i, n)); and v(i, q) corresponding to (i, q)(qof {0..., N-1}) which is a(i, q)=a(M-1) is a(i, q). |
