B-GKAP2 Key Computation. Let M be organization count for Ui 2 Unetwork. In B-GKAP2, for the functions generateAndSendPublicKeyv2(·) and querySecretKeysv2(·), network transmission occurs for each organization. Table 5.3. Communication cost of B-GKAP2 key computation for each participant. Function Ct generateAndSendPublicKeyv2(·) |4Mq + 2M p| queryPublicKeyv2(·) |2q + p| generateAndSendSecretKeyv2(·) |3q + p| querySecretKeysv2(·) |(N + 2M — 1)q + M p| According to Table 5.3, communication cost for each participant |(N + 7M + 4)q + (3M + 2)p| bits and communication complexity is: Ct = O(N)|(N + 7M + 4)q +(3M + 2)p|.
Appears in 1 contract
Sources: Master's Thesis
B-GKAP2 Key Computation. Let M be organization count for Ui 2 ∈ Unetwork. In B-GKAP2, for the functions generateAndSendPublicKeyv2(·) and querySecretKeysv2(·), network transmission occurs for each organization. Table 5.3. Communication cost of B-GKAP2 key computation for each participant. Function Ct generateAndSendPublicKeyv2(·) |4Mq + 2M p| 2Mp| queryPublicKeyv2(·) |2q + p| generateAndSendSecretKeyv2(·) |3q + p| querySecretKeysv2(·) |(N + 2M — − 1)q + M p| Mp| According to Table 5.3, communication cost for each participant |(N + 7M + 4)q + (3M + 2)p| bits and communication complexity is: Ct = O(N)|(N + 7M + 4)q +(3M + 2)p|.
Appears in 1 contract
Sources: Thesis Submission Agreement