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
//! Code for managing multiple [`Keystore`]s.
//!
//! The [`KeyMgr`] reads from (and writes to) a number of key stores. The key stores all implement
//! [`Keystore`].
//!
//! ## Concurrent key store access
//!
//! The key stores will allow concurrent modification by different processes. In
//! order to implement this safely without locking, the key store operations (get,
//! insert, remove) will need to be atomic.
//!
//! **Note**: [`KeyMgr::generate`] and [`KeyMgr::generate_with_derived`] should **not** be used
//! concurrently with any other `KeyMgr` operation that mutates the state of key stores, because
//! their outcome depends on whether the selected key store [`contains`][Keystore::contains] the
//! specified key (and thus suffers from a a TOCTOU race).
use crate::{
EncodableKey, KeyPath, KeyPathPatternSet, KeyPathRange, KeySpecifier, KeyType, Keygen,
KeygenRng, Keystore, KeystoreId, KeystoreSelector, Result, ToEncodableKey,
};
use itertools::Itertools;
use std::iter;
use tor_error::{bad_api_usage, internal};
/// A boxed [`Keystore`].
type BoxedKeystore = Box<dyn Keystore>;
/// A key manager with several [`Keystore`]s.
///
/// Note: [`KeyMgr`] is a low-level utility and does not implement caching (the key stores are
/// accessed for every read/write).
//
// TODO HSS: derive builder for KeyMgr.
pub struct KeyMgr {
/// The default key store.
default_store: BoxedKeystore,
/// The secondary key stores.
secondary_stores: Vec<BoxedKeystore>,
}
impl KeyMgr {
/// Create a new [`KeyMgr`] with a default [`Keystore`] and zero or more secondary [`Keystore`]s.
pub fn new(default_store: impl Keystore, secondary_stores: Vec<BoxedKeystore>) -> Self {
Self {
default_store: Box::new(default_store),
secondary_stores,
}
}
/// Read a key from one of the key stores, and try to deserialize it as `K::Key`.
///
/// The key returned is retrieved from the first key store that contains an entry for the given
/// specifier.
///
/// Returns Ok(None) if none of the key stores have the requested key.
pub fn get<K: ToEncodableKey>(&self, key_spec: &dyn KeySpecifier) -> Result<Option<K>> {
self.get_from_store(key_spec, &K::Key::key_type(), self.all_stores())
}
/// Read a key from one of the key stores, and try to deserialize it as `K::Key`.
///
/// The key returned is retrieved from the first key store that contains an entry for the given
/// specifier.
///
/// Returns Ok(None) if none of the key stores have the requested key.
///
/// Returns an error if the specified `key_type` does not match `K::Key::key_type()`.
pub fn get_with_type<K: ToEncodableKey>(
&self,
key_spec: &dyn KeySpecifier,
key_type: &KeyType,
) -> Result<Option<K>> {
self.get_from_store(key_spec, key_type, self.all_stores())
}
/// Read the key identified by `key_spec`.
///
/// The key returned is retrieved from the first key store that contains an entry for the given
/// specifier.
///
/// If the requested key does not exist in any of the key stores, this generates a new key of
/// type `K` computed using the provided `derive` function and inserts it into the specified
/// keystore, returning the newly inserted value.
pub fn get_or_generate_with_derived<K: ToEncodableKey>(
&self,
key_spec: &dyn KeySpecifier,
selector: KeystoreSelector,
derive: impl FnOnce() -> Result<K>,
) -> Result<K> {
let key_type = K::Key::key_type();
match self.get_from_store(key_spec, &key_type, self.all_stores())? {
Some(key) => Ok(key),
None => {
let key = derive()?;
self.insert(key, key_spec, selector)?;
// The key is not Clone so we have to look it up to return it.
let key = self
.get_from_store(key_spec, &key_type, self.all_stores())?
.ok_or_else(|| internal!("key is missing but we've just inserted it?!"))?;
// TODO HSS: assert the key was retrieved from the keystore we put it in?
Ok(key)
}
}
}
/// Read the key identified by `key_spec`.
///
/// The key returned is retrieved from the first key store that contains an entry for the given
/// specifier.
///
/// If the requested key does not exist in any of the key stores, this generates a new key of
/// type `K` from the key created using using `K::Key`'s [`Keygen`] implementation, and inserts
/// it into the specified keystore, returning the newly inserted value.
pub fn get_or_generate<K>(
&self,
key_spec: &dyn KeySpecifier,
selector: KeystoreSelector,
rng: &mut dyn KeygenRng,
) -> Result<K>
where
K: ToEncodableKey,
K::Key: Keygen,
{
self.get_or_generate_with_derived(key_spec, selector, || {
Ok(K::from_encodable_key(K::Key::generate(rng)?))
})
}
/// Generate a new key of type `K`, and insert it into the key store specified by `selector`.
///
/// If the key already exists in the specified key store, the `overwrite` flag is used to
/// decide whether to overwrite it with a newly generated key.
///
/// Returns `Ok(Some(())` if a new key was created, and `Ok(None)` otherwise.
///
/// **IMPORTANT**: using this function concurrently with any other `KeyMgr` operation that
/// mutates the key store state is **not** recommended, as it can yield surprising results! The
/// outcome of [`KeyMgr::generate`] depends on whether the selected key store
/// [`contains`][Keystore::contains] the specified key, and thus suffers from a a TOCTOU race.
//
// TODO HSS: can we make this less racy without a lock? Perhaps we should say we'll always
// overwrite any existing keys.
pub fn generate<K>(
&self,
key_spec: &dyn KeySpecifier,
selector: KeystoreSelector,
rng: &mut dyn KeygenRng,
overwrite: bool,
) -> Result<Option<()>>
where
K: ToEncodableKey,
K::Key: Keygen,
{
let store = self.select_keystore(&selector)?;
let key_type = K::Key::key_type();
if overwrite || !store.contains(key_spec, &key_type)? {
let key = K::Key::generate(rng)?;
store.insert(&key, key_spec, &key_type).map(Some)
} else {
Ok(None)
}
}
/// Generate a new keypair of type `SK` and the corresponding public key of type `PK`, and
/// insert them into the key store specified by `selector`.
///
/// If the keypair already exists in the specified key store, the `overwrite` flag is used to
/// decide whether to overwrite it with a newly generated key.
///
/// If `overwrite` is `false` and the keypair already exists in the keystore, but the
/// corresponding public key does not, ththe public key will be derived from the existing
/// keypair and inserted into the keystore.
///
/// If `overwrite` is `false` and the keypair does not exist in the keystore, but its
/// corresponding public key does, this will **not** generate a fresh keypair.
///
/// Returns `Ok(Some(())` if a new keypair was created, and `Ok(None)` otherwise.
///
/// **NOTE**: If the keypair and its corresponding public key already exist in the keystore,
/// this function checks if they match. If they do not, it returns an error.
///
/// **IMPORTANT**: using this function concurrently with any other `KeyMgr` operation that
/// mutates the key store state is **not** recommended, as it can yield surprising results! The
/// outcome of [`KeyMgr::generate_with_derived`] depends on whether the selected key store
/// [`contains`][Keystore::contains] the specified keypair, and thus suffers from a a TOCTOU race.
//
// TODO HSS: can we make this less racy without a lock? Perhaps we should say we'll always
// overwrite any existing keys.
pub fn generate_with_derived<SK, PK>(
&self,
keypair_key_spec: &dyn KeySpecifier,
public_key_spec: &dyn KeySpecifier,
selector: KeystoreSelector,
mut derive_pub: impl FnMut(&SK::Key) -> PK,
rng: &mut dyn KeygenRng,
overwrite: bool,
) -> Result<Option<()>>
where
SK: ToEncodableKey,
SK::Key: Keygen,
PK: EncodableKey + PartialEq,
{
// TODO HSS: at some point we may want to support putting the keypair and public key in
// different keystores.
let store = self.select_keystore(&selector)?;
let keypair = store.get(keypair_key_spec, &SK::Key::key_type())?;
let public_key = store.get(public_key_spec, &PK::key_type())?;
let generate_key = match (keypair, public_key) {
(Some(keypair), None) if !overwrite => {
// The keypair exists, but its corresponding public key entry does not, so we derive
// the public key and create a new entry for it.
let keypair: SK::Key = keypair
.downcast::<SK::Key>()
.map(|k| *k)
.map_err(|_| internal!("failed to downcast key to requested type"))?;
let public_key = derive_pub(&keypair);
let _ = store.insert(&public_key, public_key_spec, &PK::key_type())?;
false
}
(Some(_), None) => {
// overwrite = true, so we don't need to extract the public key from the existing
// keypair, as we're about to replace the keypair with a newly generated one
true
}
(Some(keypair), Some(public)) => {
let keypair: SK::Key = keypair
.downcast::<SK::Key>()
.map(|k| *k)
.map_err(|_| internal!("failed to downcast key to requested type"))?;
let public: PK = public
.downcast::<PK>()
.map(|k| *k)
.map_err(|_| internal!("failed to downcast key to requested type"))?;
// Check that the existing public key matches the keypair
//
// TODO HSS: I'm not sure this validation belongs here.
let expected_public = derive_pub(&keypair);
if expected_public != public {
// TODO HSS: internal! is not right, create an error type for KeyMgr errors and
// add context
return Err(internal!(
"keystore corruption: public key does not match keypair"
)
.into());
}
// Both keys exist, so we only need to generate new keys if overwrite = true
overwrite
}
(None, None) => {
// Both keys are missing, so we have to generate them.
true
}
(None, Some(_)) => {
// The public key exists, but its corresponding keypair is missing. We can't
// generate a new keypair, as that would have a different public key entry.
false
}
};
if generate_key {
let keypair = SK::Key::generate(rng)?;
let _ = store.insert(&keypair, keypair_key_spec, &SK::Key::key_type())?;
let public_key = derive_pub(&keypair);
let _ = store.insert(&public_key, public_key_spec, &PK::key_type())?;
Ok(Some(()))
} else {
Ok(None)
}
}
/// Insert `key` into the [`Keystore`] specified by `selector`.
///
/// If the key already exists, it is overwritten.
///
// TODO HSS: would it be useful for this API to return a Result<Option<K>> here (i.e. the old key)?
pub fn insert<K: ToEncodableKey>(
&self,
key: K,
key_spec: &dyn KeySpecifier,
selector: KeystoreSelector,
) -> Result<()> {
let key = key.to_encodable_key();
let store = self.select_keystore(&selector)?;
store.insert(&key, key_spec, &K::Key::key_type())
}
/// Remove the key identified by `key_spec` from the [`Keystore`] specified by `selector`.
///
/// Returns `Ok(None)` if the key does not exist in the requested keystore.
/// Returns `Ok(Some(())` if the key was successfully removed.
///
/// Returns `Err` if an error occurred while trying to remove the key.
pub fn remove<K: ToEncodableKey>(
&self,
key_spec: &dyn KeySpecifier,
selector: KeystoreSelector,
) -> Result<Option<()>> {
let store = self.select_keystore(&selector)?;
store.remove(key_spec, &K::Key::key_type())
}
/// Return the keys matching the specified [`KeyPathPatternSet`].
///
/// NOTE: This searches for matching keys in _all_ keystores.
//
// TODO HSS: remove derive_meta and change this to only return the ArtiPaths
// See https://gitlab.torproject.org/tpo/core/arti/-/merge_requests/1677#note_2955700
pub fn list_matching<M>(
&self,
pat: &KeyPathPatternSet,
derive_meta: impl Fn(&KeyPath, &[KeyPathRange]) -> Result<M>,
) -> Result<Vec<(KeyPath, KeyType, M)>> {
self.all_stores()
.map(|store| -> Result<Vec<_>> {
store
.list()?
.iter()
.filter_map(|(key_path, key_type): &(KeyPath, KeyType)| {
key_path.matches(pat).map(|captures| {
Ok((
key_path.clone(),
key_type.clone(),
derive_meta(key_path, &captures)?,
))
})
})
.collect::<Result<Vec<_>>>()
})
.flatten_ok()
.collect::<Result<Vec<_>>>()
}
/// Attempt to retrieve a key from one of the specified `stores`.
///
/// See [`KeyMgr::get`] for more details.
fn get_from_store<'a, K: ToEncodableKey>(
&self,
key_spec: &dyn KeySpecifier,
key_type: &KeyType,
stores: impl Iterator<Item = &'a BoxedKeystore>,
) -> Result<Option<K>> {
let static_key_type = K::Key::key_type();
if key_type != &static_key_type {
return Err(internal!(
"key type {:?} does not match the key type {:?} of requested key K::Key",
key_type,
static_key_type
)
.into());
}
for store in stores {
let key = match store.get(key_spec, &K::Key::key_type()) {
Ok(None) => {
// The key doesn't exist in this store, so we check the next one...
continue;
}
Ok(Some(k)) => k,
Err(e) => {
// TODO HSS: we immediately return if one of the keystores is inaccessible.
// Perhaps we should ignore any errors and simply poll the next store in the
// list?
return Err(e);
}
};
// Found it! Now try to downcast it to the right type (this should _not_ fail)...
let key: K::Key = key
.downcast::<K::Key>()
.map(|k| *k)
.map_err(|_| internal!("failed to downcast key to requested type"))?;
return Ok(Some(K::from_encodable_key(key)));
}
Ok(None)
}
/// Return an iterator over all configured stores.
fn all_stores(&self) -> impl Iterator<Item = &BoxedKeystore> {
iter::once(&self.default_store).chain(self.secondary_stores.iter())
}
/// Return the [`Keystore`] matching the specified `selector`.
fn select_keystore(&self, selector: &KeystoreSelector) -> Result<&BoxedKeystore> {
match selector {
KeystoreSelector::Id(keystore_id) => self.find_keystore(keystore_id),
KeystoreSelector::Default => Ok(&self.default_store),
}
}
/// Return the [`Keystore`] with the specified `id`.
fn find_keystore(&self, id: &KeystoreId) -> Result<&BoxedKeystore> {
self.all_stores()
.find(|keystore| keystore.id() == id)
.ok_or_else(|| bad_api_usage!("could not find keystore with ID {id}").into())
}
}
#[cfg(test)]
mod tests {
// @@ begin test lint list maintained by maint/add_warning @@
#![allow(clippy::bool_assert_comparison)]
#![allow(clippy::clone_on_copy)]
#![allow(clippy::dbg_macro)]
#![allow(clippy::print_stderr)]
#![allow(clippy::print_stdout)]
#![allow(clippy::single_char_pattern)]
#![allow(clippy::unwrap_used)]
#![allow(clippy::unchecked_duration_subtraction)]
#![allow(clippy::useless_vec)]
#![allow(clippy::needless_pass_by_value)]
//! <!-- @@ end test lint list maintained by maint/add_warning @@ -->
use super::*;
use crate::{ArtiPath, ArtiPathUnavailableError, ErasedKey, KeyPath, KeyType, SshKeyData};
use std::collections::HashMap;
use std::result::Result as StdResult;
use std::str::FromStr;
use std::sync::RwLock;
use tor_basic_utils::test_rng::testing_rng;
/// The type of "key" stored in the test key stores.
type TestKey = String;
/// The corresponding fake public key type.
type TestPublicKey = String;
impl Keygen for TestKey {
fn generate(_rng: &mut dyn KeygenRng) -> Result<Self>
where
Self: Sized,
{
Ok("generated_test_key".into())
}
}
impl EncodableKey for TestKey {
fn key_type() -> KeyType
where
Self: Sized,
{
// Dummy value
KeyType::Ed25519Keypair
}
fn as_ssh_key_data(&self) -> Result<SshKeyData> {
// (Ab)use the encrypted variant for testing purposes
Ok(SshKeyData::Private(
ssh_key::private::KeypairData::Encrypted(self.as_bytes().to_vec()),
))
}
}
impl ToEncodableKey for TestKey {
type Key = TestKey;
fn to_encodable_key(self) -> Self::Key {
self
}
fn from_encodable_key(key: Self::Key) -> Self {
key
}
}
macro_rules! impl_keystore {
($name:tt, $id:expr) => {
struct $name {
inner: RwLock<HashMap<(ArtiPath, KeyType), TestKey>>,
id: KeystoreId,
}
impl Default for $name {
fn default() -> Self {
Self {
inner: Default::default(),
id: KeystoreId::from_str($id).unwrap(),
}
}
}
#[allow(dead_code)] // this is only dead code for Keystore1
impl $name {
fn new_boxed() -> BoxedKeystore {
Box::<Self>::default()
}
}
impl Keystore for $name {
fn contains(
&self,
key_spec: &dyn KeySpecifier,
key_type: &KeyType,
) -> Result<bool> {
Ok(self
.inner
.read()
.unwrap()
.contains_key(&(key_spec.arti_path().unwrap(), key_type.clone())))
}
fn id(&self) -> &KeystoreId {
&self.id
}
fn get(
&self,
key_spec: &dyn KeySpecifier,
key_type: &KeyType,
) -> Result<Option<ErasedKey>> {
Ok(self
.inner
.read()
.unwrap()
.get(&(key_spec.arti_path().unwrap(), key_type.clone()))
.map(|k| Box::new(k.clone()) as Box<dyn EncodableKey>))
}
fn insert(
&self,
key: &dyn EncodableKey,
key_spec: &dyn KeySpecifier,
key_type: &KeyType,
) -> Result<()> {
let key = key.as_ssh_key_data()?;
let key_bytes = key.into_private().unwrap().encrypted().unwrap().to_vec();
let value = String::from_utf8(key_bytes).unwrap();
self.inner.write().unwrap().insert(
(key_spec.arti_path().unwrap(), key_type.clone()),
format!("{}_{value}", self.id()),
);
Ok(())
}
fn remove(
&self,
key_spec: &dyn KeySpecifier,
key_type: &KeyType,
) -> Result<Option<()>> {
Ok(self
.inner
.write()
.unwrap()
.remove(&(key_spec.arti_path().unwrap(), key_type.clone()))
.map(|_| ()))
}
fn list(&self) -> Result<Vec<(KeyPath, KeyType)>> {
// These tests don't use this function
unimplemented!()
}
}
};
}
macro_rules! impl_specifier {
($name:tt, $id:expr) => {
struct $name;
impl KeySpecifier for $name {
fn arti_path(&self) -> StdResult<ArtiPath, ArtiPathUnavailableError> {
Ok(ArtiPath::new($id.into()).map_err(|e| tor_error::internal!("{e}"))?)
}
fn ctor_path(&self) -> Option<crate::CTorPath> {
None
}
}
};
}
impl_keystore!(Keystore1, "keystore1");
impl_keystore!(Keystore2, "keystore2");
impl_keystore!(Keystore3, "keystore3");
impl_specifier!(TestKeySpecifier1, "spec1");
impl_specifier!(TestKeySpecifier2, "spec2");
impl_specifier!(TestKeySpecifier3, "spec3");
impl_specifier!(TestPublicKeySpecifier1, "pub-spec1");
#[test]
fn insert_and_get() {
let mgr = KeyMgr::new(
Keystore1::default(),
vec![Keystore2::new_boxed(), Keystore3::new_boxed()],
);
// Insert a key into Keystore2
mgr.insert(
"coot".to_string(),
&TestKeySpecifier1,
KeystoreSelector::Id(&KeystoreId::from_str("keystore2").unwrap()),
)
.unwrap();
assert_eq!(
mgr.get::<TestKey>(&TestKeySpecifier1).unwrap(),
Some("keystore2_coot".to_string())
);
// Insert a different key using the _same_ key specifier.
mgr.insert(
"gull".to_string(),
&TestKeySpecifier1,
KeystoreSelector::Id(&KeystoreId::from_str("keystore2").unwrap()),
)
.unwrap();
// Check that the original value was overwritten:
assert_eq!(
mgr.get::<TestKey>(&TestKeySpecifier1).unwrap(),
Some("keystore2_gull".to_string())
);
// Insert a key into the default keystore
mgr.insert(
"moorhen".to_string(),
&TestKeySpecifier2,
KeystoreSelector::Default,
)
.unwrap();
assert_eq!(
mgr.get::<TestKey>(&TestKeySpecifier2).unwrap(),
Some("keystore1_moorhen".to_string())
);
// The key doesn't exist in any of the stores yet.
assert!(mgr.get::<TestKey>(&TestKeySpecifier3).unwrap().is_none());
// Insert the same key into all 3 key stores, in reverse order of keystore priority
// (otherwise KeyMgr::get will return the key from the default store for each iteration and
// we won't be able to see the key was actually inserted in each store).
for store in ["keystore3", "keystore2", "keystore1"] {
mgr.insert(
"cormorant".to_string(),
&TestKeySpecifier3,
KeystoreSelector::Id(&KeystoreId::from_str(store).unwrap()),
)
.unwrap();
// Ensure the key now exists in `store`.
assert_eq!(
mgr.get::<TestKey>(&TestKeySpecifier3).unwrap(),
Some(format!("{store}_cormorant"))
);
}
// The key exists in all key stores, but if no keystore_id is specified, we return the
// value from the first key store it is found in (in this case, Keystore1)
assert_eq!(
mgr.get::<TestKey>(&TestKeySpecifier3).unwrap(),
Some("keystore1_cormorant".to_string())
);
}
#[test]
fn remove() {
let mgr = KeyMgr::new(
Keystore1::default(),
vec![Keystore2::new_boxed(), Keystore3::new_boxed()],
);
assert!(!mgr.secondary_stores[0]
.contains(&TestKeySpecifier1, &TestKey::key_type())
.unwrap());
// Insert a key into Keystore2
mgr.insert(
"coot".to_string(),
&TestKeySpecifier1,
KeystoreSelector::Id(&KeystoreId::from_str("keystore2").unwrap()),
)
.unwrap();
assert_eq!(
mgr.get::<TestKey>(&TestKeySpecifier1).unwrap(),
Some("keystore2_coot".to_string())
);
// Try to remove the key from a non-existent key store
assert!(mgr
.remove::<TestKey>(
&TestKeySpecifier1,
KeystoreSelector::Id(&KeystoreId::from_str("not_an_id_we_know_of").unwrap())
)
.is_err());
// The key still exists in Keystore2
assert!(mgr.secondary_stores[0]
.contains(&TestKeySpecifier1, &TestKey::key_type())
.unwrap());
// Try to remove the key from the default key store
assert_eq!(
mgr.remove::<TestKey>(&TestKeySpecifier1, KeystoreSelector::Default)
.unwrap(),
None
);
// The key still exists in Keystore2
assert!(mgr.secondary_stores[0]
.contains(&TestKeySpecifier1, &TestKey::key_type())
.unwrap());
// Removing from Keystore2 should succeed.
assert_eq!(
mgr.remove::<TestKey>(
&TestKeySpecifier1,
KeystoreSelector::Id(&KeystoreId::from_str("keystore2").unwrap())
)
.unwrap(),
Some(())
);
// The key doesn't exist in Keystore2 anymore
assert!(!mgr.secondary_stores[0]
.contains(&TestKeySpecifier1, &TestKey::key_type())
.unwrap());
}
#[test]
fn keygen() {
let mgr = KeyMgr::new(Keystore1::default(), vec![]);
mgr.insert(
"coot".to_string(),
&TestKeySpecifier1,
KeystoreSelector::Default,
)
.unwrap();
// There is no corresponding public key entry.
assert_eq!(
mgr.get::<TestPublicKey>(&TestPublicKeySpecifier1).unwrap(),
None
);
// Try to generate a new key (overwrite = false)
mgr.generate_with_derived::<TestKey, TestPublicKey>(
&TestKeySpecifier1,
&TestPublicKeySpecifier1,
KeystoreSelector::Default,
|sk| TestKey::from(sk),
&mut testing_rng(),
false,
)
.unwrap();
// The previous entry was not overwritten because overwrite = false
assert_eq!(
mgr.get::<TestKey>(&TestKeySpecifier1).unwrap(),
Some("keystore1_coot".to_string())
);
// Because overwrite = false and the keypair already exists in the keystore,
// generate() creates a new public key entry derived from the existing keypair.
assert_eq!(
mgr.get::<TestPublicKey>(&TestPublicKeySpecifier1).unwrap(),
Some("keystore1_keystore1_coot".to_string())
);
// Try to generate a new key (overwrite = true)
mgr.generate_with_derived::<TestKey, TestPublicKey>(
&TestKeySpecifier1,
&TestPublicKeySpecifier1,
KeystoreSelector::Default,
// We prefix the "key" with the id of the keystore it was retrieved from, because its
// value needs to match that of the public key that already exists in the keystore (the
// get() implementations of our test keystores prefix the keys with their keystore ID,
// for testing purposes).
//
// TODO(gabi): knowing which keystore a key came from is useful, because it enables us
// to check that KeyMgr::get works as expected (i.e. reads from the correct keystore),
// but encoding this information in the key itself makes these tests rather confusing
// to read. We should make the keystores return a (TestKey, KeystoreID) instead.
|sk| format!("keystore1_{sk}"),
&mut testing_rng(),
true,
)
.unwrap();
assert_eq!(
mgr.get::<TestKey>(&TestKeySpecifier1).unwrap(),
Some("keystore1_generated_test_key".to_string())
);
// The public part of the key was overwritten too
//
// TODO HSS: instead of making the keys Strings, we should create a real test key type.
// This will enable us to test that the public key is indeed derived from the keypair using
// its From impl (as this assertion shows, the retrieved public key,
// keystore1_generated_test_key, looks the same as the keyapir, because it's using the
// From<String> impl for String).
assert_eq!(
mgr.get::<TestPublicKey>(&TestPublicKeySpecifier1).unwrap(),
Some("keystore1_keystore1_generated_test_key".to_string())
);
}
#[test]
fn get_or_generate() {
let mgr = KeyMgr::new(
Keystore1::default(),
vec![Keystore2::new_boxed(), Keystore3::new_boxed()],
);
let keystore2 = KeystoreId::from_str("keystore2").unwrap();
mgr.insert(
"coot".to_string(),
&TestKeySpecifier1,
KeystoreSelector::Id(&keystore2),
)
.unwrap();
// The key already exists in keystore 2 so it won't be auto-generated.
assert_eq!(
mgr.get_or_generate::<TestKey>(
&TestKeySpecifier1,
KeystoreSelector::Default,
&mut testing_rng()
)
.unwrap(),
"keystore2_coot".to_string()
);
// This key doesn't exist in any of the keystores, so it will be auto-generated and
// inserted into keystore 3.
let keystore3 = KeystoreId::from_str("keystore3").unwrap();
assert_eq!(
mgr.get_or_generate::<TestKey>(
&TestKeySpecifier2,
KeystoreSelector::Id(&keystore3),
&mut testing_rng()
)
.unwrap(),
"keystore3_generated_test_key".to_string()
);
// The key already exists in keystore 2 so it won't be auto-generated.
assert_eq!(
mgr.get_or_generate_with_derived::<TestKey>(
&TestKeySpecifier1,
KeystoreSelector::Default,
|| Ok("turtle_dove".to_string())
)
.unwrap(),
"keystore2_coot".to_string()
);
// This key doesn't exist in any of the keystores, so it will be auto-generated and
// inserted into the default keystore.
assert_eq!(
mgr.get_or_generate_with_derived::<TestKey>(
&TestKeySpecifier3,
KeystoreSelector::Default,
|| Ok("rock_dove".to_string())
)
.unwrap(),
"keystore1_rock_dove".to_string()
);
}
}