Decentralized Storage Comparison

[grarpamp at gmail.com (grarpamp)]

On 1/29/19, jim bell <jdb10987 at yahoo.com> wrote:
> https://en.wikipedia.org/wiki/Gilbert_Vernam    What if a challengable
> document, call it "A",   is essentially split up into two:  Take random (or
> pseudorandom) string, the length of document "A", call it "B", is XOR'd
> (exclusive-or'd) with "A", and the result we will call "C", of the same
> length as "A" and "B".  Then, instead of having document "A" stored, store
> both "B" and "C", but maybe not on the same storage nodes.  Basically, an
> implementation of a one-time pad.  Or, instead of merely two strings, this
> could be expanded, in principle, to any number.
> The purpose of this is not to conceal the ultimate information, but to split
> up that information so that no one operator of a storage node contains
> enough information that arguably violates the law in the jurisdiction he
> happens to be at.  WIll this work?  Laws can be changed, but it would be
> difficult for a law to prohibit someone from possessing data that could
> conceivably be combined with some other information, somewhere, in order to
> regenerate some banned document "A".

There was something called OFFSystem ...

https://en.wikipedia.org/wiki/OFFSystem
http://offsystem.sourceforge.net/
https://sourceforge.net/projects/offsystem/