• Title/Summary/Keyword: Secrete Words

Search Result 3, Processing Time 0.019 seconds

An Implementation of the Spam Mail Prevention System Using Reply Message with Secrete Words (비밀단어의 회신을 이용한 스팸메일 차단 시스템의 구현)

  • Ko Joo Young;Shim Jae Chang;Kim Hyun Ki
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.1
    • /
    • pp.111-118
    • /
    • 2005
  • This paper describes an implementation of the spam mail prevention system using reply message with secrete words. When user receives a new e-mail, the e-mail address is compared with the white e-mail addresses in database by the system. If user receives a new e-mail which does not exist in a white e-mail addresses database, a reply e-mail attached with secrete words is delivered automatically. And the system is compared with the white domains first for intranet environment. It speeds up processing time. proposed algorithm is required a small database and faster than the black e-mail addresses comparison. This system is implemented using procmail, PHP and IMAP on Linux and the user can manage the databases on the web.

  • PDF

A Technique of Watermark Generation and Similarity Embedding for Still Images Based on Cross Reference Points (교차참조점에 기반한 정지영상의 워터마크 생성 및 유사성 삽입 기법)

  • Lee, Hang-Chan
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.8
    • /
    • pp.1484-1490
    • /
    • 2007
  • The Cross Reference Point(CRP) is a robust method for finding salient points in watermarking systems because it is based on the geometrical structure of a normalized image in order to avoid pointing error caused by digital attacks. After normalization of an image, the 100 CRPs are calculated. Next, the 100 blocks centered by CRPS are formed. These 100 blocks are arranged using a secrete key. Each boundary of 50 out of 100 blocks is surrounded by 8 blocks which are selected by the ordered number of a preceding block. This number is a seed of random number generator for selecting 8 out of 50 blocks. The search area of a center block is formed by a secrete key. The pixels of a center block are quantized to 10 levels by predefined thresholds. The watermarks are generated by the 50 quantized center blocks. These watermarks are embedded directly in the remaining 50 blocks. In other words, 50 out of 100 blocks are utilized to generate watermarks and the remaining 50 blocks are used to watermark embedding. Because the watermarks are generated in the given images, we can successfully detect watermarks after several digital attacks. The reason is that the blocks for the generation and detection of watermarks are equally affected by digital attacks except for the case of local distortion such as cropping.

A fasrter Spam Mail Prevention Algorithm on userID based (userID 기반의 빠른 메일 차단 알고리즘)

  • 심재창;고주영;김현기
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.211-214
    • /
    • 2003
  • The problem of unsolicited e-mail has been increasing for years, so many researchers has studied about spam filtering and prevention. In this article, we proposed a faster spam prevention algorithm based on userID instead of full email address. But there are 2% of false-negatives by userID. In this case, we store those domains in a DB and filter them out. The proposed algorithm requires small DB and 3.7 times faster than the e-mail address comparison algorithm. We implemented this algorithm using SPRSW(Spam Prevention using Replay Secrete Words) to register userID automatically in userID DB.

  • PDF