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

Fig 1.

The DIA system model.

More »

Fig 1 Expand

Table 1.

Advantages and disadvantages of existing methods.

More »

Table 1 Expand

Table 2.

Notations used in the design of TOD.

More »

Table 2 Expand

Table 3.

Computational complexities of the Paillier, RSA and LiSHA schemes.

More »

Table 3 Expand

Fig 2.

Four types of tags, their relationship and inputs and schemes used to generate them.

More »

Fig 2 Expand

Fig 3.

The functional components of the TOD method.

More »

Fig 3 Expand

Table 4.

Math equations for the generations of different tags.

More »

Table 4 Expand

Table 5.

Math equations for tag verifications (private and public).

More »

Table 5 Expand

Table 6.

Notations used in the security analysis.

More »

Table 6 Expand

Fig 4.

Costs of brute-force attack on IDTag versus the value of m.

More »

Fig 4 Expand

Fig 5.

BFADBTagTag cost: Scenarios-1 vs Scenarios-2 (GF(2128), bits and LMappingSecretKey = 160 bits).

More »

Fig 5 Expand

Fig 6.

BFADBTagTag cost: Scenarios-2 vs Scenarios-3 (LMappingSecretKey = 160 bits).

More »

Fig 6 Expand

Fig 7.

BFASTagPriVer vs the length of tag (m) and the total number of IDTags for a data file (d).

More »

Fig 7 Expand

Fig 8.

PPubVer vs. the bit-lengths of DBTag, En_IDTag and DBTagTag.

More »

Fig 8 Expand

Fig 9.

Cost of BFAAECH vs. the bit-lengths of the element in G1 and p.

More »

Fig 9 Expand

Fig 10.

Level of efforts on brute-force attack on a LiSHE key vs. the key length and the key space.

More »

Fig 10 Expand

Fig 11.

Given C = 50 blocks: Selection space (number of possible combinations) vs. file size (number of data blocks).

More »

Fig 11 Expand

Table 7.

Basic operations: Symbols and meanings.

More »

Table 7 Expand

Fig 12.

TOD method vs the OTfMB and OTfSB approaches: The number of tags generated against data redundancy percentage, K = 1000, total number of blocks in a data file, 4 Data Blocks are used in generating one tag in OTfMB approach.

More »

Fig 12 Expand

Table 8.

Tag generation and verification costs.

More »

Table 8 Expand

Table 9.

Comparing TOD method with existing tagging methods against the specified requirements.

More »

Table 9 Expand

Fig 13.

The required time of encryption vs. data redundancy percentage.

More »

Fig 13 Expand

Table 10.

Comparing the TOD method and the related works: The required time of tag generation (in seconds).

More »

Table 10 Expand

Fig 14.

Tag generation cost vs data blocks number.

More »

Fig 14 Expand

Table 11.

TOD method vs. BLS based tagging method: The required time (in seconds) of private and public tag verification.

More »

Table 11 Expand

Fig 15.

Public tag verification cost: Individual vs batch verifications.

More »

Fig 15 Expand

Fig 16.

Batch verification cost: Private vs public.

More »

Fig 16 Expand

Table 12.

TOD method vs the related work: The tag size generated (in bytes).

More »

Table 12 Expand