2
$\begingroup$

Disregarding matters such as efficiency and round complexity, can verifiable secret sharing be done in a way such that the secret cannot be decoded unless you have all n shares, and that this guarantee is information-theoretic?

| improve this question | | | | |
$\endgroup$
  • $\begingroup$ What should be verifiable about the sharing? ​ ​ $\endgroup$ – user991 Jan 22 '18 at 6:08
  • $\begingroup$ Verifiable secret sharing means that all the participants can verify that t shares will, in fact, reconstruct something intelligible. It's important if you're going to use it in something like MPC, for example: en.wikipedia.org/wiki/verifiable_secret_sharing $\endgroup$ – Ian MathWiz Jan 22 '18 at 6:35
  • $\begingroup$ Do you have a specific definition for "intelligible" in that context? ​ ​(Xhe wiki article describes it as the shares only needing to be consistent.) ​ ​ ​ ​ $\endgroup$ – user991 Jan 22 '18 at 7:13
  • $\begingroup$ Is there a reason why the work in the BDOZ protocol, where they use additive secret sharing and an information theoretic MAC, wouldn't work? $\endgroup$ – mikeazo Jan 22 '18 at 12:48
  • $\begingroup$ Ricky, I mean exactly what the Wikipedia article says. $\endgroup$ – Ian MathWiz Jan 22 '18 at 16:26

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.