Remote execution of physical tasks by putting into contributionDOSN: Case of Money Transfer

Lienou Jean-Pierre; Thierry Noulamo; Alain Djimeli-Tsajio

doi:10.18535/ijsrm/v11i08.ec01

Abstract

Distributed Online Social Networks (DOSN) provide some advantages that are not yet fully exploited. It can help reduce cost especially when it comes to manage remote physical agents to fulfill some tasks under delegation of other agents that are weakly coupled. This paper tackles the problem of structuring and organizing such a network and a case study is applied on international money transfer. Recent studies showed that the difference between the amounts of money transfer between less developed and developed countries is not too high. The finance institutions for money transfer are widespread but at international level, only few companies share the market giving the lion share to Western Union and Moneygram. Building a social network of “gentlemen” can transform two international transfers to two or more national transfers. It can then reduce the charges of international transfers, speed up at time the process of money transfer, include more people that are outside the banking system. A prototype is constructed using three key concepts to solve arisen problems. Firstly, the gentlemen approach uses some kind of godfather relationship used in most djangui unions in Cameroon to welcome new members. The graph database Neo4J was chosen to ease the process of identifying the chain of godfathers in case a “bad guy” joins and abuse members of the network. Secondly, the knapsack problem in all is varieties is implemented in case the amount to be transferred from one country to another could not match a one-to-one relationship. Thirdly, a signcryption mechanism is used to solve the cryptographic functionalities that occur during message exchanges on the platform. Due to the fact that such social network has to dealt with trust, reputation, privacy and security, it can be considered as a powerful tool for investigating societal problems such as financing terrorism or deception on the Internet. A game theory can then be applied to detect the conditions making the network not interesting to hackers.

Keywords

contribution DOSNMoney Transfer

References

Auvolat, A., Frey, D., Raynal, M., Taïani, F., Money, F. T., & Taani, F. (2020). Money Transfer Made Simple. https://hal.archives-ouvertes.fr/hal-02861511v1Google Scholar ↗
Caccetta, L., & Kulanoot, A. (2001). 1 ALGORITHMS FOR SOME HARD KNAPSACK PROBLEMS.Google Scholar ↗
Cao, L., & Ge, W. (2018). Analysis of certificateless signcryption schemes and construction of a secure and efficient pairing-free one based on ECC. KSII Transactions on Internet and Information Systems, 12(9). https://doi.org/10.3837/tiis.2018.09.022DOI ↗Google Scholar ↗
Ch, S. A., uddin, N., Sher, M., Ghani, A., Naqvi, H., & Irshad, A. (2015). An efficient signcryption scheme with forward secrecy and public verifiability based on hyper elliptic curve cryptography. Multimedia Tools and Applications, 74(5), 1711–1723. https://doi.org/10.1007/s11042-014-2283-9DOI ↗Google Scholar ↗
Daniel, R. M., Rajsingh, E. B., & Silas, S. (2021). A forward secure signcryption scheme with ciphertext authentication for e-payment systems using conic curve cryptography. Journal of King Saud University - Computer and Information Sciences, 33(1). https://doi.org/10.1016/j.jksuci.2018.02.004DOI ↗Google Scholar ↗
Guidi, B., Conti, M., Passarella, A., & Ricci, L. (2018). Managing social contents in Decentralized Online Social Networks: A survey. Online Social Networks and Media, 7, 12–29. https://doi.org/10.1016/j.osnem.2018.07.001DOI ↗Google Scholar ↗
Howgrave-Graham, N., & Joux, A. (n.d.). New Generic Algorithms for Hard Knapsacks.Google Scholar ↗
Kellerer, H., Pferschy, U., & Pisinger, D. (2004a). Knapsack Problems. In Knapsack Problems. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24777-7DOI ↗Google Scholar ↗
Kellerer, H., Pferschy, U., & Pisinger, D. (2004b). Knapsack Problems. In Knapsack Problems. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24777-7DOI ↗Google Scholar ↗
Singh, T., & Ali, R. (2018). An Identity based Multi-receiver Generalized Signcryption Scheme. Asian Journal of Applied Sciences, 6(4). https://doi.org/10.24203/ajas.v6i4.5421DOI ↗Google Scholar ↗
ur Rahman, A., Ullah, I., Naeem, M., Anwar, R., Noor-ul-Amin, Khattak, H., & Ullah, S. (2018). A lightweight multi-message and multi-receiver heterogeneous hybrid signcryption scheme based on hyper elliptic curve. International Journal of Advanced Computer Science and Applications, 9(5). https://doi.org/10.14569/IJACSA.2018.090520DOI ↗Google Scholar ↗
Xu, Q., Tan, C., Fan, Z., Zhu, W., Xiao, Y., & Cheng, F. (2018). Secure multi-authority data access control scheme in cloud storage system based on attribute-based signcryption. IEEE Access, 6, 34051–34074. https://doi.org/10.1109/ACCESS.2018.2844829DOI ↗Google Scholar ↗

