The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
SecuredTrust: A Dynamic Trust Computation Model for Secured Communication in Multiagent Systems
Abstract
Security and privacy issues have become critically important with the fast expansion of multiagent systems. Most network applications such as pervasive computing, grid computing, and P2P networks can be viewed as multiagent systems which are open, anonymous, and dynamic in nature. Such characteristics of multiagent systems introduce vulnerabilities and threats to providing secured communication. One feasible way to minimize the threats is to evaluate the trust and reputation of the interacting agents. Many trust/reputation models have done so, but they fail to properly evaluate trust when malicious agents start to behave in an unpredictable way. Moreover, these models are ineffective in providing quick response to a malicious agent's oscillating behavior. Another aspect of multiagent systems which is becoming critical for sustaining good service quality is the even distribution of workload among service providing agents. Most trust/reputation models have not yet addressed this issue. So, to cope with the strategically altering behavior of malicious agents and to distribute workload as evenly as possible among service providers; we present in this paper a dynamic trust computation model called "SecuredTrust.” In this paper, we first analyze the different factors related to evaluating the trust of an agent and then propose a comprehensive quantitative model for measuring such trust. We also propose a novel load-balancing algorithm based on the different factors defined in our model. Simulation results indicate that our model compared to other existing models can effectively cope with strategic behavioral change of malicious agents and at the same time efficiently distribute workload among the service providing agents under stable condition.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Resnick, P., Kuwabara, K., Zeckhauser, R., & Friedman, E. (2000) · Communications of the ACM · doi:10.1145/355112.355122 · Cited by 2,190 · cited 1×
“A reputation-based trust model [11], [12], [13], [14] collects, distributes, and aggregates feedback about participants' past behavior.”
BackgroundManaging trust in a peer-2-peer information system
Aberer, K., & Despotovic, Z. (2001) · Proceedings of the tenth international conference on Information and knowledge management - CIKM'01 · doi:10.1145/502636.502638 · Cited by 915
Cited by
A Survey on Metaverse: Fundamentals, Security, and Privacy
Wang, Y., Su, Z., Zhang, N., Xing, R., Liu, D., Luan, T. H., & Shen, X. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3202047 · Cited by 1,575
Wang, Y., Su, Z., Guo, S., Dai, M., Luan, T. H., & Liu, Y. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3263909 · Cited by 357
BSIS: Blockchain-Based Secure Incentive Scheme for Energy Delivery in Vehicular Energy Network
Wang, Y., Su, Z., & Zhang, N. (2019) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2908497 · Cited by 218
Metadata
- Authors
- Das, A., & Islam, M. M.
- Venue
- IEEE Transactions on Dependable and Secure Computing
- Published
- 2012-03
- Volume
- 9
- Issue
- 2
- Pages
- 261-274
- ISSN
- 1545-5971 (ISSN-L)
- OpenAlex
- W2007868971
- Cited by
- 230
- References
- 2
- FWCI
- 38.58
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.