Spaces:
Sleeping
Sleeping
| [ | |
| { | |
| "path": "table_paper/2407.00073v2.json", | |
| "table_id": "1", | |
| "section": "5.1", | |
| "all_context": [ | |
| "Table 1 presents the computational complexity of our NI-CBE protocol.", | |
| "In this table, the computation cost of GlobeSteup algorithm is not analyzed since this algorithm only needs to be run once.", | |
| "That is, the efficiency of our protocol are mainly determined by the rest of algorithms.", | |
| "We note that some operations that can be pre-computed are not considered here.", | |
| "/ denotes the time to compute a scalar exponentiation operation/a scalar multiplication operation on the bilinear groups and .", | |
| "denotes the time to complete a bilinear map operation.", | |
| "denotes the group size while represents the current number of group members of any group where a new party/old group member intends to join/leave this group.", | |
| "denotes the total number of existing group members in the target group before performing Encrypt algorithm and represents the number of group members who are chosen as recipients within the target group.", | |
| "Then, we have and .", | |
| "" | |
| ], | |
| "target_context_ids": [ | |
| 0, | |
| 1, | |
| 2, | |
| 3, | |
| 4, | |
| 5, | |
| 6, | |
| 7, | |
| 8 | |
| ], | |
| "selected_paragraphs": [ | |
| "[paragraph id = 0] Table 1 presents the computational complexity of our NI-CBE protocol.", | |
| "[paragraph id = 1] In this table, the computation cost of GlobeSteup algorithm is not analyzed since this algorithm only needs to be run once.", | |
| "[paragraph id = 2] That is, the efficiency of our protocol are mainly determined by the rest of algorithms.", | |
| "[paragraph id = 3] We note that some operations that can be pre-computed are not considered here.", | |
| "[paragraph id = 4] / denotes the time to compute a scalar exponentiation operation/a scalar multiplication operation on the bilinear groups and .", | |
| "[paragraph id = 5] denotes the time to complete a bilinear map operation.", | |
| "[paragraph id = 6] denotes the group size while represents the current number of group members of any group where a new party/old group member intends to join/leave this group.", | |
| "[paragraph id = 7] denotes the total number of existing group members in the target group before performing Encrypt algorithm and represents the number of group members who are chosen as recipients within the target group.", | |
| "[paragraph id = 8] Then, we have and ." | |
| ], | |
| "table_html": "<figure class=\"ltx_table\" id=\"S5.T1\">\n<figcaption class=\"ltx_caption ltx_centering\"><span class=\"ltx_tag ltx_tag_table\">Table 1: </span>Computation Cost of the Algorithms</figcaption>\n<table class=\"ltx_tabular ltx_centering ltx_guessed_headers ltx_align_middle\" id=\"S5.T1.5\">\n<thead class=\"ltx_thead\">\n<tr class=\"ltx_tr\" id=\"S5.T1.5.6.1\">\n<th class=\"ltx_td ltx_align_center ltx_th ltx_th_column ltx_th_row ltx_border_l ltx_border_r ltx_border_t\" id=\"S5.T1.5.6.1.1\">Algorithms</th>\n<th class=\"ltx_td ltx_align_center ltx_th ltx_th_column ltx_border_r ltx_border_t\" id=\"S5.T1.5.6.1.2\">Computation Cost</th>\n</tr>\n</thead>\n<tbody class=\"ltx_tbody\">\n<tr class=\"ltx_tr\" id=\"S5.T1.1.1\">\n<th class=\"ltx_td ltx_align_center ltx_th ltx_th_row ltx_border_l ltx_border_r ltx_border_t\" id=\"S5.T1.1.1.2\">KeyRegis</th>\n<td class=\"ltx_td ltx_align_center ltx_border_r ltx_border_t\" id=\"S5.T1.1.1.1\"></td>\n</tr>\n<tr class=\"ltx_tr\" id=\"S5.T1.2.2\">\n<th class=\"ltx_td ltx_align_center ltx_th ltx_th_row ltx_border_l ltx_border_r ltx_border_t\" id=\"S5.T1.2.2.2\">KeyDerive</th>\n<td class=\"ltx_td ltx_align_center ltx_border_r ltx_border_t\" id=\"S5.T1.2.2.1\"></td>\n</tr>\n<tr class=\"ltx_tr\" id=\"S5.T1.3.3\">\n<th class=\"ltx_td ltx_align_center ltx_th ltx_th_row ltx_border_l ltx_border_r ltx_border_t\" id=\"S5.T1.3.3.2\">KeyUpdate</th>\n<td class=\"ltx_td ltx_align_center ltx_border_r ltx_border_t\" id=\"S5.T1.3.3.1\"></td>\n</tr>\n<tr class=\"ltx_tr\" id=\"S5.T1.4.4\">\n<th class=\"ltx_td ltx_align_center ltx_th ltx_th_row ltx_border_l ltx_border_r ltx_border_t\" id=\"S5.T1.4.4.2\">DCBEncrypt</th>\n<td class=\"ltx_td ltx_align_center ltx_border_r ltx_border_t\" id=\"S5.T1.4.4.1\"></td>\n</tr>\n<tr class=\"ltx_tr\" id=\"S5.T1.5.5\">\n<th class=\"ltx_td ltx_align_center ltx_th ltx_th_row ltx_border_b ltx_border_l ltx_border_r ltx_border_t\" id=\"S5.T1.5.5.2\">DCBDecrypt</th>\n<td class=\"ltx_td ltx_align_center ltx_border_b ltx_border_r ltx_border_t\" id=\"S5.T1.5.5.1\"></td>\n</tr>\n</tbody>\n</table>\n</figure>", | |
| "perturb_sentence_id": [ | |
| 0, | |
| 1 | |
| ], | |
| "output": { | |
| "perturbed_statement": "[paragraph id = 0] Table 1 presents the computational complexity of our NI-CBE protocol. In this table, the computation cost of the Encrypt algorithm is not analyzed since this algorithm only needs to be run once.", | |
| "perturbed_explanation": "Original Explanation: The computation cost of the GlobeSteup algorithm is not analyzed since it is only needed to be run once, indicating that its infrequent use makes it less critical to include in regular computational complexity analysis. 2. The statement is incorrect because it incorrectly states that the computation cost of the Encrypt algorithm is not analyzed due to it running only once. The Encrypt algorithm is not mentioned in the context in relation to this particular aspect, and its cost depends on multiple calculations involving group members, making it a crucial part of computational analysis." | |
| } | |
| } | |
| ] |