[refR-1] Auvolat, A., Frey, D., Raynal, M., Taïani, F., Money, F. T., & Taani, F. (2020). Money Transfer Made Simple. https://hal.archives-ouvertes.fr/hal-02861511v1Google Scholar ↗

[refR-2] Caccetta, L., & Kulanoot, A. (2001). 1 ALGORITHMS FOR SOME HARD KNAPSACK PROBLEMS.Google Scholar ↗

[refR-3] Cao, L., & Ge, W. (2018). Analysis of certificateless signcryption schemes and construction of a secure and efficient pairing-free one based on ECC. KSII Transactions on Internet and Information Systems, 12(9). https://doi.org/10.3837/tiis.2018.09.022DOI ↗Google Scholar ↗

[refR-4] Ch, S. A., uddin, N., Sher, M., Ghani, A., Naqvi, H., & Irshad, A. (2015). An efficient signcryption scheme with forward secrecy and public verifiability based on hyper elliptic curve cryptography. Multimedia Tools and Applications, 74(5), 1711–1723. https://doi.org/10.1007/s11042-014-2283-9DOI ↗Google Scholar ↗

[refR-5] Daniel, R. M., Rajsingh, E. B., & Silas, S. (2021). A forward secure signcryption scheme with ciphertext authentication for e-payment systems using conic curve cryptography. Journal of King Saud University - Computer and Information Sciences, 33(1). https://doi.org/10.1016/j.jksuci.2018.02.004DOI ↗Google Scholar ↗

[refR-6] Guidi, B., Conti, M., Passarella, A., & Ricci, L. (2018). Managing social contents in Decentralized Online Social Networks: A survey. Online Social Networks and Media, 7, 12–29. https://doi.org/10.1016/j.osnem.2018.07.001DOI ↗Google Scholar ↗

[refR-7] Howgrave-Graham, N., & Joux, A. (n.d.). New Generic Algorithms for Hard Knapsacks.Google Scholar ↗

[refR-8] Kellerer, H., Pferschy, U., & Pisinger, D. (2004a). Knapsack Problems. In Knapsack Problems. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24777-7DOI ↗Google Scholar ↗

[refR-9] Kellerer, H., Pferschy, U., & Pisinger, D. (2004b). Knapsack Problems. In Knapsack Problems. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24777-7DOI ↗Google Scholar ↗

[refR-10] Singh, T., & Ali, R. (2018). An Identity based Multi-receiver Generalized Signcryption Scheme. Asian Journal of Applied Sciences, 6(4). https://doi.org/10.24203/ajas.v6i4.5421DOI ↗Google Scholar ↗

[refR-11] ur Rahman, A., Ullah, I., Naeem, M., Anwar, R., Noor-ul-Amin, Khattak, H., & Ullah, S. (2018). A lightweight multi-message and multi-receiver heterogeneous hybrid signcryption scheme based on hyper elliptic curve. International Journal of Advanced Computer Science and Applications, 9(5). https://doi.org/10.14569/IJACSA.2018.090520DOI ↗Google Scholar ↗

[refR-12] Xu, Q., Tan, C., Fan, Z., Zhu, W., Xiao, Y., & Cheng, F. (2018). Secure multi-authority data access control scheme in cloud storage system based on attribute-based signcryption. IEEE Access, 6, 34051–34074. https://doi.org/10.1109/ACCESS.2018.2844829DOI ↗Google Scholar ↗