nanog mailing list archives
Re: the O(N^2) problem
From: "Edward B. DREGER" <eddy+public+spam () noc everquick net>
Date: Mon, 14 Apr 2008 13:41:50 +0000 (GMT)
I received an off-list request: "Could you clarify what precisely you are trying to secure?" I fear that perhaps I am still too vague. When one accepts an email[*], one wishes for some sort of _a priori_ information regarding message trustworthiness. DKIM can vouch for message authenticity, but not trust. (A valid DKIM signature shows that selected headers/content have not been forged, but does not vouch for content.) If I receive email from someone I trust, there's a good chance it's something I want. If from someone who someone I trust trusts, there's still a good chance. As the chain lengthens, trust becomes a bit dicier. What I propose is orthogonal to DKIM. I've also been asked to set up a separate mailing list. I'll do that, and stop pollu^H^H^H^H^Htrying to elaborate on NANOG. [*] Discussion limited to one example, but could be expanded. Eddy -- Everquick Internet - http://www.everquick.net/ A division of Brotsman & Dreger, Inc. - http://www.brotsman.com/ Bandwidth, consulting, e-commerce, hosting, and network building Phone: +1 785 865 5885 Lawrence and [inter]national Phone: +1 316 794 8922 Wichita ________________________________________________________________________ DO NOT send mail to the following addresses: davidc () brics com -*- jfconmaapaq () intc net -*- sam () everquick net Sending mail to spambait addresses is a great way to get blocked. Ditto for broken OOO autoresponders and foolish AV software backscatter.
Current thread:
- Re: the O(N^2) problem, (continued)
- Re: the O(N^2) problem David Andersen (Apr 13)
- Re: the O(N^2) problem Owen DeLong (Apr 13)
- Re: the O(N^2) problem Suresh Ramasubramanian (Apr 13)
- Re: the O(N^2) problem Edward B. DREGER (Apr 13)
- Re: the O(N^2) problem Suresh Ramasubramanian (Apr 13)
- Re: the O(N^2) problem Steven M. Bellovin (Apr 13)
- Re: the O(N^2) problem Suresh Ramasubramanian (Apr 14)
- Re: the O(N^2) problem Joe Greco (Apr 14)
- Re: the O(N^2) problem Suresh Ramasubramanian (Apr 13)
- [admin] RE: the O(N^2) problem Martin Hannigan (Apr 14)
- Re: the O(N^2) problem Rich Kulawiec (Apr 14)