Table 1.
Comparison of Literature Review with BAAR.
Table 2.
Notations used in BAAR.
Fig 1.
BAAR Scheme with Entities.
Fig 2.
End-to-end sequence of the BAAR protocols for anonymous and revocable user authentication.
Table 3.
Gas Cost & Transaction Time.
Table 4.
Complexity analysis of BAAR Scheme.
Fig 3.
Comparative computational performance of BAAR and three baseline schemes— [36] and [37] across four cryptographic operations: Setup, Key Generation, Verification, and Revocation (log scale).
Fig 4.
Comparison of cost of gas between BAAR and threshold credential scheme [37] to Create, Verify and Revocation operations.
Fig 5.
Processing time of total revocation versus the number of revoked credentials, both representing scaling of accumulator updates of the scheme [14] and the proposed BAAR scheme with Merkle accumulators.
Fig 6.
Latency per-revocation versus the number of revoked credentials, a comparison between the on-verification witness update strategy of [14] and that of the BAAR scheme proposed in Merkle accumulator, illustrating real-time operation cost differences.
Fig 7.
Phase-wise execution time comparison between BAAR and [15] across Request, Generation, Validation, and Verification phases.
Fig 8.
Scalability evaluation with increasing attribute vector length, showing performance and attribute privacy trade-offs between BAAR and [15].