Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/go-compile/unknownaccess

UnknownAccess is a plausible deniable secret encryption scheme. Utilising; AES_256_GCM Argon2Key KDF and HKDF.
https://github.com/go-compile/unknownaccess

aes-256-gcm argon2 byteformat encryption hidden hkdf plausible-deniability qrcode secrets symetric-key volume

Last synced: about 2 months ago
JSON representation

UnknownAccess is a plausible deniable secret encryption scheme. Utilising; AES_256_GCM Argon2Key KDF and HKDF.

Awesome Lists containing this project

README

        

# UnknownAccess

[![Go Report Card](https://goreportcard.com/badge/go-compile/UnknownAccess)](https://goreportcard.com/report/go-compile/UnkownAccess)
[![go.dev reference](https://img.shields.io/badge/go.dev-reference-007d9c?logo=go&logoColor=white)](https://pkg.go.dev/github.com/go-compile/UnkownAccess)

UnknownAccess is a plausible deniable secret encryption scheme. Utilising; AES_256_GCM Argon2Key KDF and HKDF. It allows you to store upto 3 unique secrets; Cryptocurrency seeds, 2FA codes, Passwords etc, in a single output of ciphertext. Depending on the key used to decrypt, the outputted secret will be different.

This allows you to handover a decoy secret (e.g. Bitcoin seed) to an adversary, without the adversary being able to prove the secret is a decoy. Intern, allowing you to maintain privacy, even when being physically coerced.

---

![PROTOCOL FIGURE ONE](./.github/images/banners.png)

---

## Security Guarantees
- No one can infer how many encrypted volumes are in use.
- Even if k1 or k2 or k3 is compromised.
- 256bit AES symmetric encryption.
- ASIC resistant, GPU resistant using Argon2 KDF
- Rainbow table resistant (via use of salt/nonce unique to each secret data block)

---

![PROTOCOL FIGURE TWO](./.github/images/banners2.png)

*Note position/order of encrypted volumes/"data blocks" are randomised and volume sizes are fixed to deny any inference on the amount of hidden volumes and volume sizes*

---