Advances, Systems and Applications
Table 3 Scheme parameter description
From: Cross-chain asset trading scheme for notaries based on edge cloud storage
Attribute | Description |
|---|---|
\(PK_{1}\) | The public key on the source chains |
\(PK_{2}\) | The public key on the target chains |
\(M_{New_{i} }\) | Historical transaction information of new nodes |
\(M_{Old_{i} }\) | Historical transaction information of old nodes |
\(S_{iN }\) | The new node feedback evaluation value |
\(S_{iO }\) | The old node feedback evaluation value |
\(X_{iN }\) | Transaction feedback evaluation value of new node |
\(X_{iO }\) | Transaction feedback evaluation value of old node |
\(T_{jO}\) | The transaction processing efficiency |
\(R_{iN}\) | The recommendation evaluation value of new nodes |
\(R_{iO}\) | The recommendation evaluation value of old nodes |
\(G_{iO}\) | The negative message evaluation value of old nodes |
\(H_{iO}\) | The trust relationship table for old nodes |
\(P_{iN}\) | Proof of new node deposit payment |
\(P_{iO}\) | Proof of old node deposit payment |
\(grade_{i}\) | The user feedback evaluation value |
\(Nu_{i}\) | The node transaction success volum |
\(Nu_{All}\) | The total transaction volume of nodes |
\(number_{agree_{i} }\) | The recommended quantity of nodes |
\(time_{i}\) | The transaction times |
\(number_{i}\) | The amount of negative messages |
M | Node historical transaction information set |
\(Q_{S_{i} }\) | Overall user feedback value |
\(Q_{X_{i} }\) | Overall success rate |
\(Q_{T_{i} }\) | Overall transaction efficiency |
\(Q_{G_{i} }\) | Overall negative user messages |
\(A_{i}\) | The index vector |
\(P_{MN}\) | The similarity between nodes M and N |
\(PR_{i}\) | The credit rating value of the new node |
\(PR_{j} ^{\prime }\) | Historical transaction evaluation value of old nodes |
\(PR_{Oj} ^{\prime }\) | Indirect trust values between old nodes |
\(d_{0}\) | Damping coefficient of node |
t | Participation time in cross-chain transactions |
\(d_{j}\) | Cross-chain time t and \(d_{0}\) function |
\(PR_{j}\) | Comprehensive credit rating value of old nodes |
F(X) | Transaction success rate function |
\(X_{x}\) | Transaction success rate of old nodes |
\(X_{xy}\) | Transaction success rate of introducing new nodes |
\(N_{iN}\) | The number of new nodes redundancy |
\(N_{iO}\) | The number of old nodes |