Share conversion, pseudorandom secret-sharing and ... - of the NVTI

More documents

Recommendations

Info

Why interested in this scheme...??? After all...there is Shamir's scheme.. Ito/Nishizeki/Saito: introduced general, non-thresho ing secret sharing (m-out-of m additive sharing within ied set") Beaver/Wool: simple protocol for MPC, passive ad eral adversary Maurer: extension to active case
But: only makes sense when n is small (or more gen t is small). Moreover, in all these cases more ecient solution by more sophisticated techniques Good reasons to revisit this technique to follow...
Page 1 and 2: Share conversion, pseudorandom secr
Page 3 and 4: Privacy: Consider A f1; : : : ; n
Page 5: n > 3t ) perfect recovery from mali
Page 9 and 10: Pseudo-random secret sharing introd
Page 11 and 12: Application II: Non-interactive sec
Page 13 and 14: Note 1: No broadcast needed here in
Page 15 and 16: Player P i can compute his Shamir-s
Page 17 and 18: Compressed non-interactive secure m
Page 19 and 20: Instead of a single one, hand pseud
Page 21 and 22: Indeed: f: polynomial for zero-shar
Page 23: Application to non-interactive thre

Share conversion, pseudorandom secret-sharing and ... - of the NVTI

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?