Graded Consistency. If Pi assigns grade 2 to a public key pk, i.e., (pk, 2) KeySeti), then assigns at least grade to the same key, i.e., , where . H
Graded Consistency. For every key/sessionid pair (vk, sid), and every two honest parties Pi and Pj,
Graded Consistency. For every key/sessionid pair (vk, sid), and every two honest parties Pi and Pj, |GradeKeyi(vk, sid) − GradeKeyj (vk, sid)| ≤ 1. Note that it is trivial to construct a d′-graded PKI from a d-graded PKI when d′ < d, by defining GradeKey(vk, sid)′ = max {0, GradeKey(vk, sid) − (d − d′)}.
Graded Consistency. If two honest parties Pi and Pj output gi = gj = 1, respectively, then yi = yj – d-Detection: If two honest parties Pi and Pj output yi = 1 and yj = 0, respectively, then an additional d parties are added to the faulty lists of all honest parties; that is, T Pj∈H F ⋆ \ T Pj∈H Fj ≥ d.
