Skip to main content
Advertisement
Browse Subject Areas
?

Click through the PLOS taxonomy to find articles in your field.

For more information about PLOS Subject Areas, click here.

< Back to Article

Table 1.

Summary of related works.

More »

Table 1 Expand

Fig 1.

Network model.

More »

Fig 1 Expand

Table 2.

Symbols.

More »

Table 2 Expand

Fig 2.

System setup and registration.

More »

Fig 2 Expand

Fig 3.

Mutual authentication and key negotiation.

More »

Fig 3 Expand

Fig 4.

Key management.

More »

Fig 4 Expand

Fig 5.

The PBFT consensus algorithm.

More »

Fig 5 Expand

Fig 6.

Transactions management.

More »

Fig 6 Expand

Fig 7.

Structure of block βn.

More »

Fig 7 Expand

Algorithm 1.

Consensus for βn verification and addition.

More »

Algorithm 1 Expand

Fig 8.

New smart grid devices addition.

More »

Fig 8 Expand

Table 3.

Adversarial queries.

More »

Table 3 Expand

Table 4.

Execution time for various cryptographic operations.

More »

Table 4 Expand

Table 5.

Computation complexities comparisons.

More »

Table 5 Expand

Fig 9.

Computation complexities.

More »

Fig 9 Expand

Table 6.

Parameter sizes.

More »

Table 6 Expand

Table 7.

Derivation of communication complexity.

More »

Table 7 Expand

Table 8.

Communication complexities comparisons.

More »

Table 8 Expand

Fig 10.

Communication complexities.

More »

Fig 10 Expand

Table 9.

Supported features comparisons.

More »

Table 9 Expand

Fig 11.

Supported functionalities.

More »

Fig 11 Expand

Table 10.

Block βn components size.

More »

Table 10 Expand

Fig 12.

Effect of mined blocks on computation time.

More »

Fig 12 Expand

Fig 13.

Effect of number of transactions on computation time.

More »

Fig 13 Expand

Fig 14.

Effect of number of nodes on computation time.

More »

Fig 14 Expand

More »

Expand