3 ms·
Simple way might be to just use overrepresented[1] error correction code like Reed-Solomon where it'd only take half the parties to reconstruct the full message
by simcop2387 15y ago
Simple way might be to just use overrepresented[1] error correction code like Reed-Solomon where it'd only take half the parties to reconstruct the full message. Should be fairly easy to set up using par2 utilities right now actually.
[1] I'm fairly certain there's a real word for this, but I cannot think of it, anyone else know?
- xyzzyz 15y agoI'm fairly sure that using this scheme will leak "encrypted" data like crazy. What is your proposed algorithm, exactly?
- gwern 15y agoSounds like what Tahoe-Lafs does - uses the ZFEC (another FEC algorithm, like Reed-Solomon, but much faster) library to let you specify how much redundancy to generate; you can have 2-out-of-3 or 3-out-of-9 or other ratios.
- Sniffnoy 15y agoAssuming the number of parties is fixed (and it would have to be, wouldn't it? I don't see how the question could make sense otherwise), this is still more complicated than necessary. The general term for this is "secret sharing" and there's a really simple method for it, known as Shamir's Secret Sharing.