Graph Theoretic Design of Text Encryption Schemes Using Fuzzy Vertex Cover

No Thumbnail Available

Date

2026

Journal Title

Journal ISSN

Volume Title

Publisher

Library Information Services, COMSATS University Islamabad, Lahore Campus

Abstract

The rapid growth of digital communication has increased the need for encryption schemes that provide confidentiality, integrity, and structural binding of sensitive text data. This thesis presents a graph-theoretic text encryption scheme based on fuzzy vertex cover. Ac- cording to the proposed approach, the original document is first partitioned into sentences where the document itself will be considered as a fuzzy graph consisting of vertices and edges. Vertices represent sentences and edges represent the relations between pairs of sen- tences either structurally or semantically. Membership value of vertices reflects sentence importance whereas that of edges represents sentence dependencies. Then, a greedy fuzzy vertex-cover algorithm is used to generate a threshold-dependent structural summary of the document. This fuzzy vertex-cover information, together with graph-local sentence features and canonically serialized graph metadata, is incorporated into a graph fingerprint. The resulting fingerprint is used in the key-derivation process to bind sentence-level encryption keys to the structure of the document. For cryptographic protection, the scheme uses a hybrid RSA-AES-GCM framework: RSA-OAEP is used to encapsulate a fresh document master key, while AES-GCM is used for authenticated sentence-wise encryption. The thesis formally establishes the main properties of the proposed scheme. It is proved that the greedy fuzzy vertex-cover extraction algorithm terminates and returns a valid fuzzy vertex cover for the thresholded important-edge set. It is also shown that the receiver can deterministically reconstruct the graph-bound key material from the ciphertext metadata, and that decryption correctly recovers the original plaintext document when the matching private key is used. Moreover, the construction provides integrity and graph-binding: any ix nontrivial modification of the encapsulated key, graph metadata, fuzzy vertex cover, associ- ated data, nonce, or sentence ciphertext causes authentication failure except with negligible probability under the stated cryptographic assumptions. Thus, the proposed scheme gives a formal graph-structured hybrid text-encryption model in which fuzzy vertex-cover theory is used to incorporate document structure into authen- ticated cryptographic key derivation.

Description

Keywords

Department of Mathematics, Mathematics, FA24, Text Encryption, Graph Theory, Fuzzy Vertex Cover, Cryptographic Schemes, Graph-Based Cryptography, Dr. M. Faisal Nadeem

Citation

Collections

Endorsement

Review

Supplemented By

Referenced By