On Designs of Decentralized Reputation Management for Permissioned Blockchain Networks

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.

For Mega-Constellations: Edge Computing and Safety Management Based on Blockchain Technology

In mega-constellation Communication Systems, efficient routing algorithms and data transmission technologies are employed to ensure fast and reliable data transfer. However, the limited computational resources of satellites necessitate the use of edge computing to enhance secure communication.While edge computing reduces the burden on cloud computing, it introduces security and reliability challenges in open satellite communication channels. To address these challenges, we propose a blockchain architecture specifically designed for edge computing in mega-constellation communication systems. This architecture narrows down the consensus scope of the blockchain to meet the requirements of edge computing while ensuring comprehensive log storage across the network. Additionally, we introduce a reputation management mechanism for nodes within the blockchain, evaluating their trustworthiness, workload, and efficiency. Nodes with higher reputation scores are selected to participate in tasks and are appropriately incentivized. Simulation results demonstrate that our approach achieves a task result reliability of 95% while improving computational speed.

Expo 2020 Dubai’s Impact on the United Arab Emirates’Brand:A Quantitative Analysis About American and European Media Companies

Countries implement corporate communication initiatives to improve their international relations,achieve different business objectives,and reinforce their brands.Nation branding activities are mainly based on international events:sport,culture,social issues.This paper evaluates the Expo 2020 Dubai’s impact on the United Arab Emirates’brand.We conducted a literature review about nation branding,and then we resorted to 15 indicators to analyze how the most important newspapers from some of the most influential countries(United States,Russia,France,and Germany)covered this event from a journalistic and corporate communication perspective.Our results proved that 82 articles were published about this topic,and the most common criteria respected were quoting organizers(n=61),using the Expo’s logo(n=45)and the image of a falcon(n=43).We concluded that most media companies focused on facts related to the Expo and did references to the country’s identity(values,flag,falcon),but most of them did not include links to the Dubai Expo’s and UAE public authorities’websites.

Blockchain-Empowered Token-Based Access Control System with User Reputation Evaluation

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.

A dynamic incentive and reputation mechanism for energy-efficient federated learning in 6G

As 5G becomes commercial,researchers have turned attention toward the Sixth-Generation(6G)network with the vision of connecting intelligence in a green energy-efficient manner.Federated learning triggers an upsurge of green intelligent services such as resources orchestration of communication infrastructures while preserving privacy and increasing communication efficiency.However,designing effective incentives in federated learning is challenging due to the dynamic available clients and the correlation between clients'contributions during the learning process.In this paper,we propose a dynamic incentive and reputation mechanism to improve energy efficiency and training performance of federated learning.The proposed incentive based on the Stackelberg game can timely adjust optimal energy consumption with changes in available clients during federated learning.Meanwhile,clients’contributions in reputation management are formulated based on the cooperative game to capture the correlation between tasks,which satisfies availability,fairness,and additivity.The simulation results show that the proposed scheme can significantly motivate high-performance clients to participate in federated learning and improve the accuracy and energy efficiency of the federated learning model.

P2P transaction method for distributed energy prosumers based on reputation value

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.

A Machine Learning-Based Attack Detection and Prevention System in Vehicular Named Data Networking

Named Data Networking(NDN)is gaining a significant attention in Vehicular Ad-hoc Networks(VANET)due to its in-network content caching,name-based routing,and mobility-supporting characteristics.Nevertheless,existing NDN faces three significant challenges,including security,privacy,and routing.In particular,security attacks,such as Content Poisoning Attacks(CPA),can jeopardize legitimate vehicles with malicious content.For instance,attacker host vehicles can serve consumers with invalid information,which has dire consequences,including road accidents.In such a situation,trust in the content-providing vehicles brings a new challenge.On the other hand,ensuring privacy and preventing unauthorized access in vehicular(VNDN)is another challenge.Moreover,NDN’s pull-based content retrieval mechanism is inefficient for delivering emergency messages in VNDN.In this connection,our contribution is threefold.Unlike existing rule-based reputation evaluation,we propose a Machine Learning(ML)-based reputation evaluation mechanism that identifies CPA attackers and legitimate nodes.Based on ML evaluation results,vehicles accept or discard served content.Secondly,we exploit a decentralized blockchain system to ensure vehicles’privacy by maintaining their information in a secure digital ledger.Finally,we improve the default routing mechanism of VNDN from pull to a push-based content dissemination using Publish-Subscribe(Pub-Sub)approach.We implemented and evaluated our ML-based classification model on a publicly accessible BurST-Asutralian dataset for Misbehavior Detection(BurST-ADMA).We used five(05)hybrid ML classifiers,including Logistic Regression,Decision Tree,K-Nearest Neighbors,Random Forest,and Gaussian Naive Bayes.The qualitative results indicate that Random Forest has achieved the highest average accuracy rate of 100%.Our proposed research offers the most accurate solution to detect CPA in VNDN for safe,secure,and reliable vehicle communication.

