-
Notifications
You must be signed in to change notification settings - Fork 1
/
shamir.go
206 lines (187 loc) · 5.04 KB
/
shamir.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
//
// Copyright Coinbase, Inc. All Rights Reserved.
//
// SPDX-License-Identifier: Apache-2.0
//
// Package sharing is an implementation of shamir secret sharing and implements the following papers.
//
// - https://dl.acm.org/doi/pdf/10.1145/359168.359176
// - https://www.cs.umd.edu/~gasarch/TOPICS/secretsharing/feldmanVSS.pdf
// - https://link.springer.com/content/pdf/10.1007%2F3-540-46766-1_9.pdf
package sharing
import (
"encoding/binary"
"fmt"
"io"
"github.com/coinbase/kryptology/pkg/core/curves"
)
type ShamirShare struct {
Id uint32 `json:"identifier"`
Value []byte `json:"value"`
}
func (ss ShamirShare) Validate(curve *curves.Curve) error {
if ss.Id == 0 {
return fmt.Errorf("invalid identifier")
}
sc, err := curve.Scalar.SetBytes(ss.Value)
if err != nil {
return err
}
if sc.IsZero() {
return fmt.Errorf("invalid share")
}
return nil
}
func (ss ShamirShare) Bytes() []byte {
var id [4]byte
binary.BigEndian.PutUint32(id[:], ss.Id)
return append(id[:], ss.Value...)
}
type Shamir struct {
threshold, limit uint32
curve *curves.Curve
}
func NewShamir(threshold, limit uint32, curve *curves.Curve) (*Shamir, error) {
if limit < threshold {
return nil, fmt.Errorf("limit cannot be less than threshold")
}
if threshold < 2 {
return nil, fmt.Errorf("threshold cannot be less than 2")
}
if limit > 255 {
return nil, fmt.Errorf("cannot exceed 255 shares")
}
if curve == nil {
return nil, fmt.Errorf("invalid curve")
}
return &Shamir{threshold, limit, curve}, nil
}
func (s Shamir) Split(secret curves.Scalar, reader io.Reader) ([]*ShamirShare, error) {
if secret.IsZero() {
return nil, fmt.Errorf("invalid secret")
}
shares, _ := s.getPolyAndShares(secret, reader)
return shares, nil
}
func (s Shamir) getPolyAndShares(secret curves.Scalar, reader io.Reader) ([]*ShamirShare, *Polynomial) {
poly := new(Polynomial).Init(secret, s.threshold, reader)
shares := make([]*ShamirShare, s.limit)
for i := range shares {
x := s.curve.Scalar.New(i + 1)
shares[i] = &ShamirShare{
Id: uint32(i + 1),
Value: poly.Evaluate(x).Bytes(),
}
}
return shares, poly
}
func (s Shamir) LagrangeCoeffs(identities []uint32) (map[uint32]curves.Scalar, error) {
xs := make(map[uint32]curves.Scalar, len(identities))
for _, xi := range identities {
xs[xi] = s.curve.Scalar.New(int(xi))
}
result := make(map[uint32]curves.Scalar, len(identities))
for i, xi := range xs {
num := s.curve.Scalar.One()
den := s.curve.Scalar.One()
for j, xj := range xs {
if i == j {
continue
}
num = num.Mul(xj)
den = den.Mul(xj.Sub(xi))
}
if den.IsZero() {
return nil, fmt.Errorf("divide by zero")
}
result[i] = num.Div(den)
}
return result, nil
}
func (s Shamir) Combine(shares ...*ShamirShare) (curves.Scalar, error) {
if len(shares) < int(s.threshold) {
return nil, fmt.Errorf("invalid number of shares")
}
dups := make(map[uint32]bool, len(shares))
xs := make([]curves.Scalar, len(shares))
ys := make([]curves.Scalar, len(shares))
for i, share := range shares {
err := share.Validate(s.curve)
if err != nil {
return nil, err
}
if share.Id > s.limit {
return nil, fmt.Errorf("invalid share identifier")
}
if _, in := dups[share.Id]; in {
return nil, fmt.Errorf("duplicate share")
}
dups[share.Id] = true
ys[i], _ = s.curve.Scalar.SetBytes(share.Value)
xs[i] = s.curve.Scalar.New(int(share.Id))
}
return s.interpolate(xs, ys)
}
func (s Shamir) CombinePoints(shares ...*ShamirShare) (curves.Point, error) {
if len(shares) < int(s.threshold) {
return nil, fmt.Errorf("invalid number of shares")
}
dups := make(map[uint32]bool, len(shares))
xs := make([]curves.Scalar, len(shares))
ys := make([]curves.Point, len(shares))
for i, share := range shares {
err := share.Validate(s.curve)
if err != nil {
return nil, err
}
if share.Id > s.limit {
return nil, fmt.Errorf("invalid share identifier")
}
if _, in := dups[share.Id]; in {
return nil, fmt.Errorf("duplicate share")
}
dups[share.Id] = true
sc, _ := s.curve.Scalar.SetBytes(share.Value)
ys[i] = s.curve.ScalarBaseMult(sc)
xs[i] = s.curve.Scalar.New(int(share.Id))
}
return s.interpolatePoint(xs, ys)
}
func (s Shamir) interpolate(xs, ys []curves.Scalar) (curves.Scalar, error) {
result := s.curve.Scalar.Zero()
for i, xi := range xs {
num := s.curve.Scalar.One()
den := s.curve.Scalar.One()
for j, xj := range xs {
if i == j {
continue
}
num = num.Mul(xj)
den = den.Mul(xj.Sub(xi))
}
if den.IsZero() {
return nil, fmt.Errorf("divide by zero")
}
result = result.Add(ys[i].Mul(num.Div(den)))
}
return result, nil
}
func (s Shamir) interpolatePoint(xs []curves.Scalar, ys []curves.Point) (curves.Point, error) {
result := s.curve.NewIdentityPoint()
for i, xi := range xs {
num := s.curve.Scalar.One()
den := s.curve.Scalar.One()
for j, xj := range xs {
if i == j {
continue
}
num = num.Mul(xj)
den = den.Mul(xj.Sub(xi))
}
if den.IsZero() {
return nil, fmt.Errorf("divide by zero")
}
result = result.Add(ys[i].Mul(num.Div(den)))
}
return result, nil
}