## 3 Construction
### Implementation
's scheme is \(O(C+N)\), and the complexity of our scheme is also \(O(C+N)\), where \(C\) represents the length of the ciphertext and \(N\) represents the number of attributes in the attribute space. In fact, Allison et al. 's scheme involves \(C+2N\) terms, whereas ours involves \(C+3N\) terms, which results in a small difference in overhead. The generated ciphertext is also stored in the form of key-value pairs. We take plaintext \"_hello_\" as an example, and the encrypted \(C_{0}\) format is as follows:

\[G_{T}(H(M))=\overline{C_{0}}/e(g^{s},g^{s})\]3 Key Generation. \[G_{T}(H(M))=\overline{C_{0}}/e(g^{s},g^{s})\]4 Encryption. Cq_1:{x=18512619911661450195327750867443546794232624419671207238173221146535506
95552872207298169171836981828215064641158984234,y=70592147653957222146120442588
2624722810944092606551932879619145643069907176528655887436471753185725971617607
912359879737

Co_1:{x=10305743198129175737055428555819461127421625147813759967731163938926816
6507402142158364275035782497518307635598710737,y=9864469019751328170895523932
326015413634530429521486226982447421217410734488535182673330718902818130451275
75927761095]

Cq_2:{x=85627632985010802758634299337508008509965737271381026168608890332725357
5176938744611450363168080075196481905182611275,y=691570434291204284847195645886
478739452354723338419697486692137357841812076088296305720924512144895097136125
4706491542)

Cq_3:{x=85627632985010802758634299337508008509965737271381026168608890332725357
5176938744611450363168080075196481905182611275,y=6915704342912042848719564586
478739452354723338419697486692137357841812076088296305720924512144895097136125
4706491542)

Cq_4:{x=1082820915380495583407764646756944029982110212914633729470472089926979
658204543756244731444812151580842960742884772,y=41104508855643689234607591514
8105748998457729928230807668065408791706458037634503664240890763024397642409757
902239244)

\[G_{T}(H(M))=\overline{C_{0}}/e(g^{s},g^{s})\]5 Decryption. OurScheme.Decrypt(\"file/Key\",\"file/CT_AT\");

The plaintext after decryption is:hello

Finally, Figure 9 shows a comparison of the memory overhead between our scheme and the scheme proposed by [PERSON] et al. Due to the involvement of our scheme's interactive functions, such as \(\mathit{sendToAT()}\), \(\mathit{KeyGenAT()}\), and \(\mathit{id}\) extraction function \(\mathit{extractID()}\), our scheme incurs a higher memory overhead than [PERSON] et al. 's scheme. ## 5 Conclusions

Based on Paillier encryption and \(\mathit{CP-ABE}\), this paper proposes a data rights confirmation scheme, which effectively solves the ownership of data and the right to use data. The work of confirming the rights of the plaintext is transferred to the confirmation of the ciphertext. Before the plaintext audit, no one can access the original data except the user designated by the data user, which provides a guarantee that the source data will not be leaked. Finally, the security of the scheme is proved, and the efficiency and feasibility of the scheme are analyzed through experiments. First, this article does not exclude the third party, and the data transaction behavior between users is not specified, but only stipulates the \"ownership\" of data and the \"rights to use\" of data. Second, this paper does not consider how to implement the tracking of the key and revocation of the key when the data owner discovers the data leakage. Finally, there is no guarantee that the credentials stored in \(\mathit{AT}\) are authentic. In future work, we will conduct related research on data transactions. Considering the key tracing and key revocation problems, the traceability and revocability of keys can be achieved by combining the scheme proposed by [PERSON] et al. [14] and the subset coverage technique. How to combine smart contracts and blockchain to solve the problem of traditional third-party untrustworthiness is also part of our future work. [PERSON] designed the article architecture, wrote the manuscript, and completed the experimental tests. Y.C. provided funding support, [PERSON], [PERSON] and T.L.