Loading article...
Loading article...
Stream/Area:
-
Subject:
-
Paper ID:
IJSREM68019
Volume:
10 |
10 |
Oct 2026
Pages:
1-8
Publication Frequency:
Monthly (12 issues per year)
License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.

Department of Computer Science & Engineering
Buddha Institute of Technology

Department of Computer Science & Engineering
Buddha Institute of Technology
Systematic literature reviews on Attribute-Based Encryption (ABE) for blockchain-based cloud data management typically present qualitative comparisons disregarding hardware, cryptographic library, security level, policy depth, and consensus settings, so reported overheads remain incomparable across studies. We propose a Benchmark-Normalized SLR Framework reconfiguring the ABE module of a permissioned blockchain-based cloud data management system as a benchmark-aware, overhead-classified, and evidence-normalized subsystem instead of a monolithic cryptographic black box. The framework expands the conventional ABE module by means of three components: a Benchmark Normalization Kernel that maps raw time and communication measurements from thirty primary studies into a dimensionless, cross-platform comparable space via reference-hardware scaling and communication normalization; an Overhead Pattern Classifier that applies Ward-linkage agglomerative clustering with silhouette-score-based dendrogram cutting and decision-rule refinement to assign each scheme to one of four overhead classes, comprising pairing-bound, policy-size-bound, revocation-heavy, and communication-efficient; and a PRISMA-Guided Evidence Synthesizer that orchestrates the review protocol and produces a structured evidence base linking normalized costs to security assumptions, revocation methods, and deployment suitability. These components interchange structured data with the key generation authority, ciphertext policy engine, and revocation mechanism via a feedback loop selecting the ABE scheme minimizing normalized overhead subject to security, revocation, and deployment constraints. The framework consequently yields a reproducible, quantitative, and cross-platform comparable taxonomy of ABE schemes, and it permits designers of blockchain-cloud stacks to make evidence-based scheme selections rather than depending on incomparable, platform-specific measurements.
KEYWORDS
This paper set out to address a persistent obstacle in the literature on ABE for blockchain-based cloud data management: the incomparability of reported overheads across studies conducted under heterogeneous hardware, libraries, security levels, policy depths, and consensus settings. The Benchmark-Normalized SLR Framework addresses this impediment by conceptualizing the ABE module as a benchmark-conscious, overhead-categorized, and evidence-standardized subsystem. Its Benchmark Normalization Kernel maps raw stage-wise measurements from thirty primary studies into a dimensionless space, its Overhead Pattern Classifier assigns each scheme to one of four reproducible overhead classes through Ward-linkage clustering and decision-rule refinement, and its PRISMA-Guided Evidence Synthesizer links normalized costs to security assumptions, revocation methods, and deployment suitability while closing the loop between synthesized evidence and design decisions. The synthesis indicated the apparent disagreement among primary studies is largely attributable to measurement conditions rather than to cryptographic design, and the residual variation organizes into pairing-bound, policy-size-bound, revocation-heavy, and communication-efficient patterns whose trade-offs are systematic rather than incidental. Sensitivity analysis substantiated the endurance of these classes under altered correction factors and substitute linkage criteria, while simultaneously bounding the framework’s assertions: normalized values afford dependable ranking and classification yet ought not to be interpreted as exact latency forecasts. The framework’s principal value consists in transforming heterogeneous literature evidence into a constraint-aware selection instrument, thereby permitting designers of permissioned blockchain-cloud stacks to shortlist ABE schemes on comparable grounds and substantiate their choices via targeted measurements. Extending the normalization kernel to post-quantum and multi-authority constructions, and governing automated scheme selection through versioned evidence and human review, define the most immediate directions for continued work.
1. J. Bethencourt, A. Sahai, and B. Waters, “Ciphertext-policy attribute-based encryption,” in 2007 IEEE symposium on security and privacy (SP ’07), 2007. 2. D. Boneh and M. Franklin, “Identity-based encryption from the weil pairing,” in Annual international cryptology conference, 2001. 3. V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-based encryption for fine-grained access control of encrypted data,” Proceedings of the 13th ACM conference on Computer and communications security, 2006. 4. E. Androulaki, A. Barger, V. Bortnikov, C. Cachin, et al., “Hyperledger fabric: A distributed operating system for permissioned blockchains,” in Proceedings of the thirteenth eurosys conference, 2018. 5. J. Zhang, S. Zhong, T. Wang, H. Chao, et al., “Blockchain-based systems and applications: A survey,” Journal of Internet Technology, 2020. 6. M. Ferrag and L. Shu, “The performance evaluation of blockchain-based security and privacy systems for the internet of things: A tutorial,” IEEE Internet of Things Journal, 2021. 7. J Tetzlaff, D. Altman, t PRISMA Group, et al., “Preferred reporting items for systematic reviews and meta-analyses: The PRISMA statement,” PLoS Medicine, 2009. 8. J. Gong and N. Navimipour, “An in-depth and systematic literature review on the blockchain-based approaches for cloud computing,” Cluster Computing, 2022. 9. T. Saaty, “The analytic hierarchy process,” academia.edu, 1980. 10. A. Fahad, N. Alshatri, Z. Tari, A. Alamri, et al., “A survey of clustering algorithms for big data: Taxonomy and empirical analysis,” IEEE Transactions on Emerging Topics in Computing, 2014.
Publication Date
10/17/2026
Peer Review Type
Double-Blind Peer Review
Review Rounds: 2
Documents
Article Views
1
Total views since publication
PDF Downloads
5
Total downloads since publication
Geographic Reach
5
Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.
Plagiarism Screening
This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.
Conflict of Interest
The authors declare no conflict of interest related to this research work.
Funding Information
No funding information available for this research.
Related research in the same subject area
Loading similar articles...