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.展开更多
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.展开更多
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.展开更多
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.展开更多
Crowdsourcing holds broad applications in information acquisition and dissemination,yet encounters challenges pertaining to data quality assessment and user reputation management.Reputation mechanisms stand as crucial...Crowdsourcing holds broad applications in information acquisition and dissemination,yet encounters challenges pertaining to data quality assessment and user reputation management.Reputation mechanisms stand as crucial solutions for appraising and updating participant reputation scores,thereby elevating the quality and dependability of crowdsourced data.However,these mechanisms face several challenges in traditional crowdsourcing systems:1)platform security lacks robust guarantees and may be susceptible to attacks;2)there exists a potential for large-scale privacy breaches;and 3)incentive mechanisms relying on reputation scores may encounter issues as reputation updates hinge on task demander evaluations,occasionally lacking a dedicated reputation update module.This paper introduces a reputation update scheme tailored for crowdsourcing,with a focus on proficiently overseeing participant reputations and alleviating the impact of malicious activities on the sensing system.Here,the reputation update scheme is determined by an Empirical Cumulative distribution-based Outlier Detection method(ECOD).Our scheme embraces a blockchain-based crowdsourcing framework utilizing a homomorphic encryption method to ensure data transparency and tamper-resistance.Computation of user reputation scores relies on their behavioral history,actively discouraging undesirable conduct.Additionally,we introduce a dynamic weight incentive mechanism that mirrors alterations in participant reputation,enabling the system to allocate incentives based on user behavior and reputation.Our scheme undergoes evaluation on 11 datasets,revealing substantial enhancements in data credibility for crowdsourcing systems and a reduction in the influence of malicious behavior.This research not only presents a practical solution for crowdsourcing reputation management but also offers valuable insights for future research and applications,holding promise for fostering more reliable and high-quality data collection in crowdsourcing across diverse domains.展开更多
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.展开更多
In permissioned blockchain networks,the Proof of Authority(PoA)consensus,which uses the election of authorized nodes to validate transactions and blocks,has beenwidely advocated thanks to its high transaction throughp...In permissioned blockchain networks,the Proof of Authority(PoA)consensus,which uses the election of authorized nodes to validate transactions and blocks,has beenwidely advocated thanks to its high transaction throughput and fault tolerance.However,PoA suffers from the drawback of centralization dominated by a limited number of authorized nodes and the lack of anonymity due to the round-robin block proposal mechanism.As a result,traditional PoA is vulnerable to a single point of failure that compromises the security of the blockchain network.To address these issues,we propose a novel decentralized reputation management mechanism for permissioned blockchain networks to enhance security,promote liveness,and mitigate centralization while retaining the same throughput as traditional PoA.This paper aims to design an off-chain reputation evaluation and an on-chain reputation-aided consensus.First,we evaluate the nodes’reputation in the context of the blockchain networks and make the reputation globally verifiable through smart contracts.Second,building upon traditional PoA,we propose a reputation-aided PoA(rPoA)consensus to enhance securitywithout sacrificing throughput.In particular,rPoA can incentivize nodes to autonomously form committees based on reputation authority,which prevents block generation from being tracked through the randomness of reputation variation.Moreover,we develop a reputation-aided fork-choice rule for rPoA to promote the network’s liveness.Finally,experimental results show that the proposed rPoA achieves higher security performance while retaining transaction throughput compared to traditional PoA.展开更多
In the lithium-ion battery(LIB)supply-chain,transactions involve several rounds of ordering,production and delivery between LIB suppliers and electric vehicle(EV)manufacturers.The sustainable performance of LIB suppli...In the lithium-ion battery(LIB)supply-chain,transactions involve several rounds of ordering,production and delivery between LIB suppliers and electric vehicle(EV)manufacturers.The sustainable performance of LIB suppliers,related to various characteristics,significantly affects the participants’sustainable reputations.The EV-LIB supply-chain transaction mechanism is explored from the perspective of the exchange economy comprehensively addressing both short-term economic profit and long-term sustainable reputation.Specifically,a“profit-reputation”utility function is proposed to reflect participants’expectations regarding cooperation profit and sustainable reputation.Additionally,an Edgeworth box model is developed to describe the participant’s balance determinations as a contract curve,revealing the Pareto conditions for mutually beneficial transactions based on sustainable performance.Furthermore,several principal-agent models are established to analyze the equilibrium of sustainable transactions within the EV-LIB supply-chain under varying dominance scenarios.A case study of an EV-LIB transaction is conducted to demonstrate the feasibility and effectiveness.This study aims to assist supply chain managers,researchers and decision-makers in exploring the role of participant’s sustainable reputation and its influence on supply-chain transaction and equilibrium,particularly in the context of designing cooperative contracts and negotiation process to foster sustainable supply chains.展开更多
This study analyses all A-share listed companies from 2015 to 2020 to empirically examine the impact of inquiry supervision on corporate value and the moderating influence of corporate social responsibility(CSR)on thi...This study analyses all A-share listed companies from 2015 to 2020 to empirically examine the impact of inquiry supervision on corporate value and the moderating influence of corporate social responsibility(CSR)on this relationship.Research has shown that inquiry supervision significantly reduces corporate value,and the corporate social responsibility previously performed by companies can weaken this negative impact.Furthermore,the heterogeneity test based on internal and external controls shows that the reputation protection effect of CSR is more significant for companies with a higher proportion of independent directors,companies with a higher proportion of institutional investors investing in stocks,regions with a higher degree of marketization,and regions with a higher level of rule of law.The research in this article validates the effectiveness of reputation protection and verifies that reputation protection,as an informal mechanism,is easier to fulfil a role in areas where formal mechanisms are perfect.In other words,formal and informal mechanisms appear to complement each other.These findings provide empirical insights into the governance of CSR.展开更多
Purpose:For a set of 1,561 Open Access(OA)and non-OA journals in business and economics,this study evaluates the relationships between four citation metrics-five-year Impact Factor(5IF),CiteScore,Article Influence(AI)...Purpose:For a set of 1,561 Open Access(OA)and non-OA journals in business and economics,this study evaluates the relationships between four citation metrics-five-year Impact Factor(5IF),CiteScore,Article Influence(AI)score,and SCImago Journal Rank(SJR)-and the journal ratings assigned by expert reviewers.We expect that the OA journals will have especially high citation impact relative to their perceived quality(reputation).Design/methodology/approach:Regression is used to estimate the ratings assigned by expert reviewers for the 2021 CABS(Chartered Association of Business Schools)journal assessment exercise.The independent variables are the four citation metrics,evaluated separately,and a dummy variable representing the OA/non-OA status of each journal.Findings:Regardless of the citation metric used,OA journals in business and economics have especially high citation impact relative to their perceived quality(reputation).That is,they have especially low perceived quality(reputation)relative to their citation impact.Research limitations:These results are specific to the CABS journal ratings and the four citation metrics.However,there is strong evidence that CABS is closely related to several other expert ratings,and that 5IF,CiteScore,AI,and SJR are representative of the other citation metrics that might have been chosen.Practical implications:There are at least two possible explanations for these results:(1)expert evaluators are biased against OA journals,and(2)OA journals have especially high citation impact due to their increased accessibility.Although this study does not allow us to determine which of these explanations are supported,the results suggest that authors should consider publishing in OA journals whenever overall readership and citation impact are more important than journal reputation within a particular field.Moreover,the OA coefficients provide a useful indicator of the extent to which anti-OA bias(or the citation advantage of OA journals)is diminishing over time.Originality/value:This is apparently the first study to investigate the impact of OA status on the relationships between expert journal ratings and journal citation metrics.展开更多
文摘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.
基金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.
文摘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.
基金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.
基金This work is supported by National Natural Science Foundation of China(Nos.U21A20463,62172117,61802383)Research Project of Pazhou Lab for Excellent Young Scholars(No.PZL2021KF0024)Guangzhou Basic and Applied Basic Research Foundation(Nos.202201010330,202201020162,202201020221).
文摘Crowdsourcing holds broad applications in information acquisition and dissemination,yet encounters challenges pertaining to data quality assessment and user reputation management.Reputation mechanisms stand as crucial solutions for appraising and updating participant reputation scores,thereby elevating the quality and dependability of crowdsourced data.However,these mechanisms face several challenges in traditional crowdsourcing systems:1)platform security lacks robust guarantees and may be susceptible to attacks;2)there exists a potential for large-scale privacy breaches;and 3)incentive mechanisms relying on reputation scores may encounter issues as reputation updates hinge on task demander evaluations,occasionally lacking a dedicated reputation update module.This paper introduces a reputation update scheme tailored for crowdsourcing,with a focus on proficiently overseeing participant reputations and alleviating the impact of malicious activities on the sensing system.Here,the reputation update scheme is determined by an Empirical Cumulative distribution-based Outlier Detection method(ECOD).Our scheme embraces a blockchain-based crowdsourcing framework utilizing a homomorphic encryption method to ensure data transparency and tamper-resistance.Computation of user reputation scores relies on their behavioral history,actively discouraging undesirable conduct.Additionally,we introduce a dynamic weight incentive mechanism that mirrors alterations in participant reputation,enabling the system to allocate incentives based on user behavior and reputation.Our scheme undergoes evaluation on 11 datasets,revealing substantial enhancements in data credibility for crowdsourcing systems and a reduction in the influence of malicious behavior.This research not only presents a practical solution for crowdsourcing reputation management but also offers valuable insights for future research and applications,holding promise for fostering more reliable and high-quality data collection in crowdsourcing across diverse domains.
基金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 Shenzhen Science and Technology Program under Grants KCXST20221021111404010,JSGG20220831103400002,JSGGKQTD20221101115655027,JCYJ 20210324094609027the National KeyR&DProgram of China under Grant 2021YFB2700900+1 种基金the National Natural Science Foundation of China under Grants 62371239,62376074,72301083the Jiangsu Specially-Appointed Professor Program 2021.
文摘In permissioned blockchain networks,the Proof of Authority(PoA)consensus,which uses the election of authorized nodes to validate transactions and blocks,has beenwidely advocated thanks to its high transaction throughput and fault tolerance.However,PoA suffers from the drawback of centralization dominated by a limited number of authorized nodes and the lack of anonymity due to the round-robin block proposal mechanism.As a result,traditional PoA is vulnerable to a single point of failure that compromises the security of the blockchain network.To address these issues,we propose a novel decentralized reputation management mechanism for permissioned blockchain networks to enhance security,promote liveness,and mitigate centralization while retaining the same throughput as traditional PoA.This paper aims to design an off-chain reputation evaluation and an on-chain reputation-aided consensus.First,we evaluate the nodes’reputation in the context of the blockchain networks and make the reputation globally verifiable through smart contracts.Second,building upon traditional PoA,we propose a reputation-aided PoA(rPoA)consensus to enhance securitywithout sacrificing throughput.In particular,rPoA can incentivize nodes to autonomously form committees based on reputation authority,which prevents block generation from being tracked through the randomness of reputation variation.Moreover,we develop a reputation-aided fork-choice rule for rPoA to promote the network’s liveness.Finally,experimental results show that the proposed rPoA achieves higher security performance while retaining transaction throughput compared to traditional PoA.
基金supported by National Natural Science Foundation of China [Grant No.72071181]Natural Science Foundation of Zhejiang Province [Grant No.LY21G 020004].
文摘In the lithium-ion battery(LIB)supply-chain,transactions involve several rounds of ordering,production and delivery between LIB suppliers and electric vehicle(EV)manufacturers.The sustainable performance of LIB suppliers,related to various characteristics,significantly affects the participants’sustainable reputations.The EV-LIB supply-chain transaction mechanism is explored from the perspective of the exchange economy comprehensively addressing both short-term economic profit and long-term sustainable reputation.Specifically,a“profit-reputation”utility function is proposed to reflect participants’expectations regarding cooperation profit and sustainable reputation.Additionally,an Edgeworth box model is developed to describe the participant’s balance determinations as a contract curve,revealing the Pareto conditions for mutually beneficial transactions based on sustainable performance.Furthermore,several principal-agent models are established to analyze the equilibrium of sustainable transactions within the EV-LIB supply-chain under varying dominance scenarios.A case study of an EV-LIB transaction is conducted to demonstrate the feasibility and effectiveness.This study aims to assist supply chain managers,researchers and decision-makers in exploring the role of participant’s sustainable reputation and its influence on supply-chain transaction and equilibrium,particularly in the context of designing cooperative contracts and negotiation process to foster sustainable supply chains.
基金supported by the National Natural Science Foundation of China(72293573)the New Era Education Quality Project of Anhui Province(2022zyxwjxalk003)the Fundamental Research Funds for the Central Universities(YD2160004004,WK2040000090).
文摘This study analyses all A-share listed companies from 2015 to 2020 to empirically examine the impact of inquiry supervision on corporate value and the moderating influence of corporate social responsibility(CSR)on this relationship.Research has shown that inquiry supervision significantly reduces corporate value,and the corporate social responsibility previously performed by companies can weaken this negative impact.Furthermore,the heterogeneity test based on internal and external controls shows that the reputation protection effect of CSR is more significant for companies with a higher proportion of independent directors,companies with a higher proportion of institutional investors investing in stocks,regions with a higher degree of marketization,and regions with a higher level of rule of law.The research in this article validates the effectiveness of reputation protection and verifies that reputation protection,as an informal mechanism,is easier to fulfil a role in areas where formal mechanisms are perfect.In other words,formal and informal mechanisms appear to complement each other.These findings provide empirical insights into the governance of CSR.
文摘Purpose:For a set of 1,561 Open Access(OA)and non-OA journals in business and economics,this study evaluates the relationships between four citation metrics-five-year Impact Factor(5IF),CiteScore,Article Influence(AI)score,and SCImago Journal Rank(SJR)-and the journal ratings assigned by expert reviewers.We expect that the OA journals will have especially high citation impact relative to their perceived quality(reputation).Design/methodology/approach:Regression is used to estimate the ratings assigned by expert reviewers for the 2021 CABS(Chartered Association of Business Schools)journal assessment exercise.The independent variables are the four citation metrics,evaluated separately,and a dummy variable representing the OA/non-OA status of each journal.Findings:Regardless of the citation metric used,OA journals in business and economics have especially high citation impact relative to their perceived quality(reputation).That is,they have especially low perceived quality(reputation)relative to their citation impact.Research limitations:These results are specific to the CABS journal ratings and the four citation metrics.However,there is strong evidence that CABS is closely related to several other expert ratings,and that 5IF,CiteScore,AI,and SJR are representative of the other citation metrics that might have been chosen.Practical implications:There are at least two possible explanations for these results:(1)expert evaluators are biased against OA journals,and(2)OA journals have especially high citation impact due to their increased accessibility.Although this study does not allow us to determine which of these explanations are supported,the results suggest that authors should consider publishing in OA journals whenever overall readership and citation impact are more important than journal reputation within a particular field.Moreover,the OA coefficients provide a useful indicator of the extent to which anti-OA bias(or the citation advantage of OA journals)is diminishing over time.Originality/value:This is apparently the first study to investigate the impact of OA status on the relationships between expert journal ratings and journal citation metrics.
