Authenticated protocol. Thus applying the above compiler to our protocol yields a 3-round authenticated GKA protocol, P j with the follow- ing security reduction: r Theorem 3: AdvPAr (t, qex, qs) ≤ (qs + 2qex) ∗ SuccDDH 2k q +qexqs (tj)+ |P| ∗ SuccΣ(tj)+ s
Appears in 3 contracts
Samples: Efficient Group Key Agreement, Efficient Group Key Agreement, sorcersoft.org
Authenticated protocol. Thus applying the above compiler to our protocol yields a 3-round authenticated GKA protocol, P j with the follow- ing security reduction: r Theorem 3: AdvPAr (t, qex, qs) ≤ (qs + 2qex) ∗ SuccDDH 2k q +qexqs (tj)+ tj) + |P| ∗ SuccΣ(tj)+ SuccΣ(tj) + s
Appears in 1 contract
Samples: Efficient Group Key Agreement