Okay, sounds like the same idea, more or less.  But I have an excuse
   for being 15 years too late:  I was, uh, occupied at the time.
             Jim Bell

   On Wednesday, January 30, 2019, 9:11:31 AM PST, grarpamp
   <grarpamp@gmail.com> wrote:
   On 1/29/19, jim bell <[1]jdb10987@yahoo.com> wrote:
   > [2]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 ...
   [3]https://en.wikipedia.org/wiki/OFFSystem
   [4]http://offsystem.sourceforge.net/
   [5]https://sourceforge.net/projects/offsystem/

References

   1. mailto:jdb10987@yahoo.com
   2. https://en.wikipedia.org/wiki/Gilbert_Vernam
   3. https://en.wikipedia.org/wiki/OFFSystem
   4. http://offsystem.sourceforge.net/
   5. https://sourceforge.net/projects/offsystem/