In general, the approach in this paper has a low computing overhead, where m represents the number of rows of the matrix in LSSS, y represents the number of leaf nodes in the access tree, both m and y correspond to the number of attributes, so their meanings in Table 3 are the same...