2010
DOI: 10.1016/j.jnca.2010.03.010
|View full text |Cite
|
Sign up to set email alerts
|

Advanced mobile agent security models for code integrity and malicious availability check

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 26 publications
(14 citation statements)
references
References 16 publications
0
14
0
Order By: Relevance
“…Cryptographic protocol generally runs in closed network domain where at least information regarding nature of the network is known (Chen et al, 2010) and the behaviours of the hosts and the agents running on the host can be monitored. Venkatesan et al (2010) proposed an advanced models to improve the efficiency of the existing Malicious Identification Police (MIP) model for scanning the incoming agent to detect the malicious intent and to restrain the attendance of vulnerabilities in the existing Root Canal algorithm for code integrity checks. They extended the MIP model with the policy to uniquely identify the agent owners in the distributed environment.…”
Section: Background and Related Workmentioning
confidence: 99%
“…Cryptographic protocol generally runs in closed network domain where at least information regarding nature of the network is known (Chen et al, 2010) and the behaviours of the hosts and the agents running on the host can be monitored. Venkatesan et al (2010) proposed an advanced models to improve the efficiency of the existing Malicious Identification Police (MIP) model for scanning the incoming agent to detect the malicious intent and to restrain the attendance of vulnerabilities in the existing Root Canal algorithm for code integrity checks. They extended the MIP model with the policy to uniquely identify the agent owners in the distributed environment.…”
Section: Background and Related Workmentioning
confidence: 99%
“…Each host c i , where 1 < i ≤ n sends an acknowledgment to guard. A variant of this model is discussed in [17]. …”
Section: Modelmentioning
confidence: 99%
“…Each host c i , where 1 < i ≤ n sends an acknowledgment to guard. A variant of this model is discussed in [14]. …”
Section: Guard Algorithmmentioning
confidence: 99%