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

Cryptographic Protocol Based Laurel System for Multi agent Distributed Communication

Sreedhar Jyothi, Dr. A. Damodar, , ,
JNTU, Ananthapur 2VC, SVU

In order to expedite detection of unfaithful and malicious agents, an agent recognition mechanism is proposed for multi agent communication, which is based on a laurel model and a cryptographic protocol. A laurel system for multi agent communication can be let down by a set of malicious agents. Such a group can maliciously raise the laurel of one or more agents of the group. There is no known method to protect a laurel system against swindler agent groups. So there is a need for false proof laurel management mechanism to avoid malicious agents providing false state of laurel. The modern systems that entertain multi-agent communication are more vulnerable to agents who behaves maliciously or simply do not cooperate. The lack of core level trusted third party in multi agent communication strategy postures distinctive issues for laurel management. These issues feature agent recognition strategy, dependable laurel maintenance. The disadvantage of the existing system is the laurel of the agent that responds to a request is considered but the credibility of the agent that attempts to update the laurel of the other agent is ignored. This proposal aims to devise a model to encapsulate the laurel of both the agent that respond and the agent that request. The proposed protocol reduces the number of malicious transactions. It also manages the issue of highly inconsistent accessibility pattern of the agents in multi agent communication based systems.

Sreedhar Jyothi ," Cryptographic Protocol Based Laurel System for Multi agent Distributed Communication”, International Journal of Computer Engineering In Research Trends, Volume 3, Issue 9, September-2016, pp. 500-505

Keywords : Cryptography, Reputation Models, E-commerce, Trusted Models, Distributed Communication, Blind fold strategy, quality of service

