Pub Date : 2015-08-20DOI: 10.1109/Trustcom.2015.415
Julien Mineraud, Federico Lancerin, S. Balasubramaniam, M. Conti, S. Tarkoma
With the availability of inexpensive sensors, the attractiveness of participatory sensing has increased tremendously in the last decade. However, when sensing is performed with devices owned by individuals, it raises several privacy issues with respect to the data producers, and hence reduces the incentive to contribute to the services. In this paper, we evaluate the extent to which a malicious server in a crowdsourcing air quality monitoring service can track the locations of users that contribute to the service. The participants periodically send information, such as temperature, relative humidity, carbon monoxide, and luminosity of their surrounding, using an off-the-shelf sensor connected to their mobile phones. The participants also send their coarse-grain location (i.e., disclosing the ID of the cell tower to which their mobile is coupled) along with the air quality data. We evaluate the precision with which the attacker can track the participants using only air quality data and location of the cell tower. We perform a thorough analysis of the privacy attack and show that it can accurately discover the destination of the users with a precision of more than 85% (up to 97%), if at least five consecutive samples are provided by the participants. We also discovered that the precision drops when the environmental sensors are affected by outside conditions (e.g., exposition to direct sunlight) but remains significant (54.5% for 20 consecutive samples).
{"title":"You are AIRing too Much: Assessing the Privacy of Users in Crowdsourcing Environmental Data","authors":"Julien Mineraud, Federico Lancerin, S. Balasubramaniam, M. Conti, S. Tarkoma","doi":"10.1109/Trustcom.2015.415","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.415","url":null,"abstract":"With the availability of inexpensive sensors, the attractiveness of participatory sensing has increased tremendously in the last decade. However, when sensing is performed with devices owned by individuals, it raises several privacy issues with respect to the data producers, and hence reduces the incentive to contribute to the services. In this paper, we evaluate the extent to which a malicious server in a crowdsourcing air quality monitoring service can track the locations of users that contribute to the service. The participants periodically send information, such as temperature, relative humidity, carbon monoxide, and luminosity of their surrounding, using an off-the-shelf sensor connected to their mobile phones. The participants also send their coarse-grain location (i.e., disclosing the ID of the cell tower to which their mobile is coupled) along with the air quality data. We evaluate the precision with which the attacker can track the participants using only air quality data and location of the cell tower. We perform a thorough analysis of the privacy attack and show that it can accurately discover the destination of the users with a precision of more than 85% (up to 97%), if at least five consecutive samples are provided by the participants. We also discovered that the precision drops when the environmental sensors are affected by outside conditions (e.g., exposition to direct sunlight) but remains significant (54.5% for 20 consecutive samples).","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117352874","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}
Pub Date : 2015-08-20DOI: 10.1109/Trustcom.2015.357
M. Sabt, Mohammed Achemlal, A. Bouabdallah
Nowadays, there is a trend to design complex, yet secure systems. In this context, the Trusted Execution Environment (TEE) was designed to enrich the previously defined trusted platforms. TEE is commonly known as an isolated processing environment in which applications can be securely executed irrespective of the rest of the system. However, TEE still lacks a precise definition as well as representative building blocks that systematize its design. Existing definitions of TEE are largely inconsistent and unspecific, which leads to confusion in the use of the term and its differentiation from related concepts, such as secure execution environment (SEE). In this paper, we propose a precise definition of TEE and analyze its core properties. Furthermore, we discuss important concepts related to TEE, such as trust and formal verification. We give a short survey on the existing academic and industrial ARM TrustZone-based TEE, and compare them using our proposed definition. Finally, we discuss some known attacks on deployed TEE as well as its wide use to guarantee security in diverse applications.
{"title":"Trusted Execution Environment: What It is, and What It is Not","authors":"M. Sabt, Mohammed Achemlal, A. Bouabdallah","doi":"10.1109/Trustcom.2015.357","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.357","url":null,"abstract":"Nowadays, there is a trend to design complex, yet secure systems. In this context, the Trusted Execution Environment (TEE) was designed to enrich the previously defined trusted platforms. TEE is commonly known as an isolated processing environment in which applications can be securely executed irrespective of the rest of the system. However, TEE still lacks a precise definition as well as representative building blocks that systematize its design. Existing definitions of TEE are largely inconsistent and unspecific, which leads to confusion in the use of the term and its differentiation from related concepts, such as secure execution environment (SEE). In this paper, we propose a precise definition of TEE and analyze its core properties. Furthermore, we discuss important concepts related to TEE, such as trust and formal verification. We give a short survey on the existing academic and industrial ARM TrustZone-based TEE, and compare them using our proposed definition. Finally, we discuss some known attacks on deployed TEE as well as its wide use to guarantee security in diverse applications.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121095862","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}
Pub Date : 2015-08-20DOI: 10.1109/Trustcom.2015.501
Vikramajeet Khatri, J. Abendroth
The growing trend of data traffic in mobile networks brings new security threats such as malwares, botnets, premium SMS frauds etc, and these threats affect the network resources in terms of revenue as well as performance. Some end user devices are using antivirus and anti-malware clients for protection against malware attacks, but the malicious activity affects mobile network elements as well. Therefore, a network based malware detection system, such as Mobile Guard, is essential in detecting malicious activities within a network, as well as protecting end users from malware attacks that are propagated through mobile operator's network. We present Mobile Guard -- a network based malware detection system and discuss its necessity, solution architecture and key features.
{"title":"Mobile Guard Demo: Network Based Malware Detection","authors":"Vikramajeet Khatri, J. Abendroth","doi":"10.1109/Trustcom.2015.501","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.501","url":null,"abstract":"The growing trend of data traffic in mobile networks brings new security threats such as malwares, botnets, premium SMS frauds etc, and these threats affect the network resources in terms of revenue as well as performance. Some end user devices are using antivirus and anti-malware clients for protection against malware attacks, but the malicious activity affects mobile network elements as well. Therefore, a network based malware detection system, such as Mobile Guard, is essential in detecting malicious activities within a network, as well as protecting end users from malware attacks that are propagated through mobile operator's network. We present Mobile Guard -- a network based malware detection system and discuss its necessity, solution architecture and key features.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127094213","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}
Pub Date : 2015-08-20DOI: 10.1109/Trustcom.2015.365
Xiaoming Zheng, Yan Wang, M. Orgun
Predicting the trust between a source participant and a target participant in a social network is important in many applications, e.g., assessing the recommendation from a target participant from the perspective of a source participant. In general, social networks contain participants, the links and trust relations between them and the contextual information for their interactions. All such information has important influence on trust prediction. However, predicting the trust between two participants based on the whole network is ineffective and inefficient. Thus, prior to trust prediction, it is necessary to extract a small-scale contextual network that contains most of the important participants as well as trust and contextual information. However, extracting such a sub-network has been proved to be an NP-Complete problem. To solve this challenging problem, we propose a social context-aware trust sub-network extraction model to search near-optimal solutions effectively and efficiently. In our proposed model, we first present the important factors that affect the trust between participants in OSNs. Then, we define a utility function to measure the trust factors of each node in a social network. At last, we design an ant colony algorithm with a newly designed mutation process for sub-network extraction. The experiments, conducted on two popular datasets of Epinions and Slashdot, demonstrate that our approach can extract those sub-networks covering important participants and contextual information while keeping a high density rate. Our approach is superior to the state-of-the-art approaches in terms of the quality of extracted sub-networks within the same execution time.
{"title":"Contextual Sub-network Extraction in Contextual Social Networks","authors":"Xiaoming Zheng, Yan Wang, M. Orgun","doi":"10.1109/Trustcom.2015.365","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.365","url":null,"abstract":"Predicting the trust between a source participant and a target participant in a social network is important in many applications, e.g., assessing the recommendation from a target participant from the perspective of a source participant. In general, social networks contain participants, the links and trust relations between them and the contextual information for their interactions. All such information has important influence on trust prediction. However, predicting the trust between two participants based on the whole network is ineffective and inefficient. Thus, prior to trust prediction, it is necessary to extract a small-scale contextual network that contains most of the important participants as well as trust and contextual information. However, extracting such a sub-network has been proved to be an NP-Complete problem. To solve this challenging problem, we propose a social context-aware trust sub-network extraction model to search near-optimal solutions effectively and efficiently. In our proposed model, we first present the important factors that affect the trust between participants in OSNs. Then, we define a utility function to measure the trust factors of each node in a social network. At last, we design an ant colony algorithm with a newly designed mutation process for sub-network extraction. The experiments, conducted on two popular datasets of Epinions and Slashdot, demonstrate that our approach can extract those sub-networks covering important participants and contextual information while keeping a high density rate. Our approach is superior to the state-of-the-art approaches in terms of the quality of extracted sub-networks within the same execution time.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127132322","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}
Pub Date : 2015-08-20DOI: 10.1109/Trustcom.2015.358
Mordechai Guri, Yuri Poliak, Bracha Shapira, Y. Elovici
Smartphones and tablets have become prime targets for malware, due to the valuable private and corporate information they hold. While Anti-Virus (AV) program may successfully detect malicious applications (apps), they remain ineffective against low-level rootkits that evade detection mechanisms by masking their own presence. Furthermore, any detection mechanism run on the same physical device as the monitored OS can be compromised via application, kernel or boot-loader vulnerabilities. Consequentially, trusted detection of kernel rootkits in mobile devices is a challenging task in practice. In this paper we present 'JoKER' - a system which aims at detecting rootkits in the Android kernel by utilizing the hardware's Joint Test Action Group (JTAG) interface for trusted memory forensics. Our framework consists of components that extract areas of a kernel's memory and reconstruct it for further analysis. We present the overall architecture along with its implementation, and demonstrate that the system can successfully detect the presence of stealthy rootkits in the kernel. The results show that although JTAG's main purpose is system testing, it can also be used for malware detection where traditional methods fail.
{"title":"JoKER: Trusted Detection of Kernel Rootkits in Android Devices via JTAG Interface","authors":"Mordechai Guri, Yuri Poliak, Bracha Shapira, Y. Elovici","doi":"10.1109/Trustcom.2015.358","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.358","url":null,"abstract":"Smartphones and tablets have become prime targets for malware, due to the valuable private and corporate information they hold. While Anti-Virus (AV) program may successfully detect malicious applications (apps), they remain ineffective against low-level rootkits that evade detection mechanisms by masking their own presence. Furthermore, any detection mechanism run on the same physical device as the monitored OS can be compromised via application, kernel or boot-loader vulnerabilities. Consequentially, trusted detection of kernel rootkits in mobile devices is a challenging task in practice. In this paper we present 'JoKER' - a system which aims at detecting rootkits in the Android kernel by utilizing the hardware's Joint Test Action Group (JTAG) interface for trusted memory forensics. Our framework consists of components that extract areas of a kernel's memory and reconstruct it for further analysis. We present the overall architecture along with its implementation, and demonstrate that the system can successfully detect the presence of stealthy rootkits in the kernel. The results show that although JTAG's main purpose is system testing, it can also be used for malware detection where traditional methods fail.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127250570","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}
Most of the existing trust evaluation methods of wireless sensor networks focus on communication behaviors in building paths without considering transmission behaviors in sensing environment. Therefore, a potential threat tothe network security exists in wireless sensor networks. Wepropose a dynamic trust evaluation method based on multi-factor including direct trust factor and indirect trust factor in this paper. Firstly, direct trust factor is composed of communication trust factor and transmission trust factor, both of which can be got from observing the interaction process. Secondly, indirect trust factorcomes from other nodes' recommendations, which are classified into certainand uncertain ones. Such two kinds of recommendation trust values are computed respectively. Finally, nodes' trustworthinessis measured by combining direct trust with indirect trust dynamically. Besides, both the involved classification standard and dynamic weight assignment are dependent on the interaction times between nodes, which are put forward under the background of Hoeffding's Inequality in Probability Theory. Experiments on NS-2 platform show that the proposed method is effective in increasing the network throughput and the network packet delivery ratio.
{"title":"Dynamic Trust Evaluation of Wireless Sensor Networks Based on Multi-factor","authors":"Jiaojiao Song, Xiaohong Li, Jing Hu, Guangquan Xu, Zhiyong Feng","doi":"10.1109/Trustcom.2015.354","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.354","url":null,"abstract":"Most of the existing trust evaluation methods of wireless sensor networks focus on communication behaviors in building paths without considering transmission behaviors in sensing environment. Therefore, a potential threat tothe network security exists in wireless sensor networks. Wepropose a dynamic trust evaluation method based on multi-factor including direct trust factor and indirect trust factor in this paper. Firstly, direct trust factor is composed of communication trust factor and transmission trust factor, both of which can be got from observing the interaction process. Secondly, indirect trust factorcomes from other nodes' recommendations, which are classified into certainand uncertain ones. Such two kinds of recommendation trust values are computed respectively. Finally, nodes' trustworthinessis measured by combining direct trust with indirect trust dynamically. Besides, both the involved classification standard and dynamic weight assignment are dependent on the interaction times between nodes, which are put forward under the background of Hoeffding's Inequality in Probability Theory. Experiments on NS-2 platform show that the proposed method is effective in increasing the network throughput and the network packet delivery ratio.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"3151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127471646","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}
Pub Date : 2015-08-20DOI: 10.1109/Trustcom.2015.530
Maryam Sepehri, S. Cimato, E. Damiani, C. Yeun
Outsourcing data on the cloud poses many challenges related to data owners and users privacy, specially when some data processing capabilities are delegated to the cloud infrastructure. In this paper we address the problem of executing privacy-preserving equality queries in a scenario where multiple data owners outsource their databases to an untrusted cloud service provider, accepting encrypted queries coming from authorized users. We propose a highly scalable proxy re-encryption scheme so that (i) the cloud service provider can return only the encrypted data that satisfies user's query without decrypting it, and (ii) the encrypted results can be decrypted using the user's key. We analyze the computation efficiency and the security of the scheme against proxy under the standard Diffie-Hellman assumption, reporting also some experimental results, which show encouraging speed up in comparison with previously proposed similar schemes.
{"title":"Data sharing on the cloud: A scalable proxy-based protocol for privacy-preserving queries","authors":"Maryam Sepehri, S. Cimato, E. Damiani, C. Yeun","doi":"10.1109/Trustcom.2015.530","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.530","url":null,"abstract":"Outsourcing data on the cloud poses many challenges related to data owners and users privacy, specially when some data processing capabilities are delegated to the cloud infrastructure. In this paper we address the problem of executing privacy-preserving equality queries in a scenario where multiple data owners outsource their databases to an untrusted cloud service provider, accepting encrypted queries coming from authorized users. We propose a highly scalable proxy re-encryption scheme so that (i) the cloud service provider can return only the encrypted data that satisfies user's query without decrypting it, and (ii) the encrypted results can be decrypted using the user's key. We analyze the computation efficiency and the security of the scheme against proxy under the standard Diffie-Hellman assumption, reporting also some experimental results, which show encouraging speed up in comparison with previously proposed similar schemes.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124817560","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}
Pub Date : 2015-08-20DOI: 10.1109/Trustcom.2015.532
Shunan Ma
Access control refers to the whole suite of mechanisms that are used to govern user access to resources provided by computer systems over networks. Although many access control models have been proposed, such as DAC, MAC and RBAC, the functionality of these access control models is to make authorization decisions based on established access control policies. When the malicious access is identified, the access control system denies the request. However, the malicious entities may keep issuing more malicious access requests not afraid of punishment from the access control system. Such access control models are not adequate in open networks where the identities of entities may not be known. In this paper, we first apply some principles in game theory to analyze current access control models. With respect to behavior of entities, access control can be treated as a game between the requester and the provider entities. Then we propose a dynamic game access control model based on trust, which can respond to malicious access. The proposed model should follow the principles of bringing interactive entities to a state of Nash Equilibrium to make access control more effective. In the proposed model, we use access behavior trigger strategy along with a constraint mechanism that provides incentives for entities to perform honest access.
{"title":"Dynamic Game Access Control Based on Trust","authors":"Shunan Ma","doi":"10.1109/Trustcom.2015.532","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.532","url":null,"abstract":"Access control refers to the whole suite of mechanisms that are used to govern user access to resources provided by computer systems over networks. Although many access control models have been proposed, such as DAC, MAC and RBAC, the functionality of these access control models is to make authorization decisions based on established access control policies. When the malicious access is identified, the access control system denies the request. However, the malicious entities may keep issuing more malicious access requests not afraid of punishment from the access control system. Such access control models are not adequate in open networks where the identities of entities may not be known. In this paper, we first apply some principles in game theory to analyze current access control models. With respect to behavior of entities, access control can be treated as a game between the requester and the provider entities. Then we propose a dynamic game access control model based on trust, which can respond to malicious access. The proposed model should follow the principles of bringing interactive entities to a state of Nash Equilibrium to make access control more effective. In the proposed model, we use access behavior trigger strategy along with a constraint mechanism that provides incentives for entities to perform honest access.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126099380","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}
Pub Date : 2015-08-20DOI: 10.1109/Trustcom.2015.642
Chen-Wei Yang, Kashif Gulzar, S. Sierla, V. Vyatkin
The investment to DERs (Distributed Energy Resources) in the emerging smart energy grids are critical to achieving goals for environmental protection, reducing energy costs and coping with failures. An architecture and market mechanism is needed to support the participation of owners of DERs that aim to maximize the profit from this investment within a system that is also able to achieve grid level objectives. Due to privacy requirements, owners of DERs should not be requested to divulge information such as the state of charge of a local energy store, and yet such information is very relevant for operating the grid in such a way that meets the objectives of the owner of the grid, who may operate a large power plant that is ultimately responsible for satisfying the load that cannot be covered by DERs. This paper builds on previous work to propose a modular multi-agent architecture in which prosumer agents represent DER owners and an auctioneer agent represents the power plant operator. The architecture allows the different agents to use different algorithms aiming at satisfying local and grid level objectives while meeting the privacy requirement. In particular, a fuzzy logic based algorithm is developed for the distributed automation platform that supports the architecture. The capability of the architecture to flexibly evaluate the performance of various algorithms from the DER owner and plant operator perspective is demonstrated with a case study in the district heating domain.
{"title":"Fuzzy Logic Based Prosumer Agent in a Modular Smart Grid Prosumer Architecture","authors":"Chen-Wei Yang, Kashif Gulzar, S. Sierla, V. Vyatkin","doi":"10.1109/Trustcom.2015.642","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.642","url":null,"abstract":"The investment to DERs (Distributed Energy Resources) in the emerging smart energy grids are critical to achieving goals for environmental protection, reducing energy costs and coping with failures. An architecture and market mechanism is needed to support the participation of owners of DERs that aim to maximize the profit from this investment within a system that is also able to achieve grid level objectives. Due to privacy requirements, owners of DERs should not be requested to divulge information such as the state of charge of a local energy store, and yet such information is very relevant for operating the grid in such a way that meets the objectives of the owner of the grid, who may operate a large power plant that is ultimately responsible for satisfying the load that cannot be covered by DERs. This paper builds on previous work to propose a modular multi-agent architecture in which prosumer agents represent DER owners and an auctioneer agent represents the power plant operator. The architecture allows the different agents to use different algorithms aiming at satisfying local and grid level objectives while meeting the privacy requirement. In particular, a fuzzy logic based algorithm is developed for the distributed automation platform that supports the architecture. The capability of the architecture to flexibly evaluate the performance of various algorithms from the DER owner and plant operator perspective is demonstrated with a case study in the district heating domain.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116024729","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}
Pub Date : 2015-08-20DOI: 10.1109/Trustcom.2015.379
Jing Long, Dafang Zhang, W. Liang, Wenwei Li
Intellectual Property (IP) is difficult to identify when the watermarks are impaired in previous work. To address this issue, we propose a fault-tolerant watermarking scheme for FPGA IP design. The scheme employs Blakley threshold method for signature sharing. The watermarks are then encoded with Reed-Solomon (RS) coding and finally embedded into unused LUTs of used slice. The signature sharing makes it unnecessary to extract all embedded watermarks in authentication. The complete signature can be retrieved with several watermarks even if other watermarks are damaged. The experiments show that the fault-tolerant scheme incurs no extra resource and timing overhead and has good robustness against removal attacks.
{"title":"A Fault-Tolerant Watermarking Algorithm for FPGA IP Protection","authors":"Jing Long, Dafang Zhang, W. Liang, Wenwei Li","doi":"10.1109/Trustcom.2015.379","DOIUrl":"https://doi.org/10.1109/Trustcom.2015.379","url":null,"abstract":"Intellectual Property (IP) is difficult to identify when the watermarks are impaired in previous work. To address this issue, we propose a fault-tolerant watermarking scheme for FPGA IP design. The scheme employs Blakley threshold method for signature sharing. The watermarks are then encoded with Reed-Solomon (RS) coding and finally embedded into unused LUTs of used slice. The signature sharing makes it unnecessary to extract all embedded watermarks in authentication. The complete signature can be retrieved with several watermarks even if other watermarks are damaged. The experiments show that the fault-tolerant scheme incurs no extra resource and timing overhead and has good robustness against removal attacks.","PeriodicalId":277092,"journal":{"name":"2015 IEEE Trustcom/BigDataSE/ISPA","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122289927","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：