-
Notifications
You must be signed in to change notification settings - Fork 136
/
ss_test.go
149 lines (125 loc) · 3.52 KB
/
ss_test.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
package secretsharing_test
import (
"crypto/rand"
"testing"
"github.com/cloudflare/circl/group"
"github.com/cloudflare/circl/internal/test"
"github.com/cloudflare/circl/secretsharing"
)
func TestSecretSharing(tt *testing.T) {
g := group.P256
t := uint(3)
n := uint(5)
s, err := secretsharing.New(g, t, n)
test.CheckNoErr(tt, err, "failed to create ShamirSS")
want := g.RandomScalar(rand.Reader)
shares := s.Shard(rand.Reader, want)
test.CheckOk(len(shares) == int(n), "bad num shares", tt)
tt.Run("subsetSize", func(ttt *testing.T) {
// Test any possible subset size.
for k := 0; k < int(n); k++ {
got, err := s.Recover(shares[:k])
if k <= int(t) {
test.CheckIsErr(ttt, err, "should not recover secret")
test.CheckOk(got == nil, "not nil secret", ttt)
} else {
test.CheckNoErr(ttt, err, "should recover secret")
if !got.IsEqual(want) {
test.ReportError(ttt, got, want, t, k, n)
}
}
}
})
}
func TestVerifiableSecretSharing(tt *testing.T) {
g := group.P256
t := uint(3)
n := uint(5)
vs, err := secretsharing.NewVerifiable(g, t, n)
test.CheckNoErr(tt, err, "failed to create ShamirSS")
want := g.RandomScalar(rand.Reader)
shares, com := vs.Shard(rand.Reader, want)
test.CheckOk(len(shares) == int(n), "bad num shares", tt)
test.CheckOk(len(com) == int(t+1), "bad num commitments", tt)
tt.Run("verifyShares", func(ttt *testing.T) {
for i := range shares {
test.CheckOk(vs.Verify(shares[i], com) == true, "failed one share", ttt)
}
})
tt.Run("subsetSize", func(ttt *testing.T) {
// Test any possible subset size.
for k := 0; k < int(n); k++ {
got, err := vs.Recover(shares[:k])
if k <= int(t) {
test.CheckIsErr(ttt, err, "should not recover secret")
test.CheckOk(got == nil, "not nil secret", ttt)
} else {
test.CheckNoErr(ttt, err, "should recover secret")
if !got.IsEqual(want) {
test.ReportError(ttt, got, want, t, k, n)
}
}
}
})
tt.Run("badShares", func(ttt *testing.T) {
badShares := make([]secretsharing.Share, len(shares))
for i := range shares {
badShares[i].Share = shares[i].Share.Copy()
badShares[i].Share.SetUint64(9)
}
for i := range badShares {
test.CheckOk(vs.Verify(badShares[i], com) == false, "verify must fail due to bad shares", ttt)
}
})
tt.Run("badCommitments", func(ttt *testing.T) {
badCom := make(secretsharing.SharesCommitment, len(com))
for i := range com {
badCom[i] = com[i].Copy()
badCom[i].Dbl(badCom[i])
}
for i := range shares {
test.CheckOk(vs.Verify(shares[i], badCom) == false, "verify must fail due to bad commitment", ttt)
}
})
}
func BenchmarkSecretSharing(b *testing.B) {
g := group.P256
t := uint(3)
n := uint(5)
s, _ := secretsharing.New(g, t, n)
want := g.RandomScalar(rand.Reader)
shares := s.Shard(rand.Reader, want)
b.Run("Shard", func(b *testing.B) {
for i := 0; i < b.N; i++ {
s.Shard(rand.Reader, want)
}
})
b.Run("Recover", func(b *testing.B) {
for i := 0; i < b.N; i++ {
_, _ = s.Recover(shares)
}
})
}
func BenchmarkVerifiableSecretSharing(b *testing.B) {
g := group.P256
t := uint(3)
n := uint(5)
vs, _ := secretsharing.NewVerifiable(g, t, n)
want := g.RandomScalar(rand.Reader)
shares, com := vs.Shard(rand.Reader, want)
b.Run("Shard", func(b *testing.B) {
for i := 0; i < b.N; i++ {
vs.Shard(rand.Reader, want)
}
})
b.Run("Recover", func(b *testing.B) {
for i := 0; i < b.N; i++ {
_, _ = vs.Recover(shares)
}
})
b.Run("Verify", func(b *testing.B) {
for i := 0; i < b.N; i++ {
vs.Verify(shares[0], com)
}
})
}