This repository has been archived by the owner on Nov 16, 2021. It is now read-only.
/
balloon_test.go
1026 lines (921 loc) · 27.7 KB
/
balloon_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
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
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
package balloon
import (
"crypto/rand"
"errors"
"testing"
"github.com/mndrix/ps"
"github.com/pylls/balloon/util"
)
type TestEventStorage struct {
events ps.Map
}
func NewTestEventStorage() (storage *TestEventStorage) {
storage = new(TestEventStorage)
storage.events = ps.NewMap()
return
}
func (storage *TestEventStorage) Store(events []Event,
snap Snapshot) (err error) {
for _, event := range events {
storage.events = storage.events.Set(string(event.Key), event)
}
return nil
}
func (storage *TestEventStorage) LookupEvent(key []byte) (event *Event,
err error) {
e, exists := storage.events.Lookup(string(key))
if !exists {
return nil, errors.New("no such event")
}
var result Event
result.Key = (e.(Event)).Key
result.Value = (e.(Event)).Value
return &result, nil
}
func (storage *TestEventStorage) Clone() EventStorage {
clone := new(TestEventStorage)
clone.events = storage.events
return clone
}
func TestBalloon(t *testing.T) {
/*
Basics
*/
sk, vk, err := Genkey()
if err != nil {
t.Fatalf("failed to generate keys: %s", err)
}
// setup for an initially empty Balloon for the author
author, s0, err := Setup(nil, sk, vk, NewTestEventStorage())
if err != nil {
t.Fatalf("failed to setup balloon: %s", err)
}
// update the Balloon with some events
size := 10
events := make([]Event, size)
for i := 0; i < size; i++ {
k := make([]byte, util.HashOutputLen)
_, err = rand.Read(k)
if err != nil {
t.Fatalf("failed to read random bytes: %s", err)
}
events[i].Key = k
events[i].Value = util.Hash(k)
}
s1, err := author.Update(events, s0, sk)
if err != nil {
t.Fatalf("failed to update to s1: %s", err)
}
// for the server, create an empty balloon
server := NewBalloon(NewTestEventStorage())
// refresh with the initial empty events
err = server.Refresh(nil, nil, s0, vk)
if err != nil {
t.Fatalf("failed to do initial refresh: %s", err)
}
// refresh with events
err = server.Refresh(events, s0, s1, vk)
if err != nil {
t.Fatalf("failed to do refresh from s0 to s1: %s", err)
}
// create some more events, update, and refresh
for i := 0; i < size; i++ {
k := make([]byte, util.HashOutputLen)
_, err = rand.Read(k)
if err != nil {
t.Fatalf("failed to read random bytes: %s", err)
}
events[i].Key = k
events[i].Value = util.Hash(k)
}
s2, err := author.Update(events[:1], s1, sk)
if err != nil {
t.Fatalf("failed to update to 2: %s", err)
}
// refresh with events
err = server.Refresh(events[:1], s1, s2, vk)
if err != nil {
t.Fatalf("failed to do refresh from s1 to s2: %s", err)
}
/*
Membership queries
*/
// check if the event we just inserted into the Balloon exists in the latest snapshot
answer, event, proof, err := server.QueryMembership(events[0].Key, s2, vk)
if err != nil {
t.Fatalf("failed to perform a membership query: %s", err)
}
if !answer {
t.Fatal("got a false answer for a membership query that should have answered true")
}
if event == nil {
t.Fatal("got an empty event for a membership query that should have returned an event")
}
if !proof.Verify(events[0].Key, s2, s2, answer, event, vk) {
t.Fatal("failed to verify valid membership proof")
}
if proof.Size() == 0 {
t.Fatal("expected a non-zero sized membership proof")
}
// query for same event in previous snapshot, where it should not exist
answer, event, proof, err = server.QueryMembership(events[0].Key, s1, vk)
if err != nil {
t.Fatalf("failed to perform a membership query: %s", err)
}
if answer {
t.Fatal("got a true answer for a membership query that should have answered false")
}
if event != nil {
t.Fatal("got an event for a membership query that should have not returned an event")
}
if !proof.Verify(events[0].Key, s1, s2, answer, event, vk) {
t.Fatal("failed to verify valid membership proof")
}
// query for a random key in latest snapshot
key := make([]byte, util.HashOutputLen)
_, err = rand.Read(key)
if err != nil {
t.Fatalf("failed to read random bytes: %s", err)
}
answer, event, proof, err = server.QueryMembership(key, s2, vk)
if err != nil {
t.Fatalf("failed to perform a membership query: %s", err)
}
if answer {
t.Fatal("got a true answer for a membership query that should have answered false")
}
if event != nil {
t.Fatal("got an event for a membership query that should have not returned an event")
}
if !proof.Verify(key, s2, s2, answer, event, vk) {
t.Fatal("failed to verify valid membership proof")
}
// query for the random key in a prior snapshot
answer, event, proof, err = server.QueryMembership(key, s1, vk)
if err != nil {
t.Fatalf("failed to perform a membership query: %s", err)
}
if answer {
t.Fatal("got a true answer for a membership query that should have answered false")
}
if event != nil {
t.Fatal("got an event for a membership query that should have not returned an event")
}
if !proof.Verify(key, s1, s2, answer, event, vk) {
t.Fatal("failed to verify valid membership proof")
}
/*
Pruned queries
*/
// start with a prune query for events already inserted
answer, pproof := server.QueryPrune(events, vk, true)
if !pproof.Verify(events, answer, s2, vk) {
t.Fatal("failed to verify a valid query prune proof")
}
if answer {
t.Fatal("got a true reply to a prune query with old events")
}
if pproof.Size() == 0 {
t.Fatal("expected a non-zero sized membership proof")
}
// randomise events
for i := 0; i < size; i++ {
k := make([]byte, util.HashOutputLen)
_, err = rand.Read(k)
if err != nil {
t.Fatalf("failed to read random bytes: %s", err)
}
events[i].Key = k
events[i].Value = util.Hash(k)
}
// query again
answer, pproof = server.QueryPrune(events, vk, true)
if !pproof.Verify(events, answer, s2, vk) {
t.Fatal("failed to verify a valid query prune proof")
}
if !answer {
t.Fatal("got a false reply to a prune query with random events")
}
/*
Update using pruned queries
*/
s3u, err := pproof.Update(events, s2, sk)
if err != nil {
t.Fatalf("failed to update using prune: %s", err)
}
s3, err := author.Update(events, s2, sk)
if err != nil {
t.Fatalf("failed to update to 3: %s", err)
}
if !util.Equal(s3.Roots.History, s3u.Roots.History) {
t.Fatal("Update (prune) produced a different history tree root")
}
if !util.Equal(s3.Roots.Treap, s3u.Roots.Treap) {
t.Fatal("Update (prune) produced a different hash treap root")
}
if s3.Roots.Version != s3u.Roots.Version {
t.Fatal("Update (prune) produced a different version")
}
/*
Use RefreshVerify at the server
*/
if !server.RefreshVerify(events, s2, s3, vk) {
t.Fatal("failed to refresh verify at server from 2 to 3")
}
}
func TestBalloonDetails(t *testing.T) {
// More specific tests for test coverage
// setup for an initially empty Balloon for an author
sk, vk, err := Genkey()
if err != nil {
t.Fatalf("failed to generate keys: %s", err)
}
author, s0, err := Setup(nil, sk, vk, NewTestEventStorage())
if err != nil {
t.Fatalf("failed to setup balloon: %s", err)
}
// update the Balloon with some events
size := 10
events := make([]Event, size)
for i := 0; i < size; i++ {
k := make([]byte, util.HashOutputLen)
_, err = rand.Read(k)
if err != nil {
t.Fatalf("failed to read random bytes: %s", err)
}
events[i].Key = k
events[i].Value = util.Hash(k)
}
snapUpdate, err := author.Update(events, s0, sk)
if err != nil {
t.Fatalf("failed to update to s1: %s", err)
}
// create a second balloon, but use Setup directly
_, snapSetup, err := Setup(events, sk, vk, NewTestEventStorage())
if err != nil {
t.Fatalf("failed to setup balloon: %s", err)
}
if snapUpdate.Roots.Version != snapSetup.Roots.Version ||
!util.Equal(snapUpdate.Roots.History, snapSetup.Roots.History) ||
!util.Equal(snapUpdate.Roots.Treap, snapSetup.Roots.Treap) {
t.Fatal("snapshots using Update and Setup differ")
}
// Refresh
server := NewBalloon(NewTestEventStorage())
err = server.Refresh(nil, nil, s0, vk)
if err != nil {
t.Fatalf("failed to do initial refresh: %s", err)
}
err = server.Refresh(events, nil, snapUpdate, vk)
if err == nil {
t.Fatalf("did Refresh with wrong current snapshot")
}
err = server.Refresh(events, s0, snapUpdate, vk)
if err != nil {
t.Fatalf("failed to refresh from s0 to snapSetup: %s", err)
}
err = server.Refresh(events, nil, snapUpdate, vk)
if err == nil {
t.Fatalf("did Refresh with wrong current snapshot")
}
err = server.Refresh(events, snapUpdate, snapUpdate, vk)
if err == nil {
t.Fatalf("did Refresh with wrong current snapshot")
}
err = server.Refresh(events, s0, snapUpdate, vk)
if err == nil {
t.Fatalf("did Refresh with wrong current snapshot")
}
// Setup
events = make([]Event, size)
_, _, err = Setup(events, sk, vk, NewTestEventStorage())
if err == nil {
t.Fatal("successfully Setup with nil event keys and values")
}
// Update
_, err = author.Update(events, snapUpdate, sk)
if err == nil {
t.Fatal("successfully Update with nil event keys and values")
}
_, err = author.Update(events, s0, sk)
if err == nil {
t.Fatal("successfully Update with old snapshot")
}
events = make([]Event, 0, size)
_, err = author.Update(events, snapUpdate, sk)
if err == nil {
t.Fatal("successfully Update with no events")
}
// QueryMembership
_, _, _, err = author.QueryMembership([]byte("too short key"), s0, vk)
if err == nil {
t.Fatalf("membership query for too short key: %s", err)
}
// flip every byte in the signature of the snapshot
for i := range s0.Signature {
s0.Signature[i] ^= 0x40
_, _, _, err = author.QueryMembership(util.Hash([]byte("a valid key")), s0, vk)
if err == nil {
t.Fatalf("membership query for invalid signature: %s", err)
}
s0.Signature[i] ^= 0x40
}
}
func TestMembershipQueryProofFlip(t *testing.T) {
/*
Create a Balloon with size events.
*/
size := 10
sk, vk, err := Genkey()
if err != nil {
t.Fatalf("failed to generate keys: %s", err)
}
balloon, s0, err := Setup(nil, sk, vk, NewTestEventStorage())
if err != nil {
t.Fatalf("failed to setup balloon: %s", err)
}
events := make([]Event, size)
for i := 0; i < size; i++ {
k := make([]byte, util.HashOutputLen)
_, err = rand.Read(k)
if err != nil {
t.Fatalf("failed to read random bytes: %s", err)
}
events[i].Key = k
events[i].Value = util.Hash(k)
}
s1, err := balloon.Update(events, s0, sk)
if err != nil {
t.Fatalf("failed to update to s1: %s", err)
}
// create a membership query for an event that exists, such that
// the proof consists of nodes in both the hash treap and the
// history tree
answer, event, proof, err := balloon.QueryMembership(events[0].Key, s1, vk)
if err != nil {
t.Fatalf("failed to perform membership query: %s", err)
}
if !proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("failed to verify valid membership proof and arguments")
}
/*
OK, now we start systematically tampering with the proof and arguments
to Verify to make sure that any changes are detected
*/
// flip every byte in the key
for i := range events[0].Key {
events[0].Key[i] ^= 0x40
if proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
events[0].Key[i] ^= 0x40
}
// flip every byte in the root of the history tree in the snapshot
for i := range s1.Roots.History {
s1.Roots.History[i] ^= 0x40
if proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s1.Roots.History[i] ^= 0x40
}
// flip every byte in the root of the hash treap in the snapshot
for i := range s1.Roots.Treap {
s1.Roots.Treap[i] ^= 0x40
if proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s1.Roots.Treap[i] ^= 0x40
}
// flip every byte in the signature of the snapshot
for i := range s1.Signature {
s1.Signature[i] ^= 0x40
if proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
if proof.Verify(events[0].Key, s0, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s1.Signature[i] ^= 0x40
}
// flip every byte in the previous signature of the snapshot
for i := range s1.Previous {
s1.Previous[i] ^= 0x40
if proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
if proof.Verify(events[0].Key, s0, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s1.Previous[i] ^= 0x40
}
// change the version of the snapshot
s1.Roots.Version++
if proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s1.Roots.Version--
// flip answer
if proof.Verify(events[0].Key, s1, s1, !answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
// flip every byte in the event key
for i := range event.Key {
event.Key[i] ^= 0x40
if proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
event.Key[i] ^= 0x40
}
// flip every byte in the event value
for i := range event.Value {
event.Value[i] ^= 0x40
if proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
event.Value[i] ^= 0x40
}
// flip every byte in the verification key
for i := range vk {
vk[i] ^= 0x40
if proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
vk[i] ^= 0x40
}
// flip every byte in event of the history tree proof
for i := range proof.HistoryProof.Event {
proof.HistoryProof.Event[i] ^= 0x40
if proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
proof.HistoryProof.Event[i] ^= 0x40
}
// flip every byte in root of the history tree proof
for i := range proof.HistoryProof.Root {
proof.HistoryProof.Root[i] ^= 0x40
if proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
proof.HistoryProof.Root[i] ^= 0x40
}
// flip the index history tree proof
proof.HistoryProof.Index++
if proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
proof.HistoryProof.Index--
// flip the version history tree proof
proof.HistoryProof.Version++
if proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
proof.HistoryProof.Version--
// for each node in the history tree proof
for i := range proof.HistoryProof.Nodes {
// flip each byte in the hash of the node
for j := range proof.HistoryProof.Nodes[i].Hash {
proof.HistoryProof.Nodes[i].Hash[j] ^= 0x40
if proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
proof.HistoryProof.Nodes[i].Hash[j] ^= 0x40
}
// flip index in position
proof.HistoryProof.Nodes[i].Position.Index++
if proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
proof.HistoryProof.Nodes[i].Position.Index--
// flip layer in position
proof.HistoryProof.Nodes[i].Position.Layer++
if proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
proof.HistoryProof.Nodes[i].Position.Layer--
}
// flip every byte in the key of the hash treap proof
for i := range proof.TreapProof.Key {
proof.TreapProof.Key[i] ^= 0x40
if proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
proof.TreapProof.Key[i] ^= 0x40
}
// flip every byte in the value of the hash treap proof
for i := range proof.TreapProof.Value {
proof.TreapProof.Value[i] ^= 0x40
if proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
proof.TreapProof.Value[i] ^= 0x40
}
// for each node in the hash treap proof
for i := range proof.TreapProof.Nodes {
// flip every byte in the hash of the node
for j := range proof.TreapProof.Nodes[i].Hash {
proof.TreapProof.Nodes[i].Hash[j] ^= 0x40
if proof.Verify(events[0].Key, s1, s1, answer, event, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
proof.TreapProof.Nodes[i].Hash[j] ^= 0x40
}
// Note that we _cannot_ detect flips in a proof node's key and value when
// the node's key and value are only used to place the node's hash either
// left or right along the verified authenticated path in the hash treap.
// This is not a security issue for the queries that make up Balloon,
// but very well may be for other types of queries not specified in the
// design of Balloon.
}
}
func TestPruneQueryProofFlip(t *testing.T) {
/*
Create a Balloon with size events.
*/
size := 10
sk, vk, err := Genkey()
if err != nil {
t.Fatalf("failed to generate keys: %s", err)
}
balloon, s0, err := Setup(nil, sk, vk, NewTestEventStorage())
if err != nil {
t.Fatalf("failed to setup balloon: %s", err)
}
events := make([]Event, size)
for i := 0; i < size; i++ {
k := make([]byte, util.HashOutputLen)
_, err = rand.Read(k)
if err != nil {
t.Fatalf("failed to read random bytes: %s", err)
}
events[i].Key = k
events[i].Value = util.Hash(k)
}
s1, err := balloon.Update(events, s0, sk)
if err != nil {
t.Fatalf("failed to update to s1: %s", err)
}
// a prune query for new random events, to get paths in both the hash treap
// and the history tree
for i := 0; i < size; i++ {
k := make([]byte, util.HashOutputLen)
_, err = rand.Read(k)
if err != nil {
t.Fatalf("failed to read random bytes: %s", err)
}
events[i].Key = k
events[i].Value = util.Hash(k)
}
answer, proof := balloon.QueryPrune(events, vk, true)
if !proof.Verify(events, answer, s1, vk) {
t.Fatal("failed to verify a valid query prune proof")
}
if !answer {
t.Fatal("got a false reply to a prune query with old events")
}
/*
OK, now we start systematically tampering with the proof and arguments
to Verify to make sure that any changes are detected
*/
// flip answer
if proof.Verify(events, !answer, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
// flip every byte in the root of the history tree in the snapshot
for i := range s1.Roots.History {
s1.Roots.History[i] ^= 0x40
if proof.Verify(events, answer, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s1.Roots.History[i] ^= 0x40
}
// flip every byte in the root of the hash treap in the snapshot
for i := range s1.Roots.Treap {
s1.Roots.Treap[i] ^= 0x40
if proof.Verify(events, answer, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s1.Roots.Treap[i] ^= 0x40
}
// flip every byte in the signature of the snapshot
for i := range s1.Signature {
s1.Signature[i] ^= 0x40
if proof.Verify(events, answer, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s1.Signature[i] ^= 0x40
}
// flip every byte in the previous signature of the snapshot
for i := range s1.Previous {
s1.Previous[i] ^= 0x40
if proof.Verify(events, answer, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s1.Previous[i] ^= 0x40
}
// change the version of the snapshot
s1.Roots.Version++
if proof.Verify(events, answer, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s1.Roots.Version--
// flip every byte in the verification key
for i := range vk {
vk[i] ^= 0x40
if proof.Verify(events, answer, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
vk[i] ^= 0x40
}
// flip every byte in the event key in the proof
for i := range proof.Event.Key {
proof.Event.Key[i] ^= 0x40
if proof.Verify(events, answer, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
proof.Event.Key[i] ^= 0x40
}
// flip every byte in the event value in the proof
for i := range proof.Event.Value {
proof.Event.Value[i] ^= 0x40
if proof.Verify(events, answer, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
proof.Event.Value[i] ^= 0x40
}
// flip every byte in the key of the treap part of the proof
for i := range proof.TreapProof.Key {
proof.TreapProof.Key[i] ^= 0x40
if proof.Verify(events, answer, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
proof.TreapProof.Key[i] ^= 0x40
}
// for each node in the hash treap proof
for i := range proof.TreapProof.Nodes {
// flip every byte in the hash of the node
for j := range proof.TreapProof.Nodes[i].Hash {
proof.TreapProof.Nodes[i].Hash[j] ^= 0x40
if proof.Verify(events, answer, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
proof.TreapProof.Nodes[i].Hash[j] ^= 0x40
}
// Note that we _cannot_ detect flips in a proof node's key and value when
// the node's key and value are only used to place the node's hash either
// left or right along the verified authenticated path in the hash treap.
// This is not a security issue for the queries that make up Balloon,
// but very well may be for other types of queries not specified in the
// design of Balloon.
}
// always possible to add no events
if !proof.Verify(nil, true, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
}
func TestRefreshVerifyFlip(t *testing.T) {
size := 10
sk, vk, err := Genkey()
if err != nil {
t.Fatalf("failed to generate keys: %s", err)
}
balloon, s0, err := Setup(nil, sk, vk, NewTestEventStorage())
if err != nil {
t.Fatalf("failed to setup balloon: %s", err)
}
events := make([]Event, size)
for i := 0; i < size; i++ {
k := make([]byte, util.HashOutputLen)
_, err = rand.Read(k)
if err != nil {
t.Fatalf("failed to read random bytes: %s", err)
}
events[i].Key = k
events[i].Value = util.Hash(k)
}
s1, err := balloon.Update(events, s0, sk)
if err != nil {
t.Fatalf("failed to update to s1: %s", err)
}
server := NewBalloon(NewTestEventStorage())
if !server.RefreshVerify(nil, nil, s0, vk) {
t.Fatalf("failed to do initial refresh: %s", err)
}
clone := server.Clone()
if !server.RefreshVerify(events, s0, s1, vk) {
t.Fatalf("failed to do initial refresh: %s", err)
}
// flip events
for i := range events {
for j := range events[i].Key {
// we need to do this since sort in RefreshVerify
// may change the order of the slice based on key or value
key := events[i].Key
key[j] ^= 0x40
if clone.RefreshVerify(events, s0, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
key[j] ^= 0x40
}
for j := range events[i].Value {
value := events[i].Value
value[j] ^= 0x40
if clone.RefreshVerify(events, s0, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
value[j] ^= 0x40
}
}
// flip snapshot s0
s0.Index++
if clone.RefreshVerify(events, s0, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s0.Index--
s0.Roots.Version++
if clone.RefreshVerify(events, s0, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s0.Roots.Version--
for i := range s0.Roots.History {
s0.Roots.History[i] ^= 0x40
if clone.RefreshVerify(events, s0, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s0.Roots.History[i] ^= 0x40
}
for i := range s0.Roots.Treap {
s0.Roots.Treap[i] ^= 0x40
if clone.RefreshVerify(events, s0, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s0.Roots.Treap[i] ^= 0x40
}
for i := range s0.Signature {
s0.Signature[i] ^= 0x40
if clone.RefreshVerify(events, s0, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s0.Signature[i] ^= 0x40
}
// flip snapshot s1
s1.Index++
if clone.RefreshVerify(events, s0, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s1.Index--
s1.Roots.Version++
if clone.RefreshVerify(events, s0, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s1.Roots.Version--
for i := range s1.Roots.History {
s1.Roots.History[i] ^= 0x40
if clone.RefreshVerify(events, s0, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s1.Roots.History[i] ^= 0x40
}
for i := range s1.Roots.Treap {
s1.Roots.Treap[i] ^= 0x40
if clone.RefreshVerify(events, s0, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s1.Roots.Treap[i] ^= 0x40
}
for i := range s1.Signature {
s1.Signature[i] ^= 0x40
if clone.RefreshVerify(events, s0, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s1.Signature[i] ^= 0x40
}
for i := range s1.Previous {
s1.Previous[i] ^= 0x40
if clone.RefreshVerify(events, s0, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
s1.Previous[i] ^= 0x40
}
// flip verification key
for i := range vk {
vk[i] ^= 0x40
if clone.RefreshVerify(events, s0, s1, vk) {
t.Fatal("verified an invalid proof and/or argument")
}
vk[i] ^= 0x40
}
// see that the clone works
if !clone.RefreshVerify(events, s0, s1, vk) {
t.Fatal("broken clone")
}
}
func TestClone(t *testing.T) {
size := 10
sk, vk, err := Genkey()
if err != nil {
t.Fatalf("failed to generate keys: %s", err)
}
balloon, s0, err := Setup(nil, sk, vk, NewTestEventStorage())
if err != nil {
t.Fatalf("failed to setup balloon: %s", err)
}
clone0 := balloon.Clone()
if !clone0.latestsnapshot.Equal(s0) {
t.Fatal("clone has different snapshot")
}
events := make([]Event, size)
for i := 0; i < size; i++ {
k := make([]byte, util.HashOutputLen)
_, err = rand.Read(k)
if err != nil {
t.Fatalf("failed to read random bytes: %s", err)
}
events[i].Key = k
events[i].Value = util.Hash(k)
}
s1, err := balloon.Update(events, s0, sk)
if err != nil {
t.Fatalf("failed to update to s1: %s", err)
}
s1c, err := clone0.Update(events, s0, sk)
if err != nil {
t.Fatalf("failed to update to s1: %s", err)
}
if !s1c.Equal(s1) {
t.Fatal("clone has different snapshot")
}
}
func TestEqualSnapshot(t *testing.T) {
size := 10
sk, vk, err := Genkey()
if err != nil {
t.Fatalf("failed to generate keys: %s", err)
}
balloon, s0, err := Setup(nil, sk, vk, NewTestEventStorage())
if err != nil {
t.Fatalf("failed to setup balloon: %s", err)
}
events := make([]Event, size)
for i := 0; i < size; i++ {
k := make([]byte, util.HashOutputLen)
_, err = rand.Read(k)
if err != nil {
t.Fatalf("failed to read random bytes: %s", err)
}
events[i].Key = k
events[i].Value = util.Hash(k)
}
s1, err := balloon.Update(events, s0, sk)
if err != nil {
t.Fatalf("failed to update to s1: %s", err)
}
if !s1.Equal(s1) {
t.Fatal("the smae snapshot is not equal with itself")
}
if s1.Equal(s0) {
t.Fatal("two different snapshots are equal")
}
}
func TestPrune(t *testing.T) {
size := 3
runs := 4
sk, vk, err := Genkey()
if err != nil {
t.Fatalf("failed to generate keys: %s", err)
}
_, current, err := Setup(nil, sk, vk, NewTestEventStorage())
if err != nil {
t.Fatalf("failed to setup balloon: %s", err)
}
server := NewBalloon(NewTestEventStorage())
if !server.RefreshVerify(nil, nil, current, vk) {
t.Fatal("failed to refresh to s0")
}
for i := 1; i <= runs; i++ {
events := make([]Event, size)
for j := 0; j < size; j++ {
k := make([]byte, util.HashOutputLen)
_, err = rand.Read(k)
if err != nil {