mozdev.org

MozSpam    

resources:
What's New
  • News item goes here
  • More news item goes here
  • mozdev.org
Other Stuff
  • stuff goes here
  • more stuff goes here

The mozspam

Welcome to the Mozspam Mozilla Spam Mail Filter Project

First let me make one thing clear: up to now there is no working code at all for this project. Not even one line. The only thing that is being developed right now is the design of the project. If you would like to join me (us?) and help to create a spam filter please drop me a line.

HELP!

It would be nice if you would join me in my effort to program this. You don't need to be a professional, cause me too I'm a hobby programmer and have almost no idea of XUL.

How it might work

One of the most effective ways to stop spam is to filter out every mail that comes from a host that allows relaying. I.e. a host that allows unauthorized people (e.g. spammers) to send mail to everybody with an e-mail address.
Nowadays there is absolutely no need why a SMTP server should allow relaying. There are other ways, e.g. SMTP-Auth or POP before SMTP to access SMTP servers from outside a certain subnet.
the mozspam package will link itself into the Mozilla mail client. It will check every incoming mail against a public Open Relay Database, reject mails coming from hosts listed inside such a database, and allow mails from hosts not listed there.

Information about Relaying

There are at least two large open relay databases. ORBD and relays.osirusoft.org (only for commercial users). I'm thinking of using ORDB for the beginning. Both pages contain extensive information about relaying and spam blocking. See also this page.

Proceedings

Before we start coding we have to have a clean design. That's what I will work on in the next few days.
We also have to become familiar with the Mail Client and XUL. See also requirements.

You can contact the only developer at this project (at least for now...) at gullc at stud dot phys dot ethz dot ch.

This is a page with user notes on it.

The mozspam project can be contacted through the mailing list or the member list.
Copyright © 2000-2012. All rights reserved. Terms of Use & Privacy Policy.