[1] J.M. Vidal and E.H. Durfee, ‚The impact of Nested Agent
Models in an Information Economy‛, Second Int. Conf. on
Multi-Agent Systems, 377-384, 1996.
[2] J. Sabater, ‚Trust and Reputation for Agent Societies‛, Phd
Thesis, Universitat Autnoma de Barcelona, 2003.
[3] S. Sen and N. Sajja, ‚Robustness of Reputation-based Trust:
Boolean Case‛, Proc. of the First Int. Joint Conf. on
Autonomous Agents and Multiagent Systems (AAMAS-02),
Bologna, Italy, 288–293, 2002.
[4] M. Wooldridge, An Introduction to MultiAgent Systems,
Chichester: John Wiley and Sons, 2002.
[5] T. Tran and R. Cohen, ‚Learning Algorithms for Software
Agents in Uncertain and Untrusted Market Environments‛,
Proc. of the Eighteenth Int. Joint Conf. on Artificial
Intelligence, 2003.
[6] B. Krulwich, ‚The Bargainfinder Agent: Comparision Price
Shopping on the Internet‛, Bots, and other Internet Beasties, J.
Williams (Ed.), 257-263, Macmillan Computer Publishing,
[7] R. Till, ‚Transforming the way we do business‛, In: Electronic
Commerce, T.Nash, editor, 9-12, Kogan Page, London, UK,
[8] M. He, N. R. Jennings, and H. Leun. "On Agent-Mediated
Electronic Commerce" IEEE Trans on Knowledge and Data
Engineering, Vol. 15(4) 985-1003, 2003.
[9] S. D. Ramchurn, T. D. Huynh, and N. R. Jennings, ‚Trust in
Multi-Agent systems‛, The Knowledge Engineering Review,
Vol. 19(1), 1-25, 2004.
[10] K. Regan, T. Tran, and R. Cohen, ‚Sharing Models of Sellers
amongst Buying Agents in Electronic Marketplaces‛,
Decentralized Agent Based and Social Approaches to User
Modelling (DASUM), July 2005.
[11] R. Jurca, and Faltings, B. (2003). ‚Towards IncentiveCompatible
Reputation Management‛, In: Trust, reputation
and security: theories and practice, Lecture Notes in AI, R.
Falcone, S. Barber, L. Korba, & M. Singh, (Eds.), SpringerVerlag,
Vol. 2631, 138–147, 2003.
[12] T. Tran, ‚Reputation-Oriented Reinforcement Learning
Strategies for Economically-Motivated Agents in Electronic
Market Environment‛, Ph.D. Dissertation, University of
Waterloo, 2003.
[13] K. Regan, and R. Cohen, ‚A Model of Indirect Reputation
Assessment for Adaptive Buying Agents in Electronic
Markets‛, Business Agents and the Semantic Web
(BASeWEB), May 2005.
[14] R.H. Guttman and P. Maes, ‚Agent-mediated Electronic
Commerce: A Survey‛, The Knowledge Engineering Review,
Vol. 13(2), 147-159, 1998.
[15] P. Maes, "Artificial Life Meets Entertainment: Life like
Autonomous Agents," Communications of the ACM, Vol.
38(11), 108-114, 1995.
[16] A. Abdul-Rahman and S. Hailes, ‚Supporting Trust in Virtual
Communities‛, Proc. Hawaii International Conference on
System Sciences, Maui, Hawaii, 2000.
[17] C. Dellarocas, ‚Towards Incentive-compatible Reputation
Management‛, Workshop on Deception, Fraud and Trust in
Agent Societies, Bologna, Italy, 26–40, 2002.
[18] M. Wooldridge and N. Jennings, ‚Intelligent Agents: Theory
and Practice‛, The Knowledge Engineering Review, Vol.
10(2), 115-152, 1995.
[19] EBay, .
[20] R.B Doorenbos, O. Etzioni, and D. Weld, ‚A Scalable
Comparison-Shopping Agent for the World Wide Web‛, First
Int. Conf. on Autonomous Agents, 39- 48, 1997.
[21] P. Maes, R.H. Guttman, and A.G. Moukas, ‚Agents that Buy
and Sell‛, Communications of the ACM, Vol. 42(3), 81-91,
[22] B. Esfandiari and S. Chandrasekharan, ‚On How Agents
Make Friends: Mechanisms for Trust Acquisition‛, Proc. of
the Fifth Int. Conf. on Autonomous Agents Workshop on
Deception, Fraud and Trust in Agent Societies, 27-34, 2001.
[23] J. Carbo, J. Molina, and J. Davila, ‚Comparing Predictions of
SPORAS vs. a Fuzzy Reputation Agent System‛, Third Int .l
Conf. on Fuzzy Sets and Fuzzy Systems, Interlaken, 147–153,
[24] D. Huynh, N.R. Jennings, and N.R. Shadbolt, ‚Developing an
Integrated Trust and Reputation Model for Open Multi-Agent
Systems‛, Proc. of 7th Int. Workshop on Trust in Agent
Societies, 65-74, New York, USA, 2004.
[25] Amazon, .
[26] C. Goldman, S. Kraus, and O. Shehory, ‚Equilibria Strategies
for Selecting Sellers and Satisfying Buyers,‛ In: Lecture Notes
in Artificial Intelligence, M. Klusch and F. Zambonelli (Eds.),
Springer, Vol. 2182, 166-177, 2001.
[27] J. Carter, E. Bitting, and A. Ghorbani, ‚Reputation
Formalization for an Information-Sharing Multi-Agent
System‛, Computational Intelligence, Vol. 18(2), 515–534,
[28] T.D. Huynh, N.R. Jennings, and N.R. Shadbolt, ‚An
Integrated Trust and Reputation Model for Open Multi-Agent
Systems‛, Autonomous Agents and Multi-Agent Systems,
Vol. 13(2), 119-154, Sep. 2006.
[29] S. Marsh, ‚Formalizing Trust as a Computational Concept‛,
Ph.D. Thesis, Department of Mathematics and Computer
Science, University of Stirling, 1994.
[30] B. Yu and M.P. Singh, ‚A Social Mechanism of Reputation
Management in Electronic Communities‛, Cooperative
Information Agents (CIA), Vol. 24, 154-165, Boston, USA,
[31] T. Grandison, and M. Sloman, ‚A Survey of Trust in Internet
Application‛, IEEE Communications Surveys, Vol. 4(4), 2-16,
[32] Y. Mass, and O. Shehory, ‚ Distributed Trust in Open MultiAgent
Systems‛, In: Trust in cyber-societies, R. Falcone, M.
Singh, & Y. Tan, (Eds.), Springer-Verlag, 159–173, 2001.
[33] C. Castelfranchi, and R. Falcone, ‚Principles of Trust for MAS:
Cognitive Anatomy, Social Importance, and Quantification‛,
Proc. of the Intel Conf. on Multi-Agent Systems (ICMAS’98),
Paris, France, 72–79, 1998.
[34] A. Greenwald and J. Kephart, ‚Shopbots and Pricebots‛, Proc.
of the Sixteenth Int. Joint Conf . on Artificial Intelligence, Vol.
1, 506-511, 1999
[35] G. Zacharia and P. Maes, ‚Trust Management through
Reputation Mechanisms‛, Applied Artificial Intelligence, Vol.
14(9), 881-907, 2000
[36] A. Chavez and P. Maes, ‚Kasbah: An Agent Marketplace for
Buying and Selling Goods‛, First Int. Conf. on the Practical
Application of Intelligent Agents and Multi-Agent
Technology, London, UK, 1996.
[37] J. Sabater and C. Sierra ‚ REGRET: A Reputation Model for
Gregarious Societies‛, Proc. of the Fifth Int. Conf. on
Autonomous Agents, Montreal, Canada, 194-195, 2001.
[38] T. Sandholm, ‚Distributed Rational Decision Making‛, In:
Multi-Agent Systems: A Modern Approach to Distributed
Artificial Intelligence, Weiss, G. (ed.), MIT Press, 1999.
[39] J. Sabater and C. Sierra, ‚Review on Computational Trust and
Reputation Models‛, Artificial Intelligence Review, Vol. 24(1),
33-60, 2005
[40] M. Schillo, M. Rovatsos, and P. Funk, ‚ Using Trust for
Detecting Deceitful Agents in Artificial Societies‛, Special
Issue of the Applied Artificial Intelligence Journal on
Deception, Fraud and Trust in Agent Societies, Vol.14(8), 825–
848, 2000.

DOI Link :

Download :

Refbacks : There are currently 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