Users on the Internet usually require venues to provide better purchasing recommendations.This can be provided by a reputation system that processes ratings to provide recommendations.The rating aggregation process is...Users on the Internet usually require venues to provide better purchasing recommendations.This can be provided by a reputation system that processes ratings to provide recommendations.The rating aggregation process is a main part of reputation systems to produce global opinions about the product quality.Naive methods that are frequently used do not consider consumer profiles in their calculations and cannot discover unfair ratings and trends emerging in new ratings.Other sophisticated rating aggregation methods that use a weighted average technique focus on one or a few aspects of consumers′profile data.This paper proposes a new reputation system using machine learning to predict reliability of consumers from their profile.In particular,we construct a new consumer profile dataset by extracting a set of factors that have a great impact on consumer reliability,which serve as an input to machine learning algorithms.The predicted weight is then integrated with a weighted average method to compute product reputation score.The proposed model has been evaluated over three Movie Lens benchmarking datasets,using 10-folds cross validation.Furthermore,the performance of the proposed model has been compared to previous published rating aggregation models.The obtained results were promising which suggest that the proposed approach could be a potential solution for reputation systems.The results of the comparison demonstrated the accuracy of our models.Finally,the proposed approach can be integrated with online recommendation systems to provide better purchasing recommendations and facilitate user experience on online shopping markets.展开更多
A reputation mechanism is introduced in P2P- based Semantic Web to solve the problem of lacking trust. It enables Semantic Web to utilize reputation information based on semantic similarity of peers in the network. Th...A reputation mechanism is introduced in P2P- based Semantic Web to solve the problem of lacking trust. It enables Semantic Web to utilize reputation information based on semantic similarity of peers in the network. This approach is evaluated in a simulation of a content sharing system and the experiments show that the system with reputation mechanism outperforms the system without it.展开更多
A fully distributed exchange-based anonymity P2P reputation system--EARep was proposed. EARep can provide all the peer＇s anonymity in a fully distributed structured manner. In EARep, each peer＇s anonymity is achieve...A fully distributed exchange-based anonymity P2P reputation system--EARep was proposed. EARep can provide all the peer＇s anonymity in a fully distributed structured manner. In EARep, each peer＇s anonymity is achieved by changing pseudonyms. Analysis and simulation results showed that compared with DARep, which is an existing representative scheme, our system has two main features. First, EARep increased anonymity degree （measured by linkage probability） and was much more scalable than DARep. Specifically, with the same message overhead, EARep reduced the linkage probability by more than 50% compared with DARep. Alternatively, to achieve the same anonymity degree, the message overhead in EARep was less than 25% of that in DARep. Second, the service selection success , tio of EARep was greater than 90% even when the percentage of malicious peers was up to 70%, which makes our system robust to malicious behaviors of peers.展开更多
In peer-to-peer (P2P) reputation systems,each peer's trustworthiness is evaluated based on its pseudonym's rating values given by other peers. Since it is assumed that each peer has a long lived pseudonym,all ...In peer-to-peer (P2P) reputation systems,each peer's trustworthiness is evaluated based on its pseudonym's rating values given by other peers. Since it is assumed that each peer has a long lived pseudonym,all the transactions conducted by the same peer may be linked by its pseudonym. Therefore,one of the fundamental challenges in P2P reputation systems is to protect peers' identity privacy. In this paper,we present two independent anonymity protocols to achieve all the peers' anonymity by changing pseudonym with the help of a trusted third party (TTP) server. Compared with RuP (Reputation using Pseudonym),an existing representative scheme,our protocols reduce the server's cost in two different ways. First,we propose a protocol using blind signature scheme as in RuP. The protocol improves the blind signature scheme and assessment of macro-node values,and reduces the server's cost by half in terms of encryption and decryption operations and message overhead. Second,we propose another protocol,group-confusion protocol,to further reduce the server's cost.展开更多
In this paper,a formal system is proposed based on beta reputation for the development of trustworthy wireless sensor networks(FRS-TWSN).Following this approach,key concepts related to reputation are formal described ...In this paper,a formal system is proposed based on beta reputation for the development of trustworthy wireless sensor networks(FRS-TWSN).Following this approach,key concepts related to reputation are formal described step by step for wireless sensor networks where sensor nodes maintain reputation for other sensors and use it to evaluate their trustworthiness.By proving some properties of beta reputation system,the beta distribution is founded to fit well to describe reputation system.Also,a case system is developed within this framework for reputation representation,updates and integration.Simulation results show this scheme not only can keep stable reputation but also can prevent the system from some attacks as bad mouthing and reputation cheating.展开更多
Online social networks （OSNs） have revolutionarily changed the way people connect with each other. One of the main factors that help achieve this success is reputation systems that enable OSN users to mutually estab...Online social networks （OSNs） have revolutionarily changed the way people connect with each other. One of the main factors that help achieve this success is reputation systems that enable OSN users to mutually establish trust relationships based on their past experience. Current approaches for the reputation management cannot achieve the fine granularity and verifiability for each individual user, in the sense that the reputation values on such OSNs are coarse and lack of credibility. In this paper, we propose a fine granularity attribute-based reputation system which enables users to rate each other＇s attributes instead of identities. Our scheme first verifies each OSN user＇s attributes, and further allows OSN users to vote on the posted attribute-associated messages to derive the reputation value. The attribute verification process provides the authenticity of the reputation value without revealing the actual value to entities who do not have the vote privilege. To predict a stranger＇s behavior, we propose a reputation retrieval protocol for querying the reputation value on a specific attribute. To the best of our knowledge, we are the first to define a fine-grained reputation value based on users＇ verified attributes in OSNs with privacy preservation. We provide the security analysis along with the simulation results to verify the privacy preservation and feasibility. The implementation of the proposed scheme on current OSNs is also discussed.展开更多
Currently,data security and privacy protection are becoming more and more important.Access control is a method of authorization for users through predefined policies.Token-based access control(TBAC)enhances the manage...Currently,data security and privacy protection are becoming more and more important.Access control is a method of authorization for users through predefined policies.Token-based access control(TBAC)enhances the manageability of authorization through the token.However,traditional access control policies lack the ability to dynamically adjust based on user access behavior.Incorporating user reputation evaluation into access control can provide valuable feedback to enhance system security and flexibility.As a result,this paper proposes a blockchain-empowered TBAC system and introduces a user reputation evaluation module to provide feedback on access control.The TBAC system divides the access control process into three stages:policy upload,token request,and resource request.The user reputation evaluation module evaluates the user’s token reputation and resource reputation for the token request and resource request stages of the TBAC system.The proposed system is implemented using the Hyperledger Fabric blockchain.The TBAC system is evaluated to prove that it has high processing performance.The user reputation evaluation model is proved to be more conservative and sensitive by comparative study with other methods.In addition,the security analysis shows that the TBAC system has a certain anti-attack ability and can maintain stable operation under the Distributed Denial of Service(DDoS)attack environment.展开更多
Internet of Everything(IoE)has emerged as a promising paradigm for the purpose of connecting and exchanging data among physical objects and humans over the Internet,and it can be widely applied in the fields of indust...Internet of Everything(IoE)has emerged as a promising paradigm for the purpose of connecting and exchanging data among physical objects and humans over the Internet,and it can be widely applied in the fields of industry,transportation,commerce,and education.Recently,the emergence of 6G-enabled cybertwin network architecture provides the technical and theoretical foundation for the realization of IoE paradigm.However,the IoE has three open issues in the 6G-enabled cybertwin architecture,i.e.,data authenticity,data storage and node reliability.To address these issues,we propose a blockchain-based decentralized reputation management system(BC-DRMS)for IoE in 6G-enabled Cybertwin architecture.In the proposed BC-DRMS,the traffic data collected from end nodes is stored on the blockchain and the decentralized file system,i.e.,InterPlanetary File System(IPFS),to resist data tampering,and then the data is further processed by the edge clouds and core clouds to provide services to users.Also,a multi-level reputation evaluation scheme is designed to compute the reputation scores of IoE nodes to prevent malicious node attacks.The experiment results and analysis demonstrate that,compared to the traditional centralized reputation management systems(CRMS),the proposed BC-DRMS cannot only address the issues of data authenticity and storage,but also provides high reliability for IoE in 6G-enabled cybertwin architecture.展开更多
A reputation evaluation method based on multi-dimensional information representation and correlative algorithm is proposed for open multi-agent systems. First, a vector model is estab- lished to represent the reputati...A reputation evaluation method based on multi-dimensional information representation and correlative algorithm is proposed for open multi-agent systems. First, a vector model is estab- lished to represent the reputation related information. Second, a vector based reputation model ＂TRUST＂ is put forward to evaluate the reputation of agents. Finally, a correlative algorithm for se- lecting the most appropriate service provider is proposed. Simulation results indicate that the method can quickly and accurately to achieve the aim of adaptive immunity to reputation fraud and improving the average gain that service consumer agents obtained.展开更多
Reputation mechanisms are a key technique to trust assessment in large-scale decentralized systems. The effectiveness of reputation-based trust management fundamentally relies on the assumption that an entity＇s futur...Reputation mechanisms are a key technique to trust assessment in large-scale decentralized systems. The effectiveness of reputation-based trust management fundamentally relies on the assumption that an entity＇s future behavior may be predicted based on its past behavior. Though many reputation-based trust schemes have been proposed, they can often be easily manipulated and exploited, since an attacker may adapt its behavior, and make the above assumption invalid. In other words, existing trust schemes are in general only effective when applied to honest players who usually act with certain consistency instead of adversaries who can behave arbitrarily. In this paper, we investigate the modeling of honest entities in decentralized systems. We build a statistical model for the transaction histories of honest players. This statistical model serves as a profiling tool to identify suspicious entities. It is combined with existing trust schemes to ensure that they are applied to entities whose transaction records are consistent with the statistical model. This approach limits the manipulation capability of adversaries, and thus can significantly improve the quality of reputation-based trust assessment.展开更多
In this paper, a new system design for load services in computer networks with a new reputation system is constructed. The use of the reputation system is to address the free-rider problem. Database systems are used b...In this paper, a new system design for load services in computer networks with a new reputation system is constructed. The use of the reputation system is to address the free-rider problem. Database systems are used by directory agents to save information provided by load-server agents. Protocols are built for how a host finds available servers for load service or load transfer, especially when a host moves to a new region. Detailed procedures include how a directory agent builds its database, how a load-server agent provides services, and how a load-client agent receives its desired services. The system uses the fuzzy logic control method to transfer loads for load balancing, instead of the method of a fixed threshold level. For an ad-hoc (wireless) computer network framework, this new system structure is aimed to provide efficient ways for hosts to communicate with one another and to access resources in the system. This will also help the users of networks locate resources in a most effective and secure manner.展开更多
Blockchain-based user-centric access network(UCAN)fails in dynamic access point(AP)management,as it lacks an incentive mechanism to promote virtuous behavior.Furthermore,the low throughput of the blockchain has been a...Blockchain-based user-centric access network(UCAN)fails in dynamic access point(AP)management,as it lacks an incentive mechanism to promote virtuous behavior.Furthermore,the low throughput of the blockchain has been a bottleneck to the widespread adoption of UCAN in 6G.In this paper,we propose Overlap Shard,a blockchain framework based on a novel reputation voting(RV)scheme,to dynamically manage the APs in UCAN.AP nodes in UCAN are distributed across multiple shards based on the RV scheme.That is,nodes with good reputation(virtuous behavior)are likely to be selected in the overlap shard.The RV mechanism ensures the security of UCAN because most APs adopt virtuous behaviors.Furthermore,to improve the efficiency of the Overlap Shard,we reduce cross-shard transactions by introducing core nodes.Specifically,a few nodes are overlapped in different shards,which can directly process the transactions in two shards instead of crossshard transactions.This greatly increases the speed of transactions between shards and thus the throughput of the overlap shard.The experiments show that the throughput of the overlap shard is about 2.5 times that of the non-sharded blockchain.展开更多
With the development of vehicle networks and the construction of roadside units,Vehicular Ad Hoc Networks(VANETs)are increasingly promoting cooperative computing patterns among vehicles.Vehicular edge computing(VEC)of...With the development of vehicle networks and the construction of roadside units,Vehicular Ad Hoc Networks(VANETs)are increasingly promoting cooperative computing patterns among vehicles.Vehicular edge computing(VEC)offers an effective solution to mitigate resource constraints by enabling task offloading to edge cloud infrastructure,thereby reducing the computational burden on connected vehicles.However,this sharing-based and distributed computing paradigm necessitates ensuring the credibility and reliability of various computation nodes.Existing vehicular edge computing platforms have not adequately considered themisbehavior of vehicles.We propose a practical task offloading algorithm based on reputation assessment to address the task offloading problem in vehicular edge computing under an unreliable environment.This approach integrates deep reinforcement learning and reputation management to address task offloading challenges.Simulation experiments conducted using Veins demonstrate the feasibility and effectiveness of the proposed method.展开更多
Aim To study the implicit restriction mechanism for hidden action in multi stage dynamic game. Methods A reputation model for restriction on repeated principal agent relationship was established by using the theor...Aim To study the implicit restriction mechanism for hidden action in multi stage dynamic game. Methods A reputation model for restriction on repeated principal agent relationship was established by using the theory on principal agent problem in information economics and the method of game theory to study the implicit restriction mechanism for hidden action. Results and Conclusion It is proved that there exists implicit restriction mechanism for the multi stage principal agent relationship, some conditions for effective restriction are derived, the design methods of implicit restriction mechanism are presented.展开更多
Enhancing the security of Wireless Sensor Networks(WSNs)improves the usability of their applications.Therefore,finding solutions to various attacks,such as the blackhole attack,is crucial for the success of WSN applic...Enhancing the security of Wireless Sensor Networks(WSNs)improves the usability of their applications.Therefore,finding solutions to various attacks,such as the blackhole attack,is crucial for the success of WSN applications.This paper proposes an enhanced version of the AODV(Ad Hoc On-Demand Distance Vector)protocol capable of detecting blackholes and malfunctioning benign nodes in WSNs,thereby avoiding them when delivering packets.The proposed version employs a network-based reputation system to select the best and most secure path to a destination.To achieve this goal,the proposed version utilizes the Watchdogs/Pathrater mechanisms in AODV to gather and broadcast reputations to all network nodes to build the network-based reputation system.To minimize the network overhead of the proposed approach,the paper uses reputation aggregator nodes only for forwarding reputation tables.Moreover,to reduce the overhead of updating reputation tables,the paper proposes three mechanisms,which are the prompt broadcast,the regular broadcast,and the light broadcast approaches.The proposed enhanced version has been designed to perform effectively in dynamic environments such as mobile WSNs where nodes,including blackholes,move continuously,which is considered a challenge for other protocols.Using the proposed enhanced protocol,a node evaluates the security of different routes to a destination and can select the most secure routing path.The paper provides an algorithm that explains the proposed protocol in detail and demonstrates a case study that shows the operations of calculating and updating reputation values when nodes move across different zones.Furthermore,the paper discusses the proposed approach’s overhead analysis to prove the proposed enhancement’s correctness and applicability.展开更多
Wireless Mesh Networks （WMNs） are vulnerable to various security threats because of their special infrastructure and communication mode, wherein insider attacks are the most challenging issue. To address this proble...Wireless Mesh Networks （WMNs） are vulnerable to various security threats because of their special infrastructure and communication mode, wherein insider attacks are the most challenging issue. To address this problem and protect innocent users from malicious attacks, it is important to encourage cooperation and deter malicious behaviors. Reputation systems constitute a major category of techniques used for managing trust in distributed networks, and they are effective in characterizing and quantifying a node＇s behavior for WMNs. However, conventional layered reputation mechanisms ignore several key factors of reputation in other layers; therefore, they cannot provide optimal performance and accurate malicious node identification and isolation for WMNs. In this paper, we propose a novel dynamic reputation mechanism, SLCRM, which couples reputation systems with a cross-layer design and node-security-rating classification techniques to dynamically detect and restrict insider attacks. Simulation results show that in terms of network throughput, packet delivery ratio, malicious nodes＇ identification, and success rates, SI_CRM imple- ments security protection against insider attacks in a more dynamic, effective, and efficient manner than the subjective logic and uncertainty-based reputation model and the familiarity-based reputation model.展开更多
Volunteered geographic information(VGI)has entered a phase where there are both a substantial amount of crowdsourced information available and a big interest in using it by organizations.But the issue of deciding the ...Volunteered geographic information(VGI)has entered a phase where there are both a substantial amount of crowdsourced information available and a big interest in using it by organizations.But the issue of deciding the quality of VGI without resorting to a comparison with authoritative data remains an open challenge.This article first formulates the problem of quality assessment of VGI data.Then presents a model to measure trustworthiness of information and reputation of contributors by analyzing geometric,qualitative,and semantic aspects of edits over time.An implementation of the model is running on a small data-set for a preliminary empirical validation.The results indicate that the computed trustworthiness provides a valid approximation of VGI quality.展开更多
Cooperative spectrum sensing in cog- nitive radio is investigated to improve the det- ection performance of Primary User （PU）. Meanwhile, cluster-based hierarchical coop- eration is introduced for reducing the overh...Cooperative spectrum sensing in cog- nitive radio is investigated to improve the det- ection performance of Primary User （PU）. Meanwhile, cluster-based hierarchical coop- eration is introduced for reducing the overhead as well as maintaining a certain level of sens- ing performance. However, in existing hierar- chically cooperative spectrum sensing algo- rithms, the robustness problem of the system is seldom considered. In this paper, we pro- pose a reputation-based hierarchically coop- erative spectrum sensing scheme in Cognitive Radio Networks （CRNs）. Before spectrum sensing, clusters are grouped based on the location correlation coefficients of Secondary Users （SUs）. In the proposed scheme, there are two levels of cooperation, the first one is performed within a cluster and the second one is carried out among clusters. With the reputa- tion mechanism and modified MAJORITY rule in the second level cooperation, the pro- posed scheme can not only relieve the influ- ence of the shadowing, but also eliminate the impact of the PU emulation attack on a rela- tively large scale. Simulation results show that, in the scenarios with deep-shadowing or mul- tiple attacked SUs, our proposed scheme ach- ieves a better tradeoff between the system robustness and the energy saving compared with those conventionally cooperative sensing schemes.展开更多
In recent years,Blockchain is gaining prominence as a hot topic in academic research.However,the consensus mechanism of blockchain has been criticized in terms of energy consumption and performance.Although Proof-of-A...In recent years,Blockchain is gaining prominence as a hot topic in academic research.However,the consensus mechanism of blockchain has been criticized in terms of energy consumption and performance.Although Proof-of-Authority(PoA)consensus mechanism,as a lightweight consensus mechanism,is more efficient than traditional Proof-of-Work(PoW)and Proof-of-Stake(PoS),it suffers from the problem of centralization.To this end,on account of analyzing the shortcomings of existing consensus mechanisms,this paper proposes a dynamic reputation-based consensus mechanism for blockchain.This scheme allows nodes with reputation value higher than a threshold apply to become a monitoring node,which can monitor the behavior of validators in case that validators with excessive power cause harm to the blockchain network.At the same time,the reputation evaluation algorithm is also introduced to select nodes with high reputation to become validators in the network,thus increasing the cost of malicious behavior.In each consensus cycle,validators and monitoring nodes are dynamically updated according to the reputation value.Through security analysis,it is demonstrated that the scheme can resist the attacks of malicious nodes in the blockchain network.By simulation experiments and analysis of the scheme,the result verifies that the mechanism can effectively improve the fault tolerance of the consensus mechanism,reduce the time of consensus to guarantee the security of the system.展开更多
文摘Users on the Internet usually require venues to provide better purchasing recommendations.This can be provided by a reputation system that processes ratings to provide recommendations.The rating aggregation process is a main part of reputation systems to produce global opinions about the product quality.Naive methods that are frequently used do not consider consumer profiles in their calculations and cannot discover unfair ratings and trends emerging in new ratings.Other sophisticated rating aggregation methods that use a weighted average technique focus on one or a few aspects of consumers′profile data.This paper proposes a new reputation system using machine learning to predict reliability of consumers from their profile.In particular,we construct a new consumer profile dataset by extracting a set of factors that have a great impact on consumer reliability,which serve as an input to machine learning algorithms.The predicted weight is then integrated with a weighted average method to compute product reputation score.The proposed model has been evaluated over three Movie Lens benchmarking datasets,using 10-folds cross validation.Furthermore,the performance of the proposed model has been compared to previous published rating aggregation models.The obtained results were promising which suggest that the proposed approach could be a potential solution for reputation systems.The results of the comparison demonstrated the accuracy of our models.Finally,the proposed approach can be integrated with online recommendation systems to provide better purchasing recommendations and facilitate user experience on online shopping markets.
基金Supported by the National Natural Science Foun-dation of China (60173026) the Ministry of Education Key Project(105071) Foundation of E-Institute of Shanghai HighInstitutions(200301)
文摘A reputation mechanism is introduced in P2P- based Semantic Web to solve the problem of lacking trust. It enables Semantic Web to utilize reputation information based on semantic similarity of peers in the network. This approach is evaluated in a simulation of a content sharing system and the experiments show that the system with reputation mechanism outperforms the system without it.
基金Supported by the National Natural Science Foundation of China (60773008)
文摘A fully distributed exchange-based anonymity P2P reputation system--EARep was proposed. EARep can provide all the peer＇s anonymity in a fully distributed structured manner. In EARep, each peer＇s anonymity is achieved by changing pseudonyms. Analysis and simulation results showed that compared with DARep, which is an existing representative scheme, our system has two main features. First, EARep increased anonymity degree （measured by linkage probability） and was much more scalable than DARep. Specifically, with the same message overhead, EARep reduced the linkage probability by more than 50% compared with DARep. Alternatively, to achieve the same anonymity degree, the message overhead in EARep was less than 25% of that in DARep. Second, the service selection success , tio of EARep was greater than 90% even when the percentage of malicious peers was up to 70%, which makes our system robust to malicious behaviors of peers.
基金the National High Technology Research and Development Program (863) of China(No. 07QA14033)the National Natural Science Foundation of China(No.60702047)
文摘In peer-to-peer (P2P) reputation systems,each peer's trustworthiness is evaluated based on its pseudonym's rating values given by other peers. Since it is assumed that each peer has a long lived pseudonym,all the transactions conducted by the same peer may be linked by its pseudonym. Therefore,one of the fundamental challenges in P2P reputation systems is to protect peers' identity privacy. In this paper,we present two independent anonymity protocols to achieve all the peers' anonymity by changing pseudonym with the help of a trusted third party (TTP) server. Compared with RuP (Reputation using Pseudonym),an existing representative scheme,our protocols reduce the server's cost in two different ways. First,we propose a protocol using blind signature scheme as in RuP. The protocol improves the blind signature scheme and assessment of macro-node values,and reduces the server's cost by half in terms of encryption and decryption operations and message overhead. Second,we propose another protocol,group-confusion protocol,to further reduce the server's cost.
基金the National Natural Science Foundation of China(60573043)the Natural Science Foundation of Guangdong Province(06025838)
文摘In this paper,a formal system is proposed based on beta reputation for the development of trustworthy wireless sensor networks(FRS-TWSN).Following this approach,key concepts related to reputation are formal described step by step for wireless sensor networks where sensor nodes maintain reputation for other sensors and use it to evaluate their trustworthiness.By proving some properties of beta reputation system,the beta distribution is founded to fit well to describe reputation system.Also,a case system is developed within this framework for reputation representation,updates and integration.Simulation results show this scheme not only can keep stable reputation but also can prevent the system from some attacks as bad mouthing and reputation cheating.
基金This work was partially supported by the National Science Foundation of USA under Grant No. CNS-1423165. The work of Chi was supported in part by the National Natural Science Foundation of China （NSFC） under Grant Nos. 61202140 and 61328208, the Program for New Century Excellent Talents in University of China under Grant No. NCET-13-0548, and the Innovation Foundation of the Chinese Academy of Sciences under Grant No. CXJJ-14-S132. Lin＇s work was supported in part by MoE ATU Plan, the Taiwan Science and Technology Authority under Grant Nos. MOST 103-2622-E-009-012, MOST 103-2221-E-002-152-MY3, MOST 103-2221- E-002-249-MY3, MOST 104-2923-E-002-005-MY3, and MOST 103-2627-E-002-008, and the ICL/ITRI Project of Chunghwa Telecom.
文摘Online social networks （OSNs） have revolutionarily changed the way people connect with each other. One of the main factors that help achieve this success is reputation systems that enable OSN users to mutually establish trust relationships based on their past experience. Current approaches for the reputation management cannot achieve the fine granularity and verifiability for each individual user, in the sense that the reputation values on such OSNs are coarse and lack of credibility. In this paper, we propose a fine granularity attribute-based reputation system which enables users to rate each other＇s attributes instead of identities. Our scheme first verifies each OSN user＇s attributes, and further allows OSN users to vote on the posted attribute-associated messages to derive the reputation value. The attribute verification process provides the authenticity of the reputation value without revealing the actual value to entities who do not have the vote privilege. To predict a stranger＇s behavior, we propose a reputation retrieval protocol for querying the reputation value on a specific attribute. To the best of our knowledge, we are the first to define a fine-grained reputation value based on users＇ verified attributes in OSNs with privacy preservation. We provide the security analysis along with the simulation results to verify the privacy preservation and feasibility. The implementation of the proposed scheme on current OSNs is also discussed.
基金supported by NSFC under Grant No.62341102National Key R&D Program of China under Grant No.2018YFA0701604.
文摘Currently,data security and privacy protection are becoming more and more important.Access control is a method of authorization for users through predefined policies.Token-based access control(TBAC)enhances the manageability of authorization through the token.However,traditional access control policies lack the ability to dynamically adjust based on user access behavior.Incorporating user reputation evaluation into access control can provide valuable feedback to enhance system security and flexibility.As a result,this paper proposes a blockchain-empowered TBAC system and introduces a user reputation evaluation module to provide feedback on access control.The TBAC system divides the access control process into three stages:policy upload,token request,and resource request.The user reputation evaluation module evaluates the user’s token reputation and resource reputation for the token request and resource request stages of the TBAC system.The proposed system is implemented using the Hyperledger Fabric blockchain.The TBAC system is evaluated to prove that it has high processing performance.The user reputation evaluation model is proved to be more conservative and sensitive by comparative study with other methods.In addition,the security analysis shows that the TBAC system has a certain anti-attack ability and can maintain stable operation under the Distributed Denial of Service(DDoS)attack environment.
基金This work was supported in part by the National Natural Science Foundation of China under Grants 61972205,U1836208,U1836110in part by the National Key R&D Program of China under Grant 2018YFB1003205+2 种基金in part by MOST under Contract 108-2221-E-259-009-MY2 throSugh Pervasive Artificial Intelligence Research(PAIR)Labs(Taiwan)in part by the Priority Academic Program Development of Jiangsu Higher Education Institutions(PAPD)fundin part by the Collaborative Innovation Center of Atmospheric Environment and Equipment Technology(CICAEET)Fund(China).
文摘Internet of Everything(IoE)has emerged as a promising paradigm for the purpose of connecting and exchanging data among physical objects and humans over the Internet,and it can be widely applied in the fields of industry,transportation,commerce,and education.Recently,the emergence of 6G-enabled cybertwin network architecture provides the technical and theoretical foundation for the realization of IoE paradigm.However,the IoE has three open issues in the 6G-enabled cybertwin architecture,i.e.,data authenticity,data storage and node reliability.To address these issues,we propose a blockchain-based decentralized reputation management system(BC-DRMS)for IoE in 6G-enabled Cybertwin architecture.In the proposed BC-DRMS,the traffic data collected from end nodes is stored on the blockchain and the decentralized file system,i.e.,InterPlanetary File System(IPFS),to resist data tampering,and then the data is further processed by the edge clouds and core clouds to provide services to users.Also,a multi-level reputation evaluation scheme is designed to compute the reputation scores of IoE nodes to prevent malicious node attacks.The experiment results and analysis demonstrate that,compared to the traditional centralized reputation management systems(CRMS),the proposed BC-DRMS cannot only address the issues of data authenticity and storage,but also provides high reliability for IoE in 6G-enabled cybertwin architecture.
基金Supported by the National Natural Science Foundation of China(61101214)
文摘A reputation evaluation method based on multi-dimensional information representation and correlative algorithm is proposed for open multi-agent systems. First, a vector model is estab- lished to represent the reputation related information. Second, a vector based reputation model ＂TRUST＂ is put forward to evaluate the reputation of agents. Finally, a correlative algorithm for se- lecting the most appropriate service provider is proposed. Simulation results indicate that the method can quickly and accurately to achieve the aim of adaptive immunity to reputation fraud and improving the average gain that service consumer agents obtained.
基金supported by the National Science Foundation of USA under Grant Nos.IIS-0430166 and CNS-0747247
文摘Reputation mechanisms are a key technique to trust assessment in large-scale decentralized systems. The effectiveness of reputation-based trust management fundamentally relies on the assumption that an entity＇s future behavior may be predicted based on its past behavior. Though many reputation-based trust schemes have been proposed, they can often be easily manipulated and exploited, since an attacker may adapt its behavior, and make the above assumption invalid. In other words, existing trust schemes are in general only effective when applied to honest players who usually act with certain consistency instead of adversaries who can behave arbitrarily. In this paper, we investigate the modeling of honest entities in decentralized systems. We build a statistical model for the transaction histories of honest players. This statistical model serves as a profiling tool to identify suspicious entities. It is combined with existing trust schemes to ensure that they are applied to entities whose transaction records are consistent with the statistical model. This approach limits the manipulation capability of adversaries, and thus can significantly improve the quality of reputation-based trust assessment.
文摘In this paper, a new system design for load services in computer networks with a new reputation system is constructed. The use of the reputation system is to address the free-rider problem. Database systems are used by directory agents to save information provided by load-server agents. Protocols are built for how a host finds available servers for load service or load transfer, especially when a host moves to a new region. Detailed procedures include how a directory agent builds its database, how a load-server agent provides services, and how a load-client agent receives its desired services. The system uses the fuzzy logic control method to transfer loads for load balancing, instead of the method of a fixed threshold level. For an ad-hoc (wireless) computer network framework, this new system structure is aimed to provide efficient ways for hosts to communicate with one another and to access resources in the system. This will also help the users of networks locate resources in a most effective and secure manner.
基金supported by the National Natural Science Foundation of China(NSFC)under Grant 61931005.
文摘Blockchain-based user-centric access network(UCAN)fails in dynamic access point(AP)management,as it lacks an incentive mechanism to promote virtuous behavior.Furthermore,the low throughput of the blockchain has been a bottleneck to the widespread adoption of UCAN in 6G.In this paper,we propose Overlap Shard,a blockchain framework based on a novel reputation voting(RV)scheme,to dynamically manage the APs in UCAN.AP nodes in UCAN are distributed across multiple shards based on the RV scheme.That is,nodes with good reputation(virtuous behavior)are likely to be selected in the overlap shard.The RV mechanism ensures the security of UCAN because most APs adopt virtuous behaviors.Furthermore,to improve the efficiency of the Overlap Shard,we reduce cross-shard transactions by introducing core nodes.Specifically,a few nodes are overlapped in different shards,which can directly process the transactions in two shards instead of crossshard transactions.This greatly increases the speed of transactions between shards and thus the throughput of the overlap shard.The experiments show that the throughput of the overlap shard is about 2.5 times that of the non-sharded blockchain.
基金supported by the Open Foundation of Henan Key Laboratory of Cyberspace Situation Awareness(No.HNTS2022020)the Science and Technology Research Program of Henan Province of China(232102210134,182102210130)Key Research Projects of Henan Provincial Universities(25B520005).
文摘With the development of vehicle networks and the construction of roadside units,Vehicular Ad Hoc Networks(VANETs)are increasingly promoting cooperative computing patterns among vehicles.Vehicular edge computing(VEC)offers an effective solution to mitigate resource constraints by enabling task offloading to edge cloud infrastructure,thereby reducing the computational burden on connected vehicles.However,this sharing-based and distributed computing paradigm necessitates ensuring the credibility and reliability of various computation nodes.Existing vehicular edge computing platforms have not adequately considered themisbehavior of vehicles.We propose a practical task offloading algorithm based on reputation assessment to address the task offloading problem in vehicular edge computing under an unreliable environment.This approach integrates deep reinforcement learning and reputation management to address task offloading challenges.Simulation experiments conducted using Veins demonstrate the feasibility and effectiveness of the proposed method.
文摘Aim To study the implicit restriction mechanism for hidden action in multi stage dynamic game. Methods A reputation model for restriction on repeated principal agent relationship was established by using the theory on principal agent problem in information economics and the method of game theory to study the implicit restriction mechanism for hidden action. Results and Conclusion It is proved that there exists implicit restriction mechanism for the multi stage principal agent relationship, some conditions for effective restriction are derived, the design methods of implicit restriction mechanism are presented.
文摘Enhancing the security of Wireless Sensor Networks(WSNs)improves the usability of their applications.Therefore,finding solutions to various attacks,such as the blackhole attack,is crucial for the success of WSN applications.This paper proposes an enhanced version of the AODV(Ad Hoc On-Demand Distance Vector)protocol capable of detecting blackholes and malfunctioning benign nodes in WSNs,thereby avoiding them when delivering packets.The proposed version employs a network-based reputation system to select the best and most secure path to a destination.To achieve this goal,the proposed version utilizes the Watchdogs/Pathrater mechanisms in AODV to gather and broadcast reputations to all network nodes to build the network-based reputation system.To minimize the network overhead of the proposed approach,the paper uses reputation aggregator nodes only for forwarding reputation tables.Moreover,to reduce the overhead of updating reputation tables,the paper proposes three mechanisms,which are the prompt broadcast,the regular broadcast,and the light broadcast approaches.The proposed enhanced version has been designed to perform effectively in dynamic environments such as mobile WSNs where nodes,including blackholes,move continuously,which is considered a challenge for other protocols.Using the proposed enhanced protocol,a node evaluates the security of different routes to a destination and can select the most secure routing path.The paper provides an algorithm that explains the proposed protocol in detail and demonstrates a case study that shows the operations of calculating and updating reputation values when nodes move across different zones.Furthermore,the paper discusses the proposed approach’s overhead analysis to prove the proposed enhancement’s correctness and applicability.
基金supported by the Program for Changjiang Scholars and Innovative Research Team in University under Grant No.IRT1078the Key Program of NSFC-Guangdong Union Foundation under Grant No.U1135002+1 种基金Major National S&T Program under Grant No.2011ZX03005-002the Fundamental Research Funds for the Central Universities under Grant No.JY10000903001
文摘Wireless Mesh Networks （WMNs） are vulnerable to various security threats because of their special infrastructure and communication mode, wherein insider attacks are the most challenging issue. To address this problem and protect innocent users from malicious attacks, it is important to encourage cooperation and deter malicious behaviors. Reputation systems constitute a major category of techniques used for managing trust in distributed networks, and they are effective in characterizing and quantifying a node＇s behavior for WMNs. However, conventional layered reputation mechanisms ignore several key factors of reputation in other layers; therefore, they cannot provide optimal performance and accurate malicious node identification and isolation for WMNs. In this paper, we propose a novel dynamic reputation mechanism, SLCRM, which couples reputation systems with a cross-layer design and node-security-rating classification techniques to dynamically detect and restrict insider attacks. Simulation results show that in terms of network throughput, packet delivery ratio, malicious nodes＇ identification, and success rates, SI_CRM imple- ments security protection against insider attacks in a more dynamic, effective, and efficient manner than the subjective logic and uncertainty-based reputation model and the familiarity-based reputation model.
文摘Volunteered geographic information(VGI)has entered a phase where there are both a substantial amount of crowdsourced information available and a big interest in using it by organizations.But the issue of deciding the quality of VGI without resorting to a comparison with authoritative data remains an open challenge.This article first formulates the problem of quality assessment of VGI data.Then presents a model to measure trustworthiness of information and reputation of contributors by analyzing geometric,qualitative,and semantic aspects of edits over time.An implementation of the model is running on a small data-set for a preliminary empirical validation.The results indicate that the computed trustworthiness provides a valid approximation of VGI quality.
基金ACKNOWLEDGEMENT This work was partially supported by the Na- tional Natural Science Foundation of China under Grant No. 61071127 and the Science and Technology Department of Zhejiang Pro- vince under Grants No. 2012C01036-1, No. 2011R10035.
文摘Cooperative spectrum sensing in cog- nitive radio is investigated to improve the det- ection performance of Primary User （PU）. Meanwhile, cluster-based hierarchical coop- eration is introduced for reducing the overhead as well as maintaining a certain level of sens- ing performance. However, in existing hierar- chically cooperative spectrum sensing algo- rithms, the robustness problem of the system is seldom considered. In this paper, we pro- pose a reputation-based hierarchically coop- erative spectrum sensing scheme in Cognitive Radio Networks （CRNs）. Before spectrum sensing, clusters are grouped based on the location correlation coefficients of Secondary Users （SUs）. In the proposed scheme, there are two levels of cooperation, the first one is performed within a cluster and the second one is carried out among clusters. With the reputa- tion mechanism and modified MAJORITY rule in the second level cooperation, the pro- posed scheme can not only relieve the influ- ence of the shadowing, but also eliminate the impact of the PU emulation attack on a rela- tively large scale. Simulation results show that, in the scenarios with deep-shadowing or mul- tiple attacked SUs, our proposed scheme ach- ieves a better tradeoff between the system robustness and the energy saving compared with those conventionally cooperative sensing schemes.
基金This work is supported by the Key Research and Development Project of Sichuan Province(No.2021YFSY0012,No.2020YFG0307,No.2021YFG0332)the Key Research and Development Project of Chengdu(No.2019-YF05-02028-GX)+1 种基金the Innovation Team of Quantum Security Communication of Sichuan Province(No.17TD0009)the Academic and Technical Leaders Training Funding Support Projects of Sichuan Province(No.2016120080102643).
文摘In recent years,Blockchain is gaining prominence as a hot topic in academic research.However,the consensus mechanism of blockchain has been criticized in terms of energy consumption and performance.Although Proof-of-Authority(PoA)consensus mechanism,as a lightweight consensus mechanism,is more efficient than traditional Proof-of-Work(PoW)and Proof-of-Stake(PoS),it suffers from the problem of centralization.To this end,on account of analyzing the shortcomings of existing consensus mechanisms,this paper proposes a dynamic reputation-based consensus mechanism for blockchain.This scheme allows nodes with reputation value higher than a threshold apply to become a monitoring node,which can monitor the behavior of validators in case that validators with excessive power cause harm to the blockchain network.At the same time,the reputation evaluation algorithm is also introduced to select nodes with high reputation to become validators in the network,thus increasing the cost of malicious behavior.In each consensus cycle,validators and monitoring nodes are dynamically updated according to the reputation value.Through security analysis,it is demonstrated that the scheme can resist the attacks of malicious nodes in the blockchain network.By simulation experiments and analysis of the scheme,the result verifies that the mechanism can effectively improve the fault tolerance of the consensus mechanism,reduce the time of consensus to guarantee the security of the system.
