M. Yung, Multi secret sharing.  Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Proactive Secret Sharing Or: How to Cope With Perpetual .. - Herzberg, Jarecki.. (1995) (65 citations) Self-citation (Yung) (Correct)
....(mod q) Secrecy: The semantic security of the secret x is preserved. Multi Secret Sharing. Theoretically, instead of recovering each lost share separately by treating the set fx i g i2D as a secret sharing of a single x r for each r 2 B, we can treat it as a multi secret sharing (introduced in [20]) of all fx r g r2B . The servers D can recover shares fx r g r2B simultaneously, by adding random k degree polynomials ffi i ( Delta) such that ffi i (r) 0 for all r 2 B to their shares and then sending the new shares to servers B to let them reconstruct their original shares. Even though this ....
M. Yung, Multi secret sharing.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC