A Scalable Cross-Chain Access Control and Identity Authentication Scheme

View full-text article in PMC

. 2023 Feb 10;23(4):2000. doi: 10.3390/s23042000

Algorithm 1 Cross-chain data circulation

1:
Input:
2:
$C H A I N S$ : the set of chains in the cross-chain system
3:
$A G$ : the set of auto agents
4:
$A G R o b o t$ : the set of AGRobots
5:
$C r o s s C o n$ : the set of cross-chain contracts
6:
Output:
7:
True or False
8:
————————————————————————————————————————
9:
1. Propose ( $u_{i}$ from $A C_{i}$ to $A C_{j}$ ):
10:
$F r o m C h a i n I D \leftarrow C h a i n I D_{i}$
11:
$T o C h a i n I D \leftarrow C h a i n I D_{j}$
12:
$t x_{i} \leftarrow C r o s s C o n_{i} (F r o m C h a i n I D, T o C h a i n I D, O p t i o n s)$
13:
Broadcast $t x_{i}$ in $A C_{i}$
14:
invoke (Cross-chain broadcast)
15:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
16:
2. Cross-chain broadcast:
17:
$A G_{i}$ receives $t x_{i}$
18:
if $F r o m C h a i n I D \neq T o C h a i n I D$ then
19:
$t x_{s} \leftarrow A G R o b o t (t x_{i})$
20:
Broadcast $t x_{s}$ in $S C$
21:
invoke (Response)
22:
else
23:
Broadcast $t x_{i}$ in $A C_{i}$
24:
return false
25:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - – - - - - - - - - - - - - - - - - - - -
26:
3. Response ( $A G_{k}$ receives $t x_{s}$ ):
27:
if $T o C h a i n I D = C h a i n I D_{k}$ then
28:
$t x_{k} \leftarrow A G R o b o t (t x_{s})$
29:
Broadcast $t x_{k}$ in $A C_{k}$
30:
$C r o s s C o n_{k} (F r o m C h a i n I D, T o C h a i n I D, O p t i o n s)$
31:
Return True
32:
else
33:
Broadcast $t x_{s}$ in $S C$
34:
Return False