{"title":"Pseudo Anonymous and Hidden Attribute Comparison Based on Quick Friend Matching in Mobile Social Networks","authors":"Entao Luo, Guojun Wang, Qin Liu","doi":"10.1109/Trustcom/BigDataSE/ICESS.2017.220","DOIUrl":"https://doi.org/10.1109/Trustcom/BigDataSE/ICESS.2017.220","url":null,"abstract":"With the development of smart terminals and mobile social networks, users can find potential friends who have similar interests by sharing personal attribute profile in mobile social networks (MSN). However, the personal attribute profile usually contains sensitive information, and if this information is captured by attackers, it may cause unexpected consequences. In this paper, we propose a privacy-preserving matching scheme which is based on both identity authentication and key agreement. The scheme relies on trusted third party which has powerful computation ability and can reduce the workload on intelligent terminal. Moreover, the scheme uses encryption and authentication techniques to guarantee that the attacker fails to get the real information of user's attribute profile, so the personal privacy can be protected during friend matching process. Security analysis shows that the proposed scheme can protect the user's privacy. The simulation result shows that the scheme is more efficient than existing works.","PeriodicalId":170253,"journal":{"name":"2017 IEEE Trustcom/BigDataSE/ICESS","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116172996","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}
Wybren van der Meer, Kim-Kwang Raymond Choo, Nhien-An Le-Khac, Mohand Tahar Kechadi
{"title":"Investigation and Automating Extraction of Thumbnails Produced by Image Viewers","authors":"Wybren van der Meer, Kim-Kwang Raymond Choo, Nhien-An Le-Khac, Mohand Tahar Kechadi","doi":"10.1109/Trustcom/BigDataSE/ICESS.2017.355","DOIUrl":"https://doi.org/10.1109/Trustcom/BigDataSE/ICESS.2017.355","url":null,"abstract":"Data carving is generally used to recover deleted images in digital investigations, but carving time can be significant and the deleted images may have been overwritten. Thus, thumbnails of (deleted) images are an alternative evidence, and can often be found within databases created by either operating systems or image viewers. Existing literature generally focus on the extraction of thumbnails from databases created by the operating system. Understanding thumbnails created by image reviewers is relatively understudied. Therefore, in this paper, we propose a new approach of automating extraction of thumbnails produced by image viewers. We then evaluate the utility of our approach using popular image viewers.","PeriodicalId":170253,"journal":{"name":"2017 IEEE Trustcom/BigDataSE/ICESS","volume":"2009 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127337357","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":"Pipeline Optimizations of Architecting STT-RAM as Registers in Rad-Hard Environment","authors":"Zhiyao Gong, Keni Qiu, Weiwen Chen, Yuanhui Ni, Yuanchao Xu, Jianlei Yang","doi":"10.1109/Trustcom/BigDataSE/ICESS.2017.321","DOIUrl":"https://doi.org/10.1109/Trustcom/BigDataSE/ICESS.2017.321","url":null,"abstract":"Electromagnetic radiation effects can cause several types of errors on traditional SRAM-based registers such as single event upset (SEU) and single event functional interrupt (SEFI). Especially in aerospace where radiation is quite intense, the stability and correctness of systems are greatly affected. By exploiting the beneficial features of high radiation resistance and non-volatility, spin-transfer torque RAM (STT-RAM), a kind of emerging nonvolatile memory (NVM), is promising to be used as registers to avoid errors caused by radiation. However, substituting SRAM with STT-RAM in registers will affect system performance because STT-RAM suffers from long write latency. The early write termination (EWT) method has been accepted as an effective technique to mitigate write problems by terminating redundant writes. Based on the above background, this paper proposes to build registers by STT-RAM for embedded systems in rad-hard environment. Targeting the microarchitecture level of pipeline, the impact of architecting STT-RAM-based registers is discussed considering data hazard due to data dependencies. Furthermore, integrated with the EWT technique, a Read Merging method is proposed to eliminate redundant normal reads or sensing reads which are conducted along with a write. As a result of carrying out these actions, the energy and performance can be improved greatly. The results report 68% (and 75%) and 32% (and 39%) improvements on performance (and energy) by the proposed Read Merging method compared to the cases where STT-RAM is naively used as registers and intelligently used by integrating EWT, respectively.","PeriodicalId":170253,"journal":{"name":"2017 IEEE Trustcom/BigDataSE/ICESS","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125327941","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 Distinction Method of Flooding DDoS and Flash Crowds Based on User Traffic Behavior","authors":"Degang Sun, Kun Yang, Zhixin Shi, Yan Wang","doi":"10.1109/Trustcom/BigDataSE/ICESS.2017.221","DOIUrl":"https://doi.org/10.1109/Trustcom/BigDataSE/ICESS.2017.221","url":null,"abstract":"Discriminating Distributed Denial of Service (DDoS) from Flash Crowds (FC) is a tough and challenging problem, because there are many similarities between each other existed in network layer. In this paper, according to an extensive analysis of user traffic behavior of DDoS and FC, it can be found that some traffic abnormalities are existed between Bots and legitimate users. So a behavior-based method employed Data Mining isproposed to distinguish each other, and two public real-world datasets are used to evaluate the method. What's more, simulated traffic are produced to evaluate the method further, which is based on statistical parameters took from the two datasets and combined with two popular and common distributions together, Gaussian Distribution and Pareto Distribution. And two types of simulations are considered: Novice Simulation and Veteran Simulation. The result in Novice Simulation has almost 100% accuracy, while in Veteran Simulation, the result has a more than 98% accuracy, less than 15% FRP and 3% FNR, all of them show the proposed method could have a good accuracy and robustness. In addition, compared it with traditional methods-Entropy and Threshold methods in Veteran Simulation, the results indicate that both of them could hardly distinguish DDoS and FC, whilethe proposed method could achieve a better distinguished effect.","PeriodicalId":170253,"journal":{"name":"2017 IEEE Trustcom/BigDataSE/ICESS","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126971112","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}
Wei Zhang, D. Lin, Hailong Zhang, Cong Chen, Xiaojun Zhou
{"title":"A Lightweight Anonymous Mutual Authentication with Key Agreement Protocol on ECC","authors":"Wei Zhang, D. Lin, Hailong Zhang, Cong Chen, Xiaojun Zhou","doi":"10.1109/Trustcom/BigDataSE/ICESS.2017.234","DOIUrl":"https://doi.org/10.1109/Trustcom/BigDataSE/ICESS.2017.234","url":null,"abstract":"Recently, Goutham et al. proposed an ID-based user authentication with key agreement on elliptic curve cryptography(ECC), which is suitable to be applied in client-serverenvironment. The scheme mainly negotiates a temporary session key between two parties. However, we find that the scheme contains some security flaws, such as incomplete anonymity, no provision for updating private key and so on. In light of this, we propose a new version of anonymous authentication with key agreement protocol used for client-server environment, especially, the calculation of both sides are lower than the previous scheme. The proposed scheme provides more security features like complete anonymity, dynamic private key updating while keeping the merits of Goutham et al.’s scheme. We also optimize the performance of the scheme to get a lightweight protocol which is more suitable for resource-constrained device applied in Internet of Things(IoT) or wireless sensor network(WSN) applications.","PeriodicalId":170253,"journal":{"name":"2017 IEEE Trustcom/BigDataSE/ICESS","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124398121","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}
Juru Zeng, Hong Chen, Weiling Lai, Y. Liu, Cuiping Li, Shan Wang
{"title":"Privacy-Preserving and Collusion-aware k-NN Query Processing in Two-tiered Sensor Networks","authors":"Juru Zeng, Hong Chen, Weiling Lai, Y. Liu, Cuiping Li, Shan Wang","doi":"10.1109/Trustcom/BigDataSE/ICESS.2017.274","DOIUrl":"https://doi.org/10.1109/Trustcom/BigDataSE/ICESS.2017.274","url":null,"abstract":"With high expansibility of sensor electronic devices, wireless sensor networks have attracted more and more attention. The k nearest neighbors (k-NN) query has become a significant part of sensor networks due to its availability and convenience. However, it is an important but challenging problem to keep privacy and security while still maintaining low energy consumption. In this paper, we address this issue and propose PCKQ, a Privacy-preserving and Collusion-aware protocol for k-NN Query in two-tiered wireless sensor networks. Our solution consists of a novel k-NN query framework, a data encryption mechanism and comparison method. Extensive analysis and experimental results show the high performance of PCKQ in terms of energy efficiency, security and accountability requirements.","PeriodicalId":170253,"journal":{"name":"2017 IEEE Trustcom/BigDataSE/ICESS","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123683115","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}
Nikolaos Alexopoulos, Jörg Daubert, M. Mühlhäuser, Sheikh Mahbub Habib
{"title":"Beyond the Hype: On Using Blockchains in Trust Management for Authentication","authors":"Nikolaos Alexopoulos, Jörg Daubert, M. Mühlhäuser, Sheikh Mahbub Habib","doi":"10.1109/TRUSTCOM/BIGDATASE/ICESS.2017.283","DOIUrl":"https://doi.org/10.1109/TRUSTCOM/BIGDATASE/ICESS.2017.283","url":null,"abstract":"Trust Management (TM) systems for authentication are vital to the security of online interactions, which are ubiquitous in our everyday lives. Various systems, like the Web PKI (X.509) and PGP's Web of Trust are used to manage trust in this setting. In recent years, blockchain technology has been introduced as a panacea to our security problems, including that of authentication, without sufficient reasoning, as to its merits.In this work, we investigate the merits of using open distributed ledgers (ODLs), such as the one implemented by blockchain technology, for securing TM systems for authentication. We formally model such systems, and explore how blockchain can help mitigate attacks against them. After formal argumentation, we conclude that in the context of Trust Management for authentication, blockchain technology, and ODLs in general, can offer considerable advantages compared to previous approaches. Our analysis is, to the best of our knowledge, the first to formally model and argue about the security of TM systems for authentication, based on blockchain technology. To achieve this result, we first provide an abstract model for TM systems for authentication. Then, we show how this model can be conceptually encoded in a blockchain, by expressing it as a series of state transitions. As a next step, we examine five prevalent attacks on TM systems, and provide evidence that blockchain-based solutions can be beneficial to the security of such systems, by mitigating, or completely negating such attacks.","PeriodicalId":170253,"journal":{"name":"2017 IEEE Trustcom/BigDataSE/ICESS","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126435321","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}
Ghada Arfaoui, José Manuel Sánchez-Vílchez, Jean-Philippe Wary
{"title":"Security and Resilience in 5G: Current Challenges and Future Directions","authors":"Ghada Arfaoui, José Manuel Sánchez-Vílchez, Jean-Philippe Wary","doi":"10.1109/Trustcom/BigDataSE/ICESS.2017.345","DOIUrl":"https://doi.org/10.1109/Trustcom/BigDataSE/ICESS.2017.345","url":null,"abstract":"5G tends to be a multi-layered, multi-actor, and multi-access mobile network in order to fulfill the stringent availability, security, privacy and resilience requirements that are usually contradictory. In this paper, we propose a 5G vision based on softwarization. We provide a non-exhaustive list of current security, trust and resilience issues that are critical to be explored in 5G. We finally give some directions to overcome these issues.","PeriodicalId":170253,"journal":{"name":"2017 IEEE Trustcom/BigDataSE/ICESS","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131875124","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":"Fault Injection Attack on Salsa20 and ChaCha and a Lightweight Countermeasure","authors":"Kazuhide Fukushima, Rui Xu, S. Kiyomoto, N. Homma","doi":"10.1109/Trustcom/BigDataSE/ICESS.2017.348","DOIUrl":"https://doi.org/10.1109/Trustcom/BigDataSE/ICESS.2017.348","url":null,"abstract":"We propose a fault injection attack on Salsa20 and ChaCha stream ciphers. In these stream ciphers, the initial matrix X, which consists of constants, a key, a block counter, and a nonce, is added to the matrix X(20) process with a round function to generate a keystream. Our proposed fault injection attack skips the corresponding addition (add) instruction to obtain the matrix X or X(20) and extracts the key. General countermeasures against instruction skipping, including randomization, duplication, and parity checking, are not suitable for the software implementation of a stream cipher that requires high performance and lightweight computation. We thus demonstrate an algorithm-specific but extremely lightweight countermeasure with less than 0.5% execution time overhead based on a variable separation technique. Furthermore, we study the feasibility of the countermeasure in the IA-32, Intel 64, and ARM architectures.","PeriodicalId":170253,"journal":{"name":"2017 IEEE Trustcom/BigDataSE/ICESS","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130738665","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 High-Speed and SPA-Resistant Implementation of ECC Point Multiplication Over GF(p)","authors":"Xiang Feng, Shuguo Li","doi":"10.1109/Trustcom/BigDataSE/ICESS.2017.245","DOIUrl":"https://doi.org/10.1109/Trustcom/BigDataSE/ICESS.2017.245","url":null,"abstract":"In this paper, we propose a novel high-speed and SPA-resistant architecture for elliptic curve cryptography (ECC) point multiplication. A new Karatsuba-Ofman based pipelined multiplier is proposed to lower the latency, and an improved comb point multiplication method is employed to reduce the clock cycles and to resist simple power analysis (SPA). The proposed ECC architecture has been implemented on Altera's Stratix II FPGA platform. Implementation results show that our processor can perform 256-bit ECC point multiplication in 0.16 ms at the cost of 14.2k ALMs. Compared with the previous implementations, our implementation achieves a speed up factor of no less than 4 times without compromising the SPA-resistance.","PeriodicalId":170253,"journal":{"name":"2017 IEEE Trustcom/BigDataSE/ICESS","volume":"198 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115163078","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}