{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T04:32:49Z","timestamp":1778041969445,"version":"3.51.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,2,16]],"date-time":"2016-02-16T00:00:00Z","timestamp":1455580800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10479-016-2139-y","type":"journal-article","created":{"date-parts":[[2016,2,16]],"date-time":"2016-02-16T14:46:10Z","timestamp":1455633970000},"page":"217-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects"],"prefix":"10.1007","volume":"260","author":[{"given":"Bar\u0131\u015f B\u00fclent","family":"K\u0131rlar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serap","family":"Erg\u00fcn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u0131rma Zeynep","family":"Alparslan G\u00f6k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard-Wilhelm","family":"Weber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,16]]},"reference":[{"key":"2139_CR1","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/j.cam.2013.10.022","volume":"259\u2013B","author":"E Aky\u0131ld\u0131z","year":"2014","unstructured":"Aky\u0131ld\u0131z, E., & Ashraf, M. (2014). An overview of trace based public key cryptography over finite fields. Journal of Computational and Applied Mathematics, 259\u2013B, 599\u2013621.","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"2139_CR2","unstructured":"Amazon Web Services. http:\/\/calculator.s3.amazonaws.com\/index.html ."},{"key":"2139_CR3","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1016\/j.cam.2013.10.005","volume":"259\u2013B","author":"M Ashraf","year":"2014","unstructured":"Ashraf, M., & K\u0131rlar, B. B. (2014). Message transmission for GH-public key cryptosystem. Journal of Computational and Applied Mathematics, 259\u2013B, 578\u2013585.","journal-title":"Journal of Computational and Applied Mathematics"},{"issue":"4","key":"2139_CR4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/net.3230060404","volume":"6","author":"CG Bird","year":"1976","unstructured":"Bird, C. G. (1976). On cost allocation for a spanning tree: A game theoretic approach. Networks, 6(4), 335\u2013350.","journal-title":"Networks"},{"issue":"2","key":"2139_CR5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02579075","volume":"9","author":"P Borm","year":"2001","unstructured":"Borm, P., Hamers, H., & Hendrickx, R. (2001). Operations research games: A survey. Top, 9(2), 139\u2013199.","journal-title":"Top"},{"key":"2139_CR6","volume-title":"Models in cooperative game theory","author":"R Branzei","year":"2008","unstructured":"Branzei, R., Dimitrov, D., & Tijs, S. (2008). Models in cooperative game theory (Vol. 556). Berlin: Springer."},{"key":"2139_CR7","doi-asserted-by":"crossref","unstructured":"Ciftci, B., & Tijs, S. H. (2007). A vertex oriented approach to minimum cost spanning tree problems.","DOI":"10.2139\/ssrn.1047541"},{"issue":"4","key":"2139_CR8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/net.3230030402","volume":"3","author":"A Claus","year":"1973","unstructured":"Claus, A., & Kleitman, D. J. (1973). Cost allocation for a spanning tree. Networks, 3(4), 289\u2013304.","journal-title":"Networks"},{"key":"2139_CR9","volume-title":"Optimization algorithms for networks and graphs","author":"JR Evans","year":"1992","unstructured":"Evans, J. R., & Minieka, E. (1992). Optimization algorithms for networks and graphs. Berlin: CRC Press."},{"key":"2139_CR10","unstructured":"Garg, A. (2011). Cloud computing for the financial services industry. Sapient Global Markets, Sapient Corporation."},{"key":"2139_CR11","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/11423461_22","volume":"3486","author":"KJ Giuliani","year":"2005","unstructured":"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\u2013312.","journal-title":"Lecture Notes in Computer Science"},{"key":"2139_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013377).","DOI":"10.1145\/800070.802212"},{"key":"2139_CR13","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., & Micali, S. (1984). Probabilistic encryption. Journal of Computer and System Sciences, 28, 270\u2013299.","journal-title":"Journal of Computer and System Sciences"},{"issue":"7","key":"2139_CR14","doi-asserted-by":"crossref","first-page":"2601","DOI":"10.1109\/18.796413","volume":"45","author":"G Gong","year":"1999","unstructured":"Gong, G., & Harn, L. (1999). Public-key cryptosystems based on cubic finite field extensions. IEEE Transactions on Information Theory, 45(7), 2601\u20132605.","journal-title":"IEEE Transactions on Information Theory"},{"key":"2139_CR15","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/3-540-45537-X_22","volume":"2259","author":"G Gong","year":"2001","unstructured":"Gong, G., Harn, L., & Wu, H. (2001). The GH public-key cryptosystem, in SAC\u201901. Lecture Notes in Computer Science, 2259, 284\u2013300.","journal-title":"Lecture Notes in Computer Science"},{"issue":"2","key":"2139_CR16","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s10100-009-0096-0","volume":"18","author":"SA G\u00f6k","year":"2010","unstructured":"G\u00f6k, S. A., Branzei, R., & Tijs, S. (2010). The interval Shapley value: An axiomatization. Central European Journal of Operations Research, 18(2), 131\u2013140.","journal-title":"Central European Journal of Operations Research"},{"issue":"1","key":"2139_CR17","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MAHC.1985.10011","volume":"7","author":"RL Graham","year":"1985","unstructured":"Graham, R. L., & Hell, P. (1985). On the history of the minimum spanning tree problem. Annals of the History of Computing, 7(1), 43\u201357.","journal-title":"Annals of the History of Computing"},{"key":"2139_CR18","unstructured":"Intel IT Center. (2013). Securing the Cloud for Financial Instituations, Industry Brief."},{"issue":"1","key":"2139_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.5923\/j.ijis.20110101.01","volume":"1","author":"BB K\u0131rlar","year":"2012","unstructured":"K\u0131rlar, B. B. (2012). The final exponentiation in pairing-based cryptography. International Journal of Information Security Science, 1(1), 1\u201312.","journal-title":"International Journal of Information Security Science"},{"issue":"1","key":"2139_CR20","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"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\u201350.","journal-title":"Proceedings of the American Mathematical society"},{"key":"2139_CR21","first-page":"1","volume-title":"The XTR public key system, advances in cryptology-crypto 2000, Lecture Notes in Computer Science","author":"AK Lenstra","year":"2000","unstructured":"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\u20139). New York: Springer."},{"key":"2139_CR22","unstructured":"Maill\u00e9, P., Reichl, P., & Tuffin, B. (2011). Of threats and costs: A game-theoretic approach to security risk management. In N. G\u00fclpinar, P. G. Harrison, B. Rustem (Eds.), Performance models and risk management in communications systems (pp. 33\u201353). New York:Springer."},{"issue":"11","key":"2139_CR23","doi-asserted-by":"crossref","first-page":"1638","DOI":"10.1016\/j.cor.2011.02.004","volume":"38","author":"S Moretti","year":"2011","unstructured":"Moretti, S., G\u00f6k, S. Z. A., Branzei, R., & Tijs, S. (2011). Connection situations under uncertainty and cost monotonic solutions. Computers and Operations Research, 38(11), 1638\u20131645.","journal-title":"Computers and Operations Research"},{"issue":"6","key":"2139_CR24","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R. C. (1957). Shortest connection networks and some generalizations. Bell System Technical Journal, 36(6), 1389\u20131401.","journal-title":"Bell System Technical Journal"},{"issue":"1","key":"2139_CR25","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10479-008-0328-z","volume":"163","author":"FS Roberts","year":"2008","unstructured":"Roberts, F. S. (2008). Computer science and decision theory. Annals of Operations Research, 163(1), 209\u2013253.","journal-title":"Annals of Operations Research"},{"key":"2139_CR26","first-page":"307","volume":"28","author":"LS Shapley","year":"1953","unstructured":"Shapley, L. S. (1953). A value for n-person games. Annals of Mathematics Studies, 28, 307\u2013317.","journal-title":"Annals of Mathematics Studies"},{"key":"2139_CR27","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/3-540-45682-1_8","volume":"2248","author":"M Stam","year":"2001","unstructured":"Stam, M., & Lenstra, A. K. (2001). Speeding up XTR, advances in cryptology-Asiacrypt\u201901. Lecture Notes in Computer Science, 2248, 125\u2013143.","journal-title":"Lecture Notes in Computer Science"},{"key":"2139_CR28","first-page":"123","volume-title":"Game Theory and Mathematical Economics","author":"S Tijs","year":"1981","unstructured":"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\u2013132). Amsterdam: North-Holland Publishing Company."},{"issue":"1","key":"2139_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02574733","volume":"1","author":"S Tijs","year":"1993","unstructured":"Tijs, S., & Otten, G. J. (1993). Compromise values in cooperative game theory. Top, 1(1), 1\u201336.","journal-title":"Top"},{"key":"2139_CR30","volume-title":"Introduction to graph theory","author":"DB West","year":"2001","unstructured":"West, D. B. (2001). Introduction to graph theory (Vol. 2). Upper Saddle River: Prentice Hall."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2139-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2139-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2139-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2139-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T17:07:19Z","timestamp":1567616839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2139-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,16]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["2139"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2139-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,16]]}}}