An Enhanced Distribution Transforming Encoder (Dte) Of The Honey Encryption Scheme For Reinforcing Text-Based Encryption

Omolara, Abiodun Esther (2020) An Enhanced Distribution Transforming Encoder (Dte) Of The Honey Encryption Scheme For Reinforcing Text-Based Encryption. PhD thesis, Perpustakaan Hamzah Sendut.

Download (827kB) | Preview


Honey Encryption (HE) is a cryptosystem used as a reinforcement to the conventional encryption scheme to address brute-force attacks specifically in the context of password-based encryption systems. The HE scheme relies on a model called the Distribution Transforming Encoder (DTE), which focuses on the use of deception as a key defensive approach in the design of primitives that facilitate information security by yielding plausible-looking but fake plaintext during decryption using an incorrect key. However, the concept of the HE scheme is limited by the bottleneck of applicability and thus fails to reach other real-world deployment use-cases. For instance, encoding a human-generated message such as email requires adapting the scheme to natural language which means re-designing the current deterministic encoder to generate plausible or realistic decoys message that can fool the attacker. This problem remains unsolved because of the few researches on enhancing the DTE fails to produce plausible decoy messages in human-language. Furthermore, they fail to introduce secrecy on the fake message as keywords or fragments of the underlying plaintext message are revealed during decryption, thus, enabling the system to a chosen-ciphertext attack where an attacker may use the results from prior decryption to inform their choices of which ciphertexts have decrypted. The two main contributions of this work are its responses to these two problems. A natural language-based encoder (NLBE) was developed and an approach for concealing the underlying plaintext and producing plausible decoy messages is presented. Experimental analysis using human simulators as the gold standard shows a 94% indistinguishability rate in the worst case where an unbounded adversary can explore the complete Oracle and a 100% indistinguishability rate when the keyspace is large enough.

Item Type: Thesis (PhD)
Subjects: Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science
Divisions: Pusat Pengajian Sains Komputer (School of Computer Sciences) > Thesis
Depositing User: HJ Hazwani Jamaluddin
Date Deposited: 12 Aug 2022 02:11
Last Modified: 12 Aug 2022 02:11

Actions (login required)

View Item View Item