Impact Factor:6.549
 Scopus Suggested Journal: UNDER REVIEW for TITLE INCLUSSION

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Open Access and Multidisciplinary

Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed,Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

A Computational Dynamic Trust Model for User Authorization

K.S. Harika Hampi, Prof. C.Uma Shankar , Dr. S.Prem Kumar , ,
Pursuing M.Tech, CSE Branch,Dept of CSE
Registar Rastriya Sanskrit Vidyapeetha Tirupathi.Andhra Pradesh,India.
Professor & HOD, Department of computer science and engineering
G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.

Improvement of authorization process for protected information access by a large society of users in an open environment is an important problem in today’s 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 capability in different contexts and accounts for subjectivity in the evaluation of a particular trustee by different trusters. Many Model studies were conducted to evaluate the presentation of the proposed integrity belief model with other trust models from the creative writing for different user behavior patterns. Results showed that the proposed model resulted in higher performance than other models especially in predicting the behavior of unbalanced users.

K.S. Harika Hampi,Prof. C.Uma Shankar,Dr. S.Prem Kumar."A Computational Dynamic Trust Model for User Authorization". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.727-732, November- 2015, URL :,

Keywords : Authorization, security, trust, social-science

[1] G.R. Barnes and P.B. Cerrito, “A mathematical model for interpersonal relationships in social networks,” Social Networks, vol. 20, no. 2, pp. 179- 196, 1998.
 [2] R. Brent, Algorithms for Minimization Without Derivatives. Englewood Cliffs, NJ: Prentice-Hall, 1973. 
[3] A. Das, and M.M. Islam. “SecuredTrust: a dynamic trust computation model for secured communication in multiagent systems,” IEEE Trans. Dependable Sec. Comput., vol. 9, no. 2, pp. 261-274, 2012. 
[4] C. Dellarocas, “Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior,” in Proc. 2nd ACM Conference on Electronic Commerce, 2000, pp. 150- 157.
[5] L. Fan et al., “A grid authorization mechanism with dynamic role based on trust model,” Journal of Computational Information Systems, vol. 8, no. 12, pp. 5077-5084, 2012. 
[6] T. Grandison and M. Sloman, “A survey of trust in internet applications,” IEEE Communications Surveys, vol. 3, no. 4, pp. 2-16, 2000.
 [7] J.D. Hamilton, Time Series Analysis. Princeton, NJ: Princeton University Press, 1994. 
[8] J. Hu, Q. Wu, and B. Zhou, “FCTrust: A Robust and Efficient Feedback Credibility-Based Distributed P2P Trust Model,” In Proc. IEEE Ninth Int’l Conf. Young Computer Scientists (ICYCS ’08), 2008, pp. 1963-1968. 
[9] B. Lang, “A Computational Trust Model for Access Control in P2P,” Science China Information Sciences, vol. 53, no. 5, pp. 896-910, May, 2010.
[10] C. Liu and L. Liu, “A trust evaluation model for dynamic authorization,” In Proc. International Conference on Computational Intelligence and Software Engineering (CiSE), 2010, pp. 1-4. 
[11] X. Long, and J. Joshi, “BaRMS: A Bayesian Reputation Management Approach for P2P Systems,” Journal of Information & Knowledge Management, vol. 10, no. 3, pp. 341-349, 2011. 
[12]S. Ma and J. He, “A Multi-dimension dynamic trust evaluation model based on GA,” In Proc. 2nd International Workshop on Intelligent Systems and Applications, 2010, pp. 1-4. 
[13] S. Marsh, “Formalizing Trust as a Concept,” Ph.D. dissertation, Dept . Comp. Science and Math., Univ. Stirling, U.K., 1994. 
[14] P. Matt, M. Morge and F. Toni, “Combining Statistics and Arguments to Compute Trust,” In Proc. AAMAS, 2010, pp. 209-216.
 [15] D. McKnight, V. Choudhury and C. Kacmar, “Developing and validating trust measures for ecommerce: an integrative topology,” Information Systems Research, vol. 13, no. 3, pp. 334-359, September, 2002. [16] D. McKnight and N.L. Chervany, “Conceptualizing trust: a typology and e-commerce customer relationship model,” In Proc. HICSS-34, 2001.
 [17] W. Mendenhall and R.J. Beaver, Introduction to Probability and Statistics. Boston, MA: PWS-Kent Pub. Co., 1991. 
[18] A. Nagarajan and V. Varadharajan, “Dynamic trust enhanced security model for trusted platform based services,” Future Generation Computer Systems, vol. 27, pp. 564-573, 2011. 
[19] J.M. Pujol, R. Sangesa and J. Delgado, “Extracting reputation in multi agent systems by means of social network topology,” In Proc. AAMAS, 2002, pp. 467-474. 
[20] J. Sabater and C. Sierra, “Social ReGreT, a reputation model based on social relations,” ACM SIGecom Exchanges, vol. 3, no. 1, pp. 44-56, 2002. 
[21] F. Skopik, D. Schall and S. Dustdar, “Modeling and mining of dynamic trust in complex serviceoriented systems,” Information Systems, vol. 35, pp. 735-757, 2010. 
[22] F.E. Walter, S. Battiston and F. Schweitzer, “Personalized and Dynamic Trust in Social Networks,” In Proc. ACM Conference on Recommender Systems (RecSys’09), 2009, pp. 197- 204. 
[23] X. Wang and L. Wang, “P2P Recommendation Trust Model,” In Proc. IEEE Eighth Int’l Conf. Intelligent Systems Design and Applications (ISDA ’08), 2008, pp. 591-595. 
[24] B. Yu and M.P. Singh, “An evidential model of distributed reputation management,” In Proc. AAMAS, 2002, pp. 294-301. 
[25] Y. Zhang, S. Chen and G. Yang, “SFTrust: A Double Trust Metric Based Trust Model in Unstructured P2P Systems,” In Proc. IEEE Int’l Symp. Parallel and Distributed Processing (ISPDP ’09), 2009, pp. 1-7.


Download :

Refbacks : Currently there are no Refbacks


Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors. 

News & Events

Latest issue :Volume 10 Issue 1 Articles In press

A plagiarism check will be implemented for all the articles using world-renowned software. Turnitin.

Digital Object Identifier will be assigned for all the articles being published in the Journal from September 2016 issue, i.e. Volume 3, Issue 9, 2016.

IJCERT is a member of the prestigious.Each of the IJCERT articles has its unique DOI reference.
DOI Prefix : 10.22362/ijcert

IJCERT is member of The Publishers International Linking Association, Inc. (“PILA”)

Emerging Sources Citation Index (in process)

IJCERT title is under evaluation by Scopus.

Key Dates

☞   LAST DATE OF SUBMISSION : 31st March 2023
In 7 Days

Important Announcements

All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.

Citation Index

Citations Indices All
Citations 1026
h-index 14
i10-index 20
Source: Google Scholar

Acceptance Rate (By Year)

Acceptance Rate (By Year)
Year Rate
2021 10.8%
2020 13.6%
2019 15.9%
2018 14.5%
2017 16.6%
2016 15.8%
2015 18.2%
2014 20.6%

Important Links

Conference Proposal