Shamir's secret sharing scheme is a threshold secret sharing scheme based on polynomial interpolation over a finite field.

learn more… | top users | synonyms

-2
votes
1answer
66 views

How do we solve Shammir 2,3 sharring scheme where arithmetic is modulo?

I am trying to get secret S and I have 3 values (2,2)(6,3)(4,9) and know that modulo is 13. I tried using Lagrange basis polynomial and got 8 but I am not sure if that is right and also I cannot find ...
3
votes
0answers
222 views

Secure Secret sharing

I'm trying to come up with a new way to do oblivious transfer that is faster and requires less computation than existing methods. The basis of my method is shamir secret sharing. Below is an example ...
2
votes
0answers
126 views

Threshold signatures vs. certificate authority+voting verification

Perhaps a silly question, but I am wondering what the advantages are of threshold signatures. Let's consider the following two signature schemes: $(t,n)$-threshold signature with a trusted dealer, ...
1
vote
0answers
21 views

How share size is reduced in robust secret sharing?

THIS IS ROBUST SECRET SHARING SCHEME The dealer $\mathcal{D}$ wants to share a secret among the participants $\{P_1, P_2, \ldots, P_n\}$, where at most $t$ participants are malicious and $t<n/2$. ...
1
vote
0answers
58 views

Does using a verifiable secret sharing scheme ensure robustness of a protocol if it is secure under the semi-honest adversarial model

Consider a protocol $\pi$ which uses a linear secret sharing scheme like that of Shamir secret sharing. Further assume that the protocol $\pi$ has been proven to be secure (correctness and privacy) ...
0
votes
0answers
15 views

Is normal to take wrong values of the polynomial for given x while applying Horner's rule

I want to evaluate the polynomial $a_0+a_1x+a_2x^2+...a_nx^n$ using Horner's evaluation due to i want to speed up my performance of application written in Java. The problem is that sometimes it gives ...