<html>
<head>
<meta content="text/html; charset=windows-1252"
http-equiv="Content-Type">
</head>
<body bgcolor="#FFFFFF" text="#000000">
<div class="moz-cite-prefix"><br>
On 07/08/2016 06:21 PM, IngeGNUe wrote:<br>
</div>
<blockquote
cite="mid:98b3d0ac-a0df-791e-72f6-56a647c8189f@riseup.net"
type="cite">
<blockquote type="cite">
<pre wrap="">If it's encrypted, who holds the
decryption keys?
</pre>
</blockquote>
<pre wrap="">
Decryption keys are an interesting security problem. One person could
know the password and 10 could store the keys somewhere, BUT then you
have 11 times (or whatever) the chance that some cracker will find it
and brute force the keys. Since they're decryption keys, I don't recall
any way you could set a lockout for incorrect attempts.
The safest storage for keys is offline.
Parabola's non-hierarchical organization conflicts with the assumptions
of hierarchical managament most of this infrastructural software
assumes. This is a fault of the software design, not Parabola hackers.
I'm not sure how to solve this problem, but I thought I'd take a stab.
</pre>
</blockquote>
<p>I've never tried it, but would like to bring attention to the
following two program included in Tails, which are designed to
create a non-hierarchal key arrangement for this exact purpose.<br>
<br>
gfshare: <a class="moz-txt-link-freetext" href="http://www.digital-scurf.org/software/libgfshare">http://www.digital-scurf.org/software/libgfshare</a><br>
<br>
ssss: <a class="moz-txt-link-freetext" href="http://point-at-infinity.org/ssss/">http://point-at-infinity.org/ssss/</a><br>
<br>
To quote the algorithm:<b><br>
Shamir's Secret Sharing</b> is an <a
href="https://en.wikipedia.org/wiki/Algorithm" title="Algorithm">algorithm</a>
in <a href="https://en.wikipedia.org/wiki/Cryptography"
title="Cryptography">cryptography</a> created by <a
href="https://en.wikipedia.org/wiki/Adi_Shamir" title="Adi
Shamir">Adi Shamir</a>. It is a form of <a
href="https://en.wikipedia.org/wiki/Secret_sharing"
title="Secret sharing">secret sharing</a>, where a secret is
divided into parts, giving each participant its own unique part,
where some of the parts or all of them are needed in order to
reconstruct the secret.</p>
<p><br>
</p>
<p>In other words, no one holds the complete key, but as long as "x
amount" of developers still hold parts of the key, each one can
come together to unlock the file.<br>
</p>
</body>
</html>