Method for authenticated communication in dynamic federated environments
According to one embodiment of the present invention, a method for protecting authenticated communication in dynamic federated environments is provided. The method includes distributing shares of a private signature key to a group of users. When switching from an existing to a new group of users, the method includes producing a plurality of sub-shares from each of the distributed shares of existing users, with each sub-share being accompanied by a corresponding validity proof. The sub-shares from multiple existing users are combined to generate a set of shares for new users, with each new share being derived from sub-shares from multiple existing users.
1. A method comprising:
distributing shares of a private signature key to a group of users with a first processor;
producing a plurality of sub-shares from each of said distributed shares with a processor associated with at least one user of the group of users, with each sub-share being accompanied by a corresponding validity proof;
distributing the plurality of sub-shares among a set of new users, wherein each of the group of users receives sub-shares from a multiple users;
verifying whether each sub-share in that is received by the each user of the set of new users is valid; and
combining said valid sub-shares from multiple existing users at each one of the set of new users to generate a set of new shares, each said new share being derived from valid sub-shares from multiple users, wherein, based on said verifying determining that a received sub-share is invalid, said invalid sub-share is not used in said generating.
2. A method according to claim 1 further comprising:
determining whether a minimum number of said sub-shares have been received by a new user; and
based on said minimum number having been received, said new user constructing a new share using said valid sub-shares.
3. A method according to claim 1 wherein said validity proof is a non-interactive zero-knowledge validity proof.
4. A method according to claim 1 wherein each said new share includes a corresponding validity proof.
5. A method according to claim 1 further comprising:
sending said share and corresponding validity proof to a client; and
said client reconstructing said private signature key by combining said new shares and corresponding validity proofs.
6. A method according to claim 1 wherein said users are computer systems.
7. A method according to claim 1 wherein said users are individual satellites.
8. A system comprising:
a plurality of computer systems, each of the plurality of computer systems comprising a respective memory and respective processor, the plurality of computer systems configured to:
distribute shares of a private signature key to a group of users with a first processor;
produce a plurality of sub-shares from each of said distributed shares with a processor associated with at least one user of the group of users, with each sub-share being accompanied by a corresponding validity proof;
distribute the plurality of sub-shares among a set of new users, wherein each of the group of users receives sub-shares from a multiple users;
verify whether each sub-share in that is received by the each user of the set of new users is valid; and
combine said valid sub-shares from multiple existing users at each one of the set of new users to generate a set of new shares, each said new share being derived from valid sub-shares from multiple users, wherein, based on said verifying determining that a received sub-share is invalid, said invalid sub-share is not used in said generating.
9. A system according to claim 8 wherein said validity proof is a non-interactive zero-knowledge validity proof.
10. A computer program product for authenticating communications, said computer program product comprising:
a non-transitory computer usable medium having computer usable program code embodied therewith, said computer usable program code comprising: computer usable program code configured to:
distributing shares of a private signature key to a group of users with a first processor;
producing a plurality of sub-shares from each of said distributed shares with a processor associated with at least one user of the group of users, with each sub-share being accompanied by a corresponding validity proof;
distributing the plurality of sub-shares among a set of new users, wherein each of the group of users receives sub-shares from a multiple users;
verifying whether each sub-share in that is received by the each user of the set of new users is valid; and
combining said valid sub-shares from multiple existing users at each one of the set of new users to generate a set of new shares, each said new share being derived from valid sub-shares from multiple users, wherein, based on said verifying determining that a received sub-share is invalid, said invalid sub-share is not used in said generating.