-
Notifications
You must be signed in to change notification settings - Fork 6
/
Copy pathvss_kyber.go
330 lines (264 loc) · 8.48 KB
/
vss_kyber.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
package distIBE
import (
"bytes"
"crypto/rand"
"fmt"
"math/big"
"strings"
"github.com/drand/kyber"
bls "github.com/drand/kyber-bls12381"
"github.com/drand/kyber/pairing"
// "github.com/drand/kyber/proof"
)
type (
PolynomialCoeff []kyber.Scalar
Commitments []kyber.Point
)
type Share struct {
Index kyber.Scalar
Value kyber.Scalar
}
func hexToBin(hexString string) string {
hexChar2BinChar := map[string]string{
"0": "0000",
"1": "0001",
"2": "0010",
"3": "0011",
"4": "0100",
"5": "0101",
"6": "0110",
"7": "0111",
"8": "1000",
"9": "1001",
"a": "1010",
"b": "1011",
"c": "1100",
"d": "1101",
"e": "1110",
"f": "1111",
}
var binString bytes.Buffer
hexStringArr := strings.Split(hexString, "")
for i := 0; i < len(hexStringArr); i++ {
binString.WriteString(hexChar2BinChar[hexStringArr[i]])
}
return binString.String()
}
func newPolynomial(threshold uint32) PolynomialCoeff {
poly := make(PolynomialCoeff, threshold)
for i := 0; i < len(poly); i++ {
poly[i] = bls.NewKyberScalar()
}
return poly
}
func createRandomPolynomial(threshold uint32, masterSecretKey kyber.Scalar, groupOrder *big.Int) (poly PolynomialCoeff, err error) {
if groupOrder.Sign() < 0 {
return PolynomialCoeff{}, fmt.Errorf("group order is negative")
}
poly = newPolynomial(threshold)
poly[0].Set(masterSecretKey)
for i := 1; i < len(poly); i++ {
one := big.NewInt(int64(1))
max := big.NewInt(int64(0))
max.Sub(groupOrder, one)
r, err := rand.Int(rand.Reader, max)
if err != nil {
return PolynomialCoeff{}, err
}
r.Add(r, one)
poly[i] = kyber.Scalar.SetInt64(poly[i], r.Int64())
}
return poly, nil
}
func (p PolynomialCoeff) eval(x kyber.Scalar) kyber.Scalar {
y := bls.NewKyberScalar().Zero()
for k := len(p) - 1; k >= 0; k-- {
y.Mul(y, x)
y.Add(y, p[k])
}
return y
}
func Exp(base, exponent kyber.Scalar) kyber.Scalar {
if exponent.Equal(bls.NewKyberScalar().Zero()) {
return bls.NewKyberScalar().One()
}
if exponent.Equal(bls.NewKyberScalar().One()) {
return base
}
if base.Equal(bls.NewKyberScalar().One()) {
return base
}
expBinStr := hexToBin(exponent.String())
expBinStringArr := strings.Split(expBinStr, "")
res := bls.NewKyberScalar().One()
bPrime := bls.NewKyberScalar().One()
bPrime.Mul(bPrime, base)
for j := len(expBinStringArr) - 1; j >= 0; j-- {
if expBinStringArr[j] == "1" {
res.Mul(res, bPrime)
}
bPrime.Mul(bPrime, bPrime)
}
return res
}
func GenerateMSKAndMPK(groupOrder *big.Int) (masterSecretKey kyber.Scalar, masterPublicKey kyber.Point) {
one := big.NewInt(int64(1))
max := big.NewInt(int64(0))
max.Sub(groupOrder, one)
r, err := rand.Int(rand.Reader, max)
if err != nil {
fmt.Println("could not generate random master secret key")
return
}
r.Add(r, one)
masterSecretKey = bls.NewKyberScalar().SetInt64(r.Int64())
s := bls.NewBLS12381Suite()
PointG := s.G1().Point().Base()
masterPublicKey = s.G1().Point().Mul(masterSecretKey, PointG)
return masterSecretKey, masterPublicKey
}
func GenerateShares(numberOfShares, threshold uint32) (shares []Share, MPK kyber.Point, commits Commitments, err error) {
buf := make([]byte, 128)
groupOrder := bigFromHex("0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001")
s := bls.NewBLS12381Suite()
_, err = rand.Read(buf)
if err != nil {
return nil, nil, nil, err
}
secretVal := buf
masterSecretKey, _ := h3(s, secretVal, []byte("msg"))
MPK = s.G1().Point().Mul(masterSecretKey, s.G1().Point().Base())
polynomial, err := createRandomPolynomial(threshold, masterSecretKey, groupOrder)
if err != nil {
return shares, nil, nil, fmt.Errorf("shares could not be created due to random polynomial generation failing")
}
randomPoly := polynomial
index := make([]kyber.Scalar, numberOfShares)
value := make([]kyber.Scalar, numberOfShares)
for i := range index {
index[i] = bls.NewKyberScalar().SetInt64(int64(i + 1))
evalPoly := polynomial.eval(index[i])
value[i] = evalPoly
}
shares = make([]Share, numberOfShares)
for j := range shares {
shares[j] = Share{Index: index[j], Value: value[j]}
}
commits = GenerateCommits(randomPoly)
return shares, MPK, commits, nil
}
// func GenerateSharesKZG(numberOfShares, threshold uint32) (kyber.Point, kyber.Point, []OpeningProof, SRS, error) {
// buf := make([]byte, 128)
// groupOrder := bigFromHex("0x73eda753299d7d483339d80809a1d80553bda402fffe5bfeffffffff00000001")
// s := bls.NewBLS12381Suite()
// _, err := rand.Read(buf)
// if err != nil {
// return nil, nil, nil, SRS{}, err
// }
// var secretVal []byte = buf
// masterSecretKey, _ := h3(s, secretVal, []byte("msg"))
// MPK := s.G1().Point().Mul(masterSecretKey, s.G1().Point().Base())
// polynomial, err := createRandomPolynomial(threshold, masterSecretKey, groupOrder)
// if err != nil {
// return nil, nil, nil, SRS{}, fmt.Errorf("shares could not be created due to random polynomial generation failing")
// }
// randomPoly := polynomial
// index := make([]kyber.Scalar, numberOfShares)
// value := make([]kyber.Scalar, numberOfShares)
// for i := range index {
// index[i] = bls.NewKyberScalar().SetInt64(int64(i + 1))
// evalPoly := polynomial.eval(index[i])
// value[i] = evalPoly
// }
// srs, err := NewSRS(uint64(threshold))
// if err != nil {
// return nil, nil, nil, SRS{}, err
// }
// commitment, err := Commit(randomPoly, srs)
// if err != nil {
// return nil, nil, nil, SRS{}, err
// }
// var proof []OpeningProof
// proof = make([]OpeningProof, numberOfShares)
// var p OpeningProof
// var shares []Share
// shares = make([]Share, numberOfShares)
// for j := range shares {
// shares[j] = Share{Index: index[j], Value: value[j]}
// }
// for i := 0; i < int(numberOfShares); i++ {
// p, err = Open(randomPoly, shares[i].Index, shares[i].Value, srs)
// if err != nil {
// return nil, nil, nil, SRS{}, err
// }
// proof[i].H = s.G1().Point().Base()
// proof[i].H.Set(p.H)
// proof[i].ClaimedValue = p.ClaimedValue
// proof[i].Index = p.Index
// }
// return MPK, commitment, proof, srs, nil
// }
func lagrangeCoefficientFromShares(indexJ kyber.Scalar, shares []Share) kyber.Scalar {
nominator := bls.NewKyberScalar().SetInt64(int64(1))
denominator := bls.NewKyberScalar().SetInt64(int64(1))
for _, share := range shares {
if share.Index != indexJ {
nominator.Mul(nominator, share.Index)
denominator.Mul(denominator, bls.NewKyberScalar().SetInt64(int64(1)).Add(share.Index, bls.NewKyberScalar().SetInt64(int64(1)).Neg(indexJ)))
}
}
return bls.NewKyberScalar().SetInt64(int64(1)).Div(nominator, denominator) // Inverse will panic if denominator is 0
}
func LagrangeCoefficient(suite pairing.Suite, signer uint32, S []uint32) kyber.Scalar {
nominator := bls.NewKyberScalar()
temp := bls.NewKyberScalar()
temp1 := bls.NewKyberScalar()
nominator.SetInt64(int64(1))
denominator := bls.NewKyberScalar()
denominator.SetInt64(int64(1))
for _, s := range S {
if s != signer {
nominator.Mul(nominator, kyber.Scalar.SetInt64(temp, int64(s)))
denominator.Mul(denominator,
kyber.Scalar.Sub(temp,
kyber.Scalar.SetInt64(temp, int64(s)),
kyber.Scalar.SetInt64(temp1, int64(signer))))
}
}
outScalar := bls.NewKyberScalar()
kyber.Scalar.Div(outScalar, nominator, denominator)
return outScalar
}
func RegenerateSecret(threshold uint32, shares []Share) (masterSecretKey kyber.Scalar, err error) {
if uint32(len(shares)) != threshold {
return masterSecretKey, fmt.Errorf("not enough shares to reconstruct master secret key")
}
masterSecretKey = bls.NewKyberScalar().Zero()
for _, share := range shares {
lagrangeCoeff := lagrangeCoefficientFromShares(share.Index, shares)
product := bls.NewKyberScalar().One()
masterSecretKey.Add(masterSecretKey, product.Mul(share.Value, lagrangeCoeff))
}
return masterSecretKey, nil
}
func GenerateCommits(polynomial PolynomialCoeff) (commits Commitments) {
s := bls.NewBLS12381Suite()
PointG := s.G1().Point().Base()
commits = make(Commitments, len(polynomial))
for i := 0; i < len(polynomial); i++ {
commits[i] = s.G1().Point().Mul(polynomial[i], PointG)
}
return commits
}
func VerifyVSSShare(share Share, commits Commitments) bool {
s := bls.NewBLS12381Suite()
PointG := s.G1().Point().Base()
shareTimesPointG := s.G1().Point().Mul(share.Value, PointG)
sum := s.G1().Point().Set(commits[0])
for i := 1; i < len(commits); i++ {
indexToI := Exp(share.Index, bls.NewKyberScalar().SetInt64(int64(i)))
product := s.G1().Point().Mul(indexToI, commits[i])
sum = s.G1().Point().Add(sum, product)
}
return shareTimesPointG.Equal(sum)
}