Refine your search
Collections
Co-Authors
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Asante, Michael
- Wireless Sensor Network Surveillance on Forest Illegal Mining using ‘Planned Behaviour Abortion Tower’:Analytical Modelling
Abstract Views :226 |
PDF Views:0
Authors
Affiliations
1 Department of Computer Science, Kwame Nkrumah University of Science and Technology, GH
1 Department of Computer Science, Kwame Nkrumah University of Science and Technology, GH
Source
International Journal of Computer Networks and Applications, Vol 5, No 4 (2018), Pagination: 52-60Abstract
The USAID report on climate change vulnerability and adaptation in Ghana confirmed the impact of recent explosion of illegal gold mining in forest reserves and in river body. Government of Ghana responded to such wake-up call in deploying military combatants against perpetrators operating at day and midnight hours when drones are ineffective to monitor. We aimed at wireless sensor network (WSN) deployment to compliment military efforts for real time remote sensing. A conceptual framework on WSN technology is proposed based on expert view gathered from Delphi technique data analysis. A close textual reading of illegal mining editorial and the primary evidence of climate change impact from water shortage due to river body pollution with cyanide chemical in Ghana are key input factors for this technology-based conceptual exploration. Positive analytical feedback from the ‘Delphi’ suggests that we can apply this conceptual framework to all environmental case studies in which technology-based security protocols are good compliments to abort human intention towards certain behavior. The comparative discussion on the use of Drones, Satellite and WSN showed that the latter is: economical to deploy, energy efficient for continuous operational availability and reliable data sensing at midnight mining compared to drones’ image processing power at night to track manual mining excavations. This study gives a starting point for uptake investigation in WSN deployment for surveillance on illegal mining; hence the findings may have limitations such as subjectivity of expert view. This conceptual framework is a recommendation to urgent national issue and thus it is relevant having real-world implementation for testing the human behavioral assumptions.Keywords
Wireless Sensor Network, Surveillance, Illegal Gold Mining.References
- S. K. Jacobson, J. R. Seavey, and R. C. Mueller, “Integrated science and art education for creative climate change communication,” Ecol. Soc., vol. 21, no. 3, p. art30, Sep. 2016.
- M. F. Othman and K. Shazali, “Wireless Sensor Network Applications: A Study in Environment Monitoring System,” Procedia Eng., vol. 41, pp. 1204–1210, 2012.
- World Health Organization, “Cyanide in Drinking-water Background document for development of WHO Guidelines for Drinking-water Quality,” vol. 2, pp. 1–26, 2007.
- U. S. Agency, I. Development, U. F. Service, and I. Programs, “Ghana Climate Change Vulnerability and,” no. June, 2011.
- V. Hsu, J. Kahn, and K. Pister, “Wireless communications for smart dust,” Electron. Res. Lab. Tech. Memo. M98/2, pp. 1–22, 1998.
- “‘Operation Vanguard’—A Timely Saviour of our Environment - Government of Ghana.” [Online]. Available: http://www.ghana.gov.gh/index.php/media-center/features/3966-operation-vanguard-a-timely-saviour-of-our-environment. [Accessed: 28-Aug-2018].
- Y. Zare Mehrjerdi, “RFID‐enabled systems: a brief review,” Assem. Autom., vol. 28, no. 3, pp. 235–245, Aug. 2008.
- “The Wi-fi, wireless security review in finding the best wireless security implementation.” [Online]. Available:https://www.tenouk.com/wifisecurityfeatures.html. [Accessed: 24-Aug-2018].
- T. Sobh and K. Elleithy, Eds., Advances in Systems, Computing Sciences and Software Engineering. Dordrecht: Springer Netherlands, 2006.
- “Welcome to the Mobile Data Management and Applications Website.” [Online]. Available: https://web.mst.edu/~mobildat/WMAN/index.html. [Accessed: 24-Aug-2018].
- “요청하신 페이지가 존재하지 않습니다.” [Online]. Available: http://graduate2.korea.ac.kr/programs/programs01-3-06.jsp. [Accessed: 24-Aug-2018].
- D. K. Lobiyal, V. Mansotra, and U. Singh, Eds., Next-Generation Networks, vol. 638. Singapore: Springer Singapore, 2018.
- H. Su and X. Zhang, “Energy-Efficient Clustering System Model and Reconfiguration Schemes for Wireless Sensor Networks,” in 2006 40th Annual Conference on Information Sciences and Systems, 2006, pp. 99–104.
- H. M. Ammari, Ed., The Art of Wireless Sensor Networks. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014.
- “Smart Dust: Communication Systems and the Future World |ChaiOne.” [Online]. Available: https://chaione.com/blog/smart-dust-communication-systems-and-future/. [Accessed: 24-Aug-2018].
- R. M. Howard, R. Conway, and A. J. Harrison, “A survey of sensor devices: use in sports biomechanics,” Sport. Biomech., vol. 15, no. 4, pp. 450–461, Oct. 2016.
- ChipCon, “Single Chip Very Low Power RF Transceiver with 8051-Compatible Microcontroller,” Fea.Kpi.Ua, 2002.
- H. M. Ammari, Ed., The Art of Wireless Sensor Networks. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014.
- I. Ajzen, “The theory of planned behavior,” Organ. Behav. Hum. Decis. Process., vol. 50, no. 2, pp. 179–211, Dec. 1991.
- G. Elmer, “A diagram of panoptic surveillance,” New Media Soc., vol. 5, no. 2, pp. 231–247, 2003.
- I. AJZEN, R. Netemeyer, and M. Van Ryn, “The Theory of Planned Behavior,” Organ. {Behavior} {Human} {Decision} {Processes}, v, vol. 50, no. JANUARY 1991, pp. 179–211, 1991.
- M. R. de Villiers, P. J. T. de Villiers, and A. P. Kent, “The Delphi technique in health sciences education research,” Med. Teach., vol. 27, no. 7, pp. 639–643, Nov. 2005.
- A. Alomary and J. Woollard, “How Is Technology Accepted by Users? A Review of Technology Acceptance Models and Theories,” IRES 17th Int. Conf., no. November, pp. 1–4, 2015.
- P. Lai, “the Literature Review of Technology Adoption Models and Theories for the Novelty Technology,” J. Inf. Syst. Technol. Manag., vol. 14, no. 1, pp. 21–38, 2017.
- Eric, O. O (2018). Routing Protocol Redesign for Scalability in Wireless sensor Network Applications. (Unpublished doctoral thesis). Kwame Nkrumah University of Science and Technology. Kumasi, Ghana.
- A Symmetric, Probabilistic, Non-Circuit Based Fully Homomorphic Encryption Scheme
Abstract Views :201 |
PDF Views:2
Authors
Affiliations
1 Department of Information Technology Education, Akenten Appiah-Menka University of Skills Training and Entrepreneurial Development, IN
2 Department of Computer Science, Kwame Nkrumah University of Science and Technology, GH
3 Department of Information Technology Education, Akenten Appiah-Menka University of Skills Training and Entrepreneurial Development, GH
1 Department of Information Technology Education, Akenten Appiah-Menka University of Skills Training and Entrepreneurial Development, IN
2 Department of Computer Science, Kwame Nkrumah University of Science and Technology, GH
3 Department of Information Technology Education, Akenten Appiah-Menka University of Skills Training and Entrepreneurial Development, GH
Source
International Journal of Computer Networks and Applications, Vol 9, No 2 (2022), Pagination: 160-168Abstract
Traditional encryption allows encrypted data to be decrypted before any computation could be performed on such data. This approach could compromise the security of the data when an untrusted party is involved in the computation. To be able to work on data in its encrypted form, a homomorphic encryption approach is recommended. Homomorphic encryption allows computation to be done on data that has been encrypted and yields the same results that would have been obtained if the computation had been performed on the unencrypted form of the data. Most of the Homomorphic encryption (HE) algorithms are deterministic. These deterministic algorithms produce the same ciphertext for a given data on different occasions. This could allow an adversary to easily predict a plaintext from a ciphertext. Probabilistic algorithms, however, resolve the aforementioned challenge of deterministic algorithms. A probabilistic encryption algorithm ensures different ciphertexts for the same plaintext on different occasions. Another challenge of most homomorphic encryption schemes is the way data is encrypted. Most algorithms encrypt data bit-by-bit (i.e. circuit-based). Circuit-based encryption makes the encryption and decryption complex, thereby increasing the running time. To reduce the running time, Non-Circuit based encryption and decryption are preferred. Here, numeric data need not be converted to binary before any encryption is done. To ensure a very secure, efficient but simpler HE scheme, the authors have offered a fully homomorphic encryption (FHE) scheme that is Probabilistic, Non-Circuit based, and uses symmetric keys. Results from the experiment conducted show that the proposed scheme is faster than Fully Homomorphic Encryption over the Integer (DGHV), A simple Fully Homomorphic Encryption Scheme Available in Cloud Computing (SDC), and Fully Homomorphic Encryption by Prime Modular Operation (SAM) schemes. The proposed scheme has a time complexity of O(log(n2)) and consumes less memory space. Even though HE schemes are naturally slow, the less memory space consumed by the proposed scheme and the time complexity of O (log(n2)), makes the proposed scheme suitable for real-life implementation such as auction, electronic voting, and in other applications that make use of private data.Keywords
Probabilistic Encryption, Homomorphic Encryption, Non-Circuit Based Encryption, Information Security, Data, Symmetric Keys, Cryptography.References
- Asante, G., Hayfron-Acquah, J.B., & Asante, M. (2021). Evolution of Homomorphic Encryption. International Journal of Computer Applications 183(29): 37-40.
- Kahate, A. (2013). Cryptography and network security. Tata McGraw-Hill Education.
- Al Badawi, A. Q. A., Polyakov, Y., Aung, K. M. M., Veeravalli, B., & Rohloff, K. (2018). Implementation and performance evaluation of RNS variants of the BFV homomorphic encryption scheme. IEEE Transactions on Emerging Topics in Computing. 2018: pp. 70-95
- Gentry, C. (2009). A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University.
- Van Dijk, M., Gentry, C., Halevi, S., and Vaikuntanathan, V. (2010) Fully homomorphic encryption over the integers," in Advances in Cryptology {EUROCRYPT 2010, pp. 24{43, Springer, 2010.
- Gentry, C., & Halevi, S. (2011, May). Implementing gentry’s fully-homomorphic encryption scheme. In Annual international conference on the theory and applications of cryptographic techniques (pp. 129-148). Springer, Berlin, Heidelberg.
- Brakerski, Z., & Vaikuntanathan, V. (2011, August). Fully homomorphic encryption from ring-LWE and security for key-dependent messages. In Annual cryptology conference (pp. 505-524). Springer, Berlin, Heidelberg.
- Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2014). (Leveled) fully homomorphic encryption without bootstrapping. ACM Transactions on Computation Theory (TOCT), 6(3), 1-36.
- Gupta, C. P., and Sharma, I. (2013, October). A fully homomorphic encryption scheme with symmetric keys with application to private data processing in clouds. In 2013 Fourth International Conference on the Network of the Future (NoF) (pp. 1-4). IEEE.
- Cheon, J. H., Coron, J. S., Kim, J., Lee, M. S., Lepoint, T., Tibouchi, M., & Yun, A. (2013, May). Batch fully homomorphic encryption over the integers. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (pp. 315-335). Springer, Berlin, Heidelberg.
- Coron, J. S., Lepoint, T., & Tibouchi, M. (2014, March). Scale-invariant fully homomorphic encryption over the integers. In International Workshop on Public Key Cryptography (pp. 311-328). Springer, Berlin, Heidelberg.
- Dasgupta, S., & Pal, S. K. (2016). Design of a polynomial ring-based symmetric homomorphic encryption scheme. Perspectives in Science, 8, 692-695.
- Ahmed, E. Y., and Elkettani, M. D. (2019), An Efficient Fully Homomorphic Encryption Scheme, International Journal of Network Security, Vol.21, No.1, PP.91-99, Jan. 2019 (DOI: 10.6633/IJNS.201901 21(1).11)
- Hamad, S.S & Sagheer, Ali. (2018). Design of Fully Homomorphic Encryption by Prime Modular Operation. Telfor Journal. 10. 118-122. 10.5937/telfor1802118S.
- Xiao, Liangliang & Bastani, Osbert & Yen, I-ling. (2012). An Efficient Homomorphic Encryption Protocol for Multi-User Systems. IACR Cryptology ePrint Archive. 2012. 193.
- Bellare, M., Fischlin, M., O’Neill, A., & Ristenpart, T. (2008, August). Deterministic encryption: Definitional equivalences and constructions without random oracles. In Annual International Cryptology Conference (pp. 360-378). Springer, Berlin, Heidelberg.
- Bali, P. (2014). Comparative study of private and public-key cryptography algorithms: A Survey. IJRET: International Journal of Research in Engineering and Technology, 2319-1163.
- Nurhaida, I., Ramayanti, D., & Riesaputra, R. (2017). Digital signature & encryption implementation for increasing authentication, integrity, security, and data non-repudiation. vol, 4, 4-14.
- Zhang, L., Zheng, Y., & Kantoa, R. (2016, June). A review of homomorphic encryption and its applications. In Proceedings of the 9th EAI International Conference on Mobile Multimedia Communications (pp. 97-106).
- J. Li, D. Song, S. Chen, X. Lu, “A Simple Fully Homomorphic Encryption Scheme Available in Cloud Computing”, In Proceeding of IEEE, (2012), pp. 214-217.
- Das A., Dutta S., Adhikari A. (2013) Indistinguishability against Chosen Ciphertext Verification Attack Revisited: The Complete Picture. In: Susilo W., Reyhanitabar R. (eds) Provable Security. ProvSec 2013. Lecture Notes in Computer Science, vol 8209. pp. 347-356Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41227-1_6.