-
Notifications
You must be signed in to change notification settings - Fork 67
/
Copy pathverify_test.go
174 lines (158 loc) · 4.56 KB
/
verify_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
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
// Copyright 2023 Google LLC. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package main
import (
"context"
"crypto/sha256"
"encoding/base64"
"fmt"
"testing"
"github.com/google/trillian-examples/clone/logdb"
"github.com/transparency-dev/formats/log"
"github.com/transparency-dev/merkle/compact"
"github.com/transparency-dev/merkle/rfc6962"
"golang.org/x/mod/sumdb/note"
)
const (
testOrigin = "test log"
// golang.org/x/text v0.3.0 h1:g61tztE5qeGQ89tm6NTjjM9VPIm088od1l6aSorWRWg=
// golang.org/x/text v0.3.0/go.mod h1:NqM8EUOU14njkJ3fqMW+pc6Ldnwhi/IjpwHt7yyuwOQ=
leafFormat = "%s %s h1:%s\n%s %s/go.mod h1:%s\n"
)
func TestVerifyLeaves(t *testing.T) {
signer, verifier := genKeyPair(t, "testlog")
testCases := []struct {
desc string
leaves [][]byte
wantErr bool
}{
{
desc: "good",
leaves: [][]byte{
makeLeaf("apple", "v1.0.0", "salt"),
makeLeaf("ban/a/na", "v1.1.0", "salt"),
},
},
{
desc: "duplicate with same hash",
leaves: [][]byte{
makeLeaf("a", "v1.0.0", "salt"),
makeLeaf("b", "v1.1.0", "salt"),
makeLeaf("a", "v1.0.0", "salt"),
},
},
{
desc: "duplicate with different hash",
leaves: [][]byte{
makeLeaf("a", "v1.0.0", "salt"),
makeLeaf("b", "v1.1.0", "salt"),
makeLeaf("a", "v1.0.0", "spice"),
},
wantErr: true,
},
}
for _, tC := range testCases {
t.Run(tC.desc, func(t *testing.T) {
cp := newCP(t, tC.leaves, signer)
source := leafSource{
checkpoint: cp,
leaves: tC.leaves,
}
verifier := sumdbVerifier{
db: source,
origin: testOrigin,
verifier: verifier,
}
size, err := verifier.verifyLeaves(context.Background())
switch {
case err != nil && !tC.wantErr:
t.Fatalf("Got unexpected error %q", err)
case err == nil && tC.wantErr:
t.Fatal("Got no error, but wanted error")
case err != nil && tC.wantErr:
// expected error
default:
if got, want := size, uint64(len(tC.leaves)); got != want {
t.Errorf("expected %d but got %d", want, got)
}
}
})
}
}
func makeLeaf(mod, ver, salt string) []byte {
// repoHash and modHash are deterministically derived from {mod, version, salt} such
// that they are different from each other, but unique for any given input tuple.
repoHash := sha256.Sum256([]byte(mod + ver + salt))
repoHashString := base64.StdEncoding.EncodeToString(repoHash[:])
modHash := sha256.Sum256([]byte(ver + mod + salt))
modHashString := base64.StdEncoding.EncodeToString(modHash[:])
return []byte(fmt.Sprintf(leafFormat, mod, ver, repoHashString, mod, ver, modHashString))
}
type leafSource struct {
checkpoint []byte
leaves [][]byte
}
func (s leafSource) GetLatestCheckpoint(ctx context.Context) (size uint64, checkpoint []byte, compactRange [][]byte, err error) {
return uint64(len(s.leaves)), s.checkpoint, nil, nil
}
func (s leafSource) StreamLeaves(ctx context.Context, start, end uint64, out chan<- logdb.StreamResult) {
for _, v := range s.leaves {
out <- logdb.StreamResult{
Leaf: v,
}
}
close(out)
}
func newCP(t *testing.T, leaves [][]byte, sig note.Signer) []byte {
t.Helper()
rf := compact.RangeFactory{
Hash: rfc6962.DefaultHasher.HashChildren,
}
cr := rf.NewEmptyRange(0)
for _, l := range leaves {
if err := cr.Append(rfc6962.DefaultHasher.HashLeaf(l), nil); err != nil {
t.Fatal(err)
}
}
rootHash, err := cr.GetRootHash(nil)
if err != nil {
t.Fatal(err)
}
cp := log.Checkpoint{
Origin: testOrigin,
Size: uint64(len(leaves)),
Hash: rootHash,
}
ret, err := note.Sign(¬e.Note{Text: string(cp.Marshal())}, sig)
if err != nil {
t.Fatalf("Failed to sign note: %v", err)
}
return ret
}
func genKeyPair(t *testing.T, name string) (note.Signer, note.Verifier) {
t.Helper()
sKey, vKey, err := note.GenerateKey(nil, name)
if err != nil {
t.Fatalf("Failed to generate key %q: %v", name, err)
}
s, err := note.NewSigner(sKey)
if err != nil {
t.Fatalf("Failed to create signer %q: %v", name, err)
}
v, err := note.NewVerifier(vKey)
if err != nil {
t.Fatalf("Failed to create verifier %q: %v", name, err)
}
return s, v
}