[3122] in bugtraq

home help back first fref pref prev next nref lref last post

Re: mail storm

daemon@ATHENA.MIT.EDU (Igor Chudov @ home)
Tue Aug 13 02:21:11 1996

Date: 	Mon, 12 Aug 1996 22:56:56 -0500
Reply-To: Igor Chudov <ichudov@algebra.com>
From: "Igor Chudov @ home" <ichudov@algebra.com>
To: Multiple recipients of list BUGTRAQ <BUGTRAQ@NETSPACE.ORG>
In-Reply-To:  <320FD2CB.35CF@hydra.acs.uci.edu> from "Dan Stromberg" at Aug 12,
              96 05:56:43 pm

Dan Stromberg wrote:
> This almost has to have been discussed before, but I don't recall see=
ing
> it anywhere.
>
> Imagine a hacker really doesn't like someone, and is willing to do
> something disruptive to a lot of other people to spite that one perso=
n.
> Or imagine that they just want to do something very disruptive.
>
> Imagine the hacker picks 2n mailing lists, subscribing the i'th to th=
e
> (i+n)th and the (i+n)th to the i'th, subscribing that person they rea=
lly
> don't like to the 0..n-1'th, and finally, forging one message to each=
 of
> the 0..n-1'th.

Try subscribeing ALL lists to ALL lists (and subscribe every list to
itself). The reaction after time T will be (ideally)

                sum( t=3D0, t=3DT, N ** t)

messages (where t is time and N is the number of mailing lists).
It should be relatively easy to write a perl script that does it.

What is proves is that every mailing list should include a standard
header

X-Mailing-List: <submission@address>

to help other list manager programs identify the illegal submissions.

It also helps users who are list-bombed (ie, subscribed to hundreds of
unrelated mailing lists) to junk all unwanted messages.

        - =E9=C7=CF=D2=D8.

home help back first fref pref prev next nref lref last post