{"title":"Anti-Counterfeit Scheme Using Monte Carlo Simulation for E-commerce in Cloud Systems","authors":"Keke Gai, Meikang Qiu, Hui Zhao, Wenyun Dai","doi":"10.1109/CSCloud.2015.75","DOIUrl":"https://doi.org/10.1109/CSCloud.2015.75","url":null,"abstract":"E-commerce using cloud-based trading platforms has become a popular approach with the growth of global development in recent years. However, the existence of counterfeits on the platform has threatened the benefits of all stakeholders. This paper proposes a novel scheme named Anti-Counterfeit Deterministic Prediction Model (ADPM), which is designed for detecting counterfeits by using Monte Carlo Model (MCM) to predict the potential malicious information in e-commerce. We consider the discriminations of the fake merchandises a crucial issue in preventing counterfeits on the online business platforms. The proposed mechanism provides a paradigm of machine-learning with using a novel algorithm that derives from MCM. The main algorithm used in our proposed mechanism is Monte Carlo Model-based Prediction Analysis Algorithm (M-PAA). Our experiment has evaluated that the proposed approach can provision the predictions of the insecure information in e-commerce.","PeriodicalId":278090,"journal":{"name":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130566169","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Guangquan Xu, Bin Liu, Yuanyuan Ren, Runhe Huang, Gaoxu Zhang, Zhiyong Feng, Xiaohong Li
{"title":"Towards Trustworthy Participants in Social Participatory Networks","authors":"Guangquan Xu, Bin Liu, Yuanyuan Ren, Runhe Huang, Gaoxu Zhang, Zhiyong Feng, Xiaohong Li","doi":"10.1109/CSCloud.2015.55","DOIUrl":"https://doi.org/10.1109/CSCloud.2015.55","url":null,"abstract":"By leveraging online social networks as an underlying infrastructure, Social Participatory Network (SPN) has been becoming a new paradigm of participatory sensing systems. However, a significant barrier to the widespread use of SPN applications is their vulnerability to various forms of malicious attacks. Such threats inhibit human participation and thus the viability of SPN systems in everyday use. To solve this problem, this paper proposes a trust evaluation framework for participants to encourage wider human participation in SPN. The proposal is based on the Tianjin University's own existing SPN system, named CRCS (ClassRoom Cloud System), which enables participants to use the cloud resources for online lessons or library study. It derives the trust value of participants by using entropy-weight method and data mining algorithms to deal with the behaviors data of participants. Our proposed solution can detect malicious participants easily, and more importantly, it outperforms other work for its low cost and simple deployment. For now, though our solution is based on a specified SPN system, we are confident that this solution is highly applicable to most other SPN systems.","PeriodicalId":278090,"journal":{"name":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127102388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Towards an Early Warning System for Network Attacks Using Bayesian Inference","authors":"H. Kalutarage, Chonho Lee, S. Shaikh, Bu-Sung Lee","doi":"10.1109/CSCLOUD.2015.35","DOIUrl":"https://doi.org/10.1109/CSCLOUD.2015.35","url":null,"abstract":"The Internet has become the most vulnerable part of critical civil infrastructures. Proactive measures such as early warnings are required to reduce the risk of disasters that can be created using it. With the continuous growth in scale, complexity and variety of networked systems the quality of data is continuously decreasing. This paper investigates the ability to employ Bayesian inference for network scenario analysis with low quality data to produce early warnings. Theoretical account of the approach and experimental results using a real world attack scenario and a real network traffic capture is presented.","PeriodicalId":278090,"journal":{"name":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127956215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Remote Attestation of Software and Execution-Environment in Modern Machines","authors":"Michael Kiperberg, A. Resh, N. Zaidenberg","doi":"10.1109/CSCloud.2015.52","DOIUrl":"https://doi.org/10.1109/CSCloud.2015.52","url":null,"abstract":"The research on network security concentrates mainly on securing the communication channels between two endpoints, which is insufficient if the authenticity of one of the endpoints cannot be determined with certainty. Previously presented methods that allow one endpoint, the authentication authority, to authenticate another remote machine. These methods are inadequate for modern machines that have multiple processors, introduce virtualization extensions, have a greater variety of side effects, and suffer from nondeterminism. This paper addresses the advances of modern machines with respect to the method presented by Kennell. The authors describe how a remote attestation procedure, involving a challenge, needs to be structured in order to provide correct attestation of a remote modern target system.","PeriodicalId":278090,"journal":{"name":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117227922","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Dependable Service Path Searching Method in Distributed Virtualized Environment Using Adaptive Bonus-Penalty Micro-Canonical Annealing","authors":"Huiqiang Wang, Shichen Zou, Junyu Lin, Guangsheng Feng, Hongwu Lv","doi":"10.1109/CSCloud.2015.41","DOIUrl":"https://doi.org/10.1109/CSCloud.2015.41","url":null,"abstract":"In Distributed Virtualized Environment, service components on a dependable service path will be selected to implement service composition. Searching for the optimal dependable service path is the key to implement dependability assurance, which is a Multi-Constrained Optimal Path problem. However, the existing algorithms have disadvantages of high complexity and low performance, and lacking the consideration of trust relationships and evidence spread among service components during service construction and composition. We proposed the concept of QoD, the Quality of Dependability, introducing some attributes(e.g. component intimacy) to describe and restrict the dependable service path searching in distributed virtualized environment. We also applied Adaptive Bonus-Penalty Micro-canonical Annealing(ABP-MA) to dependable service path searching, and chose service components on the optimal dependable service path to satisfy users' demands for service dependability. The experimental results showed that ABP-MA has the advantages of fast convergence and high search success rate.","PeriodicalId":278090,"journal":{"name":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134219477","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Context Awareness through Reasoning on Private Analysis for Android Application","authors":"Hongmu Han, Ruixuan Li, Jinwei Hu, Meikang Qiu","doi":"10.1109/CSCloud.2015.63","DOIUrl":"https://doi.org/10.1109/CSCloud.2015.63","url":null,"abstract":"Smartphone contains diverse sensitive private information, such as phone number, contact and credit. The Android platform employs permission mechanism to protect intensive information from illegal leakage. There are several tools to assist users to manage apps' permissions, such as App Ops, Privacy Guard, and XPrivacy. However, the permission mechanism of Android is complicated, and only a few of smartphone users are familiar with Android security mechanism. In addition, it is difficult for smartphone users to know whether the privacy information exposure by Android applications is legal or not. Reverse engineering and program data flow analysis are basic approaches to analysis applications. Although it needs analysts to manual analysis results, its efficiency is largely depends on analysts' skills and experience. To improve analysis efficiency, we take a case-based reasoning method to simulation the security expert analysis applications. We translate the result of Android static analysis tools into cases and build a case reasoning library. Experiments show that it can help analysts to aid analysis Android applications.","PeriodicalId":278090,"journal":{"name":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128012848","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"CPAV: Computationally Efficient Privacy Preserving Anonymous Authentication Scheme for Vehicular Ad Hoc Networks","authors":"P. Vijayakumar, M. Azees, L. Deborah","doi":"10.1109/CSCloud.2015.32","DOIUrl":"https://doi.org/10.1109/CSCloud.2015.32","url":null,"abstract":"In this paper, we propose a computationally efficient privacy preserving anonymous authentication scheme based on the use of anonymous certificates and signatures for vehicular ad hoc networks (VANETs). Even though there were many existing schemes to provide anonymous authentication based on anonymous certificates and signatures in VANETs, the existing schemes suffer from high computation cost in the certificate revocation list (CRL) checking process and in the certificate and the signature verification process. Therefore, it is not possible to verify a large number of messages per second in VANETs which would lead to high message loss. Hence, we use a computationally efficient anonymous mutual authentication mechanism to validate the message source and anonymous signatures in order to guarantee the integrity of messages. Moreover, a conditional tracking mechanism is introduced to trace the real identity of vehicles and revoke them from VANET in the case of dispute. This proposed scheme is implemented and performance analysis shows that our scheme is more efficient in terms of certificate and signature verification delay, while keeping conditional privacy in VANETs.","PeriodicalId":278090,"journal":{"name":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117191323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Design of Detecting Botnet Communication by Monitoring Direct Outbound DNS Queries","authors":"Yong Jin, Hikaru Ichise, K. Iida","doi":"10.1109/CSCloud.2015.53","DOIUrl":"https://doi.org/10.1109/CSCloud.2015.53","url":null,"abstract":"Domain Name System is the most widely used protocol for domain name resolution in the Internet. Domain name resolution is necessary for most of Internet services and it is usually provided by DNS full resolvers. Unfortunately, many reports indicated that DNS protocol was also used in botnet communication recently. Botnet communications between bot-infected computers and Command and Control (C&C) servers are indispensable in botnet attacks and the involved DNS traffic may not use DNS full resolvers. More importantly, due to the popularity of DNS protocol it is difficult to simply block the DNS traffic from internal computers. Several related works have been launched but they only focus on DNS full resolvers. In this paper, we focus on monitoring direct outbound DNS queries and propose a new botnet communication detection method by collecting authoritative NS (Name Server) record and its IP address. We monitored all DNS traffic for about three months in our university and checked the destination IP addresses of direct outbound DNS queries in a third party security site to confirm the effectiveness of the proposed method. The results confirmed that about 19% IP addresses in average have hits per day which indicates that our proposed method is effective and the hit rate is acceptable for detailed investigation in real operation.","PeriodicalId":278090,"journal":{"name":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114786958","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ari Butowsky, Keke Gai, Michael J. Coakley, Meikang Qiu, C. Tappert
{"title":"City of White Plains Parking App: Case Study of a Smart City Web Application","authors":"Ari Butowsky, Keke Gai, Michael J. Coakley, Meikang Qiu, C. Tappert","doi":"10.1109/CSCloud.2015.70","DOIUrl":"https://doi.org/10.1109/CSCloud.2015.70","url":null,"abstract":"The City of White Plains has a residential population of 57,000 people, which increases every day by 225,000 people who come in from the outlying suburbs to work and shop in the city. Due to the traffic created and the large number of spread-out parking locations, there is an urgent demand of creating an mobile app allowing drivers to find available parking spaces easily. However, the solution specifically focusing on this issue has been rarely investigated by the prior research. In this paper, we represent our case study of a smart city web application using semantic design for a governmental organization's parking app. The app navigates customers to parking structures in conjunction with their destination. The app's user interface was constructed using HTML, CSS, and JavaScript, and a tag-based network structure to facilitate exploratory behavior. The work culminated in a completed user interface, a report detailing its perceived benefits, and an evaluation of its application. Use cases are described for three applications-the Passport app currently employed by the City of White Plains, the app developed in this study, and a future app using Internet of Things (IoT) technology.","PeriodicalId":278090,"journal":{"name":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","volume":"PP 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126534876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zhouwang Fu, Tao Song, Sheng Wang, Fuzong Wang, Zhengwei Qi
{"title":"Seagull -- A Real-Time Coflow Scheduling System","authors":"Zhouwang Fu, Tao Song, Sheng Wang, Fuzong Wang, Zhengwei Qi","doi":"10.1109/CSCloud.2015.38","DOIUrl":"https://doi.org/10.1109/CSCloud.2015.38","url":null,"abstract":"Data-parallel applications often generate hundreds of flows at the same time in data centers. Since these flows are always connected with application context, traditional flow-level optimization policies are hard to perform well in such collections. The coflow abstraction brings hope and opportunity to make the scheduling much more efficient. But exsiting schedule systems based on that related concept are either static (such as Varys) or impracticable (such as Baraat). In this paper, we address these limitations by presenting Seagull -- a dynamic precise coflow scheduling system to optimize the average CCT (Coflow Completion Time) and guaranteeing predictable completions within coflow deadlines. It's a centralized system which can share the bandwidth resources with background flows in the data center. Our experiments show that 80% CCT of the coflows is about 1.7× faster than Varys. As for deadline meeting, Seagull can guarantee about 50% of admitted coflows finishing within their deadline, which is 10% more precise than Varys.","PeriodicalId":278090,"journal":{"name":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124797390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}