CN103490992A - Instant messaging worm detection method - Google Patents

Instant messaging worm detection method Download PDF

Info

Publication number
CN103490992A
CN103490992A CN201310470865.XA CN201310470865A CN103490992A CN 103490992 A CN103490992 A CN 103490992A CN 201310470865 A CN201310470865 A CN 201310470865A CN 103490992 A CN103490992 A CN 103490992A
Authority
CN
China
Prior art keywords
worm
characteristic
instant messaging
mahalanobis distance
detection method
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201310470865.XA
Other languages
Chinese (zh)
Other versions
CN103490992B (en
Inventor
郭薇
周翰逊
张国栋
贾大宇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Taiyu Information Technology Co ltd
Shenzhen Pengbo Information Technology Co ltd
Original Assignee
Shenyang Aerospace University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenyang Aerospace University filed Critical Shenyang Aerospace University
Priority to CN201310470865.XA priority Critical patent/CN103490992B/en
Publication of CN103490992A publication Critical patent/CN103490992A/en
Application granted granted Critical
Publication of CN103490992B publication Critical patent/CN103490992B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention relates to the field of information security technology, in particular to an instant messaging worm detection method. The instant messaging worm detection method comprises two steps that firstly, the behaviors of an ordinary user and instant messaging worm behaviors are distinguished at a learning stage through a characteristic function, and secondly, the similarity between current network flow and learning data is calculated through the simple mahalanobis distance at a detection stage. In order to achieve the purpose that a detection mechanism is not sensitive to a web site access pattern, the similarity is calculated through a parameter-free CUSUM algorithm, and an alarm is generated when the distance of novel network flow exceeds the permitted distance set by the algorithm.

Description

The instant messaging Worm detection method
Technical field
The present invention relates to field of information security technology, is a kind of detection method for detection of the instant messaging worm specifically.
Background technology
Instant messaging (IM) service is very welcome, has the user who counts in necessarily in whole the Internet as a kind of instant exchange way.Many popular systems, as MSN Messenger (the Windows Messenger in Windows XP), the courier of Yahoo (YIM), AOL Instant Messenger (AIM), and Tencent QQ has changed the exchange way that we and friend, acquaintance and business are worked together.Yet the leak existed in instant communication client forms great security challenge.
The instant messaging worm is wide-scale distribution in instant communication network, by utilizing IM client and protocol bug, and a safety problem causing of instant message service.When instant communication worm operation, it is usually located at instant communication client, and attempts oneself to send to all friends and infected user.Some worm utilizes common engine to send information, inveigles the addressee to receive worm operation copy.Some IM worm even can exchange recipient's note and analyze their reply.Many IM worm examples are arranged at present as Chock, SoFunny, JS Menger.
The IM worm is different from periodic scanning virus and e-mail worm.Although the researcher has made great efforts to understand and contain the breeding of scanning worm and e-mail worm very much, because these researchs of different infection mechanisms are not to be well suited for the IM worm.The people such as M.Williamson apply the inhibition technology to slow down the propagation of worm to the instant messaging worm.But the method may postpone effective communication and limit too many IM user to allow to only have new contact person/sky etc.
Summary of the invention
For above shortcomings part in prior art, the technical problem to be solved in the present invention is to provide a kind of instant messaging Worm detection method.
The present invention adopts following technical scheme:
A kind of instant messaging Worm detection method, for communication server, comprises the following steps:
1) learning phase, by the behavioural characteristic of worm on the data analysis network that infects worm on network, is analyzed the behavioral data of normal users by characteristic function, deposits in database;
2) the detection-phase detection module is accepted the new data by gateway and is adopted the similarity of characteristic function in the database in simple mahalanobis distance and step 1) to be contrasted, and then judges new data and whether be subject to invermination.
Further, simple mahalanobis distance computing formula is:
d ( x , y ‾ ) = Σ i = 0 m - 1 ( ( x i - y i ‾ ) + ) 2 σ i 2 - - - ( 6 )
Wherein,
Figure BDA0000393174010000022
for simple mahalanobis distance, the number that m is characteristic function, x ifor i characteristic value of new data, y ifor i characteristic value of learning phase data,
Figure BDA0000393174010000023
for i mean eigenvalue of learning phase, x is the new data characteristic vector, and y is the learning phase averaged feature vector, be the variance of i characteristic value, calculate the simple mahalanobis distance of new data
Figure BDA0000393174010000025
with { X n, n=1,2,3 ... mean simple mahalanobis distance sequence, and n means the time interval here, simple mahalanobis distance is larger, means that the probability of invermination is larger.
Further, adopt non-parametric CUSUM to make detection algorithm insensitive to the site access pattern: at first not losing under any characteristic { X n, n=1,2,3 ... be transformed into another random sequence { Z n, n=1,2,3 ..., make all Z nin negative value can not accumulate in time, the definition Z nas follows:
Z n=X n-β (11)
Parameter beta is a constant, and for specific network condition, it contributes to produce { a Z of the random sequence with negative value n, n=1,2,3 ..., the recurrence condition is as follows:
y n=(y n-1+Z n) +
y 0=0 (12)
Wherein as (y n-1+ Z n) 0 o'clock, (y n-1+ Z n) +equal (y n-1+ Z n), otherwise be 0, y nlarger, show that attack is stronger, wherein y ntest statistics, y nmean X naccumulation on the occasion of;
y n = S n - min 1 < &kappa; < n S k - - - ( 13 )
Wherein,
Figure BDA0000393174010000031
initial S 0=0;
Decision function is expressed as: d N ( y n ) = 0 , y n &le; N ; 1 , y n > N . (14)
Wherein, N represents worm detection threshold, d n(y n) be illustrated in the judgement of time n, inspection statistics y nbe greater than N, d n(y n) be 1, mean to have to attack to occur, otherwise d n(y n) be 0, mean normally operation.
Further, in order to calculate simple mahalanobis distance, adopt incremental learning Pleistocene series evaluation to keep the correctness of statistics, establish E ibe a characteristic value of i sample, set three variablees (E, ω, n),
Figure BDA0000393174010000041
n is historical sample length, and when observing new sample, ternary is updated suc as formula (7), (8) and (9):
E = E + e n + 1 - E n + 1 - - - ( 7 )
&omega; = &omega; + e n + 1 2 - - - ( 8 )
n=n+1 (9)
Sample variance is calculated as suc as formula (10):
&sigma; 2 = &omega; - n * E 2 n - 1 - - - ( 10 ) .
Further, described characteristic function is: characteristic function URL ():
URL ( ) = Max &ForAll; URL &Element; U Count ( URL ) , U &NotEqual; 0 0 , U = &Phi; - - - ( 1 )
The U here is the URL that the user sets transmission;
Characteristic function Filereq ():
Filereq ( ) = Max &ForAll; a &Element; A Count ( a ) , A &NotEqual; &Phi; 0 , A = &Phi; - - - ( 2 )
Here A is the file size that the user sets transmission;
Characteristic function IPAder ():
IPAddr()=Number of distinct IP address (3)。
The present invention has following advantage and beneficial effect:
At first the present invention passes through characteristic function at learning phase, distinguishes the difference of behavior and the behavior of instant messaging worm of domestic consumer.Then, carry out the Sampling network worm by simple mahalanobis distance.In order to make the insensitivity of testing mechanism to the site access pattern, adopted non-parametric CUSUM, when the distance of new data surpassed permission that algorithm sets apart from the time generate alarm.The digital proof of collecting from the university instant communication server validity of this inventive method.
Adopt device of the present invention to be arranged in gateway, take the 1GHz Pentium III as basic machine.Every through 10 seconds in data centralization, the CPU time that record data process part is required.In 99% sample, within the CPU time less than 2 seconds, can process the packet of 10 seconds.In addition, the required maximum duration of any ten sample process in second is less than four second CPU time.All sample service rates have surpassed the arrival rate of flow.This shows that the real-time performance of the inventive method has surpassed 10 seconds running fire flows of a catenet.
The accompanying drawing explanation
Fig. 1 is that emulation IM worm is propagated by send network address in text message, (a) has shown the situation of change of test statistics after characteristic function situation of change, (b) introduce the IM worm;
Fig. 2 propagates and has shown test statistics y after characteristic function situation of change, (b) introduce the IM worm by Transmit message for having shown emulation IM worm nsituation of change.
Embodiment
Below in conjunction with drawings and Examples, the present invention is described in detail:
A kind of instant messaging Worm detection method, for communication server, the checkout gear of the method place main body is arranged on the gateway of communication server, and the data by gateway are detected, and comprises the following steps:
The step 1) learning phase is by worm behavioural characteristic on the data analysis network that infects worm on network,, deposit in database;
It is in order to work or amusement that typical user uses instant communicating system.He/her exchanges daily life with other people.As if it has nothing special, but it discloses important characteristics: the user may only exchange with several individuals over a period to come.On the contrary, the instant messaging worm is extensive widespread as far as possible, usually by the trustship worm code of transmission or the URL of file website.Therefore, can from normal behavior, distinguish the behavior of instant messaging worm.But, after loading the worm code, the IM worm will send the message language of a malice network address to different users.So can infer, this network address sends ratio will be increased.Defined function Count (x) is used identical x value and a user communication for the different user of quantity.For example, if a user sends www.google.com to four different friends in contact list, at this moment Count (www.google.com) just equals four.For portraying this feature, defined feature function URL () is suc as formula (1).
URL ( ) = Max &ForAll; URL &Element; U Count ( URL ) , U &NotEqual; 0 0 , U = &Phi; - - - ( 1 )
The U here is the URL that the user sets transmission.
Another kind of more common infection character is that victim's Transmit message size is all identical with content.In fact, these files are exactly the instant messaging worm.For describing this feature, the characteristic function of defined file Forward-reques, suc as formula (2).
Filereq ( ) = Max &ForAll; a &Element; A Count ( a ) , A &NotEqual; &Phi; 0 , A = &Phi; - - - ( 2 )
Here A is the file size that the user sets transmission
A plurality of friends over a period to come with a user communication.When the user uses MSN, they can select that friend or those friends to be linked up in contact list.Yet worm can attempt to propagate as far as possible soon, so it may contact with a large amount of friend in contact list, has so just departed from the normal users usage behavior.In contact list, an IP address can represent a friend, and defined feature function IPAder () describes these characteristics suc as formula (3).
IPAddr()=Number of distinct IP address(3)
Step 2) detection module is accepted the new data by gateway and is adopted the similarity of the characteristic function in simple mahalanobis distance and step 1) to be contrasted, and then judges new data and whether be subject to invermination.
Simple mahalanobis distance computing formula is:
d ( x , y &OverBar; ) = &Sigma; i = 0 m - 1 ( ( x i - y i &OverBar; ) + ) 2 &sigma; i 2 - - - ( 6 )
Wherein,
Figure BDA0000393174010000072
for simple mahalanobis distance, the number of the characteristic value that m is characteristic function, x ifor i characteristic value of new data, y ifor i characteristic value of training stage data,
Figure BDA0000393174010000073
for i mean eigenvalue of training stage, x is the new data characteristic vector, and y is the training stage averaged feature vector, be the variance of i characteristic value, calculate the simple mahalanobis distance of new data
Figure BDA0000393174010000075
simple mahalanobis distance is larger, means that the probability of invermination is larger.With { X n, n=1,2,3 ... mean simple mahalanobis distance sequence, now n means time span,
Mahalanobis distance is the most frequently used polynary anomaly statistics.Formula is described substantially is whether new sample is abnormal in the data of history learning.Calculate the data of New Observer and the distance that learning phase obtains data here.Distance is higher, is more likely just abnormal sign.
The definition of mahalanobis distance is suc as formula (4):
D ( x , y &OverBar; ) = ( x , y &OverBar; ) T C - 1 ( x , y &OverBar; ) - - - ( 4 )
Here x and y are two characteristic vectors, and each vector element is variable.X is new observational characteristic vector, and y is the averaged feature vector calculated in learning phase.C -1it is the inverse covariance Matrix C ij=Cov (y i, y j), y i, y ji and j characteristic value in the learning phase characteristic vector.
Suppose that feature is to add up independently, mahalanobis distance provides a process useful, from baseline, weighs current deviation.Therefore, covariance matrix C becomes on diagonal matrix and diagonal element for each characteristic value variance.Therefore, simple mahalanobis distance is suc as formula (5):
d ( x , y &OverBar; ) = &Sigma; i = 0 m - 1 ( x i - y &OverBar; i ) 2 &sigma; i 2 - - - ( 5 )
Here m is set to 3 (because three optional feature values are arranged).
When contacting by instant communicating system and friend, because busy study or active user are not necessarily used it always.Therefore, the characteristic function value may be lower than relevant mean value, and still, this does not also mean that it is abnormal.Therefore, this deviation should not be set as mahalanobis distance.Therefore, use formula (6) is calculated simple mahalanobis distance.
d ( x , y &OverBar; ) = &Sigma; i = 0 m - 1 ( ( x i - y i &OverBar; ) + ) 2 &sigma; i 2 - - - ( 6 )
Wherein as (y n-1+ Z n) 0 o'clock, (y n-1+ Z n) +equal (y n-1+ Z n), otherwise be 0.
In order to calculate simple mahalanobis distance, adopt incremental learning Pleistocene series evaluation keep statistics correctness, establish E ibe a characteristic value of i sample, set three variablees (E, ω, n),
Figure BDA0000393174010000091
n is historical sample length, and when observing new sample, ternary is updated suc as formula (7), (8) and (9):
E = E + e n + 1 - E n + 1 - - - ( 7 )
&omega; = &omega; + e n + 1 2 - - - ( 8 )
n=n+1 (9)
Wherein, in (7), (8), (9), the equal sign left side is the value of new samples, and the equal sign right side is the value of previous historical sample length.
Sample variance is calculated as suc as formula (10):
&sigma; 2 = &omega; - n * E 2 n - 1 - - - ( 10 ) .
In order to make the insensitivity of testing mechanism to the site access pattern, a kind of printenv Cumulative sum CUSUM method.
Adopt non-parametric CUSUM to make to detect insensitive to the site access pattern: at first not losing under any characteristic { X n, n=1,2,3 ... be transformed into another random sequence { Z n, n=1,2,3 ..., make all Z nin negative value can not accumulate in time, the definition Z nas follows:
Z n=X n-β (11)
Parameter beta is that for specific network condition, it contributes to produce { a Z of the random sequence with negative value to a constant n, n=1,2,3 ..., the recurrence condition is as follows:
y n=(y n-1+Z n) +
y 0=0 (12)
(y wherein n-1+ Z n)+as (y n-1+ Z n) 0 equal (y n-1+ Z n), otherwise be 0, y nlarger, show that attack is stronger, wherein y ntest statistics, y nmean X naccumulation on the occasion of;
y n = S n - min 1 < &kappa; < n S k - - - ( 13 )
Wherein,
Figure BDA0000393174010000101
initial S 0=0;
Decision function is expressed as:
d N ( y n ) = 0 , y n &le; N ; 1 , y n > N . - - - ( 14 )
Wherein, N represents worm detection threshold, d n(y n) be illustrated in the judgement of time n, inspection statistics y nbe greater than N, d n(y n) be 1, mean to have to attack to occur, otherwise d n(y n) be 0, mean normally operation.
β is taken as 3 in the present invention.
Embodiment
Verified the inventive method by simulated environment.Collected 521 user data sets of certain university's communication server (the instant messaging service is only applicable in campus) and data have been divided into to two parts as study and classification and Detection.Wherein, 80% data are used as training data, and all the other are 20% for being mixed with IM worm attack data and being used for detecting the IM worm, and IM worm data are random mixing.In addition, the website information of the file of every 5 minutes simulation instant messaging worms in text message or transmission is to the friend in online contact list.
For normal discharge:
Owing to being busy with work or arduous research, the user can be not all the time all with contact list in friend contact, particularly at midnight.Therefore, when corresponding characteristic function value much larger than zero the time.Result is as shown in table 1:
Table 1
characteristic μ σ 2
URL() 1.333312 0.420157
FileReq() 1.271003 0.236540
IPAddr() 2.600212 0.737141
When domestic consumer is used the IM service, several file transfer requests and network address are arranged in text message.In most of the cases, the user communicates with each other by text message.From result, also to see, URL () and FileReq () average are 1.333312 and 1.271003, corresponding variance is 0.420157 and 0.236540.This means, although the user sends the requirement of network address or file transfer in text message, they send identical URL or the file friend different to one or two usually.The mean value of IPAddr () and variance are 2.600212 and 0.73714.
After increasing instant messaging worm flow, worm detects:
As shown in Figure 1, emulation IM worm is propagated by send network address in text message.(a) shown in the characteristic function situation of change.The value that is shown to URL () when there is no instant messaging worm flow is not more than the excursion from 0 to 3 of 1, IPAddr () value.Yet, as (b) shows that after introducing the IM worm URL's () and IPAddr () value approaches 10 to the peak variation suddenly.Do not change the value of FileReq ().Therefore, the IM worm can detect in the unit interval after outburst.
Fig. 2 has shown that emulation IM worm propagates by Transmit message.(a) shown FileReq () value be not more than 1 and IPAddr () value excursion from 0 to 3 do not increase IM worm flow.Yet FileReq () value and IPAddr () value are different from normal value after introducing the IM worm.They change and to exceed 7 and reach their peak 15.FileReq () value is 0 always.Therefore, (b) show that this method, after introducing the IM worm, detects in the unit interval after outburst.
Carried out same test 100 times repeatedly.Result is similar, negative value do not occur.
To adopt device of the present invention to be arranged in gateway, take the 1GHz Pentium III as basic machine.Every through 10 seconds in data centralization, the CPU time that record data process part is required.In 99% sample, within the CPU time less than 2 seconds, can process the packet of 10 seconds.In addition, the required maximum duration of any ten sample process in second is less than four second CPU time.All sample service rates have surpassed the arrival rate of flow.This shows that the real-time performance of the inventive method has surpassed 10 seconds running fire flows of a catenet.

Claims (5)

1. an instant messaging Worm detection method, for communication server, is characterized in that, comprises the following steps:
1) learning phase, by the behavioural characteristic of worm on the data analysis network that infects worm on network, is analyzed the behavioral data of normal users by characteristic function, deposits in database;
2) configuration detection module in gateway, the detection-phase detection module is accepted by the new data of gateway and is adopted the similarity of value of the characteristic function of the database learning in simple mahalanobis distance and step 1) to be contrasted, and then judges new data and whether be subject to invermination.
2. according to instant messaging Worm detection method claimed in claim 1, it is characterized in that,
Simple mahalanobis distance computing formula is:
d ( x , y &OverBar; ) = &Sigma; i = 0 m - 1 ( ( x i - y i &OverBar; ) + ) 2 &sigma; i 2 - - - ( 6 )
Wherein,
Figure FDA0000393174000000012
for simple mahalanobis distance, the number that m is characteristic function, x ifor i characteristic value of new data, y ifor i characteristic value of learning phase data,
Figure FDA0000393174000000013
for i mean eigenvalue of learning phase, x is the new data characteristic vector, and y is the learning phase averaged feature vector,
Figure FDA0000393174000000014
be the variance of i characteristic value, calculate the simple mahalanobis distance of new data
Figure FDA0000393174000000015
with { X n, n=1,2,3 ... mean simple mahalanobis distance sequence, and n means the time interval here, simple mahalanobis distance is larger, means that the probability of invermination is larger.
3. according to instant messaging Worm detection method claimed in claim 2, it is characterized in that, adopt non-parametric CUSUM to make detection algorithm insensitive to the site access pattern: at first not losing under any characteristic { X n, n=1,2,3 ... be transformed into another random sequence { Z n, n=1,2,3 ..., make all Z nin negative value can not accumulate in time, the definition Z nas follows:
Z n=X n-β (11)
Parameter beta is a constant, and for specific network condition, it contributes to produce { a Z of the random sequence with negative value n, n=1,2,3 ..., the recurrence condition is as follows:
y n=(y n-1+Z n) +
y 0=0 (12)
Wherein, as (y n-1+ Z n) 0 o'clock, (y n-1+ Z n) +equal (y n-1+ Z n), otherwise be 0, y nlarger, show that attack is stronger, wherein y ntest statistics, y nmean X naccumulation on the occasion of;
y n = S n - min 1 < &kappa; < n S k - - - ( 13 )
Wherein,
Figure FDA0000393174000000021
initial S 0=0;
Decision function is expressed as: d N ( y n ) = 0 , y n &le; N ; 1 , y n > N . - - - ( 14 )
Wherein, N represents worm detection threshold, d n(y n) be illustrated in the judgement of time n, inspection statistics y nbe greater than N, d n(y n) be 1, mean to have to attack to occur, otherwise d n(y n) be 0, mean normally operation.
4. according to instant messaging Worm detection method claimed in claim 2, it is characterized in that, in order to calculate simple mahalanobis distance, adopt incremental learning Pleistocene series evaluation to keep the correctness of statistics, establish E ibe a characteristic value of i sample, set three variablees (E, ω, n), n is historical sample length, and when observing new sample, ternary is updated suc as formula (7), (8) and (9):
E = E + e n + 1 - E n + 1 - - - ( 7 )
&omega; = &omega; + e n + 1 2 - - - ( 8 )
n=n+1 (9)
Sample variance is calculated as suc as formula (10):
&sigma; 2 = &omega; - n * E 2 n - 1 - - - ( 10 ) .
5. according to instant messaging Worm detection method claimed in claim 1, it is characterized in that, described characteristic function is: characteristic function URL ():
URL ( ) = Max &ForAll; URL &Element; U Count ( URL ) , U &NotEqual; 0 0 , U = &Phi; - - - ( 1 )
The U here is the URL that the user sets transmission;
Characteristic function Filereq ():
Filereq ( ) = Max &ForAll; a &Element; A Count ( a ) , A &NotEqual; &Phi; 0 , A = &Phi; - - - ( 2 )
Here A is the file size that the user sets transmission;
Characteristic function IPAder ():
IPAddr()=Number of distinct IP address (3)。
CN201310470865.XA 2013-10-10 2013-10-10 Instant messaging Worm detection method Active CN103490992B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310470865.XA CN103490992B (en) 2013-10-10 2013-10-10 Instant messaging Worm detection method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310470865.XA CN103490992B (en) 2013-10-10 2013-10-10 Instant messaging Worm detection method

Publications (2)

Publication Number Publication Date
CN103490992A true CN103490992A (en) 2014-01-01
CN103490992B CN103490992B (en) 2016-10-19

Family

ID=49830963

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310470865.XA Active CN103490992B (en) 2013-10-10 2013-10-10 Instant messaging Worm detection method

Country Status (1)

Country Link
CN (1) CN103490992B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104219225A (en) * 2014-07-31 2014-12-17 珠海市君天电子科技有限公司 Worm virus detection and prevention method and system

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101496025A (en) * 2005-12-13 2009-07-29 约吉安全系统公司 System and method for providing network security to mobile devices
CN102457525A (en) * 2011-12-19 2012-05-16 河海大学 Load-based anomaly intrusion detection method and system

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101496025A (en) * 2005-12-13 2009-07-29 约吉安全系统公司 System and method for providing network security to mobile devices
CN102457525A (en) * 2011-12-19 2012-05-16 河海大学 Load-based anomaly intrusion detection method and system

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
KE WANG等: "Anomalous Payload-based Netowrk Intrusion Detection", 《RECENT ADVANCES IN INTRUSION DETECTION》 *
周翰逊: "网络蠕虫传播模型及检测技术研究", 《中国博士学位论文全文数据库 信息科技辑(2011年)》 *
周翰逊等: "一种混合的网络蠕虫检测方法", 《小型微型计算机系统》 *
赵彬彬: "IM蠕虫检测方案的设计与实现", 《计算机工程》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104219225A (en) * 2014-07-31 2014-12-17 珠海市君天电子科技有限公司 Worm virus detection and prevention method and system
CN104219225B (en) * 2014-07-31 2020-04-03 珠海豹趣科技有限公司 Detection and defense method and system for worm virus

Also Published As

Publication number Publication date
CN103490992B (en) 2016-10-19

Similar Documents

Publication Publication Date Title
Van Der Heijden et al. Cognitive triaging of phishing attacks
Zhang et al. Textual and visual content-based anti-phishing: a Bayesian approach
Lakshmi et al. Efficient prediction of phishing websites using supervised learning algorithms
Panda et al. Network intrusion detection using naive bayes
Kagan et al. Generic anomalous vertices detection utilizing a link prediction algorithm
Khonji et al. Enhancing phishing e-mail classifiers: A lexical url analysis approach
Saadat Survey on spam filtering techniques
Barberá et al. How to use social media data for political science research
Li et al. Modeling and performance analysis of information diffusion under information overload in Facebook‐like social networks
Wang Machine learning for the detection of spam in twitter networks
Qabajeh et al. An experimental study for assessing email classification attributes using feature selection methods
Singh et al. Detection and differentiation of application layer DDoS attack from flash events using fuzzy‐GA computation
Folorunso et al. Ca-NIDS: A network intrusion detection system using combinatorial algorithm approach
David et al. Zero day attack prediction with parameter setting using Bi direction recurrent neural network in cyber security
Juvonen et al. An efficient network log anomaly detection system using random projection dimensionality reduction
Lota et al. A systematic literature review on sms spam detection techniques
Li et al. Chassis: Conformity meets online information diffusion
Woo et al. An event-driven SIR model for topic diffusion in web forums
Rezvani et al. A randomized reputation system in the presence of unfair ratings
Pandey et al. Text and data mining to detect phishing websites and spam emails
Okolica et al. Using PLSI-U to detect insider threats by datamining e-mail
Ahmed et al. A framework for phishing attack identification using rough set and formal concept analysis
CN103490992A (en) Instant messaging worm detection method
Mathur et al. Dynamic SEIZ in online social networks: epidemiological modeling of untrue information
Chen et al. Detecting spam on Twitter via message-passing based on retweet-relation

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20190926

Address after: Room 509, Building 508 Chundong Road, Minhang District, Shanghai 201108

Patentee after: SHANGHAI TAIYU INFORMATION TECHNOLOGY CO.,LTD.

Address before: 518110 Building 1619, No. 3, Queshan Yunfeng Road, Gaofeng Community, Dalang Street, Longhua District, Shenzhen City, Guangdong Province

Patentee before: Shenzhen Pengbo Information Technology Co.,Ltd.

Effective date of registration: 20190926

Address after: 518110 Building 1619, No. 3, Queshan Yunfeng Road, Gaofeng Community, Dalang Street, Longhua District, Shenzhen City, Guangdong Province

Patentee after: Shenzhen Pengbo Information Technology Co.,Ltd.

Address before: 110136, Liaoning, Shenyang, Shenbei New Area moral South Avenue No. 37

Patentee before: Shenyang Aerospace University