Message testing based on a determinate message...

Electrical computers and digital processing systems: multicomput – Computer network managing – Computer network monitoring

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S206000, C726S011000, C726S022000

Reexamination Certificate

active

07921204

ABSTRACT:
A system and method are disclosed for routing a message through a plurality of test methods. The method includes: receiving a message; applying a first test method to the message; updating a state of the message based on the first test method; and determining a second test method to be applied to the message based on the state.

REFERENCES:
patent: 5999929 (1999-12-01), Goodman
patent: 6023723 (2000-02-01), McCormick et al.
patent: 6026491 (2000-02-01), Hiles
patent: 6052709 (2000-04-01), Paul
patent: 6055508 (2000-04-01), Naor et al.
patent: 6072942 (2000-06-01), Stockwell et al.
patent: 6076101 (2000-06-01), Kamakura et al.
patent: 6112227 (2000-08-01), Heiner
patent: 6199102 (2001-03-01), Cobb
patent: 6234802 (2001-05-01), Pella et al.
patent: 6266692 (2001-07-01), Greenstein
patent: 6393465 (2002-05-01), Leeds
patent: 6421709 (2002-07-01), McCormick et al.
patent: 6424997 (2002-07-01), Buskirk et al.
patent: 6438690 (2002-08-01), Patel et al.
patent: 6453327 (2002-09-01), Nielsen
patent: 6460073 (2002-10-01), Asakura
patent: 6539092 (2003-03-01), Kocher
patent: 6546416 (2003-04-01), Kirsch
patent: 6563912 (2003-05-01), Dorfman et al.
patent: 6615242 (2003-09-01), Riemers
patent: 6640301 (2003-10-01), Ng
patent: 6643686 (2003-11-01), Hall
patent: 6650890 (2003-11-01), Irlam et al.
patent: 6654787 (2003-11-01), Aronson et al.
patent: 6691156 (2004-02-01), Drummond et al.
patent: 6708205 (2004-03-01), Sheldon et al.
patent: 6728378 (2004-04-01), Garib
patent: 6732149 (2004-05-01), Kephart
patent: 6760752 (2004-07-01), Liu
patent: 6772196 (2004-08-01), Kirsch et al.
patent: 6778941 (2004-08-01), Worrell et al.
patent: 6779021 (2004-08-01), Bates et al.
patent: 6829635 (2004-12-01), Townshend
patent: 6836750 (2004-12-01), Wong et al.
patent: 6842773 (2005-01-01), Ralston et al.
patent: 6851051 (2005-02-01), Bolle et al.
patent: 6868498 (2005-03-01), Katsikas
patent: 6876977 (2005-04-01), Marks
patent: 6931433 (2005-08-01), Ralston et al.
patent: 6941348 (2005-09-01), Petry et al.
patent: 6963928 (2005-11-01), Bagley et al.
patent: 6965919 (2005-11-01), Woods et al.
patent: 7003724 (2006-02-01), Newman
patent: 7006993 (2006-02-01), Cheong et al.
patent: 7016875 (2006-03-01), Steele et al.
patent: 7016877 (2006-03-01), Steele et al.
patent: 7039949 (2006-05-01), Cartmell
patent: 7072943 (2006-07-01), Landesmann
patent: 7076241 (2006-07-01), Zondervan
patent: 7127405 (2006-10-01), Frank et al.
patent: 7149778 (2006-12-01), Patel et al.
patent: 7171450 (2007-01-01), Wallace et al.
patent: 7178099 (2007-02-01), Meyer et al.
patent: 7206814 (2007-04-01), Kirsch
patent: 7231428 (2007-06-01), Teague
patent: 7249175 (2007-07-01), Donaldson
patent: 7293063 (2007-11-01), Sobel
patent: 7299261 (2007-11-01), Oliver et al.
patent: 7441277 (2008-10-01), Burges
patent: 2001/0044803 (2001-11-01), Szutu
patent: 2001/0047391 (2001-11-01), Szutu
patent: 2002/0046275 (2002-04-01), Crosbie et al.
patent: 2002/0087573 (2002-07-01), Reuning et al.
patent: 2002/0116463 (2002-08-01), Hart
patent: 2002/0162025 (2002-10-01), Sutton et al.
patent: 2002/0188689 (2002-12-01), Michael
patent: 2002/0199095 (2002-12-01), Bandini et al.
patent: 2003/0009526 (2003-01-01), Bellegarda et al.
patent: 2003/0023692 (2003-01-01), Moroo
patent: 2003/0023736 (2003-01-01), Abkemeier
patent: 2003/0041126 (2003-02-01), Buford et al.
patent: 2003/0041280 (2003-02-01), Malcolm et al.
patent: 2003/0046421 (2003-03-01), Horvitz et al.
patent: 2003/0069933 (2003-04-01), Lim et al.
patent: 2003/0105827 (2003-06-01), Tan et al.
patent: 2003/0149726 (2003-08-01), Spear
patent: 2003/0158903 (2003-08-01), Rohall et al.
patent: 2003/0163357 (2003-08-01), Engleman et al.
patent: 2003/0167311 (2003-09-01), Kirsch
patent: 2003/0195764 (2003-10-01), Baker et al.
patent: 2003/0195937 (2003-10-01), Kircher et al.
patent: 2003/0204569 (2003-10-01), Andrews et al.
patent: 2003/0229672 (2003-12-01), Kohn
patent: 2003/0233418 (2003-12-01), Goldman
patent: 2004/0003283 (2004-01-01), Goodman et al.
patent: 2004/0015554 (2004-01-01), Wilson
patent: 2004/0024639 (2004-02-01), Goldman
patent: 2004/0030776 (2004-02-01), Cantrell et al.
patent: 2004/0059786 (2004-03-01), Caughey
patent: 2004/0083270 (2004-04-01), Heckerman et al.
patent: 2004/0103160 (2004-05-01), Sheldon et al.
patent: 2004/0117451 (2004-06-01), Chung
patent: 2004/0158554 (2004-08-01), Trottman
patent: 2004/0167964 (2004-08-01), Rounthwaite et al.
patent: 2004/0177120 (2004-09-01), Kirsch
patent: 2005/0055410 (2005-03-01), Landsman et al.
patent: 2005/0081059 (2005-04-01), Bandini et al.
patent: 2005/0114705 (2005-05-01), Reshef et al.
patent: 2005/0125667 (2005-06-01), Sullivan et al.
patent: 2005/0172213 (2005-08-01), Ralston et al.
patent: 2006/0010217 (2006-01-01), Sood
patent: 2006/0031346 (2006-02-01), Zheng et al.
patent: 2006/0036693 (2006-02-01), Hulten et al.
patent: 2006/0095528 (2006-05-01), Sykes, Jr.
patent: 2006/0282888 (2006-12-01), Bandini et al.
patent: 2008/0271116 (2008-10-01), Robinson et al.
Anon., “The Lifecycle of Spam,” PC Magazine, Feb. 25, 2003, pp. 74-97.
Bryan,Georgantopoulous, “MScin Speech and Language Processing Dissertation: Automatic summarizing based on sentence extraction: A statistical approach,” Department of Linguistics, University of Edinburgh, http://cgi.di.uoa.gr/˜bryon/msc.html.
D.H. Lie, “Sumatra: A system for Automatic Summary Generation,” http://www.carptechnologies.nl/SumatraTWLT14paper/SumatraTWLT14.html.
Anon., “Correspondence Negotiation Protocol,” http://ww.cs.sfu.ca/˜cameron/CNP.html.
Anon., “Cloudmark, Different Approaches to Spamfighting,” Whitepaper, Version 1.0, Nov. 2002.
Anon., “DigiPortal Software, Creating Order from Chaos,” Support, Frequently Asked Questions, http://ww/digiportal.com/support/choicemail/faq.html.
Paul Hoffman et al., “Unsolicited Bulk Email: Mechanisms for Control,” Internet Mail Consortium Report: UBE-SOL, IMCR-008, revised May 4, 1998.
Satheesh Kolathur et al., “Spam Filter, A collaborative Method of Eliminating Spam,” Whitepaper, published Dec. 8, 2000, http://www.cs.uh.edu/˜kolathur/Paper.htm.
Anon., “Challenge Messages,” Mailblocks, http://suportmailblocks.com/tab—howto/Validation/detail—privacy—challenge.asp.
Anon., “How Challenge/Response Works,” http://about.mailblocks.com/challenge.html.
Razor-agents 2.22, http://razor.sourceforge.net.
Anon., “Project: Vipul's Razor: Summary,” http://sourceforge.net/projects/razor/.
Spamarrest, The Product, How it Works, http://spamarrest.com/products/howitworks.jsp.
SpamAssassin, “Welcome to SpamAssassin,” http://spamassassin.org.
“Hash Function,” http://en.wikipedia.org/wiki/Hash—value, last accessed Nov. 15, 2006.
“Giant Company Software Announces Full Integrated AOL Support for it Popular Spam Inspector Anti-Spam Software,” GIANT Compnay Software, Inc., 2002.
Jason Mastaler, “Tagged Message Delivery Agent (TMDA),” TDMA Hompage, 2003.
“Digital Signature,” http://www.cnet.com/Reources/Info/Glossary/Terms/digitalsignature.html, last accessed Nov. 15, 2006.
“Active SMTP White Paper,” ESCOM Corp. 2000-2006.
Anon., “Tagged Message Delivery Agent (TMDA),” http://tmda.net/index.html.
Dwork, Cynthia, et al. “Pricing via Processing or Combating Junk Mail,” CRYPTO '92, Springer-Verlag LNCS 740, pp. 139-147, 1992.
Von Ahn, Luis, et al., “Telling Humans and COmputers Apart (Automatically) or How Lazy Cryptographers do AI,” Communications to the ACM, Feb. 2004.
Skoll, David F., “How to Make Sure a Human is Sending You Mail,” Google Groups Thread (Nov. 17, 1996).
Byrne, Julian, “My Spamblock,” Google Groups Thread (Jan. 19, 1997).
Guilmette, Ronald F., “To Mung or Not to Mung,” Google Groups Thread (Jul. 24, 1997).
Temleton, Brad, “Viking-12 Junk E-Mail Blocker,” (believed to have last been updated Ju

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Message testing based on a determinate message... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Message testing based on a determinate message..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Message testing based on a determinate message... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2687596

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.