-
Notifications
You must be signed in to change notification settings - Fork 106
/
transaction.go
322 lines (284 loc) · 8.07 KB
/
transaction.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
package lib
import (
"crypto/sha256"
"encoding/binary"
"errors"
"fmt"
"io"
"sort"
"time"
"go.dedis.ch/kyber/v3"
"go.dedis.ch/kyber/v3/sign/schnorr"
"go.dedis.ch/onet/v3/log"
"go.dedis.ch/onet/v3/network"
"go.dedis.ch/protobuf"
uuid "github.com/satori/go.uuid"
"go.dedis.ch/cothority/v3"
"go.dedis.ch/cothority/v3/skipchain"
)
func init() {
network.RegisterMessage(&Transaction{})
}
// TransactionVerifierID identifes the core transaction verification function.
var TransactionVerifierID = skipchain.VerifierID(uuid.NewV5(uuid.NamespaceURL, "evoting"))
// UnmarshalTransaction decodes a data blob to a transaction structure.
func UnmarshalTransaction(data []byte) *Transaction {
transaction := &Transaction{}
err := protobuf.DecodeWithConstructors(
data,
transaction,
network.DefaultConstructors(cothority.Suite),
)
if err != nil {
return nil
}
return transaction
}
// NewTransaction constructs a new transaction for the given arguments.
func NewTransaction(data interface{}, user uint32) *Transaction {
transaction := &Transaction{User: user}
switch data.(type) {
case *Master:
transaction.Master = data.(*Master)
case *Link:
transaction.Link = data.(*Link)
case *Election:
transaction.Election = data.(*Election)
case *Ballot:
transaction.Ballot = data.(*Ballot)
case *Mix:
transaction.Mix = data.(*Mix)
case *Partial:
transaction.Partial = data.(*Partial)
default:
return nil
}
return transaction
}
// Hash returns a hash of the transaction. For fields where
// protobuf is deterministic, hash those directly. For Election,
// encode the maps in deterministic order.
func (t *Transaction) Hash() []byte {
h := sha256.New()
if t.Election != nil {
// make a copy, remove maps
e := Election{}
e = *t.Election
e.Name = nil
e.Subtitle = nil
e.MoreInfoLang = nil
data, _ := protobuf.Encode(e)
h.Write(data)
// now hash maps in deterministic order
hashMap(h, t.Election.Name)
hashMap(h, t.Election.Subtitle)
hashMap(h, t.Election.MoreInfoLang)
// finally hash the user id in the tx
binary.Write(h, binary.LittleEndian, t.User)
} else {
sig := t.Signature
t.Signature = nil
data, _ := protobuf.Encode(t)
h.Write(data)
t.Signature = sig
}
return h.Sum(nil)
}
func hashMap(h io.Writer, m map[string]string) {
keys := make([]string, 0, len(m))
for k := range m {
keys = append(keys, k)
}
sort.Strings(keys)
for _, k := range keys {
h.Write([]byte(m[k]))
}
}
// Verify checks that the corresponding transaction is valid before storing it.
func (t *Transaction) Verify(genesis skipchain.SkipBlockID, s *skipchain.Service) error {
if t.Master != nil {
// Find the current master in order to compare against it.
m, err := GetMaster(s, genesis)
if err != nil {
// This chain does not exist, yet. Allow it to be created.
return nil
}
if !m.IsAdmin(t.User) {
return errors.New("current user was not in previous admin list")
}
// Changing this would not make any sense.
if !t.Master.ID.Equal(m.ID) {
return errors.New("mismatched ID in master update")
}
// All the other fields (admin list, roster, and front end key) may change, but
// let's apply some sanity checks to them.
if len(t.Master.Admins) == 0 {
return errors.New("empty admin list in master update")
}
if len(t.Master.Roster.List) == 0 {
return errors.New("empty roster in master update")
}
if !m.Roster.ID.Equal(t.Master.Roster.ID) {
log.Lvl2("Changing roster to:", t.Master.Roster.List)
}
null := t.Master.Key.Clone().Null()
if t.Master.Key.Equal(null) {
return errors.New("null key in master update")
}
return nil
} else if t.Link != nil {
master, err := GetMaster(s, genesis)
if err != nil {
return err
}
if !master.IsAdmin(t.User) {
return errors.New("link error: user not admin")
}
return nil
} else if t.Election != nil {
election := t.Election
if election.End < time.Now().Unix() {
return errors.New("open error: invalid end date")
}
master, err := GetMaster(s, election.Master)
if err != nil {
return err
}
if !master.IsAdmin(t.User) {
return errors.New("open error: user not admin")
}
return nil
} else if t.Ballot != nil {
null := cothority.Suite.Point().Null()
if t.Ballot.Alpha == nil || t.Ballot.Beta == nil {
return errors.New("alpha and beta must be non-nil")
}
if t.Ballot.Alpha.Equal(null) || t.Ballot.Beta.Equal(null) {
return errors.New("alpha and beta must be null points")
}
// t.User is trusted at this point, so make sure that they did not try to sneak
// through a different user-id in the ballot.
if t.User != t.Ballot.User {
return errors.New("ballot user-id differs from transaction user-id")
}
election, err := GetElection(s, genesis, false, t.User)
if err != nil {
return fmt.Errorf("could not get election: %v", err)
}
now := time.Now()
start := time.Unix(election.Start, 0)
end := time.Unix(election.End, 0)
if now.Before(start) {
return errors.New("election is not yet open")
}
if now.After(end) {
return errors.New("election is already closed")
}
latest, err := s.GetDB().GetLatest(s.GetDB().GetByID(election.ID))
transaction := UnmarshalTransaction(latest.Data)
if err != nil {
return err
}
if transaction.Mix != nil || transaction.Partial != nil {
return errors.New("cast error: election not in running stage")
} else if !election.IsUser(t.User) {
return errors.New("cast error: user not part")
}
return nil
} else if t.Mix != nil {
election, err := GetElection(s, genesis, false, t.User)
if err != nil {
return err
}
if !election.IsCreator(t.User) {
return errors.New("shuffle error: user is not election creator")
}
// verify proposer
_, proposer := election.Roster.Search(t.Mix.NodeID)
if proposer == nil {
return errors.New("didn't find signer in mix")
}
data, err := proposer.Public.MarshalBinary()
if err != nil {
return err
}
err = schnorr.Verify(cothority.Suite, proposer.Public, data, t.Mix.Signature)
if err != nil {
return err
}
mixes, err := election.Mixes(s)
if err != nil {
return err
}
if len(mixes) > 2*len(election.Roster.List)/3 {
return errors.New("shuffle error: election already shuffled")
}
for _, mix := range mixes {
_, mixProposer := election.Roster.Search(mix.NodeID)
if mixProposer == nil {
return errors.New("didn't find signer in mix")
}
if mixProposer.Public.Equal(proposer.Public) {
return fmt.Errorf("%s has already proposed a shuffle", mixProposer)
}
}
// check if Mix is valid
var x, y []kyber.Point
if len(mixes) == 0 {
// verify against Boxes
boxes, err := election.Box(s)
if err != nil {
return err
}
x, y = Split(boxes.Ballots)
} else {
// verify against the last mix
x, y = Split(mixes[len(mixes)-1].Ballots)
}
v, w := Split(t.Mix.Ballots)
err = Verify(t.Mix.Proof, election.Key, x, y, v, w)
if err != nil {
return err
}
return nil
} else if t.Partial != nil {
election, err := GetElection(s, genesis, false, t.User)
if err != nil {
return err
}
if !election.IsCreator(t.User) {
return errors.New("decrypt error: user is not election creator")
}
mixes, err := election.Mixes(s)
target := 2 * len(election.Roster.List) / 3
if err != nil {
return err
} else if len(mixes) <= target {
return errors.New("decrypt error: election not shuffled yet")
}
partials, err := election.Partials(s)
if len(partials) >= len(election.Roster.List) {
return errors.New("decrypt error: election already decrypted")
}
for _, partial := range partials {
if partial.NodeID.Equal(t.Partial.NodeID) {
return fmt.Errorf("%s has already proposed a partial", t.Partial.NodeID)
}
}
// verify proposer
_, proposer := election.Roster.Search(t.Partial.NodeID)
if proposer == nil {
return errors.New("didn't find node who created the partial")
}
data, err := proposer.Public.MarshalBinary()
if err != nil {
return err
}
err = schnorr.Verify(cothority.Suite, proposer.Public, data, t.Partial.Signature)
if err != nil {
return err
}
return nil
}
return errors.New("transaction error: empty transaction")
}