{"title":"云存储审计中的合作博弈论模型","authors":"Chung-Yi Lin, Wen-Guey Tzeng","doi":"10.6688/JISE.20200136(1).0008","DOIUrl":null,"url":null,"abstract":"In the traditional cloud storage auditing, users individually audit the cloud storage provider (CSP). However, users may pay the redundant auditing cost when they have similar auditing results. For example, a lot of users may get fail results when the CSP’s service occurs accidents. In the worst case, the overall auditing cost is linearly increasing with the number of users. We propose a cooperative auditing model to let user share their auditing results in a friendship-based social network so that their overall auditing cost can be reduced. Furthermore, we design an auditing coalition game based on cooperative game theory, where not only users’ individual interest but their entire benefit is considered. We present two algorithms to find out an optimal way of forming auditing coalitions. The first algorithm determines an optimal coalition in one iteration. In the second algorithm, after iteratively adjusting users’ trust relationships, users may change to join another coalition if they receive wrong auditing results.","PeriodicalId":50177,"journal":{"name":"Journal of Information Science and Engineering","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Cooperative Game-Theoretic Model in Cloud Storage Auditing\",\"authors\":\"Chung-Yi Lin, Wen-Guey Tzeng\",\"doi\":\"10.6688/JISE.20200136(1).0008\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the traditional cloud storage auditing, users individually audit the cloud storage provider (CSP). However, users may pay the redundant auditing cost when they have similar auditing results. For example, a lot of users may get fail results when the CSP’s service occurs accidents. In the worst case, the overall auditing cost is linearly increasing with the number of users. We propose a cooperative auditing model to let user share their auditing results in a friendship-based social network so that their overall auditing cost can be reduced. Furthermore, we design an auditing coalition game based on cooperative game theory, where not only users’ individual interest but their entire benefit is considered. We present two algorithms to find out an optimal way of forming auditing coalitions. The first algorithm determines an optimal coalition in one iteration. In the second algorithm, after iteratively adjusting users’ trust relationships, users may change to join another coalition if they receive wrong auditing results.\",\"PeriodicalId\":50177,\"journal\":{\"name\":\"Journal of Information Science and Engineering\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Information Science and Engineering\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.6688/JISE.20200136(1).0008\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.6688/JISE.20200136(1).0008","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
A Cooperative Game-Theoretic Model in Cloud Storage Auditing
In the traditional cloud storage auditing, users individually audit the cloud storage provider (CSP). However, users may pay the redundant auditing cost when they have similar auditing results. For example, a lot of users may get fail results when the CSP’s service occurs accidents. In the worst case, the overall auditing cost is linearly increasing with the number of users. We propose a cooperative auditing model to let user share their auditing results in a friendship-based social network so that their overall auditing cost can be reduced. Furthermore, we design an auditing coalition game based on cooperative game theory, where not only users’ individual interest but their entire benefit is considered. We present two algorithms to find out an optimal way of forming auditing coalitions. The first algorithm determines an optimal coalition in one iteration. In the second algorithm, after iteratively adjusting users’ trust relationships, users may change to join another coalition if they receive wrong auditing results.
期刊介绍:
The Journal of Information Science and Engineering is dedicated to the dissemination of information on computer science, computer engineering, and computer systems. This journal encourages articles on original research in the areas of computer hardware, software, man-machine interface, theory and applications. tutorial papers in the above-mentioned areas, and state-of-the-art papers on various aspects of computer systems and applications.