A Computational Dynamic Trust Model for User Authorization

Date

2015-01-01

Author

ZHONG, Yuhui
Bhargava, Bharat
LU, Yİ
Angın, Pelin

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

196
views

0
downloads

Development of authorization mechanisms for secure information access by a large community of users in an open environment is an important problem in the ever-growing Internet world. In this paper we propose a computational dynamic trust model for user authorization, rooted in findings from social science. Unlike most existing computational trust models, this model distinguishes trusting belief in integrity from that in competence in different contexts and accounts for subjectivity in the evaluation of a particular trustee by different trusters. Simulation studies were conducted to compare the performance of the proposed integrity belief model with other trust models from the literature for different user behavior patterns. Experiments show that the proposed model achieves higher performance than other models especially in predicting the behavior of unstable users.

Subject Keywords

Electrical and Electronic Engineering

URI

https://hdl.handle.net/11511/44692

Journal

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING

DOI

https://doi.org/10.1109/tdsc.2014.2309126

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

Synthesis of Monitoring Rules with STL Aydin, Sertac Kagan; Aydın Göl, Ebru (World Scientific Pub Co Pte Lt, 2020-09-01) Online monitoring is essential to enhance the reliability for various systems including cyber-physical systems and Web services. During online monitoring, the system traces are checked against monitoring rules in real time to detect deviations from normal behaviors. In general, the rules are defined as boundary conditions by the experts of the monitored system. This work studies the problem of synthesizing online monitoring rules in the form of temporal logic formulas in an automated way. The monitoring rul...
EACF: extensible access control framework for cloud environments Mehak, Faria; Masood, Rahat; Shibli, Muhammad Awais; Elgedway, Islam (Springer Science and Business Media LLC, 2017-06-01) The dynamic authorization and continuous monitoring of resource usage in cloud environments is a challenge. Moreover, the extant access control techniques are not well-suited for all types of the cloud-hosted applications predominantly for two reasons. Firstly, these techniques lack in providing features such as generality, extensibility, and flexibility. Secondly, they are static in nature, such that once the user is authorized, they do not evaluate the access request during and after the resource usage. E...
A hybrid single-source shortest path algorithm Arslan, Hilal; Manguoğlu, Murat (The Scientific and Technological Research Council of Turkey, 2019-01-01) The single-source shortest path problem arises in many applications, such as roads, social applications, and computer networks. Finding the shortest path is challenging, especially for graphs that contain a large number of vertices and edges. In this work, we propose a novel hybrid method that first sparsifies a given graph by removing most edges that cannot form the shortest path tree and then applies a classical shortest path algorithm to the sparser graph. Removing all the edges that cannot form the shor...
A Hierarchical Partitioning Strategy for an Efficient Parallelization of the Multilevel Fast Multipole Algorithm Ergül, Özgür Salih (Institute of Electrical and Electronics Engineers (IEEE), 2009-06-01) We present a novel hierarchical partitioning strategy for the efficient parallelization of the multilevel fast multipole algorithm (MLFMA) on distributed-memory architectures to solve large-scale problems in electromagnetics. Unlike previous parallelization techniques, the tree structure of MLFMA is distributed among processors by partitioning both clusters and samples of fields at each level. Due to the improved load-balancing, the hierarchical strategy offers a higher parallelization efficiency than previ...
A Power Control Game with Smooth Reduction of SINR Objectives Ozel, Omur; Uysal, Elif (2009-10-02) When rate expectations of users in a wireless network cannot all be satisfied, one choice is to discard some users from the system, in a mechanism called admission control. However, in a data network, users have a certain tolerance to occasional rate outages. In this paper we argue that it may be preferable for users to reduce their rate objectives smoothly, by considering an outage probability tolerance, rather than not be provided any service at all. We propose a distributed utility based algorithm for do...

Citation Formats

Y. ZHONG, B. Bhargava, Y. LU, and P. Angın, “A Computational Dynamic Trust Model for User Authorization,” IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, pp. 1–15, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/44692.