AbstractResearch Paper • September 18th, 2022
Contract Type FiledSeptember 18th, 2022adversary that takes as input (x0, x1), makes some number of queries to (g, u, v, d) (but not to e) and outputs a set Chal = {(pk1, c1), . . . , (pkw, cw)}. We say the event Success holds if (i) w ≥ [2 |x1| [ + 1; (ii) all the pairs are distinct, and (iii) for all i ∈ [w] v(pki, ci) = 𝖳. We then have Pr[Success] 2−λ/2 = negl(λ), where the probability is taken over (g, e, d, u, v) $ Ψ and the random coins of A and B.
AbstractResearch Paper • October 4th, 2021
Contract Type FiledOctober 4th, 2021Continuous Group Key Agreement (CGKA) is the basis of modern Secure Group Messaging (SGM) protocols. At a high level, a CGKA protocol allows group members to continually be able to compute a shared secret while members of the group add new members, remove other existing members, or perform state updates. The state updates allow for CGKA to offer desirable security features such as forward secrecy and post-compromise security.