Hybrid Trust Based Reputation Mechanism for Discovering Malevolent Node in MANET

A self-contained connection of wireless links that functions without any infrastructure is known as Mobile Ad Hoc Network(MANET).A MANET’s nodes could engage actively and dynamically with one another.However,MAN-ETs,from the other side,are exposed to severe potential threats that are difficult to counter with present security methods.As a result,several safe communication protocols designed to enhance the secure interaction among MANET nodes.In this research,we offer a reputed optimal routing value among network nodes,secure computations,and misbehavior detection predicated on node’s trust levels with a Hybrid Trust based Reputation Mechanism(HTRM).In addition,the study designs a robust Public Key Infrastructure(PKI)system using the suggested trust evaluation method in terms of“key”generation,which is a crucial component of a PKI cryptosystem.We also concentrate on the solid node authenticating process that relies on pre-authentication.To ensure edge-to-edge security,we assess safe,trustworthy routes to secure computations and authenticate mobile nodes,incorporating uncertainty into the trust management solution.When compared to other protocols,our recommended approach performs better.Finally,we use simulations data and performance evaluation metrics to verify our suggested approach’s validity Our approach outperformed the competing systems in terms of overall end-to-end delay,packet delivery ratio,performance,power consumption,and key-computing time by 3.47%,3.152%,2.169%,and 3.527%,3.762%,significantly.

How Do Young Children Manage Their Reputation among Peers?

Young children’s reputation management is closely related to their social development.The purpose of our study is to examine the interaction between theory of mind and partner choice on children’s reputation management.Participants consisted of 270 children who were 3 to 5 years old.First,we measured participants’theory of mind capabilities using the unexpected location task and unexpected content task and then randomly divided the participants into the control group,non-partner–choice group,and partner-choice group.We measured reputation management by comparing children’s willingness to share and sharing behavior between these groups.Thefindings are as follows:(1)Children from ages 3 to 5 demonstrated reputation management,and their reputation management followed a significant developmental trend.The reputation management of 4-to 5-year-old children was significantly better than that of 3-year-old children.(2)Scores on the theory of mind tasks positively predicted children’s reputation management.(3)Partner choice affected children’s reputation management.In the partner-choice group,children’s reputation management was more apparent.(4)Partner choice did moderate the relationship between theory of mind and children’s reputation management.In the partner-choice group,theory of mind had a stronger predictive effect on children’s reputation management.

Roles of Corporate Reputation and Service Recovery in Food Safety Crises:A Case Study of Food Hygiene Incidents in Hot Pot Restaurants

Food hygiene incidents in hot pot restaurants were studied,and a relationship model between corporate reputation and consumers behavioral intention was established.Hot pot consumers of hot pot restaurants were surveyed through questionnaires.The results show that corporate reputation positively affects service recovery and repurchase intention,and service recovery positively influences repurchase intention,while corporate reputation affects repurchase intention through service recovery.In other words,under the situation of enterprise crises,the service recovery of an enterprise can restore its image and reputation.Therefore,when an enterprise has a crisis,it should positively respond to the crisis incident,and take timely crisis recovery to maintain its positive image.

A New Historicism Interpretation of Is He Living or Is He Dead

Is He Living or Is He Dead is mainly about an outstanding painter Francois Millet who pretend to be dead in order to get reputation and money,because at that time a great artist has never been acknowledged until after he was starved and dead. Based on the critic approach of New Historicism, this thesis have analyzed how Millet subvert power and be contained by power, the capitalism and market, which criticized the phenomenon that the value of art is not decided by itself, but by power. No matter it is good or bad, if it is denied by power, it is valueless.

比特币背后的技术可能改变经济运行模式

Bitcoin has a bad reputation.The decentralised digital cryptocurrency,powered by a vast computer network,is notorious for the wild fluctuations in its value,the zeal of its supporters and its degenerate uses,such as extortion,buying drugs and hiring hitmen in the online bazaars of the'dark net'.比特币有一个坏名声。这种由一个庞大的计算机网络来驱动的去中心化数字加密货币,其恶名源于币值的剧烈波动、支持者的狂热追捧以及各种堕落的用途,如敲诈勒索、购买毒品和在'暗网'的在线市场雇佣杀手等。

A Privacy-Based SLA Violation Detection Model for the Security of Cloud Computing

A Service Level Agreement(SLA) is a legal contract between any two parties to ensure an adequate Quality of Service(Qo S). Most research on SLAs has concentrated on protecting the user data through encryption. However, these methods can not supervise a cloud service provider(CSP) directly. In order to address this problem, we propose a privacy-based SLA violation detection model for cloud computing based on Markov decision process theory. This model can recognize and regulate CSP's actions based on specific requirements of various users. Additionally, the model could make effective evaluation to the credibility of CSP, and can monitor events that user privacy is violated. Experiments and analysis indicate that the violation detection model can achieve good results in both the algorithm's convergence and prediction effect.

