{"title":"Secure Email Login Based on Lightweight Asymmetric Identities","authors":"Kaige Yang, Shenghui Su","doi":"10.1145/3371676.3371683","DOIUrl":"https://doi.org/10.1145/3371676.3371683","url":null,"abstract":"In this paper, the authors analyze existing email login schemes, point out their flaws and shortcomings of, and give a secure login scheme based on a lightweight asymmetric identity. For the first time, the new scheme adopts a lightweight asymmetric identity of a user account as a user login credentials. The lightweight asymmetric identity implicates a user account (namely user name), private key, IP source address, and random number, and is verified by an email server, which can prevent an attacker from intercepting the user information and directly logging in the user mailbox. Analysis manifests the scheme can resist replay attack, birthday attack, dictionary attack, phishing website attack, and their combinatorial attacks.","PeriodicalId":352443,"journal":{"name":"Proceedings of the 2019 9th International Conference on Communication and Network Security","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115515412","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 Comprehensive Assessment Method of Asset Importance for Key Asset Protection","authors":"Xiaoling Gao, Yanhua Liu, Yanbin Qiu, Huajun Liu","doi":"10.1145/3371676.3371679","DOIUrl":"https://doi.org/10.1145/3371676.3371679","url":null,"abstract":"In a given system network, an important prerequisite for security risk control is how to accurately calculate the impact of different host assets in the topology on the spread of attack risk. In this regard, we propose a comprehensive asset importance assessment model for critical asset protection. First, the importance of local static assets in the topology was evaluated using three methods: degree centrality, mediation centrality, and closeness centrality. At the same time, PageRank was used to assess the importance of local dynamic assets for asset level changes. By combining the above two methods, and using K-CORE to evaluate the core position of the host in the network topology as the global weight indicator of the importance of assets. The comprehensive evaluation results of the importance of topology-oriented assets was finally obtained, and the validity of the model was verified through the experiment of the simulation ER random network.","PeriodicalId":352443,"journal":{"name":"Proceedings of the 2019 9th International Conference on Communication and Network Security","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128353887","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":"Simulation Environment of Evaluation and Optimization for Moving Target Defense: A SimPy Approach","authors":"Xinli Xiong, Linru Ma, Chao Cui","doi":"10.1145/3371676.3371692","DOIUrl":"https://doi.org/10.1145/3371676.3371692","url":null,"abstract":"In this paper, a simulation environment for evaluating the effectiveness and performance cost of moving target defense (MTD) is presented. This simulation environment is based on SimPy, which is a process-based discrete-event simulation framework worked on standard Python. In our MTD simulation environment, we develop a typical topology to contain different deployments of moving target (MT) techniques. Meanwhile, processes of attackers, defenders, services, and users are analyzed and modeled in the simulation environment, which also provides an extendable interface for MT technologies in the future. In the case study, we quantify the effectiveness and performance of MTD in the proposed simulation environment under several typical scenarios, none-MTD deployment, high-security strategy, high-performance strategy. The average attacking time, average processed requests, and average request's processing time are used as metrics to assess different MTD strategies. Results show that our simulation environment provides an efficient and intuitionistic method for evaluating the effectiveness and performance of MTD and helping to choose a more optimal strategy set for MTD.","PeriodicalId":352443,"journal":{"name":"Proceedings of the 2019 9th International Conference on Communication and Network Security","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134146446","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 Web Services Testing Approach based on Difference Measurement and Adaptive Random Testing","authors":"Zufa Zhang, Jianqiang Dai, Lingling Zhao, Songling Qin","doi":"10.1145/3371676.3371703","DOIUrl":"https://doi.org/10.1145/3371676.3371703","url":null,"abstract":"Nowadays, people's demand for Web services is increasing, but in the process of obtaining these services, there are some problems in the service, which have not been detected, resulting in a poor experience. Therefore, this paper proposes a difference measurement method based on FSCS (Fixed Sized Candidate Set) algorithm, which improves the traditional ART (Adaptive Random Testing) algorithm. By comparing the differences of each method in Web Services, the farthest method is selected for testing, which improves the testing efficiency and improves the service experience. The method first selects one of the multiple services that may have a potential error service for testing, each time picks the farthest service in the combined service, and then selects the farthest method from the service as a test case, and then measures the differences between the methods in the service, compare the test results with the expected results, so that the problems in the service can be effectively detected. The experimental results show that the proposed method based on difference metric and adaptive random test can detect the existing methods in the service and improve the detection efficiency.","PeriodicalId":352443,"journal":{"name":"Proceedings of the 2019 9th International Conference on Communication and Network Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130131516","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}
Zi-Yan Lin, Liangliang Gao, Xuexian Hu, Yuxuan Zhang, Wenfen Liu
{"title":"Differentially Private Graph Clustering Algorithm Based on Structure Similarity","authors":"Zi-Yan Lin, Liangliang Gao, Xuexian Hu, Yuxuan Zhang, Wenfen Liu","doi":"10.1145/3371676.3371693","DOIUrl":"https://doi.org/10.1145/3371676.3371693","url":null,"abstract":"With the widespread use of new information systems such as social networks, recommendation systems as well as location-based services, graph data has become a very common and important data type. It has been shown that, from these collected graph data, some special substructures can be found through clustering analysis, and can further support the intelligent decision. However, directly publishing or using clustering results on these graph data would disclose the privacy information of system users. To this end, based a classical structural clustering algorithm for networks (SCAN) and the technology of differential privacy, we propose a differentially private graph clustering algorithm named DP-SCAN. Specifically, we first reasonably calibrate the global sensitivity of the function of computing structure similarity between nodes in the graph, and thus specify parameters of the Laplace mechanism for capturing differential privacy. Then, we provide details of the DP-SCAN algorithm. The theoretical analysis indicates that DPSCAN algorithm satisfies ε-differential privacy, without trading off the clustering efficiency. The experimental results show that, when compared with the original SCAN clustering algorithm, DP-SCAN clustering algorithm can maintain the validity of clustering under the premise of satisfying differential privacy.","PeriodicalId":352443,"journal":{"name":"Proceedings of the 2019 9th International Conference on Communication and Network Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131321331","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":"Embedded Authentication and Blockchain in Micro-course","authors":"Wu-Chuan Yang, Lien-Yuan Ting","doi":"10.1145/3371676.3371696","DOIUrl":"https://doi.org/10.1145/3371676.3371696","url":null,"abstract":"The decentralization and consensus of blockchain provide the network trust and data certification of a low cost. In addition to financial technology, it has also attracted widespread attention in many applications. In this paper, we discuss on the design of the micro-course certification in university. The proposed architecture is suitable for the integration of school information systems and enhances the trust and micro-course elective. Unlike general blockchain applications, micro-course certification must be provided by a university-approved teacher or staff, thus it is important for their authentication. In this application, the password authentication is not secure enough, and the cost of public key certification is too high. Therefore, we use the authenticated public key technology of the RSA system technology, the authenticated data is the predetermined portion and embedded to RSA public key, such that the authenticated certifier and effective period can be directly provided by RSA public key. In comparison with traditional RSA, we only modified the key generation and the other part of RSA cryptosystem are all the same. This combination of blockchain and public key authentication can achieve a secure and easy-to-use micro-course certification system.","PeriodicalId":352443,"journal":{"name":"Proceedings of the 2019 9th International Conference on Communication and Network Security","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133747196","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":"An Efficient, Secure and Reliable Search Scheme for Dynamic Updates with Blockchain","authors":"Hang Li, Chonglin Gu, Yi Chen, Wenye Li","doi":"10.1145/3371676.3371684","DOIUrl":"https://doi.org/10.1145/3371676.3371684","url":null,"abstract":"Blockchain is a newly emerged technology to maintain data consistency through distributed network. Due to the nature of tamper-resistance, blockchain can well be used to achieve secure and reliable search without the participation of any third party. For data storage system with frequent updates, unfortunately, the existing blockchain-based search methods do not work. In this paper, we try to solve this problem by proposing a highly efficient search scheme for dynamic updates while still using blockchain to ensure security and reliability. Instead of modifying the original index directly, our updates are implemented by appending new indices when adding new data and maintaining a revocation list when deleting or changing data. Note that, the index tables and revocation list are preserved through dynamic searchable encryption, achieving high efficiency as well as security. Thus, attacker cannot learn if the newly added file contains a keyword that was searched before or not, so it can resist file-rejection attacks. Finally, we set up a blockchain-based search framework and validate the effectiveness and practicability of our method.","PeriodicalId":352443,"journal":{"name":"Proceedings of the 2019 9th International Conference on Communication and Network Security","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124138802","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}