Some time ago I read about a means of a group–let’s say a group of 4 people could use to secure a password such that at least 3, and any 3, of the 4 were required to recover it. I swear the implementation was based on properties of a polynomial that each individual’s secret key helped compose, but I cannot remember enough details to tease the solution out of google.
Does anyone know what I’m talking about so I may revisit this topic?
One way you could do it is to pick three of the four passwords, and make the system require all three of those passwords to open up. Then, you construct the fourth password by taking the parity bit of the other three passwords. With any three such keys, no matter which they are, you can reconstruct the missing one, and thereby have all the information the system is asking for.
Note carefully the use of terminology: it doesn’t go the way non-experts think it might.
Sounds like you’re thinking of partial-key escrow.
There’s a synopsis of a whole bunch of PKE schemes here.
ftg, that’s exactly it. gotpasswords, excellent followup. Thanks.