V2X communication enables vehicles to share real-time traffic and road-condition data,but binding messages to persistent identifiers enables location tracking.Furthermore,since forged reports from malicious vehicles c...V2X communication enables vehicles to share real-time traffic and road-condition data,but binding messages to persistent identifiers enables location tracking.Furthermore,since forged reports from malicious vehicles can distort trust decisions and threaten road safety,privacy-preserving trust management is essential.Lu et al.previously presented BARS,an anonymous reputation mechanism founded on blockchain technology to establish a privacy-preserving trust architecture for V2X communication.In this system,reputation certificates without a vehicle identifier ensure anonymity,while two authorities jointly manage certificate issuance and reputation updates.However,the centralized certificate updates introduce scalability limitations,and the authorities can trace vehicle behavioral information,which threatens privacy guarantees.Several subsequent systems derived from BARS still rely on centralized certificate management and are subject to authority-side privacy leakage.As a result,a key challenge in this line of research remains unresolved:how to decentralize the certificate-update process while preserving privacy against the authorities in privacy-preservingV2X trustmanagement.In this paper,we propose a distributed anonymous reputation system for V2X communication,based on an anonymous reputation system for crowdsensing.In our proposed system for V2X communication,the server is distributed to a certificate authority(CA)and roadside units(RSUs).Each vehicle shows the reputation level to the nearest RSU at the beginning of each time interval,and registers a short-time public key.In the interval,the messages from the vehicle are authenticated under the public key and are scored.At the end of the interval,the nearest RSU updates the certificate anonymously.Our solution decentralizes the certificate-update process by assigning each update to the nearest RSU.A zero-knowledge-proof-based show protocol removes the need for any central authority to handle vehicle certificates and thus prevents the authorities from tracing vehicle activities.Compared with BARS,where centralized authorities must update the reputation certificates of many vehicles and may incur communication and processing delays,our system performs each update locally at the nearest RSUonce per interval.The required interaction consists only of a fewkilobytes of communication and a zero-knowledge proof that is almost fully precomputed on the vehicle side,while the RSU-side processing is estimated to take about 40 ms based on timingmeasurements of the underlying cryptographic operations.This distributed updatemodel avoids the centralized bottleneck of BARS and simultaneously removes the privacy risk arising from authority collusion.展开更多
To address the problems of high communication overhead,insufficient robustness in master node election,and difficulty in timely management of faulty nodes in large-scale networks,the traditional PBFT consensus algorit...To address the problems of high communication overhead,insufficient robustness in master node election,and difficulty in timely management of faulty nodes in large-scale networks,the traditional PBFT consensus algorithm is proposed as a reputation-based grouping and supervision PBFT(RGS-PBFT).This method constructs a dynamic reputation score model based on the behavioral characteristics of nodes during the consensus process,such as verification correctness,voting participation,and operational stability.Based on this model,nodes are divided into consensus groups,candidate node groups,and ordinary node groups,enabling adaptive adjustment of node roles.During the master node election phase,the top 5%of nodes with the highest reputation scores from the consensus groups are selected as the candidate set.The ordinary node group and the candidate node group elect the master node through reputation-weighted voting,thus balancing the reliability of the master node with the decentralized nature of the election process.During the consensus process,only the consensus group participates in the core voting and confirmation process of PBFT to reduce communication complexity,while the remaining nodes mainly undertake verification and supervision responsibilities.Simultaneously,a monitoring and punishment mechanism for low-reputation nodes is introduced to limit,downgrade,and isolate faulty and abnormal nodes.Experimental results show that this mechanism,while maintaining Byzantine fault tolerance,can effectively reduce consensus communication overhead and improve master node election stability and overall system performance.展开更多
Consensus mechanisms are fundamental to blockchain systems,ensuring that distributed nodes agree on the validity of transactions and data.However,performance bottlenecks,particularly those related to throughput,latenc...Consensus mechanisms are fundamental to blockchain systems,ensuring that distributed nodes agree on the validity of transactions and data.However,performance bottlenecks,particularly those related to throughput,latency,and node selection,have increasingly constrained the scalability of modern blockchain deployments.To address these issues,this paper proposes NI-HotStuff,a reputation-driven committee-based BFT consensus framework built upon the HotStuff protocol.A CatBoost-based reputation model is introduced to learn and evaluate historical behavioral features of nodes,enabling quantitative reputation scoring.A hardware-aware bidding mechanism is further incorporated to dynamically compute each node’s bid value and integrate it with its reputation score,thereby prioritizing stable and high-performance nodes for consensus participation.Moreover,a committee mechanism is established in which a set of committee nodes were selected from the candidate pool,and only committee members participate in the consensus process,reducing redundant communication and mitigating the performance drag caused by weak nodes.On top of that,a leader-selection strategy based on reputation values and inter-view time intervals is designed to prevent low-reputation or potentially malicious nodes from frequently becoming leaders.Experimental results demonstrate that NI-HotStuff significantly outperforms traditional PBFT and HotStuff in terms of communication overhead,consensus latency,and system throughput,with particularly notable improvements in small-and medium-scale node environments.展开更多
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.展开更多
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.展开更多
This paper presents a comparative qualitative analysis of reputational crisis of four European banks, and explores how in recent years these companies have faced the manifestation of reputational risk. To achieve this...This paper presents a comparative qualitative analysis of reputational crisis of four European banks, and explores how in recent years these companies have faced the manifestation of reputational risk. To achieve this, the research follows three related steps: (1) to carry out a review of the literature on reputational risk in the banking sector aimed to identify the relationships between causes, effects, stakeholders, and key qualitative-quantitative variables involved during the reputational crisis of a bank; (2) to propose a conceptual framework for management of reputational risk (and reputational crisis) in banking; (3) to test this framework with the results of an empirical analysis, carried out through the observation of key variables of some reputational crisis of intemational banks. The main results show that: (1) the banks are not yet prepared to accurately manage a reputational crisis or to prevent them; (2) the reputational crisis is determined by several internal and external factors; (3) the conduct of the managers and the corporate communication are very important to overcome a reputational crisis. Finally, this research provides indications that will help banks to better manage their corporate reputation and prevent reputational crisis.展开更多
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.展开更多
Adding a reputation incentive system to peer-to-peer(P2P)energy transactions can encourage prosumers to regulate their trading behavior,which is important for ensuring the efficiency and reliability of P2P transaction...Adding a reputation incentive system to peer-to-peer(P2P)energy transactions can encourage prosumers to regulate their trading behavior,which is important for ensuring the efficiency and reliability of P2P transactions.This study proposed a P2P transaction mechanism and game optimization model for prosumers involved in distributed energy sources considering reputation-value incentives.First,the deviation of P2P transactions and the non-consumption rate of distributed renewable energy in P2P transactions were established as indicators to quantify the influencing factors of the reputation value,and a reputation incentive model of P2P transactions for prosumers was constructed.Then,the penalty coefficient was applied to the cost function of the prosumers,and a non-cooperative game model of P2P transactions based on the complete information of multi-prosumers was established.Furthermore,the Nash equilibrium problem was transformed into a nonlinear optimization problem by constructing the modified optimal reaction function,and the Nash equilibrium solution of the game was obtained via a relaxation algorithm.Finally,the modified IEEE 33-node test system based on electricity market P2P and an IEEE 123-node test system were used to analyze and verify the cost and P2P participation of prosumers considering the reputation value.The results show that the addition of the reputation incentive system can encourage prosumers to standardize their interactive transaction behavior and actively participate in P2P transactions.It can also improve the operation efficiency of the power grid and promote the perfection of the P2P transaction mechanism.展开更多
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.展开更多
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.展开更多
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...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.展开更多
Identifying malicious users accurately in cognitive radio networks(CRNs) is the guarantee for excellent detection performance. However, existing algorithms fail to take the mobility of secondary users into considerati...Identifying malicious users accurately in cognitive radio networks(CRNs) is the guarantee for excellent detection performance. However, existing algorithms fail to take the mobility of secondary users into consideration. If applied directly in mobile CRNs, those conventional algorithms would overly punish reliable users at extremely bad or good locations, leading to an obvious decrease in detection performance. To overcome this problem, we divide the whole area of interest into several cells to consider the location diversity of the network. Each user's reputation score is updated after each sensing slot and is used for identifying whether it is malicious or not. If so, it would be removed away. And then our algorithm assigns users in cells with better channel conditions, i.e. larger signal-to-noise ratios(SNRs), with larger weighting coefficients, without requiring the prior information of SNR. Detailed analysis about the validity of our algorithm is presented. The simulation results show that in a CRN with 60 mobile secondary users, among which, 18 are malicious, our solution has an improvement of detection probability by 0.97-d B and 3.57-d B when false alarm probability is 0.1, compared with a conventional trust-value-based algorithm and a trusted collaborative spectrum sensing for mobile CRNs, respectively.展开更多
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.展开更多
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.展开更多
Reputation mechanism has been recently introduced into wireless sensor networks(WSNs) to overcome the deficiencies incurred by cryptography alone.Unlike most current reputation mechanisms that are based on binomial di...Reputation mechanism has been recently introduced into wireless sensor networks(WSNs) to overcome the deficiencies incurred by cryptography alone.Unlike most current reputation mechanisms that are based on binomial distribution and to some extent,do not give due attention to the aspect of energy constraint of WSNs,this research deduces and proves the feasibility that negative binomial distribution can well be used in the reputation update with distinctive energy-saving features.Comparison tests with respect to the energy consumption in terms of reputation computing frequencies are done between the traditional reputation method and the one in this study.Results show that our method can save more energy for the reputation update and thus can better meet the power constraints of WSNs.展开更多
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.展开更多
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.展开更多
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.展开更多
To study the incentive mechanisms of cooperation, we propose a preference rewarding mechanism in the spatial prisoner’s dilemma game, which simultaneously considers reputational preference, other-regarding preference...To study the incentive mechanisms of cooperation, we propose a preference rewarding mechanism in the spatial prisoner’s dilemma game, which simultaneously considers reputational preference, other-regarding preference and the dynamic adjustment of vertex weight. The vertex weight of a player is adaptively adjusted according to the comparison result of his own reputation and the average reputation value of his immediate neighbors. Players are inclined to pay a personal cost to reward the cooperative neighbor with the greatest vertex weight. The vertex weight of a player is proportional to the preference rewards he can obtain from direct neighbors. We find that the preference rewarding mechanism significantly facilitates the evolution of cooperation, and the dynamic adjustment of vertex weight has powerful effect on the emergence of cooperative behavior. To validate multiple effects, strategy distribution and the average payoff and fitness of players are discussed in a microcosmic view.展开更多
摘要V2X communication enables vehicles to share real-time traffic and road-condition data,but binding messages to persistent identifiers enables location tracking.Furthermore,since forged reports from malicious vehicles can distort trust decisions and threaten road safety,privacy-preserving trust management is essential.Lu et al.previously presented BARS,an anonymous reputation mechanism founded on blockchain technology to establish a privacy-preserving trust architecture for V2X communication.In this system,reputation certificates without a vehicle identifier ensure anonymity,while two authorities jointly manage certificate issuance and reputation updates.However,the centralized certificate updates introduce scalability limitations,and the authorities can trace vehicle behavioral information,which threatens privacy guarantees.Several subsequent systems derived from BARS still rely on centralized certificate management and are subject to authority-side privacy leakage.As a result,a key challenge in this line of research remains unresolved:how to decentralize the certificate-update process while preserving privacy against the authorities in privacy-preservingV2X trustmanagement.In this paper,we propose a distributed anonymous reputation system for V2X communication,based on an anonymous reputation system for crowdsensing.In our proposed system for V2X communication,the server is distributed to a certificate authority(CA)and roadside units(RSUs).Each vehicle shows the reputation level to the nearest RSU at the beginning of each time interval,and registers a short-time public key.In the interval,the messages from the vehicle are authenticated under the public key and are scored.At the end of the interval,the nearest RSU updates the certificate anonymously.Our solution decentralizes the certificate-update process by assigning each update to the nearest RSU.A zero-knowledge-proof-based show protocol removes the need for any central authority to handle vehicle certificates and thus prevents the authorities from tracing vehicle activities.Compared with BARS,where centralized authorities must update the reputation certificates of many vehicles and may incur communication and processing delays,our system performs each update locally at the nearest RSUonce per interval.The required interaction consists only of a fewkilobytes of communication and a zero-knowledge proof that is almost fully precomputed on the vehicle side,while the RSU-side processing is estimated to take about 40 ms based on timingmeasurements of the underlying cryptographic operations.This distributed updatemodel avoids the centralized bottleneck of BARS and simultaneously removes the privacy risk arising from authority collusion.
摘要To address the problems of high communication overhead,insufficient robustness in master node election,and difficulty in timely management of faulty nodes in large-scale networks,the traditional PBFT consensus algorithm is proposed as a reputation-based grouping and supervision PBFT(RGS-PBFT).This method constructs a dynamic reputation score model based on the behavioral characteristics of nodes during the consensus process,such as verification correctness,voting participation,and operational stability.Based on this model,nodes are divided into consensus groups,candidate node groups,and ordinary node groups,enabling adaptive adjustment of node roles.During the master node election phase,the top 5%of nodes with the highest reputation scores from the consensus groups are selected as the candidate set.The ordinary node group and the candidate node group elect the master node through reputation-weighted voting,thus balancing the reliability of the master node with the decentralized nature of the election process.During the consensus process,only the consensus group participates in the core voting and confirmation process of PBFT to reduce communication complexity,while the remaining nodes mainly undertake verification and supervision responsibilities.Simultaneously,a monitoring and punishment mechanism for low-reputation nodes is introduced to limit,downgrade,and isolate faulty and abnormal nodes.Experimental results show that this mechanism,while maintaining Byzantine fault tolerance,can effectively reduce consensus communication overhead and improve master node election stability and overall system performance.
摘要Consensus mechanisms are fundamental to blockchain systems,ensuring that distributed nodes agree on the validity of transactions and data.However,performance bottlenecks,particularly those related to throughput,latency,and node selection,have increasingly constrained the scalability of modern blockchain deployments.To address these issues,this paper proposes NI-HotStuff,a reputation-driven committee-based BFT consensus framework built upon the HotStuff protocol.A CatBoost-based reputation model is introduced to learn and evaluate historical behavioral features of nodes,enabling quantitative reputation scoring.A hardware-aware bidding mechanism is further incorporated to dynamically compute each node’s bid value and integrate it with its reputation score,thereby prioritizing stable and high-performance nodes for consensus participation.Moreover,a committee mechanism is established in which a set of committee nodes were selected from the candidate pool,and only committee members participate in the consensus process,reducing redundant communication and mitigating the performance drag caused by weak nodes.On top of that,a leader-selection strategy based on reputation values and inter-view time intervals is designed to prevent low-reputation or potentially malicious nodes from frequently becoming leaders.Experimental results demonstrate that NI-HotStuff significantly outperforms traditional PBFT and HotStuff in terms of communication overhead,consensus latency,and system throughput,with particularly notable improvements in small-and medium-scale node environments.
基金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.
基金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.
摘要This paper presents a comparative qualitative analysis of reputational crisis of four European banks, and explores how in recent years these companies have faced the manifestation of reputational risk. To achieve this, the research follows three related steps: (1) to carry out a review of the literature on reputational risk in the banking sector aimed to identify the relationships between causes, effects, stakeholders, and key qualitative-quantitative variables involved during the reputational crisis of a bank; (2) to propose a conceptual framework for management of reputational risk (and reputational crisis) in banking; (3) to test this framework with the results of an empirical analysis, carried out through the observation of key variables of some reputational crisis of intemational banks. The main results show that: (1) the banks are not yet prepared to accurately manage a reputational crisis or to prevent them; (2) the reputational crisis is determined by several internal and external factors; (3) the conduct of the managers and the corporate communication are very important to overcome a reputational crisis. Finally, this research provides indications that will help banks to better manage their corporate reputation and prevent reputational crisis.
摘要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.
基金supported by the National Natural Science Foundation of China(U2066211,52177124,52107134)the Institute of Electrical Engineering,CAS(E155610101)+1 种基金the DNL Cooperation Fund,CAS(DNL202023)the Youth Innovation Promotion Association of CAS(2019143).
摘要Adding a reputation incentive system to peer-to-peer(P2P)energy transactions can encourage prosumers to regulate their trading behavior,which is important for ensuring the efficiency and reliability of P2P transactions.This study proposed a P2P transaction mechanism and game optimization model for prosumers involved in distributed energy sources considering reputation-value incentives.First,the deviation of P2P transactions and the non-consumption rate of distributed renewable energy in P2P transactions were established as indicators to quantify the influencing factors of the reputation value,and a reputation incentive model of P2P transactions for prosumers was constructed.Then,the penalty coefficient was applied to the cost function of the prosumers,and a non-cooperative game model of P2P transactions based on the complete information of multi-prosumers was established.Furthermore,the Nash equilibrium problem was transformed into a nonlinear optimization problem by constructing the modified optimal reaction function,and the Nash equilibrium solution of the game was obtained via a relaxation algorithm.Finally,the modified IEEE 33-node test system based on electricity market P2P and an IEEE 123-node test system were used to analyze and verify the cost and P2P participation of prosumers considering the reputation value.The results show that the addition of the reputation incentive system can encourage prosumers to standardize their interactive transaction behavior and actively participate in P2P transactions.It can also improve the operation efficiency of the power grid and promote the perfection of the P2P transaction mechanism.
基金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.
基金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.
摘要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.
基金supported by National Natural Science Foundation of China under Grant No. 61671183the Open Research Fund of State Key Laboratory of Space-Ground Integrated Information Technology under Grant No. 2015_SGIIT_KFJJ_TX_02major consulting projects of Chinese Academy of Engineering under Grant No. 2016-ZD-05-07
摘要Identifying malicious users accurately in cognitive radio networks(CRNs) is the guarantee for excellent detection performance. However, existing algorithms fail to take the mobility of secondary users into consideration. If applied directly in mobile CRNs, those conventional algorithms would overly punish reliable users at extremely bad or good locations, leading to an obvious decrease in detection performance. To overcome this problem, we divide the whole area of interest into several cells to consider the location diversity of the network. Each user's reputation score is updated after each sensing slot and is used for identifying whether it is malicious or not. If so, it would be removed away. And then our algorithm assigns users in cells with better channel conditions, i.e. larger signal-to-noise ratios(SNRs), with larger weighting coefficients, without requiring the prior information of SNR. Detailed analysis about the validity of our algorithm is presented. The simulation results show that in a CRN with 60 mobile secondary users, among which, 18 are malicious, our solution has an improvement of detection probability by 0.97-d B and 3.57-d B when false alarm probability is 0.1, compared with a conventional trust-value-based algorithm and a trusted collaborative spectrum sensing for mobile CRNs, respectively.
基金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.
基金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.
基金the National Natural Science Foundation of China(No.60905037)
摘要Reputation mechanism has been recently introduced into wireless sensor networks(WSNs) to overcome the deficiencies incurred by cryptography alone.Unlike most current reputation mechanisms that are based on binomial distribution and to some extent,do not give due attention to the aspect of energy constraint of WSNs,this research deduces and proves the feasibility that negative binomial distribution can well be used in the reputation update with distinctive energy-saving features.Comparison tests with respect to the energy consumption in terms of reputation computing frequencies are done between the traditional reputation method and the one in this study.Results show that our method can save more energy for the reputation update and thus can better meet the power constraints of WSNs.
基金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.
基金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.
基金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.
基金the National Natural Science Foundation of China(Grant No.62062049)the Social Science Project of the Ministry of Education of China(Grant No.20YJCZH212)the Natural Science Foundation of Gansu Province,China(Grant No.20JR5RA390).
摘要To study the incentive mechanisms of cooperation, we propose a preference rewarding mechanism in the spatial prisoner’s dilemma game, which simultaneously considers reputational preference, other-regarding preference and the dynamic adjustment of vertex weight. The vertex weight of a player is adaptively adjusted according to the comparison result of his own reputation and the average reputation value of his immediate neighbors. Players are inclined to pay a personal cost to reward the cooperative neighbor with the greatest vertex weight. The vertex weight of a player is proportional to the preference rewards he can obtain from direct neighbors. We find that the preference rewarding mechanism significantly facilitates the evolution of cooperation, and the dynamic adjustment of vertex weight has powerful effect on the emergence of cooperative behavior. To validate multiple effects, strategy distribution and the average payoff and fitness of players are discussed in a microcosmic view.