Sorry if this question is stupid, but is there an encryption algorithm where a message is encrypted with a set of n keys which can then be deciphered with any sufficiently large subset of those? E.g. encrypt with 3 keys and any 2 are sufficient to decipher the message. AFAIK some blockchain wallets have a functionality similar to this.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.