Advertisement

Annals of Operations Research

, Volume 260, Issue 1–2, pp 217–231 | Cite as

A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects

  • Barış Bülent Kırlar
  • Serap Ergün
  • Sırma Zeynep Alparslan Gök
  • Gerhard-Wilhelm Weber
S.I.: Advances of OR in Commodities and Financial Modelling

Abstract

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.

Keywords

Game-theoretical models Optimization Cloud computing XTR Trace-DLP Cooperation 

Notes

Acknowledgments

The authors thank the anonymous referees for their detailed and very helpful comments.

References

  1. 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
  2. Ashraf, M., & Kırlar, B. B. (2014). Message transmission for GH-public key cryptosystem. Journal of Computational and Applied Mathematics, 259–B, 578–585.CrossRefGoogle Scholar
  3. Bird, C. G. (1976). On cost allocation for a spanning tree: A game theoretic approach. Networks, 6(4), 335–350.CrossRefGoogle Scholar
  4. Borm, P., Hamers, H., & Hendrickx, R. (2001). Operations research games: A survey. Top, 9(2), 139–199.CrossRefGoogle Scholar
  5. Branzei, R., Dimitrov, D., & Tijs, S. (2008). Models in cooperative game theory (Vol. 556). Berlin: Springer.Google Scholar
  6. Ciftci, B., & Tijs, S. H. (2007). A vertex oriented approach to minimum cost spanning tree problems.Google Scholar
  7. Claus, A., & Kleitman, D. J. (1973). Cost allocation for a spanning tree. Networks, 3(4), 289–304.CrossRefGoogle Scholar
  8. Evans, J. R., & Minieka, E. (1992). Optimization algorithms for networks and graphs. Berlin: CRC Press.Google Scholar
  9. Garg, A. (2011). Cloud computing for the financial services industry. Sapient Global Markets, Sapient Corporation.Google Scholar
  10. Giuliani, K. J., & Gong, G. (2005). New LFSR-based cryptosystems and the trace discrete log problem (Trace-DLP), sequences and their applications-SETA 2004. Lecture Notes in Computer Science, 3486, 298–312.CrossRefGoogle Scholar
  11. 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
  12. Goldwasser, S., & Micali, S. (1984). Probabilistic encryption. Journal of Computer and System Sciences, 28, 270–299.CrossRefGoogle Scholar
  13. Gong, G., & Harn, L. (1999). Public-key cryptosystems based on cubic finite field extensions. IEEE Transactions on Information Theory, 45(7), 2601–2605.CrossRefGoogle Scholar
  14. Gong, G., Harn, L., & Wu, H. (2001). The GH public-key cryptosystem, in SAC’01. Lecture Notes in Computer Science, 2259, 284–300.CrossRefGoogle Scholar
  15. Gök, S. A., Branzei, R., & Tijs, S. (2010). The interval Shapley value: An axiomatization. Central European Journal of Operations Research, 18(2), 131–140.CrossRefGoogle Scholar
  16. Graham, R. L., & Hell, P. (1985). On the history of the minimum spanning tree problem. Annals of the History of Computing, 7(1), 43–57.CrossRefGoogle Scholar
  17. Intel IT Center. (2013). Securing the Cloud for Financial Instituations, Industry Brief.Google Scholar
  18. Kırlar, B. B. (2012). The final exponentiation in pairing-based cryptography. International Journal of Information Security Science, 1(1), 1–12.CrossRefGoogle Scholar
  19. Kruskal, J. B. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical society, 7(1), 48–50.CrossRefGoogle Scholar
  20. Lenstra, A. K., & Verheul, E. R. (2000). The XTR public key system, advances in cryptology-crypto 2000, Lecture Notes in Computer Science (Vol. 1880, pp. 1–9). New York: Springer.CrossRefGoogle Scholar
  21. 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
  22. Moretti, S., Gök, S. Z. A., Branzei, R., & Tijs, S. (2011). Connection situations under uncertainty and cost monotonic solutions. Computers and Operations Research, 38(11), 1638–1645.CrossRefGoogle Scholar
  23. Prim, R. C. (1957). Shortest connection networks and some generalizations. Bell System Technical Journal, 36(6), 1389–1401.CrossRefGoogle Scholar
  24. Roberts, F. S. (2008). Computer science and decision theory. Annals of Operations Research, 163(1), 209–253.CrossRefGoogle Scholar
  25. Shapley, L. S. (1953). A value for n-person games. Annals of Mathematics Studies, 28, 307–317.Google Scholar
  26. Stam, M., & Lenstra, A. K. (2001). Speeding up XTR, advances in cryptology-Asiacrypt’01. Lecture Notes in Computer Science, 2248, 125–143.CrossRefGoogle Scholar
  27. 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
  28. Tijs, S., & Otten, G. J. (1993). Compromise values in cooperative game theory. Top, 1(1), 1–36.CrossRefGoogle Scholar
  29. West, D. B. (2001). Introduction to graph theory (Vol. 2). Upper Saddle River: Prentice Hall.Google Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Barış Bülent Kırlar
    • 1
    • 2
  • Serap Ergün
    • 3
  • Sırma Zeynep Alparslan Gök
    • 1
    • 2
  • Gerhard-Wilhelm Weber
    • 2
  1. 1.Department of MathematicsSüleyman Demirel UniversityIspartaTurkey
  2. 2.Institute of Applied Mathematics, METUAnkaraTurkey
  3. 3.Department of Electronic and Communication EngineeringSüleyman Demirel UniversityIspartaTurkey

Personalised recommendations