Saw this posted over here: https://sh.itjust.works/post/163355
sounds like a really fun concept that should be shared here too :D
I’ve always liked this, it has pretty much everything you could want in a personal project: a catchy name and a whimsical idea that is just on the edge of being actually practical.
Yeah, there is something oddly mesmerizing about projects that solve an “already-solved-in-a-more-efficient-way” problem in a weird way
I really like the name
I always thought this was such a cool concept when I was administrating a Hashicorp Vault server. I made 7 fragments for 7 keyholders, and required that 4 or 5 of them (can’t remember) enter their fragments to unlock the Vault server.
This is probably implemented with Shamir’s secret sharing algorithm or similar.
that’s super cool, almost zero use case but if you have a super sensitive string (such as a bank or wallet code) I guess it’s a good layer of offline security
This is cool! This could be a handy way to store important private keys like internal root CA keys in known locations that are distributed across an infrastructure. Oh man, maybe even in a vault file for secrets you don’t need often like break glass credentials and the like. Such a cool and unique idea!
Incredibly cool, will def try this
I love the way I would keep my stuff safe:
Now you just need to disperse the horcruxes around the house on various USBs or online locations and hope you can recall where they all are!
This is insane, I love it.
There is actually one use case for it. I create a yearly backup that i distribute across my friends (mostly via CD-ROMs) which include all my files that i can’t afford to lose, like encryption keys, keepass database, crypto wallets (everything that isn’t encrypted data gets aes-encrypted via gpg and a 512-bit key which is stored in the keepass database). But if say a malicious actor gets access to it by social-engineering they could start brute-forcing the keepass-database (good luck though with my passphrase and 10-rounds of argon2 with 4-threads and 4gig vector size), by splitting it into fragments that vector would be closed.