A notary group-based cross-chain mechanism

As an emerging distributed technology, blockchain has begun to penetrate into many fields such as finance, healthcare, supply chain, intelligent transportation. However, the interoperability and value exchange between different independent blockchain systems is restricting the expansion of blockchain. In this paper, a notary group-based cross-chain interaction model is proposed to achieve the interoperability between different blockchains. Firstly, a notary election mechanism is proposed to choose one notary from the notary group to act as a bridge for cross-chain transactions. Secondly, a margin pool is introduced to limit the misconduct of the elected notary and ensure the value transfer between the involved blockchains. Moreover, a reputation based incentive mechanism is used to encourage members of the notary group to participate in cross-chain transactions. Ethereum-based experiments demonstrate that the proposed mechanism can provide an acceptable performance for cross-chain transactions and provide a higher security level than ordinary cross-chain mechanisms.

Fraud detections for online businesses:a perspective from blockchain technology

Background:The reputation system has been designed as an effective mechanism to reduce risks associated with online shopping for customers.However,it is vulnerable to rating fraud.Some raters may inject unfairly high or low ratings to the system so as to promote their own products or demote their competitors.Method:This study explores the rating fraud by differentiating the subjective fraud from objective fraud.Then it discusses the effectiveness of blockchain technology in objective fraud and its limitation in subjective fraud,especially the rating fraud.Lastly,it systematically analyzes the robustness of blockchain-based reputation systems in each type of rating fraud.Results:The detection of fraudulent raters is not easy since they can behave strategically to camouflage themselves.We explore the potential strengths and limitations of blockchain-based reputation systems under two attack goals:ballot-stuffing and bad-mouthing,and various attack models including constant attack,camouflage attack,whitewashing attack and sybil attack.Blockchain-based reputation systems are more robust against bad-mouthing than ballot-stuffing fraud.Conclusions:Blockchain technology provides new opportunities for redesigning the reputation system.Blockchain systems are very effective in preventing objective information fraud,such as loan application fraud,where fraudulent information is fact-based.However,their effectiveness is limited in subjective information fraud,such as rating fraud,where the ground-truth is not easily validated.Blockchain systems are effective in preventing bad mouthing and whitewashing attack,but they are limited in detecting ballot-stuffing under sybil attack,constant attacks and camouflage attack.

METrust: A Mutual Evaluation-based Trust Model for P2P Networks

It is necessary to construct an effective trust model to build trust relationship between peers in peer-to-peer （P2P） network and enhance the security and reliability of P2P systems. The current trust models only focus on the consumers＇ evaluation to a transaction, which may be abused by malicious peers to exaggerate or slander the provider deliberately. In this paper, we propose a novel trust model based on mutual evaluation, called METrust, to suppress the peers＇ malicious behavior, such as dishonest evaluation and strategic attack. METrust considers the factors including mutual evaluation, similarity risk, time window, incentive, and punishment mechanism. The trust value is composed of the direct trust value and the recommendation trust value. In order to inhibit dishonest evaluation, both participants should give evaluation information based on peers＇ own experiences about the transaction while computing the direct trust value. In view of this, the mutual evaluation consistency factor and its time decay function are proposed. Besides, to reduce the risk of computing the recommendation trust based on the recommendations of friend peers, the similarity risk is introduced to measure the uncertainty of the similarity computing, while similarity is used to measure credibility. The experimental results show that METrust is effective, and it has advantages in the inhibition of the various malicious behaviors.

A New Kind of Subjective Trust Model

Based on the outstanding characteristics of Cloud Model on the process of transforming a qualitative concept to a set of quantitative numerical values, a formalized model of subjective trust is introduced by which we can transform between qualitative reputation and quantitative voting data. The present paper brings forward algorithms to compute direct trust and recommender trust. Further more, an effective similarity measuring method used to distinguish two users＇ reputation on knowledge level is also proposed. The given model properly settles the uncertainty and fuzziness properties of subjective trust which is always the weakness of traditional subjective trust model, and provides a step in the direction of proper understanding and definition of human trust.

SemTrust: A Semantic Reputation System in P2P-Based Semantic Web

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.

An Extended Hierarchical Trusted Model for Wireless Sensor Networks

Cryptography and authentication are traditional approach for providing network security. However, they are not sufficient for solving the problems which malicious nodes compromise whole wireless sensor network leading to invalid data transmission and wasting resource by using vicious behaviors. This paper puts forward an extended hierarchical trusted architecture for wireless sensor network, and establishes trusted congregations by three-tier framework. The method combines statistics, economics with encrypt mechanism for developing two trusted models which evaluate cluster head nodes and common sensor nodes respectively. The models form logical trusted-link from command node to common sensor nodes and guarantees the network can run in secure and reliable circumstance.

Reputation-Based Cooperative Spectrum Sensing Algorithm for Mobile Cognitive Radio Networks

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.