Khan Farhan Rafat
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Khan Farhan Rafat has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
Pakistan Islamabad
2 shared publications- Arif Ur Rahman
Bahria University, Islamabad, Pakistan, Pakistan
1 shared publication - Ashfaq Hussain Farooqi
Department of Computer Science, Air University, Islamabad, Pakistan
1 shared publication - Mohammad Imran
Air University, Pakistan
1 shared publication Syed Muhammad Sajjad
Department of Cyber Security, Air University, Islamabad, Pakistan
1 shared publication- Syed Muhammad Sajjad
Department of Cyber Security Air University Islamabad,Pakistan
1 shared publication
Latest Publications
- Open Access
- 20 October 2026
- Published by MDPI AG in Preprints.org
A Systematic Survey on Unified Compression-Encryption Schemes with a Header-Consolidation Taxonomy
Data compression and encryption are conventionally performed as sequential operations, incurring redundant computational overhead, increasing the attack surface, and complicating system architectures. This systematic literature review analyzes 34 verified contributions published between 1948 and 2026 in IEEE, ACM, Springer, Elsevier, Wiley, IET, and NIST venues, following PRISMA 2020. We propose a four-level operational taxonomy (L0–L3) for defining what it means for a scheme to be unified rather than merely coordinated as well as the structure of header consolidation: an L3 scheme consolidates the compression and encryption headers into a single object, typically carried by the key. Only two schemes achieve L3, both restricted by domain-specific assumptions. We discover two structural constraints—the redundancy duality and the header duality—which explain why L3 schemes are restricted to domain-specific, and that the latter is a security constraint: the compression header leaks source statistics and the encryption header leaks cryptographic state, so consolidating them reduces the attack surface. We also show that source-type specificity is inherited by all joint schemes reviewed, and the review also reveals that no scheme achieves a source-independent compression ratio, and that formal security proofs under standard adversarial models (IND-CPA, IND-CCA, IND-CCA2, AE) are absent in each of the reviewed schemes, including the two L3 schemes.
- 20 October 2026
- Published by MDPI AG in Preprints.org
Open AccessA Systematic Survey on Unified Compression-Encryption Schemes with a Header-Consolidation Taxonomy
Data compression and encryption are conventionally performed as sequential operations, incurring redundant computational overhead, increasing the attack surface, and complicating system architectures. This systematic literature review analyzes 34 verified contributions published between 1948 and 2026 in IEEE, ACM, Springer, Elsevier, Wiley, IET, and NIST venues, following PRISMA 2020. We propose a four-level operational taxonomy (L0–L3) for defining what it means for a scheme to be unified rather than merely coordinated as well as the structure of header consolidation: an L3 scheme consolidates the compression and encryption headers into a single object, typically carried by the key. Only two schemes achieve L3, both restricted by domain-specific assumptions. We discover two structural constraints—the redundancy duality and the header duality—which explain why L3 schemes are restricted to domain-specific, and that the latter is a security constraint: the compression header leaks source statistics and the encryption header leaks cryptographic state, so consolidating them reduces the attack surface. We also show that source-type specificity is inherited by all joint schemes reviewed, and the review also reveals that no scheme achieves a source-independent compression ratio, and that formal security proofs under standard adversarial models (IND-CPA, IND-CCA, IND-CCA2, AE) are absent in each of the reviewed schemes, including the two L3 schemes.
- 26 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
STRIKE: Secure Transmission via Reconstruction-Integrated Key-based Encoding
Since its inception, the field of digital communication has been fundamentally defined by a dichotomy: compression seeks to eliminate redundancy, while encryption aims to induce it for secrecy. This conceptual division has solidified into two entirely separate research pipelines, leading to the entrenched sequential paradigm of compress-then-encrypt. The critical, unaddressed flaw in this architecture is the absence of a single, unified mathematical operation that inherently guarantees both minimal representation and semantic security. We propose STRIKE (Secure Transmission via Reconstruction-Integrated Key-based Encoding), a framework that collapses this historic divide. STRIKE achieves a deterministic $2: 1$ compression ratio via synchronized state evolution, independent of data statistics. It maps a 2-bit message to an angular coordinate, applies a secret key-driven rotation, and outputs a single projected bit. A synchronized 1-bit state variable, evolving deterministically at the encoder and decoder, provides the necessary context for perfect, lossless reconstruction without transmission overhead. The process is a singular, lightweight geometric transform that concurrently reduces size and obscures content. STRIKE thus delivers a unified axiomatic proof-of-concept, demonstrating that compression and encryption are not sequential necessities but can be emergent properties of a single, stateful, informationtheoretic function.- 26 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
STRIKE: Secure Transmission via Reconstruction-Integrated Key-based Encoding
Since its inception, the field of digital communication has been fundamentally defined by a dichotomy: compression seeks to eliminate redundancy, while encryption aims to induce it for secrecy. This conceptual division has solidified into two entirely separate research pipelines, leading to the entrenched sequential paradigm of compress-then-encrypt. The critical, unaddressed flaw in this architecture is the absence of a single, unified mathematical operation that inherently guarantees both minimal representation and semantic security. We propose STRIKE (Secure Transmission via Reconstruction-Integrated Key-based Encoding), a framework that collapses this historic divide. STRIKE achieves a deterministic $2: 1$ compression ratio via synchronized state evolution, independent of data statistics. It maps a 2-bit message to an angular coordinate, applies a secret key-driven rotation, and outputs a single projected bit. A synchronized 1-bit state variable, evolving deterministically at the encoder and decoder, provides the necessary context for perfect, lossless reconstruction without transmission overhead. The process is a singular, lightweight geometric transform that concurrently reduces size and obscures content. STRIKE thus delivers a unified axiomatic proof-of-concept, demonstrating that compression and encryption are not sequential necessities but can be emergent properties of a single, stateful, informationtheoretic function.- Open Access
- 24 November 2025
- Published by MDPI AG in Preprints.org
Beyond the Achilles Heel: Securing Spatial Domain Reversible LSB Image Steganography
The rapid evolution of digital communication demands a paradigm shift in image steganography, moving beyond conventional data embedding to fully reversible concealment that ensures seamless integration while preserving the original cover. However, spatial-domain techniques remain inherently flawed—repetitive carrier image usage exposes hidden data to statistical detection, while deterministic extraction mechanisms violate Kerckhoff’s principle, enabling unauthorized recovery. Reliance on encryption, flawed key management, and misplaced emphasis on imperceptibility metrics further compromise true undetectability. This research introduces a provably robust steganographic framework that advances spatial-domain security through three foundational innovations: (1) Cryptographic reversibility—unlike conventional LSB methods that permanently alter cover media, our SHA-256–modulated entropy embedding enables lossless payload extraction and perfect cover recovery without auxiliary data; (2) Statistical undetectability—by integrating inverse modulo-5 arithmetic (E(x, k) = (x + k) mod 5) with dual-channel pixel diffusion, we eliminate detectable artifacts in co-occurrence matrices and histograms, achieving zero discriminability (AUC = 0.5) against ML-based steganalysis; and (3) Adaptive capacity hardening—a dynamic payload distribution system that simultaneously maximizes embedding density (1–100% pixel utilization) while resisting known-cover attacks through key-driven randomization. These mechanisms collectively establish mathematically verifiable robustness: reversibility is guaranteed by the bijective properties of our modular transformations (E−1(y, k) = (y−k) mod 5), undetectability is proven via entropy preservation (ΔH < 0.02), and security is enforced through Kerckhoffs-compliant key derivation. Empirical validation confirms superiority over existing methods in PSNR (> 53 dB), structural fidelity (SSIM > 0.999), and attack resilience—redefining the theoretical limits of secure data hiding.
- 24 November 2025
- Published by MDPI AG in Preprints.org
Open AccessBeyond the Achilles Heel: Securing Spatial Domain Reversible LSB Image Steganography
The rapid evolution of digital communication demands a paradigm shift in image steganography, moving beyond conventional data embedding to fully reversible concealment that ensures seamless integration while preserving the original cover. However, spatial-domain techniques remain inherently flawed—repetitive carrier image usage exposes hidden data to statistical detection, while deterministic extraction mechanisms violate Kerckhoff’s principle, enabling unauthorized recovery. Reliance on encryption, flawed key management, and misplaced emphasis on imperceptibility metrics further compromise true undetectability. This research introduces a provably robust steganographic framework that advances spatial-domain security through three foundational innovations: (1) Cryptographic reversibility—unlike conventional LSB methods that permanently alter cover media, our SHA-256–modulated entropy embedding enables lossless payload extraction and perfect cover recovery without auxiliary data; (2) Statistical undetectability—by integrating inverse modulo-5 arithmetic (E(x, k) = (x + k) mod 5) with dual-channel pixel diffusion, we eliminate detectable artifacts in co-occurrence matrices and histograms, achieving zero discriminability (AUC = 0.5) against ML-based steganalysis; and (3) Adaptive capacity hardening—a dynamic payload distribution system that simultaneously maximizes embedding density (1–100% pixel utilization) while resisting known-cover attacks through key-driven randomization. These mechanisms collectively establish mathematically verifiable robustness: reversibility is guaranteed by the bijective properties of our modular transformations (E−1(y, k) = (y−k) mod 5), undetectability is proven via entropy preservation (ΔH < 0.02), and security is enforced through Kerckhoffs-compliant key derivation. Empirical validation confirms superiority over existing methods in PSNR (> 53 dB), structural fidelity (SSIM > 0.999), and attack resilience—redefining the theoretical limits of secure data hiding.
- 30 September 2025
- Published by Serbian Project Management Association
- p. 131-157
Transforming Project Success: Integrating Information Security Within the PMBOK Framework
The rapid digitalisation of project management has made information security crucial for organisational resilience and project success. As organisations adopt agile methodologies, cloud computing, and remote collaboration tools, they face increasing cyber threats that can jeopardise project objectives, lead to financial losses, and damage reputations. Although the 7th edition of the Project Management Body of Knowledge (PMBOK) acknowledges the importance of information security, it lacks structured methodologies for integrating security into project lifecycles effectively. Insufficient security measures are linked to project failures, with studies showing that cybersecurity breaches disrupt timelines, raise costs, and undermine stakeholder confidence. Given the complexity of multi-stakeholder environments and fragmented digital infrastructures, a proactive, security-first approach is essential. Project managers must foster a culture of security awareness, ensuring team members understand their roles in mitigating risks and protecting sensitive data. This study evaluates contemporary research and proposes a refined security integration framework within PMBOK's knowledge areas called Progressive Project Management Body of Knowledge (PPMBOK). Organisations can enhance risk mitigation, governance, and compliance by embedding structured security strategies into project workflows—leveraging AI-driven threat detection and predictive risk analytics. A comprehensive approach to information security is now a strategic necessity, enabling sustained operational excellence and stakeholder trust in an increasingly volatile digital landscape.
- 30 September 2025
- Published by Serbian Project Management Association
- p. 131-157
Transforming Project Success: Integrating Information Security Within the PMBOK Framework
The rapid digitalisation of project management has made information security crucial for organisational resilience and project success. As organisations adopt agile methodologies, cloud computing, and remote collaboration tools, they face increasing cyber threats that can jeopardise project objectives, lead to financial losses, and damage reputations. Although the 7th edition of the Project Management Body of Knowledge (PMBOK) acknowledges the importance of information security, it lacks structured methodologies for integrating security into project lifecycles effectively. Insufficient security measures are linked to project failures, with studies showing that cybersecurity breaches disrupt timelines, raise costs, and undermine stakeholder confidence. Given the complexity of multi-stakeholder environments and fragmented digital infrastructures, a proactive, security-first approach is essential. Project managers must foster a culture of security awareness, ensuring team members understand their roles in mitigating risks and protecting sensitive data. This study evaluates contemporary research and proposes a refined security integration framework within PMBOK's knowledge areas called Progressive Project Management Body of Knowledge (PPMBOK). Organisations can enhance risk mitigation, governance, and compliance by embedding structured security strategies into project workflows—leveraging AI-driven threat detection and predictive risk analytics. A comprehensive approach to information security is now a strategic necessity, enabling sustained operational excellence and stakeholder trust in an increasingly volatile digital landscape.
- 30 September 2025
- Published by Serbian Project Management Association
- p. 207-232
Pioneering Leadership Dynamics and Security Resilience in Global Project Management: Navigating Complexities in a Volatile Landscape
This paper presents the Leadership-Driven Security Adoption Model (LSAM), an innovative framework designed to integrate cybersecurity resilience within project management through strategic foresight and leadership engagement. Unlike traditional security frameworks such as National Institute of Standards and Technology (NIST) Cybersecurity Framework (CSF) 2.0, ISO 27001:2022, and Project Management Institute (PMI) governance principles, LSAM emphasises leadership-centric governance, stakeholder alignment, and proactive threat mitigation. By redefining the role of leadership in project security, this study underscores the critical interplay between executive vision, strategic foresight, and operational resilience in global project management. Empirical validation through cross-sector case studies and statistical analysis demonstrates LSAM's effectiveness in reducing cyber risk exposure, improving organizational resilience, and driving security sustainability. This research challenges outdated paradigms by advocating a leadership-driven approach that transcends mere policy enforcement, promoting leadership excellence as a catalyst for embedding security across complex, multinational environments. The study also provides decision-makers an actionable roadmap for integrating security within project governance. By establishing LSAM as a benchmark for cybersecurity leadership, this paper offers scholars and practitioners invaluable insights for navigating the evolving threat landscape and ensuring security resilience in contemporary project environments.
- 30 September 2025
- Published by Serbian Project Management Association
- p. 207-232
Pioneering Leadership Dynamics and Security Resilience in Global Project Management: Navigating Complexities in a Volatile Landscape
This paper presents the Leadership-Driven Security Adoption Model (LSAM), an innovative framework designed to integrate cybersecurity resilience within project management through strategic foresight and leadership engagement. Unlike traditional security frameworks such as National Institute of Standards and Technology (NIST) Cybersecurity Framework (CSF) 2.0, ISO 27001:2022, and Project Management Institute (PMI) governance principles, LSAM emphasises leadership-centric governance, stakeholder alignment, and proactive threat mitigation. By redefining the role of leadership in project security, this study underscores the critical interplay between executive vision, strategic foresight, and operational resilience in global project management. Empirical validation through cross-sector case studies and statistical analysis demonstrates LSAM's effectiveness in reducing cyber risk exposure, improving organizational resilience, and driving security sustainability. This research challenges outdated paradigms by advocating a leadership-driven approach that transcends mere policy enforcement, promoting leadership excellence as a catalyst for embedding security across complex, multinational environments. The study also provides decision-makers an actionable roadmap for integrating security within project governance. By establishing LSAM as a benchmark for cybersecurity leadership, this paper offers scholars and practitioners invaluable insights for navigating the evolving threat landscape and ensuring security resilience in contemporary project environments.
- Open Access
- 26 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 143434-143457
Advancing Reversible LSB Steganography: Addressing Imperfections and Embracing Pioneering Techniques for Enhanced Security
Steganography, an intricate technique that discreetly conceals information within innocuous carrier files, has become indispensable for safeguarding confidential communication. Hence, a comprehensive exploration of its multifaceted aspects and constituent elements is imperative to grasp Steganography’s nuanced layers of security. This discourse endeavors to illuminate the profound essence of security within Steganography, encompassing pivotal facets such as confidentiality, integrity, and resilience against emerging threats. Developing an innovative and secure reversible Steganography algorithm rooted in the Least Significant Bit (LSB) methodology assumes paramount significance in attaining these lofty security objectives. This imperative arises from the escalating demand for secure communication across public networks, necessitating techniques to ensure the confidentiality and integrity of transmitted data. Reversible steganographic approaches, characterized by their ability to extract the original image and embedded data without loss, hold particular relevance in domains where the intrinsic value of the original image is irreplaceable, as exemplified in medical imaging and satellite applications. Preserving the embedded data’s security is critical to forestall unauthorized access or tampering. Thus, the employment of secure reversible image Steganography techniques within the spatial domain emerges as a vital strategy in fortifying the protection of sensitive information while upholding the sanctity and confidentiality of the original image. In this vein, the scrutiny of Kerckhoff’s principle, which accentuates the reliance of system security on the secrecy of the key rather than the algorithm, assumes significance in ensuring robust security protocols. Our research underscores the indispensable nature of adhering to Kerckhoff’s principle and mandating the obliviousness of bit embedding locations within the cover image for the enduring prevalence of secure Steganography, particularly in the face of well-known cover attacks.
- 26 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 143434-143457
Open AccessAdvancing Reversible LSB Steganography: Addressing Imperfections and Embracing Pioneering Techniques for Enhanced Security
Steganography, an intricate technique that discreetly conceals information within innocuous carrier files, has become indispensable for safeguarding confidential communication. Hence, a comprehensive exploration of its multifaceted aspects and constituent elements is imperative to grasp Steganography’s nuanced layers of security. This discourse endeavors to illuminate the profound essence of security within Steganography, encompassing pivotal facets such as confidentiality, integrity, and resilience against emerging threats. Developing an innovative and secure reversible Steganography algorithm rooted in the Least Significant Bit (LSB) methodology assumes paramount significance in attaining these lofty security objectives. This imperative arises from the escalating demand for secure communication across public networks, necessitating techniques to ensure the confidentiality and integrity of transmitted data. Reversible steganographic approaches, characterized by their ability to extract the original image and embedded data without loss, hold particular relevance in domains where the intrinsic value of the original image is irreplaceable, as exemplified in medical imaging and satellite applications. Preserving the embedded data’s security is critical to forestall unauthorized access or tampering. Thus, the employment of secure reversible image Steganography techniques within the spatial domain emerges as a vital strategy in fortifying the protection of sensitive information while upholding the sanctity and confidentiality of the original image. In this vein, the scrutiny of Kerckhoff’s principle, which accentuates the reliance of system security on the secrecy of the key rather than the algorithm, assumes significance in ensuring robust security protocols. Our research underscores the indispensable nature of adhering to Kerckhoff’s principle and mandating the obliviousness of bit embedding locations within the cover image for the enduring prevalence of secure Steganography, particularly in the face of well-known cover attacks.
- 27 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Safeguarding Democracy Online
The necessity of internet voting arises from the fusion of democratic ideals and technological progression in today's digital era. This shift towards online voting aims to enhance inclusivity, efficiency, and transparency, meeting core societal needs. However, this transition introduces vulnerabilities that could compromise the integrity of the electoral process as online platforms become susceptible to cyber threats. Malicious actors could exploit vulnerabilities to compromise the confidentiality, integrity, and availability of voting data, potentially disrupting the democratic process. To address these challenges, robust authentication and verification mechanisms, potentially leveraging artificial intelligence (AI), are essential to prevent unauthorized access and fraud. Secure transmission and storage of voter data are crucial, necessitating advanced anti-cybersecurity technologies to create an immutable and transparent voting transaction ledger, enhancing system security and trustworthiness. Our research aims to raise awareness of internet voting risks, emphasizing the importance of informed assessments to build trust in online voting systems by proposing a Steganography-based internet vote-casting solution.
- 27 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Safeguarding Democracy Online
The necessity of internet voting arises from the fusion of democratic ideals and technological progression in today's digital era. This shift towards online voting aims to enhance inclusivity, efficiency, and transparency, meeting core societal needs. However, this transition introduces vulnerabilities that could compromise the integrity of the electoral process as online platforms become susceptible to cyber threats. Malicious actors could exploit vulnerabilities to compromise the confidentiality, integrity, and availability of voting data, potentially disrupting the democratic process. To address these challenges, robust authentication and verification mechanisms, potentially leveraging artificial intelligence (AI), are essential to prevent unauthorized access and fraud. Secure transmission and storage of voter data are crucial, necessitating advanced anti-cybersecurity technologies to create an immutable and transparent voting transaction ledger, enhancing system security and trustworthiness. Our research aims to raise awareness of internet voting risks, emphasizing the importance of informed assessments to build trust in online voting systems by proposing a Steganography-based internet vote-casting solution.
- 20 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Nondeterministic Secure LSB Steganography for Digital Images
The practice of obscuring information on a ‘need to know’ basis, but still sharing it with others, is called ‘secrecy.’ The information that requires fortification is known as the secret. However, the pace at which data gets generated, gathered, disseminated, and analyzed in today's Internet of Things (IoT) has inhibited the individuals from keeping their secrets ‘secret.’ Cloud computing further hardened the situation by providing a pay-as-you-go method for data processing and information retention (persistent storage). Although the cloud service providers are bound to maintain data integrity, confidentiality, and the privacy of users, yet the gray areas of proxy points still await a resolution. The judicial endorsement on gaining and having access to the encrypted data and the pre-shared keys to the law-enforcing authorities by the Australian parliament - the first amongst the five-eye countries inspecting the global communication has worsened the situation further. Hence, the current state of affairs not just demand for information hiding but the evolution of ‘secure’ information hiding solutions to maintain secrecy both at the personal and national level. Least Significant Bit embedding technique for hiding data has brought a stir in the information security arena, and since its inception has remained a topic of research for the said purpose. This research endeavor proposes an enhancement to the existing LSB embedding mechanism to deceive attackers from detecting hidden information but without compromising image perceptibility. The results confer on the effectiveness of the proposed algorithm with regard to Peak Signal to Noise Ratio and known-cover attack scenario.
- 20 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Nondeterministic Secure LSB Steganography for Digital Images
The practice of obscuring information on a ‘need to know’ basis, but still sharing it with others, is called ‘secrecy.’ The information that requires fortification is known as the secret. However, the pace at which data gets generated, gathered, disseminated, and analyzed in today's Internet of Things (IoT) has inhibited the individuals from keeping their secrets ‘secret.’ Cloud computing further hardened the situation by providing a pay-as-you-go method for data processing and information retention (persistent storage). Although the cloud service providers are bound to maintain data integrity, confidentiality, and the privacy of users, yet the gray areas of proxy points still await a resolution. The judicial endorsement on gaining and having access to the encrypted data and the pre-shared keys to the law-enforcing authorities by the Australian parliament - the first amongst the five-eye countries inspecting the global communication has worsened the situation further. Hence, the current state of affairs not just demand for information hiding but the evolution of ‘secure’ information hiding solutions to maintain secrecy both at the personal and national level. Least Significant Bit embedding technique for hiding data has brought a stir in the information security arena, and since its inception has remained a topic of research for the said purpose. This research endeavor proposes an enhancement to the existing LSB embedding mechanism to deceive attackers from detecting hidden information but without compromising image perceptibility. The results confer on the effectiveness of the proposed algorithm with regard to Peak Signal to Noise Ratio and known-cover attack scenario.
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 299-2994
K-Anonymity without the Prior Value of the Threshold k: Revisited
k-Anonymity is a popular concept associated with a data set to designate it some level of anonymity. That is, a dataset is said to be k-anonymous if each of its identity-revealing attribute termed as Quasi-Identifier, appears for a minimum in at least k different tuples of the data set. Since its first publication in the year 2002, that concept has remained a focus of interest in the research arena, where the majority of studies have agreed on the prior delineation of the value of k. This research, however, adlibs one of the recent research that auto assigns to k an amount computed by traversing through each row in an anonymized data set. Our proposed solution suggests having a byte array of a dimension of 100, corresponding to the two-digit suppressed area code whose values can range from 0 to 99. The process requires the initialization of this array at the start with all zero/null values. With each row taken for pre-processing, that is, perform generalization and suppression, the value of the array element whose index corresponds to the value of the two-digit suppressed ZIP/Area Code is incremented by one. Whenever the resultant value exceeds 255, the same gets reinitialized with a value of two. The process terminates with the pre-processing of the dataset after which, a new kanonymized table is generated but only for the tuples whose ZIP/Area Code has a value > 2 in the corresponding index element of the proposed array. Doing so reduces the search iterations, which has a positive effect on process efficiency. Further, the proposed enhancement appreciates human intervention for add-in security during the publication process.
- 1 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 299-2994
K-Anonymity without the Prior Value of the Threshold k: Revisited
k-Anonymity is a popular concept associated with a data set to designate it some level of anonymity. That is, a dataset is said to be k-anonymous if each of its identity-revealing attribute termed as Quasi-Identifier, appears for a minimum in at least k different tuples of the data set. Since its first publication in the year 2002, that concept has remained a focus of interest in the research arena, where the majority of studies have agreed on the prior delineation of the value of k. This research, however, adlibs one of the recent research that auto assigns to k an amount computed by traversing through each row in an anonymized data set. Our proposed solution suggests having a byte array of a dimension of 100, corresponding to the two-digit suppressed area code whose values can range from 0 to 99. The process requires the initialization of this array at the start with all zero/null values. With each row taken for pre-processing, that is, perform generalization and suppression, the value of the array element whose index corresponds to the value of the two-digit suppressed ZIP/Area Code is incremented by one. Whenever the resultant value exceeds 255, the same gets reinitialized with a value of two. The process terminates with the pre-processing of the dataset after which, a new kanonymized table is generated but only for the tuples whose ZIP/Area Code has a value > 2 in the corresponding index element of the proposed array. Doing so reduces the search iterations, which has a positive effect on process efficiency. Further, the proposed enhancement appreciates human intervention for add-in security during the publication process.