CRYPTOGRAPHY FOR SECURE DYNAMIC GROUP COMMUNICATIONS

摘要

Cryptographic dynamic group communications are disclosed, where: 1) a first player U1 initiates an upflow to the next player, the upflow based on a random value chi1 , a random value nu1 , and "g", a generator of a finite cyclic group where a computational solution to a Diffie-Hellman problem is hard; 2) each player after the first Up sends an upflow Flp , comprising information based on a random values chip , nup , and the previous upflow Flp-1 ; and 3) the last player Un sends a downflow Fln to all other players in the dynamic group, where the downflow Fln comprises information based on a random values chin , nun , and the previous upflow Fln-1 . Players may be added to or removed from the dynamic group by adjusting the downflow to the remaining players. The dynamic groups may be refreshed and/or merged by adjusting the downflow.