A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects
Recently, crypto-cloud computing has become an interesting research area with many technical, security, commercial and financial aspects, goals and consequences. The original intention of the cloud is to link computing stations (services) for collaboration. Sharing and coordination of computational resources is important because of the activities between service providers and service requesters. Considering the cooperative functionality of crypto-cloud computing, the use of game theory in that area has became very beneficial. In the sequel, we mathematically associate that area with game theory, i.e., the bargaining and compromising of interests of various “players”, by using a game-theoretical approach which arises from networks, servers, operating systems, storage devices, etc. Further, we propose a novel efficient encryption system by using XTR (effective and compact subgroup trace representation) which has the property of semantic security. Those interactions has been constructed in the direction of how cryptographic tools can be used to address a natural optimization problem in the fields of game theory and financial economics. It is believed that game theory and its optimization is going to provide a suitable framework for the design of a crypto-cloud computing system that will be perceived as a strong technique and satisfy the needs of many participants and users of the cloud. The paper ends with a conclusion and an outlook to future studies.
KeywordsGame-theoretical models Optimization Cloud computing XTR Trace-DLP Cooperation
The authors thank the anonymous referees for their detailed and very helpful comments.
- Akyıldız, E., & Ashraf, M. (2014). An overview of trace based public key cryptography over finite fields. Journal of Computational and Applied Mathematics, 259–B, 599–621.Google Scholar
- Amazon Web Services. http://calculator.s3.amazonaws.com/index.html.
- Branzei, R., Dimitrov, D., & Tijs, S. (2008). Models in cooperative game theory (Vol. 556). Berlin: Springer.Google Scholar
- Ciftci, B., & Tijs, S. H. (2007). A vertex oriented approach to minimum cost spanning tree problems.Google Scholar
- Evans, J. R., & Minieka, E. (1992). Optimization algorithms for networks and graphs. Berlin: CRC Press.Google Scholar
- Garg, A. (2011). Cloud computing for the financial services industry. Sapient Global Markets, Sapient Corporation.Google Scholar
- Goldwasser, S., & Micali, S. (1982). Probabilistic encryption and how to play mental poker keeping secret all partial information. Proceedings of 14 Annual ACM Symposium on Theory of Computing (pp. 365–377).Google Scholar
- Intel IT Center. (2013). Securing the Cloud for Financial Instituations, Industry Brief.Google Scholar
- Maillé, P., Reichl, P., & Tuffin, B. (2011). Of threats and costs: A game-theoretic approach to security risk management. In N. Gülpinar, P. G. Harrison, B. Rustem (Eds.), Performance models and risk management in communications systems (pp. 33–53). New York:Springer.Google Scholar
- Shapley, L. S. (1953). A value for n-person games. Annals of Mathematics Studies, 28, 307–317.Google Scholar
- Tijs, S. (1981). Bounds for the core of a game and the t-value. In O. Moeschlin & D. Pallaschke (Eds.), Game Theory and Mathematical Economics (pp. 123–132). Amsterdam: North-Holland Publishing Company.Google Scholar
- West, D. B. (2001). Introduction to graph theory (Vol. 2). Upper Saddle River: Prentice Hall.Google Scholar