#encryption #storage #keystore #parser #container

no-std cocoon

A simple protected container with strong encryption and format validation

20 releases

0.3.2 Aug 3, 2022
0.3.1 Jul 9, 2022
0.3.0 Sep 19, 2021
0.2.5 Sep 18, 2021
0.1.11 Jul 12, 2020

#77 in Cryptography

Download history 1029/week @ 2022-06-05 1744/week @ 2022-06-12 1065/week @ 2022-06-19 1996/week @ 2022-06-26 1305/week @ 2022-07-03 516/week @ 2022-07-10 638/week @ 2022-07-17 899/week @ 2022-07-24 457/week @ 2022-07-31 506/week @ 2022-08-07 163/week @ 2022-08-14 572/week @ 2022-08-21 313/week @ 2022-08-28 220/week @ 2022-09-04 240/week @ 2022-09-11 155/week @ 2022-09-18

1,040 downloads per month

MIT license

105KB
1.5K SLoC

Cocoon crates.io docs.rs license coverage

Cocoon

Cocoon format

MiniCocoon and Cocoon are protected containers to wrap sensitive data with strong encryption and format validation. A format of MiniCocoon and Cocoon is developed for the following practical cases:

  1. As an encrypted file format to organize simple secure storage:
    1. Key store.
    2. Password store.
    3. Sensitive data store.
  2. For encrypted data transfer:
    • As a secure in-memory container.

Cocoon is developed with security in mind. It aims to do the only one thing and do it flawlessly. It has a minimal set of dependencies and a minimalist design to simplify control over security aspects. It's a pure Rust implementation, and all dependencies are pure Rust packages with disabled default features.

Problem

Whenever you need to transmit and store data securely you reinvent the wheel: you have to take care of how to encrypt data properly, how to handle randomly generated buffers, then how to get data back, parse, and decrypt. Instead, you can use MiniCocoon and Cocoon.

Basic Usage

📌 Wrap/Unwrap

One party wraps private data into a container using MiniCocoon::wrap. Another party (or the same one, or whoever knows the key) unwraps data out of the container using MiniCocoon::unwrap.

MiniCocoon is preferred against Cocoon in a case of simple data encryption because it generates a container with a smaller header without version control, and also it allows to wrap data sequentially (wrap, wrap, wrap!) without performance drop because of KDF calculation.

let cocoon = MiniCocoon::from_key(b"0123456789abcdef0123456789abcdef", &[0; 32]);

let wrapped = cocoon.wrap(b"my secret data")?;
assert_ne!(&wrapped, b"my secret data");

let unwrapped = cocoon.unwrap(&wrapped)?;
assert_eq!(unwrapped, b"my secret data");

📌 Dump/Parse

You can store data to file. Put data into Vec container, the data is going to be encrypted in place and stored in a file using the "cocoon" format.

Cocoon is preferred as a long-time data storage, it has an extended header with a magic number, options, and version control.

let mut data = b"my secret data".to_vec();
let cocoon = Cocoon::new(b"password");

cocoon.dump(data, &mut file)?;

let data = cocoon.parse(&mut file)?;
assert_eq!(&data, b"my secret data");

📌 Encrypt/Decrypt

You can encrypt data in place and avoid re-allocations. The method operates with a detached meta-data (a container format prefix) in the array on the stack. It is suitable for "no_std" build and whenever you want to evade re-allocations of a huge amount of data. You have to care about how to store and transfer a data length and a container prefix though.

Both MiniCocoon and Cocoon have the same API, but prefixes are of different sizes. MiniCocoon doesn't have the overhead of generating KDF on each encryption call, therefore it's recommended for simple sequential encryption/decryption operations.

let mut data = "my secret data".to_owned().into_bytes();
let cocoon = MiniCocoon::from_key(b"0123456789abcdef0123456789abcdef", &[0; 32]);

let detached_prefix = cocoon.encrypt(&mut data)?;
assert_ne!(data, b"my secret data");

cocoon.decrypt(&mut data, &detached_prefix)?;
assert_eq!(data, b"my secret data");

Study Case

You implement a database of secrets that must be stored in an encrypted file using a user password. There are a lot of ways how your database can be represented in memory and how it could be serialized. You handle these aspects on your own, e.g. you can use HashMap to manage data and use borsh, or bincode, to serialize the data. You can even compress a serialized buffer before encryption.

In the end, you use Cocoon to put the final image into an encrypted container.

use borsh::BorshSerialize;
use cocoon::{Cocoon, Error};

use std::collections::HashMap;
use std::fs::File;

// Your data can be represented in any way.
#[derive(BorshSerialize)]
struct Database {
    inner: HashMap<String, String>,
}

fn main() -> Result<(), Error> {
    let mut file = File::create("target/test.db")?;
    let mut db = Database { inner: HashMap::new() };

    // Over time you collect some kind of data.
    db.inner.insert("my.email@example.com".to_string(), "eKPV$PM8TV5A2".to_string());

    // You can choose how to serialize data. Also, you can compress it.
    let encoded = db.try_to_vec().unwrap();

    // Finally, you want to store your data secretly.
    // Supply some password to Cocoon: password is any byte array, basically.
    // Don't use a hard-coded password in real life!
    // It could be a user-supplied password.
    let cocoon = Cocoon::new(b"secret password");

    // Dump the serialized database into a file as an encrypted container.
    let container = cocoon.dump(encoded, &mut file)?;

    Ok(())
}

Cryptography

256-bit cryptography is chosen as a Cocoon baseline.

Cipher (AEAD) Key Derivation Function (KDF)
Chacha20-Poly1305 PBKDF2-SHA256: 100000 iterations
AES256-GCM
  • Key: 256-bit.
  • Salt for KDF: random 128-bit + predefined part.
  • Nonce for encryption: random 96-bit.

Key derivation parameters comply with NIST SP 800-132 recommendations (salt, iterations), and cipher parameters (key, nonce, length) fit requirements of a particular cipher. AEAD is chosen in order to authenticate encrypted data together with an unencrypted header.

Zeroization

Encryption key is wrapped into zeroizing container (provided by zeroize crate), which means that the key is erased automatically once it is dropped.

How It Works

See more implementation details on docs.rs, e.g.

  1. the process of container creation,
  2. customizable crate features,
  3. and of course API.

Dependencies

~2MB
~32K SLoC