search

Roman2K / scat

Decentralized, trustless backup tool
https://github.com/Roman2K/scat/issues/1
MIT License
94 stars 9 forks source link

Threshold secret sharing for data (or metadata) #14

Open Intensity opened 7 years ago

Intensity commented 7 years ago

Divide the data into n chunks, any k of which are able to recover the information (but with fewer than k shares, no information on the original data can be discerned). An example is Shamir's secret sharing.

This could be combined with other processors. The data payload could be split between a few cloud providers. By metadata, I mean for example an index or an ephemeral symmetric key. But the more common case could be to apply threshold secret sharing to the stream.

Roman2K commented 7 years ago

Hi @Intensity. Sorry for the late reply, my notifications were disabled 🙈.

Indeed, that processing you suggest would take the form of a two new procs, one for splitting into parts (like parity), one for joining them (like uparity).

I don't need such a proc, so I must admit I don't have the motivation to invest time in it. Would you?