A Scalable Cross-Chain Access Control and Identity Authentication Scheme

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

Algorithm 2 Cross-chain data circulation with access control and identity authentication ( $I$ : improvement point)

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:
Authenticate $u_{i}$ in $A C_{i}$ ▹ $I$
13:
$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)$
14:
Broadcast $t x_{i}$ in $A C_{i}$
15:
invoke (Cross-chain broadcast)
16:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - – - - - - - - - - - - - - - - - - - - -
17:
2. Cross-chain broadcast:
18:
$A G_{i}$ receives $t x_{i}$
19:
if $F r o m C h a i n I D \neq T o C h a i n I D$ then
20:
$S i g_{A G_{i}} \leftarrow S K_{A G_{i}} (T o C h a i n I D)$ ▹ $I$
21:
$A C I A C_{s} \leftarrow (F r o m C h a i n I D, T o C h a i n I D, S i g_{A G_{i}})$ ▹ $I$
22:
if $P K_{A G_{i}} (S i g_{A G_{i}}) \equiv T o C h a i n I D$ then ▹ $I$
23:
$t x_{s} \leftarrow A G R o b o t (t x_{i})$
24:
Broadcast $t x_{s}$ in $S C$
25:
invoke (Response)
26:
else ▹ $I$
27:
Return False ▹ $I$
28:
else
29:
Broadcast $t x_{i}$ in $A C_{i}$
30:
Return False
31:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - – - - - - - - - - - - - - - - - - - - -
32:
3. Response ( $A G_{k}$ receives $t x_{s}$ ):
33:
if $T o C h a i n I D = C h a i n I D_{k}$ then
34:
$S i g_{A G_{j}} \leftarrow S K_{A G_{j}} (F r o m C h a i n I D)$ ▹ $I$
35:
$A C I A C_{s} \leftarrow (F r o m C h a i n I D, T o C h a i n I D, S i g_{A G_{j}})$ ▹ $I$
36:
if $P K_{A G_{j}} (S i g_{A G_{j}}) \equiv F r o m C h a i n I D$ then ▹ $I$
37:
$t x_{k} \leftarrow A G R o b o t (t x_{s})$
38:
Broadcast $t x_{k}$ in $A C_{k}$
39:
else
40:
Return False ▹ $I$
41:
$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)$
42:
Return True
43:
else
44:
Broadcast $t x_{s}$ in $S C$
45:
Return False