Submitted:
16 February 2023
Posted:
17 February 2023
You are already at the latest version
Abstract
Keywords:
1. Background
2. Related Work
3. Methodology
3.1. Detection Phase
3.1.1. Typing Speed
3.1.2. Time for Sending ()
3.1.3. Reading Speed ()
4. Test Data
5. Discussion
6. Conclusion
References
- Nissar, A., & Mir, A. H. (2010). Classification of steganalysis techniques: A study. Digital Signal Processing, 20(6), 1758-1770. [CrossRef]
- Johnson, N. F., & Jajodia, S. (1998, September). Steganalysis: The investigation of hidden information. In 1998 IEEE Information Technology Conference, Information Environment for the Future (Cat. No. 98EX228) (pp. 113-116). IEEE. [CrossRef]
- Okello, M. O. (2022). Optimal Covert Communication Techniques. International Journal of Informatics and Applied Mathematics, 5 (1), 1-26. [CrossRef]
- Kakungulu-Mayambala, R. (2008). Phone-tapping & the Right to Privacy: A Comparison of the Right to Privacy in Communication in Uganda & Canada. In BILETA Conference.
- Atuhaire, E. (2021). Artificial intelligence and the right to privacy in Uganda (Doctoral dissertation, Makerere University).
- Elsadig, Muawia & Gafar, Ahmed. (2022). PACKET LENGTH COVERT CHANNEL DETECTION: AN ENSEMBLE MACHINE LEARNING APPROACH. Journal of Theoretical and Applied Information Technology. 100. 7035-7043.
- Mivule, K., & Turner, C. (2012). Applying Data Privacy Techniques on Published Data in Uganda. In Proceedings of the International Conference on e-Learning, e-Business, Enterprise Information Systems, and e-Government (EEE) (p. 1). The Steering Committee of The World Congress in Computer Science, Computer Engineering and Applied Computing (WorldComp).
- Gianvecchio, S., & Wang, H. (2007, October). Detecting covert timing channels: an entropy-based approach. In Proceedings of the 14th ACM conference on Computer and communications security. (pp. 307-316).
- Liu, G., Zhai, J., & Dai, Y. (2012). Network covert timing channel with distribution matching. Telecommunication Systems, 49(2), 199-205. [CrossRef]
- M. Okello, “A New Timing Steganography Algorithm in Real-Time Transmission Devices,” 2018 IEEE 18th International Conference on Communication Technology (ICCT), Chongqing, China, 2018, pp. 880-884. [CrossRef]
- Okello, M. O. (2021). Transmission of Secret Information Based on Time Instances. The Eurasia Proceedings of Science Technology Engineering and Mathematics, 16, 209-218. [CrossRef]
- William Soukoreff, R., & Scott Mackenzie, I. (1995). Theoretical upper and lower bounds on typing speed using a stylus and a soft keyboard. Behaviour & Information Technology, 14(6), 370-379. [CrossRef]
- Brysbaert, M. (2019). How many words do we read per minute? A review and meta-analysis of reading rate. Journal of memory and language, 109, 104047. [CrossRef]
- Online blog typing speed by admin: https://onlinetyping.org/blog/average-typing-speed.php.
| 09:20:02 | 09:03:12 | 09:03:14 | 75 | 70 | 2 | 75/70 |
| 10:15:11 | 10:15:21 | 10:16:30 | 63 | 10 | 69 | 63/10 |
| 15:00:23 | 15:12:04 | 15:14:03 | 327 | 701 | 119 | 327/701 |
| 15:24:34 | 15:24:46 | 15:24:49 | 89 | 12 | 3 | 89/12 |
| 16:00:13 | 16:01:44 | 16:01:59 | 65 | 91 | 15 | 65/91 |
| N | |||||||||
|---|---|---|---|---|---|---|---|---|---|
| 8:30:11 | 8:50:01 | 8:52:23 | 8:52:58 | 8:53:29 | 20 | 142 | 35 | 32 | 20/35 |
| 9:10:07 | 9:10:28 | 9:10:30 | 9:11::01 | 9:11:08 | 132 | 02 | 31 | 07 | 132/31 |
| 10:02:25 | 10:20:11 | 10:21:52 | 10:21:54 | 10:21:56 | 57 | 41 | 62 | 2 | 57/62 |
| 12:10:17 | 12:15:01 | 12:15:20 | 12:15:38 | 12:15:41 | 14 | 19 | 18 | 3 | 14/18 |
| 12:31:23 | 12:31:28 | 12:32:09 | 12:35:42 | 12:36:26 | 217 | 41 | 213 | 44 | 217/213 |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).