Electrical computers and digital processing systems: multicomput – Computer conferencing – Demand based messaging
Reexamination Certificate
2011-04-05
2011-04-05
Thomas, Joseph (Department: 2492)
Electrical computers and digital processing systems: multicomput
Computer conferencing
Demand based messaging
C709S207000, C709S246000, C382S165000
Reexamination Certificate
active
07921159
ABSTRACT:
Computer-implemented methods, apparati, and computer-readable media for countering spam that disguises characters within an electronic message (1). A method embodiment of the present invention comprises locating (36) portions of an electronic message (1) where the difference between foreground color and background color is negligible; deleting (37) from the electronic message (1) foreground characters from said portions, to form a redacted electronic message; and forwarding (33) the redacted electronic message to a spam filter (23).
REFERENCES:
patent: 4758885 (1988-07-01), Sasaki et al.
patent: 4770534 (1988-09-01), Matsuki et al.
patent: 5675710 (1997-10-01), Lewis
patent: 5751847 (1998-05-01), Wuyts
patent: 5826249 (1998-10-01), Skeirik
patent: 5889885 (1999-03-01), Moed et al.
patent: 6023723 (2000-02-01), McCormick et al.
patent: 6052709 (2000-04-01), Paul
patent: 6072942 (2000-06-01), Stockwell et al.
patent: 6148102 (2000-11-01), Stolin
patent: 6161130 (2000-12-01), Horvitz et al.
patent: 6167434 (2000-12-01), Pang
patent: 6249807 (2001-06-01), Shaw et al.
patent: 6253169 (2001-06-01), Apte et al.
patent: 6282565 (2001-08-01), Shaw et al.
patent: 6289416 (2001-09-01), Fukushima et al.
patent: 6298351 (2001-10-01), Castelli et al.
patent: 6324569 (2001-11-01), Ogilvie et al.
patent: 6347310 (2002-02-01), Passera
patent: 6370526 (2002-04-01), Agrawal et al.
patent: 6397200 (2002-05-01), Lynch, Jr. et al.
patent: 6397215 (2002-05-01), Kreulen et al.
patent: 6421709 (2002-07-01), McCormick et al.
patent: 6424960 (2002-07-01), Lee et al.
patent: 6442606 (2002-08-01), Subbaroyan et al.
patent: 6456991 (2002-09-01), Srinivasa et al.
patent: 6487586 (2002-11-01), Ogilvie et al.
patent: 6493007 (2002-12-01), Pang
patent: 6502082 (2002-12-01), Toyama et al.
patent: 6505167 (2003-01-01), Horvitz et al.
patent: 6505256 (2003-01-01), York
patent: 6546416 (2003-04-01), Kirsch
patent: 6640301 (2003-10-01), Ng
patent: 6643685 (2003-11-01), Millard
patent: 6650890 (2003-11-01), Irlam et al.
patent: 6654787 (2003-11-01), Aronson et al.
patent: 6687740 (2004-02-01), Gough
patent: 6691156 (2004-02-01), Drummond et al.
patent: 6697942 (2004-02-01), L'Heureux
patent: 6701347 (2004-03-01), Ogilvie
patent: 6711608 (2004-03-01), Ogilvie
patent: 6732157 (2004-05-01), Gordon et al.
patent: 6748111 (2004-06-01), Stolin et al.
patent: 6757713 (2004-06-01), Ogilvie et al.
patent: 6757830 (2004-06-01), Tarbotton et al.
patent: 6809741 (2004-10-01), Bates et al.
patent: 6842773 (2005-01-01), Ralston et al.
patent: 6901163 (2005-05-01), Pearce et al.
patent: 7197539 (2007-03-01), Cooley
patent: 2002/0016735 (2002-02-01), Runge et al.
patent: 2002/0038308 (2002-03-01), Cappi
patent: 2002/0087641 (2002-07-01), Levosky
patent: 2002/0087649 (2002-07-01), Horvitz
patent: 2002/0113801 (2002-08-01), Reavy et al.
patent: 2002/0138525 (2002-09-01), Karadimitriou et al.
patent: 2002/0138581 (2002-09-01), MacIntosh et al.
patent: 2002/0147694 (2002-10-01), Dempsey et al.
patent: 2002/0147782 (2002-10-01), Dimitrova et al.
patent: 2002/0163527 (2002-11-01), Park
patent: 2002/0199186 (2002-12-01), Ali et al.
patent: 2002/0199194 (2002-12-01), Ali
patent: 2003/0033587 (2003-02-01), Ferguson et al.
patent: 2003/0149726 (2003-08-01), Spear
patent: 2003/0167311 (2003-09-01), Kirsch
patent: 2003/0191969 (2003-10-01), Katsikas
patent: 2003/0200334 (2003-10-01), Grynberg
patent: 2003/0220978 (2003-11-01), Rhodes
patent: 2003/0229672 (2003-12-01), Kohn
patent: 2003/0233415 (2003-12-01), Beyda
patent: 2004/0003283 (2004-01-01), Goodman et al.
patent: 2004/0024823 (2004-02-01), Del Monte
patent: 2004/0054887 (2004-03-01), Paulsen et al.
patent: 2004/0064734 (2004-04-01), Ehrlich
patent: 2004/0068534 (2004-04-01), Angermayr et al.
patent: 2004/0073617 (2004-04-01), Milliken et al.
patent: 2004/0093383 (2004-05-01), Huang et al.
patent: 2004/0093384 (2004-05-01), Shipp
patent: 2004/0111480 (2004-06-01), Yue
patent: 2004/0148358 (2004-07-01), Singh et al.
patent: 2004/0167964 (2004-08-01), Rounthwaite et al.
patent: 2004/0205173 (2004-10-01), Hall
patent: 2004/0221062 (2004-11-01), Starbuck et al.
patent: 2005/0198160 (2005-09-01), Shannon et al.
Outlook.spambully.com web pages [online] Spam Bully [retrieved Jan. 16, 2003] Copyright 2002, Retrieved from the Internet <URL: http://outlook.spambully.com/about.php>.
outlook.spambully.com web pages [online]. Spam Bully [retrieved Jan. 16, 2003]. Copyright 2002. Retrieved from the Internet: <URL: http://outlook.spambully.com/about.php >.
cauce.org web pages [online]. Coalition Against Unsolicited Commercial Email [retrieved Mar. 17, 2003]. Retrieved from the Internet: <URL: http://www.cauce.org/about/problem.shtml>.
Wikipedia.org web pages (online). Wikipedia (retrieved Mar. 17, 2003). Retrieved from the Internet: <URL: http://www.wikipedia.org/w/wiki.phtml?title= Machine learning & printable=yes>.
NBEC/NWOCA Anti-Spam Tools, [online] [retrieved Jul. 7, 2004] retrieved from http://home.nwoca.org, Jul. 7, 2004.
Kularski, C. “Compound Procedures for Spam Control,” Highland School of Technology, Jan. 2004.
“Technical Responses to Spam,” Nov. 2003, Taughannock Networks.
Cranor, Faith, L., LaMacchia, Brian A., “Spam!” Communications of the ACM, vol. 41, No. 8, pp. 74-83, Aug. 1998. U.S.A.
How it Works:Spam Recognition, http://www.death2spam.net/docs/classifier.html, retrieved Aug. 18, 2005, U.S.A.
Cavnar, William B. et al., “N-Gram-Based Text Categorization”, Proceedings of SDAIR-94, 3rd Annual Symposium on Document Analysis and Information Retrieval, Las Vegas, NV., USA, Apr. 13, 1994.
“N-Gram-Based Text Categorization”, 2 pages, downloaded from http://citeseer.ist.psu.edu/68861.html, Aug. 25, 2005 U.S.A.
TextCat Language Guesser, 2 pages, downloaded from http:/odur.let.rug.nl/˜vannoord/Textcat/ on Aug. 25, 2005., U.S.A.
Spam Assassin, The Apache SpamAssasin Project, 2 pages, downloaded from http:/spamassasin.apache.org on Aug. 25, 2005, U.S.A.
Basis Technology's Rosette Language Identifier, 2 pages, downloaded from http:/www.basistech.com/language-identification/ on Aug. 25, 2005, U.S.A.
Karp-Rabin algorithm, 3 pages, downloaded from http:/www-igm.univ-mlv.fr/˜lecroq/string
ode5.html on Sep. 1, 2005, U.S.A.
Rabin-Karp string search algorithm, 5 pages, downloaded from http://en.wikipedia.org/wiki/Rabin-Karp—string—search—alogrithm on August 31, 2005 U.S.A.
The Rabin-Karp algorithm, String searching via Hashing, 5 pages, downloaded from http://www.eecs.harvard.edu/˜ellard/Q-97/HTML/root
ode43 on Aug. 31, 2005 U.S.A.
Fenwick & West LLP
Kim Tae K
Symantec Corporation
Thomas Joseph
LandOfFree
Countering spam that uses disguised characters does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Countering spam that uses disguised characters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Countering spam that uses disguised characters will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2652735