Fast Multiparty Threshold ECDSA with Fast Trustless Setup

If you have two secrets a,b shared via Shamir a, with polynomial F(x) and shares a i b, with polynomial G(x) and shares b i • Players can reconstruct c=a+b by revealing c i =a i +b i -A point on the polynomial (F+G)(x) -still of degree t no other information about a,b is released