Flexible pattern matching algorithm in Chinese strings

Presently the research on the security of network contents has faced the challenge of network breakthrough techniques. A popular Chinese network breakthrough technique is to jam malicious characters in key words, and/or replace the Chinese characters in key words with homonyms or homophones, or comp...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Chinese Control Conference s. 610 - 614
Hlavní autoři: Zhou Xueguang, Zhang Huanguo
Médium: Konferenční příspěvek
Jazyk:čínština
angličtina
Vydáno: IEEE 01.07.2008
Témata:
Algorithm design and analysis
Chinese strings
Electronic mail
flexible pattern Matching
Heuristic algorithms
Jamming
Pattern matching
Security
Security content
Software algorithms
ISSN:1934-1768
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Presently the research on the security of network contents has faced the challenge of network breakthrough techniques. A popular Chinese network breakthrough technique is to jam malicious characters in key words, and/or replace the Chinese characters in key words with homonyms or homophones, or complicated Chinese characters. With this method some malicious web pages make themselves escape from the network filtering and intrusion detection. While most existing pattern matching algorithms in Chinese strings cannot detect this kind of attacks. In this paper we give a formulized definition of flexible pattern matching in Chinese strings, and compare the classical algorithms for pattern matching in strings, and choose the prefix searching strategy to realize the flexible algorithms for pattern matching in single-pattern string and multi-pattern string. Our algorithm can match the Chinese strings jammed with malicious characters, and partially resolve the Chinese network breakthrough problem that other classical matching algorithms in string cannot solve.
ISSN:1934-1768
DOI:10.1109/CHICC.2008.4604947