/
user.go
980 lines (840 loc) · 25.3 KB
/
user.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
// Copyright 2015 Keybase, Inc. All rights reserved. Use of
// this source code is governed by the included BSD license.
package libkb
import (
"encoding/hex"
"errors"
"fmt"
"io"
"regexp"
keybase1 "github.com/adamwalz/keybase-client/go/protocol/keybase1"
stellar1 "github.com/adamwalz/keybase-client/go/protocol/stellar1"
jsonw "github.com/keybase/go-jsonw"
)
type UserBasic interface {
GetUID() keybase1.UID
GetName() string
}
var _ UserBasic = keybase1.UserPlusKeys{}
type User struct {
// Raw JSON element read from the server or our local DB.
basics *jsonw.Wrapper
publicKeys *jsonw.Wrapper
pictures *jsonw.Wrapper
// Processed fields
id keybase1.UID
name string
sigChainMem *SigChain
idTable *IdentityTable
sigHints *SigHints
status keybase1.StatusCode
leaf MerkleUserLeaf
// Loaded from publicKeys
keyFamily *KeyFamily
// Available on partially-copied clones of the User object
ckfShallowCopy *ComputedKeyFamily
dirty bool
Contextified
}
func NewUserThin(name string, uid keybase1.UID) *User {
return &User{name: name, id: uid}
}
func newUser(g *GlobalContext, o *jsonw.Wrapper, fromStorage bool) (*User, error) {
uid, err := GetUID(o.AtKey("id"))
if err != nil {
return nil, fmt.Errorf("user object lacks an ID: %s", err)
}
name, err := o.AtKey("basics").AtKey("username").GetString()
if err != nil {
return nil, fmt.Errorf("user object for %s lacks a name", uid)
}
// This field was a late addition, so cached objects might not have it.
// If we load from storage and it wasn't there, then it's safe to assume
// it's a 0. All server replies should have this field though.
status, err := o.AtPath("basics.status").GetInt()
if err != nil {
if fromStorage {
status = SCOk
} else {
return nil, fmt.Errorf("user object for %s lacks a status field", uid)
}
}
kf, err := ParseKeyFamily(g, o.AtKey("public_keys"))
if err != nil {
return nil, err
}
return &User{
basics: o.AtKey("basics"),
publicKeys: o.AtKey("public_keys"),
pictures: o.AtKey("pictures"),
keyFamily: kf,
id: uid,
name: name,
status: keybase1.StatusCode(status),
dirty: false,
Contextified: NewContextified(g),
}, nil
}
func NewUserFromServer(g *GlobalContext, o *jsonw.Wrapper) (*User, error) {
u, e := newUser(g, o, false)
if e == nil {
u.dirty = true
}
return u, e
}
func NewUserFromLocalStorage(g *GlobalContext, o *jsonw.Wrapper) (*User, error) {
u, err := newUser(g, o, true)
return u, err
}
func (u *User) GetNormalizedName() NormalizedUsername { return NewNormalizedUsername(u.name) }
func (u *User) GetName() string { return u.name }
func (u *User) GetUID() keybase1.UID { return u.id }
func (u *User) GetStatus() keybase1.StatusCode { return u.status }
func (u *User) GetSalt() (salt []byte, err error) {
saltHex, err := u.basics.AtKey("salt").GetString()
if err != nil {
return nil, err
}
salt, err = hex.DecodeString(saltHex)
if err != nil {
return nil, err
}
return salt, nil
}
func (u *User) GetIDVersion() (int64, error) {
return u.basics.AtKey("id_version").GetInt64()
}
func (u *User) GetSigChainLastKnownSeqno() keybase1.Seqno {
if u.sigChain() == nil {
return 0
}
return u.sigChain().GetLastKnownSeqno()
}
func (u *User) GetSigChainLastKnownID() LinkID {
if u.sigChain() == nil {
return nil
}
return u.sigChain().GetLastKnownID()
}
func (u *User) GetCurrentEldestSeqno() keybase1.Seqno {
if u.sigChain() == nil {
// Note that NameWithEldestSeqno will return an error if you call it with zero.
return 0
}
return u.sigChain().currentSubchainStart
}
func (u *User) GetExpectedNextHighSkip(mctx MetaContext) (HighSkip, error) {
if u.sigChain() == nil {
return NewInitialHighSkip(), nil
}
return u.sigChain().GetExpectedNextHighSkip(mctx, u.GetUID())
}
func (u *User) GetLastLink() *ChainLink {
if u.sigChain() == nil {
return nil
}
return u.sigChain().GetLastLink()
}
func (u *User) ToUserVersion() keybase1.UserVersion {
return keybase1.UserVersion{
Uid: u.GetUID(),
EldestSeqno: u.GetCurrentEldestSeqno(),
}
}
func (u *User) IsNewerThan(v *User) (bool, error) {
var idvU, idvV int64
var err error
idvU, err = u.GetIDVersion()
if err != nil {
return false, err
}
idvV, err = v.GetIDVersion()
if err != nil {
return false, err
}
return ((idvU > idvV && u.GetSigChainLastKnownSeqno() >= v.GetSigChainLastKnownSeqno()) ||
(idvU >= idvV && u.GetSigChainLastKnownSeqno() > v.GetSigChainLastKnownSeqno())), nil
}
func (u *User) GetKeyFamily() *KeyFamily {
return u.keyFamily
}
func (u *User) GetComputedKeyInfos() *ComputedKeyInfos {
if u.sigChain() == nil {
return nil
}
return u.sigChain().GetComputedKeyInfos()
}
func (u *User) GetSigHintsVersion() int {
if u.sigHints == nil {
return 0
}
return u.sigHints.version
}
func (u *User) GetComputedKeyFamily() (ret *ComputedKeyFamily) {
if u.sigChain() != nil && u.keyFamily != nil {
cki := u.sigChain().GetComputedKeyInfos()
if cki == nil {
return nil
}
ret = &ComputedKeyFamily{cki: cki, kf: u.keyFamily, Contextified: u.Contextified}
} else if u.ckfShallowCopy != nil {
ret = u.ckfShallowCopy
}
return ret
}
// GetActivePGPKeys looks into the user's ComputedKeyFamily and
// returns only the active PGP keys. If you want only sibkeys, then
// specify sibkey=true.
func (u *User) GetActivePGPKeys(sibkey bool) (ret []*PGPKeyBundle) {
if ckf := u.GetComputedKeyFamily(); ckf != nil {
ret = ckf.GetActivePGPKeys(sibkey)
}
return
}
// FilterActivePGPKeys returns the active pgp keys that match
// query.
func (u *User) FilterActivePGPKeys(sibkey bool, query string) []*PGPKeyBundle {
keys := u.GetActivePGPKeys(sibkey)
var res []*PGPKeyBundle
for _, k := range keys {
if KeyMatchesQuery(k, query, false) {
res = append(res, k)
}
}
return res
}
// GetActivePGPFingerprints looks into the user's ComputedKeyFamily and
// returns only the fingerprint of the active PGP keys.
// If you want only sibkeys, then // specify sibkey=true.
func (u *User) GetActivePGPFingerprints(sibkey bool) (ret []PGPFingerprint) {
for _, pgp := range u.GetActivePGPKeys(sibkey) {
ret = append(ret, pgp.GetFingerprint())
}
return
}
func (u *User) GetActivePGPKIDs(sibkey bool) (ret []keybase1.KID) {
for _, pgp := range u.GetActivePGPKeys(sibkey) {
ret = append(ret, pgp.GetKID())
}
return
}
func (u *User) GetDeviceSibkey() (GenericKey, error) {
did := u.G().Env.GetDeviceIDForUsername(u.GetNormalizedName())
if did.IsNil() {
return nil, NotProvisionedError{}
}
ckf := u.GetComputedKeyFamily()
if ckf == nil {
return nil, KeyFamilyError{"no key family available"}
}
return ckf.GetSibkeyForDevice(did)
}
func (u *User) GetDeviceSubkey() (subkey GenericKey, err error) {
ckf := u.GetComputedKeyFamily()
if ckf == nil {
err = KeyFamilyError{"no key family available"}
return
}
did := u.G().Env.GetDeviceIDForUsername(u.GetNormalizedName())
if did.IsNil() {
err = NotProvisionedError{}
return
}
return ckf.GetEncryptionSubkeyForDevice(did)
}
func (u *User) HasEncryptionSubkey() bool {
if ckf := u.GetComputedKeyFamily(); ckf != nil {
return ckf.HasActiveEncryptionSubkey()
}
return false
}
func (u *User) CheckBasicsFreshness(server int64) (current bool, reason string, err error) {
var stored int64
if stored, err = u.GetIDVersion(); err != nil {
return false, "", err
}
if stored >= server {
u.G().Log.Debug("| Local basics version is up-to-date @ version %d", stored)
return true, "", nil
}
u.G().Log.Debug("| Local basics version is out-of-date: %d < %d", stored, server)
return false, fmt.Sprintf("idv %v < %v", stored, server), nil
}
func (u *User) StoreSigChain(m MetaContext) error {
var err error
if u.sigChain() != nil {
err = u.sigChain().Store(m)
}
return err
}
func (u *User) LoadSigChains(m MetaContext, f *MerkleUserLeaf, self bool, stubMode StubMode) (err error) {
defer TimeLog(fmt.Sprintf("LoadSigChains: %s", u.name), u.G().Clock().Now(), u.G().Log.Debug)
loader := SigChainLoader{
user: u,
self: self,
leaf: f,
chainType: PublicChain,
preload: u.sigChain(),
stubMode: stubMode,
MetaContextified: NewMetaContextified(m),
}
u.sigChainMem, err = loader.Load()
// Eventually load the others, but for now, this one is good enough
return err
}
func (u *User) Store(m MetaContext) error {
m.Debug("+ Store user %s", u.name)
// These might be dirty, in which case we can write it back
// to local storage. Note, this can be dirty even if the user is clean.
if err := u.sigHints.Store(m); err != nil {
return err
}
if !u.dirty {
m.Debug("- Store for %s skipped; user wasn't dirty", u.name)
return nil
}
if err := u.StoreSigChain(m); err != nil {
return err
}
if err := u.StoreTopLevel(m); err != nil {
return err
}
u.dirty = false
m.Debug("- Store user %s -> OK", u.name)
return nil
}
func (u *User) StoreTopLevel(m MetaContext) error {
jw := jsonw.NewDictionary()
err := jw.SetKey("id", UIDWrapper(u.id))
if err != nil {
return err
}
err = jw.SetKey("basics", u.basics)
if err != nil {
return err
}
err = jw.SetKey("public_keys", u.publicKeys)
if err != nil {
return err
}
err = jw.SetKey("pictures", u.pictures)
if err != nil {
return err
}
err = u.G().LocalDb.Put(
DbKeyUID(DBUser, u.id),
[]DbKey{{Typ: DBLookupUsername, Key: u.name}},
jw,
)
if err != nil {
m.Debug("StoreTopLevel -> %s", ErrToOk(err))
}
return err
}
func (u *User) SyncedSecretKey(m MetaContext) (ret *SKB, err error) {
if lctx := m.LoginContext(); lctx != nil {
return u.getSyncedSecretKeyLogin(m, lctx)
}
return u.GetSyncedSecretKey(m)
}
func (u *User) getSyncedSecretKeyLogin(m MetaContext, lctx LoginContext) (ret *SKB, err error) {
defer m.Trace("User#getSyncedSecretKeyLogin", &err)()
if err = lctx.RunSecretSyncer(m, u.id); err != nil {
return
}
ckf := u.GetComputedKeyFamily()
if ckf == nil {
m.Debug("| short-circuit; no Computed key family")
return
}
ret, err = lctx.SecretSyncer().FindActiveKey(ckf)
return
}
func (u *User) SyncedSecretKeyWithSka(m MetaContext, ska SecretKeyArg) (ret *SKB, err error) {
keys, err := u.GetSyncedSecretKeys(m)
if err != nil {
return nil, err
}
var errors []error
for _, key := range keys {
pub, err := key.GetPubKey()
if err != nil {
errors = append(errors, err)
continue
}
if KeyMatchesQuery(pub, ska.KeyQuery, ska.ExactMatch) {
return key, nil
}
}
if len(errors) > 0 {
// No matching key found and we hit errors.
return nil, CombineErrors(errors...)
}
return nil, NoSecretKeyError{}
}
func (u *User) GetSyncedSecretKey(m MetaContext) (ret *SKB, err error) {
defer m.Trace("User#GetSyncedSecretKey", &err)()
skbs, err := u.GetSyncedSecretKeys(m)
if err != nil {
return nil, err
}
if len(skbs) == 0 {
return nil, nil
}
m.Debug("NOTE: using GetSyncedSecretKey, returning first secret key from randomly ordered map")
return skbs[0], nil
}
func (u *User) GetSyncedSecretKeys(m MetaContext) (ret []*SKB, err error) {
defer m.Trace("User#GetSyncedSecretKeys", &err)()
if err = u.SyncSecrets(m); err != nil {
return
}
ckf := u.GetComputedKeyFamily()
if ckf == nil {
m.Debug("| short-circuit; no Computed key family")
return
}
syncer, err := m.SyncSecrets()
if err != nil {
return nil, err
}
ret, err = syncer.FindActiveKeys(ckf)
return ret, err
}
// AllSyncedSecretKeys returns all the PGP key blocks that were
// synced to API server. LoginContext can be nil if this isn't
// used while logging in, signing up.
func (u *User) AllSyncedSecretKeys(m MetaContext) (keys []*SKB, err error) {
defer m.Trace("User#AllSyncedSecretKeys", &err)()
m.Dump()
ss, err := m.SyncSecretsForUID(u.GetUID())
if err != nil {
return nil, err
}
ckf := u.GetComputedKeyFamily()
if ckf == nil {
m.Debug("| short-circuit; no Computed key family")
return nil, nil
}
keys = ss.AllActiveKeys(ckf)
return keys, nil
}
func (u *User) SyncSecrets(m MetaContext) error {
_, err := m.SyncSecretsForUID(u.GetUID())
return err
}
// May return an empty KID
func (u *User) GetEldestKID() (ret keybase1.KID) {
return u.leaf.eldest
}
func (u *User) GetPublicChainTail() *MerkleTriple {
if u.sigChainMem == nil {
return nil
}
return u.sigChain().GetCurrentTailTriple()
}
func (u *User) IDTable() *IdentityTable {
return u.idTable
}
// Return the active stellar public address for a user.
// Returns nil if there is none or it has not been loaded.
func (u *User) StellarAccountID() *stellar1.AccountID {
if u.idTable == nil {
return nil
}
return u.idTable.StellarAccountID()
}
func (u *User) sigChain() *SigChain {
return u.sigChainMem
}
func (u *User) MakeIDTable(m MetaContext) error {
kid := u.GetEldestKID()
if kid.IsNil() {
return NoKeyError{"Expected a key but didn't find one"}
}
idt, err := NewIdentityTable(m, kid, u.sigChain(), u.sigHints)
if err != nil {
return err
}
u.idTable = idt
return nil
}
// GetHighLinkSeqnos gets the list of all high links in the user's sigchain ascending.
func (u *User) GetHighLinkSeqnos(mctx MetaContext) (res []keybase1.Seqno, err error) {
sigChain := u.sigChain()
if sigChain == nil {
return nil, fmt.Errorf("no user sigchain")
}
for _, c := range sigChain.chainLinks {
high, err := c.IsHighUserLink(mctx, u.GetUID())
if err != nil {
return nil, fmt.Errorf("error determining link %v", c.GetSeqno())
}
if high {
res = append(res, c.GetSeqno())
}
}
return res, nil
}
func (u *User) VerifySelfSig() error {
u.G().Log.Debug("+ VerifySelfSig for user %s", u.name)
if u.IDTable().VerifySelfSig(u.GetNormalizedName(), u.id) {
u.G().Log.Debug("- VerifySelfSig via SigChain")
return nil
}
if u.VerifySelfSigByKey() {
u.G().Log.Debug("- VerifySelfSig via Key")
return nil
}
u.G().Log.Debug("- VerifySelfSig failed")
return fmt.Errorf("Failed to find a self-signature for %s", u.name)
}
func (u *User) VerifySelfSigByKey() (ret bool) {
name := u.GetName()
if ckf := u.GetComputedKeyFamily(); ckf != nil {
ret = ckf.FindKeybaseName(name)
}
return
}
func (u *User) HasActiveKey() (ret bool) {
u.G().Log.Debug("+ HasActiveKey")
defer func() {
u.G().Log.Debug("- HasActiveKey -> %v", ret)
}()
if u.GetEldestKID().IsNil() {
u.G().Log.Debug("| no eldest KID; must have reset or be new")
ret = false
return
}
if ckf := u.GetComputedKeyFamily(); ckf != nil {
u.G().Log.Debug("| Checking user's ComputedKeyFamily")
ret = ckf.HasActiveKey()
return
}
if u.sigChain() == nil {
u.G().Log.Debug("User HasActiveKey: sig chain is nil")
} else if u.sigChain().GetComputedKeyInfos() == nil {
u.G().Log.Debug("User HasActiveKey: comp key infos is nil")
}
if u.keyFamily == nil {
u.G().Log.Debug("User HasActiveKey: keyFamily is nil")
}
return false
}
func (u *User) Equal(other *User) bool {
return u.id == other.id
}
func (u *User) TmpTrackChainLinkFor(m MetaContext, username string, uid keybase1.UID) (tcl *TrackChainLink, err error) {
return TmpTrackChainLinkFor(m, u.id, uid)
}
func TmpTrackChainLinkFor(m MetaContext, me keybase1.UID, them keybase1.UID) (tcl *TrackChainLink, err error) {
m.Debug("+ TmpTrackChainLinkFor for %s", them)
tcl, err = LocalTmpTrackChainLinkFor(m, me, them)
m.Debug("- TmpTrackChainLinkFor for %s -> %v, %v", them, (tcl != nil), err)
return tcl, err
}
func (u *User) TrackChainLinkFor(m MetaContext, username NormalizedUsername, uid keybase1.UID) (*TrackChainLink, error) {
u.G().Log.Debug("+ TrackChainLinkFor for %s", uid)
defer u.G().Log.Debug("- TrackChainLinkFor for %s", uid)
remote, e1 := u.remoteTrackChainLinkFor(username, uid)
return TrackChainLinkFor(m, u.id, uid, remote, e1)
}
func TrackChainLinkFor(m MetaContext, me keybase1.UID, them keybase1.UID, remote *TrackChainLink, remoteErr error) (*TrackChainLink, error) {
local, e2 := LocalTrackChainLinkFor(m, me, them)
m.Debug("| Load remote -> %v", (remote != nil))
m.Debug("| Load local -> %v", (local != nil))
if remoteErr != nil && e2 != nil {
return nil, remoteErr
}
if local == nil && remote == nil {
return nil, nil
}
if local == nil && remote != nil {
return remote, nil
}
if remote == nil && local != nil {
m.Debug("local expire %v: %s", local.tmpExpireTime.IsZero(), local.tmpExpireTime)
return local, nil
}
if remote.GetCTime().After(local.GetCTime()) {
m.Debug("| Returning newer remote")
return remote, nil
}
return local, nil
}
func (u *User) remoteTrackChainLinkFor(username NormalizedUsername, uid keybase1.UID) (*TrackChainLink, error) {
if u.IDTable() == nil {
return nil, nil
}
return u.IDTable().TrackChainLinkFor(username, uid)
}
// BaseProofSet creates a basic proof set for a user with their
// keybase and uid proofs and any pgp fingerprint proofs.
func (u *User) BaseProofSet() *ProofSet {
proofs := []Proof{
{Key: "keybase", Value: u.name},
{Key: "uid", Value: u.id.String()},
}
for _, fp := range u.GetActivePGPFingerprints(true) {
proofs = append(proofs, Proof{Key: PGPAssertionKey, Value: fp.String()})
}
return NewProofSet(proofs)
}
// localDelegateKey takes the given GenericKey and provisions it locally so that
// we can use the key without needing a refresh from the server. The eventual
// refresh we do get from the server will clobber our work here.
func (u *User) localDelegateKey(key GenericKey, sigID keybase1.SigID, kid keybase1.KID, isSibkey bool, isEldest bool, merkleHashMeta keybase1.HashMeta, firstAppearedUnverified keybase1.Seqno) (err error) {
if err = u.keyFamily.LocalDelegate(key); err != nil {
return
}
if u.sigChain() == nil {
err = NoSigChainError{}
return
}
err = u.sigChain().LocalDelegate(u.keyFamily, key, sigID, kid, isSibkey, merkleHashMeta, firstAppearedUnverified)
if isEldest {
eldestKID := key.GetKID()
u.leaf.eldest = eldestKID
}
return
}
func (u *User) localDelegatePerUserKey(perUserKey keybase1.PerUserKey) error {
// Don't update the u.keyFamily. It doesn't manage per-user-keys.
// Update sigchain which will update ckf/cki
err := u.sigChain().LocalDelegatePerUserKey(perUserKey)
if err != nil {
return err
}
u.G().Log.Debug("User LocalDelegatePerUserKey gen:%v seqno:%v sig:%v enc:%v",
perUserKey.Gen, perUserKey.Seqno, perUserKey.SigKID.String(), perUserKey.EncKID.String())
return nil
}
// SigChainBump is called during a multikey post to update the correct seqno, hash, and
// high skip. When a delegator posts a high link, they specify isHighDelegator=true
// in order to set the new high skip pointer to the delegator's link, so subsequent
// keys in the multikey will supply the correct high skip.
func (u *User) SigChainBump(linkID LinkID, sigID keybase1.SigID, isHighDelegator bool) {
u.SigChainBumpMT(MerkleTriple{LinkID: linkID, SigID: sigID.StripSuffix()}, isHighDelegator)
}
func (u *User) SigChainBumpMT(mt MerkleTriple, isHighDelegator bool) {
u.sigChain().Bump(mt, isHighDelegator)
}
func (u *User) GetDevice(id keybase1.DeviceID) (*Device, error) {
if u.GetComputedKeyFamily() == nil {
return nil, fmt.Errorf("no computed key family")
}
device, exists := u.GetComputedKeyFamily().cki.Devices[id]
if !exists {
return nil, fmt.Errorf("device %s doesn't exist", id)
}
return device, nil
}
func (u *User) DeviceNames() ([]string, error) {
ckf := u.GetComputedKeyFamily()
if ckf == nil {
return nil, fmt.Errorf("no computed key family")
}
if ckf.cki == nil {
return nil, fmt.Errorf("no computed key infos")
}
var names []string
for _, device := range ckf.cki.Devices {
if device.Description == nil {
continue
}
names = append(names, *device.Description)
}
return names, nil
}
// Returns whether or not the current install has an active device
// sibkey.
func (u *User) HasDeviceInCurrentInstall(did keybase1.DeviceID) bool {
ckf := u.GetComputedKeyFamily()
if ckf == nil {
return false
}
_, err := ckf.GetSibkeyForDevice(did)
return err == nil
}
func (u *User) HasCurrentDeviceInCurrentInstall() bool {
did := u.G().Env.GetDeviceIDForUsername(u.GetNormalizedName())
if did.IsNil() {
return false
}
return u.HasDeviceInCurrentInstall(did)
}
func (u *User) SigningKeyPub() (GenericKey, error) {
// Get our key that we're going to sign with.
arg := SecretKeyArg{
Me: u,
KeyType: DeviceSigningKeyType,
}
key := u.G().ActiveDevice.SigningKeyForUID(u.GetUID())
if key != nil {
return key, nil
}
lockedKey, err := u.G().Keyrings.GetSecretKeyLocked(NewMetaContextTODO(u.G()), arg)
if err != nil {
return nil, err
}
pubKey, err := lockedKey.GetPubKey()
if err != nil {
return nil, err
}
return pubKey, nil
}
func (u *User) GetSigIDFromSeqno(seqno keybase1.Seqno) keybase1.SigID {
if u.sigChain() == nil {
return ""
}
link := u.sigChain().GetLinkFromSeqno(seqno)
if link == nil {
return ""
}
return link.GetSigID()
}
func (u *User) IsSigIDActive(sigID keybase1.SigID) (bool, error) {
if u.sigChain() == nil {
return false, fmt.Errorf("User's sig chain is nil.")
}
link := u.sigChain().GetLinkFromSigID(sigID)
if link == nil {
return false, fmt.Errorf("Signature with ID '%s' does not exist.", sigID)
}
if link.revoked {
return false, fmt.Errorf("Signature ID '%s' is already revoked.", sigID)
}
return true, nil
}
func (u *User) SigIDSearch(query string) (keybase1.SigID, error) {
if u.sigChain() == nil {
return "", fmt.Errorf("User's sig chain is nil.")
}
link := u.sigChain().GetLinkFromSigIDQuery(query)
if link == nil {
return "", fmt.Errorf("Signature matching query %q does not exist.", query)
}
if link.revoked {
return "", fmt.Errorf("Signature ID '%s' is already revoked.", link.GetSigID())
}
return link.GetSigID(), nil
}
func (u *User) LinkFromSigID(sigID keybase1.SigID) *ChainLink {
return u.sigChain().GetLinkFromSigID(sigID)
}
func (u *User) SigChainDump(w io.Writer) {
u.sigChain().Dump(w)
}
func (u *User) IsCachedIdentifyFresh(upk *keybase1.UserPlusKeysV2AllIncarnations) bool {
idv, _ := u.GetIDVersion()
if upk.Uvv.Id == 0 || idv != upk.Uvv.Id {
return false
}
shv := u.GetSigHintsVersion()
if upk.Uvv.SigHints == 0 || shv != upk.Uvv.SigHints {
return false
}
scv := u.GetSigChainLastKnownSeqno()
if upk.Uvv.SigChain == 0 || int64(scv) != upk.Uvv.SigChain {
return false
}
return true
}
// PartialCopy copies some fields of the User object, but not all.
// For instance, it doesn't copy the SigChain or IDTable, and it only
// makes a shallow copy of the ComputedKeyFamily.
func (u User) PartialCopy() *User {
ret := &User{
Contextified: NewContextified(u.G()),
id: u.id,
name: u.name,
leaf: u.leaf,
dirty: false,
}
if ckf := u.GetComputedKeyFamily(); ckf != nil {
ret.ckfShallowCopy = ckf.ShallowCopy()
ret.keyFamily = ckf.kf
} else if u.keyFamily != nil {
ret.keyFamily = u.keyFamily.ShallowCopy()
}
return ret
}
func ValidateNormalizedUsername(username string) (NormalizedUsername, error) {
res := NormalizedUsername(username)
if len(username) < 2 {
return res, errors.New("username too short")
}
if len(username) > 16 {
return res, errors.New("username too long")
}
// underscores allowed, just not first or doubled
re := regexp.MustCompile(`^([a-z0-9][a-z0-9_]?)+$`)
if !re.MatchString(username) {
return res, errors.New("invalid username")
}
return res, nil
}
type UserForSignatures struct {
uid keybase1.UID
name NormalizedUsername
eldestKID keybase1.KID
eldestSeqno keybase1.Seqno
latestPUK *keybase1.PerUserKey
}
func (u UserForSignatures) GetUID() keybase1.UID { return u.uid }
func (u UserForSignatures) GetName() string { return u.name.String() }
func (u UserForSignatures) GetEldestKID() keybase1.KID { return u.eldestKID }
func (u UserForSignatures) GetEldestSeqno() keybase1.Seqno { return u.eldestSeqno }
func (u UserForSignatures) GetNormalizedName() NormalizedUsername { return u.name }
func (u UserForSignatures) ToUserVersion() keybase1.UserVersion {
return keybase1.UserVersion{Uid: u.uid, EldestSeqno: u.eldestSeqno}
}
func (u UserForSignatures) GetLatestPerUserKey() *keybase1.PerUserKey { return u.latestPUK }
func (u *User) ToUserForSignatures() (ret UserForSignatures, err error) {
if u == nil {
return ret, fmt.Errorf("ToUserForSignatures missing user object")
}
ckf := u.GetComputedKeyFamily()
if ckf == nil {
return ret, fmt.Errorf("ToUserForSignatures missing ckf")
}
if ckf.cki == nil {
return ret, fmt.Errorf("ToUserForSignatures missing cki")
}
ret.uid = u.GetUID()
ret.name = u.GetNormalizedName()
ret.eldestKID = u.GetEldestKID()
ret.eldestSeqno = u.GetCurrentEldestSeqno()
ret.latestPUK = u.GetComputedKeyFamily().GetLatestPerUserKey()
return ret, nil
}
var _ UserBasic = UserForSignatures{}
// VID gets the VID that corresponds to the given UID. A VID is a pseudonymous UID.
// Should never error.
func VID(mctx MetaContext, uid keybase1.UID) (ret keybase1.VID) {
mctx.G().vidMu.Lock()
defer mctx.G().vidMu.Unlock()
// Construct the key from the given uid passed in.
strKey := "vid" + ":" + string(uid)
key := DbKey{DBMisc, strKey}
found, err := mctx.G().LocalDb.GetInto(&ret, key)
if found {
return ret
}
if err != nil {
// It's ok, we will just rerandomize in this case.
mctx.Debug("VID: failure to get: %s", err.Error())
}
b, err := RandBytesWithSuffix(16, keybase1.UID_SUFFIX_2)
if err != nil {
// This should never happen.
mctx.Debug("VID: random bytes failed: %s", err.Error())
}
ret = keybase1.VID(hex.EncodeToString(b))
err = mctx.G().LocalDb.PutObj(key, nil, ret)
if err != nil {
// It's ok, we will just rerandomize in this case.
mctx.Debug("VID: store failed: %s", err.Error())
}
return ret
}