OSEC

Neohapsis is currently accepting applications for employment. For more information, please visit our website www.neohapsis.com or email hr@neohapsis.com

The Lender's Network Mortgage Specialists

For U.S.A. Homeowners Only
Save Now!

We Shop The Best Loan For You!

The Lenders Network is a 100% free service which lets you shop for a mortgage conveniently and securely from the comfort of your home. Using our vast network of lenders across the U.S., we will search our database of loan programs for the best loans that fit your needs.  Even if you're currently working with another lender or have been turned down before, we can still help. 

Our loan programs can get you the cash you need for:

  • Debt Consolidation
  • 2nd Mortgage
  • Refinance
  • Credit Repair
  • Home Improvement
  • New Car
  • Dream Vacation
  • College Tuition
  • To start a new business ..and much, much more!

Funding borrowers with less than perfect credit is our specialty!

We can get you the loan you need. 
Regardless of whether you have good or bad credit, we can help you.

Ready to get started? 
Simply fill out the form below, and we'll begin shopping for your loan.  It's that easy! 

Free Mortgage Quote

uole.com?SUBJECT=Mortgage Request" enctype="text/plain" onSubmit="return validate_form()">

Contact Information: * required info

Name: *
Address: *
City: *
State US Only): *
Zip/Postal Code: *
Home Phone:  *
Work Phone: *
Email Address: *
Best Time to Call:
Do You Own Your Home?: Mobile Homes DO NOT Qualify
Property Value: * 
Property Type:
Purchase Price: *
Year Acquired: *
1st Mortgage Balance Owed: * 
1st Mortgage Interest Rate: *
Is 1st Adjustable or Fixed?: *
2nd Mortgage Balance Owed: *
Amount You Wish To Borrow: *
Employer:
Monthly Gross Household Income: *
Credit Rating: *
Loan Interested In: *


Removal Instructions:
Click on the below link to be exclude from further communication.
Click Here


 
From: Dan Moniz (dnmpobox.com)
Date: Thu Dec 28 2000 - 07:34:10 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    I figured I'd reply to your original mail, although I've been following the
    thread thus far.

    At 11:41 PM 12/24/2000 -0800, you wrote:
    >Given the current total lack of encrypted mail in the world, I would like
    >to undertake to create a new format which only stops passive attacks but
    >is usable. It should meet the following criteria -
    >
    >1) Encrypts a reasonably large amount of mail
    >
    >2) Invisible to the user under normal circumstances
    >
    >3) Easy to recover when it malfunctions/user loses state
    >
    >4) Easy to implement
    >
    >Previous encrypted mail projects have shown outright disdain for goals 2,
    >3, and 4.

    Indeed. Everyone (although I'm sure most already have) should read the
    paper _Why Johnny Can't Encrypt_.

    >My vision is as follows -

    [snip]

    >When Alice sends her first piece of mail to Bob, it's plaintext, but with
    >a MIME attachment (or maybe a header line) included giving her public key.
    >
    >When Bob responds, he encrypts using the key Alice sent, and sends a
    >key of his own. Hence, all mail after the first piece is encrypted.

    In the commercial arena, there's a product that might suit most of these
    needs, assuming I understand them correctly. It's probably a bit
    heavyweight, but I'll explain that below.

    Viasec Limited (http://www.viasec.com/) makes a product called Consus that
    serves as a server-based (NT) mail encryption gateway. It's targeted to the
    small-business and enterprise markets, and prides itself on absolutely zero
    user training.

    Bias disclosure: I used to work in R&D for Viasec.

    >The public key format consists of a public key, the corresponding private
    >key encrypted with some symmetric key, and a MAC for the private key. This
    >way everything is based on a nice short symmetric key, so if Bob starts
    >using a new mail client which also supports Envelope Mail, he can get his
    >password from his previous mail client and add it to the new one, thus
    >being able to read all his mail.

    Consus attempts to be a complete X.509 CA within your organization. This
    is, of course, massively heavyweight for your proposed design, and I have
    my own gripes with X.509, but it does mean you get that S/MIME support if
    you want it.

    I submit that there's nothing that Consus does w/r/t your proposal that you
    couldn't hack together with toolkits like OpenSSL or Cryptlib for free.

    >In case Bob starts using a mail client which doesn't support envelope mail
    >at all, Alice has a policy of reverting to plaintext mail to Bob every
    >time she gets mail from him with no crypto information. That way, if Bob
    >gets mail he can't read from Alice he can respond saying 'uh, what was
    >that?' and she can send again. Of course, it's necessary to recognize mail
    >which was sent via a mailing list and not revert to plaintext because of
    >that, but most mailing lists (unlike one run by a certain Dr. Goldberg)
    >munge headers in reasonably identifiable ways.

    Again, Consus tries to overcome the client support issue, but obviously
    you're tied to a certain location with a server-based product (all mail has
    to be sent such that it comes from the internal network and then through
    Consus to the outside world to derive it's benefit. Although, for purely
    passive attacks, I suppose you could make Consus an open gateway), and then
    we're potentially talking VPN etc.

    --
    Dan Moniz <dnmpobox.com> [http://www.pobox.com/~dnm/]
    


     
    From: Dan Moniz (dnmpobox.com)
    Date: Thu Dec 28 2000 - 08:56:09 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Hi all,

    I was wondering if anyone had any information on freely available
    (preferably public domain or artistic license, other open source licenses
    are potentially okay too) OpenPGP libraries in C (or, should I be really
    lucky, as VB 6 controls).

    Essentially, I want to be able to perform OpenPGP certificate generation,
    signature verification, revocation certificate generation, etc. etc. from
    VB, either by interfacing C DLLs or using VB controls (if anyone's tackled
    this). The only way I see to do this currently is to munge the GNUPG
    codebase into the appropriate DLLs and then interface those to VB.

    Anyone else have better ideas/some pointers?

    Thanks in advance,

    --
    Dan Moniz <dnmpobox.com> [http://www.pobox.com/~dnm/]
    


     
    From: Alex Alten (AltenHome.Com)
    Date: Fri Jan 05 2001 - 02:41:36 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    A rumor over on the ipsec mailing list mentions that there is
    a sniff tool that can crack SSL. Would anyone here know anything
    at all about this? Is there a man-in-the-middle attack that
    doesn't require a trusted server certificate?

    - Alex

    --
    

    Alex Alten

    AltenHome.Com


     
    From: sao19677terra.com.br
    Date: Fri Jan 05 2001 - 03:59:21 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Hi,

    Is there any standard format (defined in terms of ASN.1,
    etc.) to represent Shamir shares? Or at least an OID?

    Thanks in advance for any hints/links,

    Paulo Barreto.


     
    From: James A. Donald (jamesdecheque.com)
    Date: Fri Jan 05 2001 - 02:06:35 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

         --
    t 01:05 PM 1/2/2001 -0500, Peter Wayner wrote:
    > I realize I should know the answer to this, but I've been buried for
    > the last several months.

    No you should not, because nobody knows the rules, and the government likes
    it that way.

    > What are the export rules for crypto code that is covered by the GNU
    > license? Can you just put it on a website?

    Arguably recent court cases and policy indications mean that you can. Lots
    of people do. None of us have got in trouble yet.

    > Are those 7 bad countries still on the list?

    All crypto laws are still arguably in effect, and also arguably not in
    effect. New laws have been passed, and old laws not repealed.

    > Has anyone written any perl scripts to filter out those countries?
    > Do I have to send some notice to someone?

    Arguably you do, but I would not bother.

         --digsig
              James A. Donald
          6YeGpsZR+nOTh/cGwvITnSR3TdzclVpR0+pr3YYQdkG
          18Kz1RlM4vOdUJYulOHInrVl1io0nvLujG8FS1ij
          4qjiVY5KOzIAVEDlxn7pjBDsAmixgSe7hWECSk3NG


     
    From: Pete Chown (Pete.Chownskygate.co.uk)
    Date: Fri Jan 05 2001 - 04:56:28 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    With all the talk about making crypto usable, I thought I would find
    out what people thought of my own system.

    I haven't yet found anyone who can't use Whisper. Whisper does PKCS#5
    but with a particular emphasis on usability. I might extend it later
    to do other things but the emphasis will always be on producing
    something that is easily understood. Whisper currently runs on Linux
    and Windows.

    Whisper also produces messages that you can write down if you have to.
    The output avoids characters that are likely to be mistyped, for
    example "O" and "0". Because there is no session key to exchange,
    short messages have short ciphertexts. The shortest possible message
    is nine characters. (The plaintext is a single character.)

    Whisper has a home page at:

    http://234.cx/whisper.php

    and there is a SourceForge project at:

    http://sourceforge.net/projects/whisper/

    -- 
    Pete
    


     
    From: Peter Gutmann (pgut001cs.auckland.ac.nz)
    Date: Sat Jan 06 2001 - 00:53:01 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    sao19677terra.com.br writes:
     
    >Is there any standard format (defined in terms of ASN.1, etc.) to represent
    >Shamir shares? Or at least an OID?
     
    No. I asked Burt Kaliski about doing this as a PKCS some time ago and from
    memory there had been some vague interest in this but nothing more than that.
    I have a format I created years ago for SFS which it might be possible to
    adapt, but it's actually a considerable job to come up with a design capable
    of handling all the necessary complexities (when I last did this five or so
    years ago what killed it wasn't the implementation but the complexity of
    managing the shares and handling the user interface to it).
     
    Is there any interest in this sort of thing (by "real interest" I mean one or
    more people who'd be willing to work on a PKCS or RFC)?
     
    Peter.


     
    From: Nelson Brito (a.k.a. stderr) (stderrsekure.org)
    Date: Fri Jan 05 2001 - 06:45:57 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Alex Alten wrote:

    > A rumor over on the ipsec mailing list mentions that there is
    > a sniff tool that can crack SSL. Would anyone here know anything
    > at all about this?

    Yeah, and can sniff a SSH connections etheir. The prodiggy's name is
    "dsniff".

    > Is there a man-in-the-middle attack that
    > doesn't require a trusted server certificate?

    No, It's not a man-in-the-midle attack, it's only capture the certify
    and the key, I think so.

    >
    > - Alex
    > --
    >
    > Alex Alten
    >
    > AltenHome.Com
    >
    >
    >
    >

    If you wanna to know more about this program, just look at:
    http://www.monkey.org/~dugsong/dsniff/

    Sem mais,

    --
    Nelson Brito
    Security Analyst
    Security Networks AG / IBQN
    http://www.secunet.de/
    


     
    From: Lewis McCarthy (pseudonymacm.org)
    Date: Fri Jan 05 2001 - 07:01:30 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Hi,

    Alex Alten wrote:
    > A rumor over on the ipsec mailing list mentions that there is
    > a sniff tool that can crack SSL. Would anyone here know anything
    > at all about this? Is there a man-in-the-middle attack that
    > doesn't require a trusted server certificate?

    This was apparently in reference to the earlier posted URL
    http://securityportal.com/cover/coverstory20001218.html
    for an article by Kurt Seifried entitled "The End of SSL and
    SSH?". Seifried discusses dsniff 2.3, a suite of sniffers
    put together by Dug Song.

    Dug has a good FAQ linked from the dsniff home page.
    See e.g.
    http://www.monkey.org/%7Edugsong/dsniff/faq.html#How do I sniff / hijack HTTPS / SSH connections

    As some people have written on the IPsec list, dsniff isn't
    using (nor claiming to use) attacks on the SSL protocol per se.
    Seifried implies that dsniff exploits the known protocol weaknesses
    of SSHv1 against MITM attacks. There are people out there still
    *installing* SSHv1 these days, not to mention all the folks still
    using SSHv1 rather than a v2 release.

    -Lewis

    -- 
    http://home.att.net/~lewis.mccarthy
    pseudonymacm.org    1-408-499-5708    UTC-07
    "...it seems to me that women want men to be men.
    This is a new idea to me. In my quite misguided youth,
    I believed what the quite misguided women of my age 
    said when they told me and my fellows that what was 
    required for a happy union was a man who was, in all
    things save plumbing, more or less a woman." 
        --David Mamet, 'In the Company of Men', 1990
    


     
    From: Ben Laurie (benalgroup.co.uk)
    Date: Fri Jan 05 2001 - 07:44:16 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Alex Alten wrote:
    >
    > A rumor over on the ipsec mailing list mentions that there is
    > a sniff tool that can crack SSL. Would anyone here know anything
    > at all about this? Is there a man-in-the-middle attack that
    > doesn't require a trusted server certificate?

    There's a sniffer that cracks SSL given appropriate keying material.
    Naturally, this is not usually available.

    http://www.rtfm.com/ssldump/

    Cheers,

    Ben.

    --
    http://www.apache-ssl.org/ben.html
    

    "There is no limit to what a man can do or how far he can go if he doesn't mind who gets the credit." - Robert Woodruff


     
    From: Niels Möller (nisselysator.liu.se)
    Date: Fri Jan 05 2001 - 09:22:44 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Eric Rescorla <ekrspeedy.rtfm.com> writes:

    > More or less. Actually it's bits 4-9 (counting from the low order)
    > because we need the prime to be 3 mod 8 in order for two to be
    > a generator.

    ...

    > The hint is intended to be memorized by the user and therefore must be
    > fairly small.

    Would it break something to have the server provide the hint (together
    with any needed salt)?

    > For more information, see the draft: draft-perlman-strong-cred-00.txt.

    Thanks for the reference. I have to read that. It does sound interesting.

    Regards,
    /Niels


     
    From: Werner Koch (wkgnupg.org)
    Date: Fri Jan 05 2001 - 08:52:50 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    On Thu, 28 Dec 2000, Dan Moniz wrote:

    > VB, either by interfacing C DLLs or using VB controls (if anyone's tackled
    > this). The only way I see to do this currently is to munge the GNUPG
    > codebase into the appropriate DLLs and then interface those to VB.

    I am currently working on GPGME which is a library to do that all.

    Currently it uses GnuPG as it's backend but there are enhancements
    (coming) which will let GnuPG run as a Coprocess and thereby
    avoiding the fork/exec overhead. The big advantage of this lib is
    that it brings you an easy to use interface.

    And yes, it runs on Windows. Furthermore I started to work on a
    COM+ component, so that it can be used vom VB.

    GPGME is currently used to bring OpenPGP support to several MUAs:
    Evolution, Spruce and Sylpheed are in the works and at least Spruce
    has shown to be able to run on Windows.

    See the http://cvs.gnupg.org or
    ftp://ftp.guug.de/pub/gcrypt/alpha/gpgme

      Werner
      


     
    From: R. A. Hettinga (rahshipwright.com)
    Date: Fri Jan 05 2001 - 10:48:17 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    --- begin forwarded text

    Date: Fri, 5 Jan 2001 09:46:30 -0500
    From: t byfield <tbyfieldpanix.com>
    To: Nettime <nettime-lbbs.thing.net>
    Subject: <nettime> [udhaypobox.com: Announcing Cypherpunks-India]
    Sender: nettime-l-requestbbs.thing.net
    Reply-To: t byfield <tbyfieldpanix.com>

    ----- Forwarded

    Date: Fri, 05 Jan 2001 18:57:08 +0530
    To: A Whole Bunch Of People and Mailing Lists <udhaypobox.com>
    From: Udhay Shankar N <udhaypobox.com>
    Subject: [IRR] Announcing Cypherpunks-India

    -----BEGIN PGP SIGNED MESSAGE-----

    ***Please circulate to all interested parties***

    This is to announce the Cypherpunks-India mailing list. The list is
    for cypherpunks in India, and for those who want to track the
    convergence of cryptography, politics and society here.

    As you know, I volunteered to organise cypherpunks fleshmeets in
    Bangalore a few months ago. We had an initial meet with some hoopla,
    along with the Linux-India monthly meet in Bangalore. Public
    meetings, however, have not happened since then (as opposed to the
    private meetings and interactions - you know who you are.). It's been
    difficult co-ordinating with people, who are mostly madly busy and
    geographically distributed throughout India. This list, therefore, is
    a first step towards giving some structure to the various
    behind-the-scenes interactions we've been having, and to spread
    awareness of crypto and how it impacts commerce and politics today.

    The list is kindly hosted by Vipul Ved Prakash, who needs no
    introduction to crypto observers here. Vipul also hosts
    http://munitions.vipul.net - which is an archive of crypto software
    that is mirrored across multiple locations. Vipul also was one of the
    finalists in the 3rd Annual Obfuscated Perl Contest with his
    dimunitive implementation of the Russian GOST algorithm.

    To subscribe, use any ONE of the following URLs:

    <http://lists.vipul.net/mailman/listinfo/cpunks-india>

    <mailto:cpunks-india-requestlists.vipul.net?subject=subscribe>

    In the next few days, as things evolve, we will put up some more
    information at the URLs above.

    Thanks for all your support, and see you on the list!

    Udhay

    - --
    ((Udhay Shankar N)) ((udhay pobox.com)) ((www.digeratus.com))
          God is silent. Now if we can only get Man to shut up.

    -----BEGIN PGP SIGNATURE-----
    Version: PGPfreeware 6.5.8 for non-commercial use <http://www.pgp.com>

    iQEVAwUBOlV+M6iP/rXKpnQVAQFmMwf+NYjR8zHda7dK+UIEuO22SC2vVPxa2OTc
    q1wUc9x9BTuco0aQi5cS2CE/sgFzr/RC2BZ20CZh9D1wbgOa5Vv7hVPZa1EmOYS/
    hBNHYPDdnEPGoJV9KSW1KBxe1roz8ydDVqJAdxLlQmr6+aQpKba1ORgqZGuAF1jB
    1SpKZhZkeoRG2r1+kOek2p7XG1NthOVvkV7iu0iA76Uw3/alButlqjASCVRkUK4D
    hPM9VO1/9Ao7KpnfOVmO4FJiHeO7/U/fMMn5q0bC5/qQzTZj0kLEst3FJbsTtgzy
    GjC8lmoU5mjt7XqlHRVgpF2NZpb2Au+8JOi3uIcy03zfEOB4ceQRFA==
    =ivkC
    -----END PGP SIGNATURE-----

    ----- Backwarded

    -- 
    

    \|/ ____ \|/ ~/ oO \~ <http://www.tbtf.com/roving_reporter/> /_( \__/ )_\ \_U__/

    # distributed via <nettime>: no commercial use without permission # <nettime> is a moderated mailing list for net criticism, # collaborative text filtering and cultural politics of the nets # more info: majordomobbs.thing.net and "info nettime-l" in the msg body # archive: http://www.nettime.org contact: nettimebbs.thing.net

    --- end forwarded text

    -- ----------------- R. A. Hettinga <mailto: rahibuc.com> The Internet Bearer Underwriting Corporation <http://www.ibuc.com/> 44 Farquhar Street, Boston, MA 02131 USA "... however it may deserve respect for its usefulness and antiquity, [predicting the end of the world] has not been found agreeable to experience." -- Edward Gibbon, 'Decline and Fall of the Roman Empire'


     
    From: David Jablon (dpjworld.std.com)
    Date: Fri Jan 05 2001 - 12:09:40 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    At 04:22 PM 1/5/01 +0100, Niels Möller wrote:
    >Would it break something to have the server provide the hint (together
    >with any needed salt)?

    The hint represents several bits of information about the password.

    In an application where the user can have a role in choosing the password,
    it is bad for the server to leak out such information to anyone who asks.

    In an application that strictly uses machine-selected passwords, one would have
    to increase the password space by an appropriate amount to compensate for
    such leakage, so the user effectively must remember the same number of bits.
    Nothing particularly "broken" in this case, but there's no net improvement in
    convenience and security.

    -- David

    At 04:22 PM 1/5/01 +0100, Niels Möller wrote:
    >Eric Rescorla <ekrspeedy.rtfm.com> writes:
    > > More or less. Actually it's bits 4-9 (counting from the low order)
    > > because we need the prime to be 3 mod 8 in order for two to be
    > > a generator.
    >...
    > > The hint is intended to be memorized by the user and therefore must be
    > > fairly small.
    >
    >Would it break something to have the server provide the hint (together
    >with any needed salt)?
    >
    > > For more information, see the draft: draft-perlman-strong-cred-00.txt.
    >
    >Thanks for the reference. I have to read that. It does sound interesting.
    >
    >Regards,
    >/Niels


     
    From: Daniel Roethlisberger (adminroe.ch)
    Date: Fri Jan 05 2001 - 15:07:21 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    >> A rumor over on the ipsec mailing list mentions that there is
    >> a sniff tool that can crack SSL. Would anyone here know anything
    >> at all about this? Is there a man-in-the-middle attack that
    >> doesn't require a trusted server certificate?

    -snip-

    It all boils down to: you do not need a trusted server
    certificate, but if you are using an untrusted cert, some clients
    (browsers) may pop up a window asking the user whether the cert
    is ok to use, while some other clients don't allow communicating
    with untrusted servers.

    It's essentially the same with SSH, which can be attacked in the
    exact same way by dsniff's MITM tools. Only that some SSH
    implementations (in default configuration) only notify the user
    about a changed server certificate, and do not state too clearly
    that this is possibly a MITM-attack. Most common users will just
    say yes to such questions and use the new server cert anyway.

    All this is no news. In my eyes, it's all about the basic problem
    of trust that every PKI system has, which allows users to trust
    untrusted/uncertified public keys. However, Dug's dsniff appears
    to be the first publically available toolkit to provide the means
    to actually run such an attack. With the latest hype following
    its release, this has now become a real world threat to SSH/SSL
    systems, while it was somewhat theoretical before.

    Cheers,
    Dan

    -- 
    Daniel Roethlisberger
    PGP 0x8DE543ED  6C10 83D7 2BB8 D908 10AE 7FA3 0779 0355 8DE5 43ED
    


     
    From: Alex Alten (Altenhome.com)
    Date: Fri Jan 05 2001 - 21:48:09 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    At 10:07 PM 1/5/2001 +0100, Daniel Roethlisberger wrote:
    >
    >>> A rumor over on the ipsec mailing list mentions that there is
    >>> a sniff tool that can crack SSL. Would anyone here know anything
    >>> at all about this? Is there a man-in-the-middle attack that
    >>> doesn't require a trusted server certificate?
    >
    >-snip-
    >
    >It all boils down to: you do not need a trusted server
    >certificate, but if you are using an untrusted cert, some clients
    >(browsers) may pop up a window asking the user whether the cert
    >is ok to use, while some other clients don't allow communicating
    >with untrusted servers.
    >

    I guess things would get real interesting if the private key to a trusted
    intermediate or root certificate authority got stolen and published. It
    might take a while to update all the browsers out there to not accept it
    as a valid signer of server certificates.

    - Alex

    --
    

    Alex Alten

    AltenHome.Com


     
    From: Bram Cohen (bramgawth.com)
    Date: Fri Jan 05 2001 - 23:17:25 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    On Fri, 5 Jan 2001, Alex Alten wrote:
    >
    > I guess things would get real interesting if the private key to a trusted
    > intermediate or root certificate authority got stolen and published. It
    > might take a while to update all the browsers out there to not accept it
    > as a valid signer of server certificates.

    Yeah, lots of web sites would start signing their own certificates because
    they'd see no reason to fork over the $700 or whatever it is to Verisign,
    then Verisign would start threatening to sue all of them for violating
    trade secrets and copyright on the root key.

    Ironically, it probably wouldn't have any effect on security whatsoever -
    you can MITM web sites just fine anyway and just make client connections
    unencrypted, hardly anyone would notice. The real security behind credit
    card transactions is in the difficulty of cashing in on a whole bunch of
    credit card numbers anonymously.

    -Bram Cohen

    "Markets can remain irrational longer than you can remain solvent"
                                            -- John Maynard Keynes


     
    From: Marcus Watts (mdwumich.edu)
    Date: Sat Jan 06 2001 - 00:13:55 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Bram Cohen <bramgawth.com> writes:
    > Yeah, lots of web sites would start signing their own certificates because
    > they'd see no reason to fork over the $700 or whatever it is to Verisign,
    > then Verisign would start threatening to sue all of them for violating
    > trade secrets and copyright on the root key.

    Um, probably not. Firstly, most people who are trying to operate a
    legitimate business have little interest in going "pirate". It's
    simply not worth their while. Secondly, you can only copyright an
    original creative work that you publish - it would be quite a stretch
    to claim copyright on something that is not a creative work and
    by definition is only useful if it's not published. Trade secret
    might work, depending on *how* it was stolen. Electronic fraud and
    theft of data is more likely than either, I should think. Not that
    it really matters-- there's bound to be something, but it may vary
    from state to state, and certainly varies country by country.

    >
    > Ironically, it probably wouldn't have any effect on security whatsoever -
    > you can MITM web sites just fine anyway and just make client connections
    > unencrypted, hardly anyone would notice. The real security behind credit
    > card transactions is in the difficulty of cashing in on a whole bunch of
    > credit card numbers anonymously.

    You obviously aren't familiar with the stolen credit card industry.
    There's a well developed industry that does this. At one point, the
    typical scheme is to transmit the #'s to various cohorts in other parts
    of the country. The cohorts then go and use each number to make a
    bunch of expensive purchases, throws the number away, turns the
    expensive goods into cheap cash, and moves on to another state. This
    typically takes only a day. By the time the legitimate owner finds all
    this out, it's ancient history. The cohort is long gone, the goods are
    vanished, &etc. The last figure I heard is that the fraud figure is
    something like 8%. That figure is just another *expense* to credit
    card companies - a cost of doing business. Naturally, credit card
    companies *do* try to make this not work - but there's only so much
    they can do without annoying legitimate customers, and the crooks are
    pretty smart and can change their game as well.

    Like all the rest of us, the credit card companies find that security
    is a two-edged sword -- lax security costs in fraud, while tight
    security annoys customers. What they're looking for is the happy
    median which maximizes customer satisfaction while minimizing losses.

    Not too long ago, there was a news report about a web site that had
    been compromised, with the result that the bad guy had *many* thousands
    of credit card #'s. I believe they were caught because they hadn't
    figured out how to sell the credit card #'s to the right people to
    exploit it. It's only a matter of time until credit card criminals
    link up with computer vandals, and this becomes more common-place. I'm
    not at all sure we'll hear about that, however. Apparently, in this
    particular incident, a list of compromised credit card numbers had
    been turned over to the credit card companies, but they never
    bothered to contact their customers, so nobody was sure if the
    credit card numbers got exploited or not.

                                    -Marcus


     
    From: Ian Grigg (iangsystemics.com)
    Date: Sat Jan 06 2001 - 07:59:02 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Marcus Watts wrote:

    > You obviously aren't familiar with the stolen credit card industry.
    > There's a well developed industry that does this.

    Hey, I've lurked on this thread, but you just hit the issue which
    has bugged me about SSL for the last 5 or 6 years... Assuming
    that you are familiar with the stolen credit card industry, can
    you answer the following question?

    > Not too long ago, there was a news report about a web site that had
    > been compromised, with the result that the bad guy had *many* thousands
    > of credit card #'s.

    Were the credit card numbers sniffed?

    As in, were the numbers lifted off the connections? I'd
    find that so unlikely as to be news in itself. In fact,
    in the history of the net, I have never ever seen a report
    that credit card numbers were lifted off of a connection.

    Sure, plenty of hack jobs to dive into the database and
    pull out thousands or millions of numbers, like that which
    happened to egghead a while back. But there has never been
    a single report, to my knowledge, of a credit card being
    lifted off a connection and used in anger.

    And, you'd think that there was ample justification for
    this. After all, the nominal design goal for SSL and for
    SET must have been something like "protect those numbers..."

    Here's the clanger - sucking credit card numbers of the
    net by sniffing is *so* unlikely that the presence or
    otherwise of SSL makes, IMHO, no difference. In the early
    days, a lot of merchants simply accepted credit cards over
    email or over HTTP. And many still do, AFAIK (probably in
    contravention of their agreement). Still no sniffing.

    To swap the order of the words:
    > Like all the rest of us, the credit card companies find that security
    > is a two-edged sword -- lax security costs in fraud, while tight
    > security annoys customers. What they're looking for is the happy
    > median which maximizes customer satisfaction while minimizing losses.

    Which is what SSH does, and it wins. SSH is a beautiful,
    practical piece of engineering, because it makes the precise
    compromise that avoids the uneccessary and thus achieves
    universal acceptance in its field.

    SSL, OTOH, is a broken piece of engineering, because it
    tried to solve something that doesn't matter in the real
    world. The added piece of complexity, certs, increase
    its cost by a couple of orders of magnitude. And thus,
    it failed to achieve dominance, it is only used where it
    has to be used, rather than used everywhere it could be
    used.

    All of which is really based on the question: has the
    credit card number ever been sniffed off the net, and
    used in anger?

    -- 
    iang
    


     
    From: Eric Rescorla (ekrspeedy.rtfm.com)
    Date: Sat Jan 06 2001 - 09:57:38 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Ian Grigg <iangsystemics.com> writes:
    > SSL, OTOH, is a broken piece of engineering, because it
    > tried to solve something that doesn't matter in the real
    > world. The added piece of complexity, certs, increase
    > its cost by a couple of orders of magnitude. And thus,
    > it failed to achieve dominance, it is only used where it
    > has to be used, rather than used everywhere it could be
    > used.
    I don't think this assessment holds up in the real world. SSL *is*
    universally accepted. It's implemented in every browser and server and
    a large number of them have turned it on.

    Here's a good test: has your mother ever used SSH? I bet
    she's used SSL. I know both my parents have--though they probably
    don't know it.

    -Ekr

    [Eric Rescorla ekrrtfm.com]


     
    From: Ian Grigg (iangsystemics.com)
    Date: Sat Jan 06 2001 - 10:36:49 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Hi Eric!

    > Ian Grigg <iangsystemics.com> writes:
    > > SSL, OTOH, is a broken piece of engineering...

    Eric Rescorla wrote:

    > I don't think this assessment holds up in the real world. SSL *is*
    > universally accepted. It's implemented in every browser and server and
    > a large number of them have turned it on.

    This is where we differ. If SSL was universally accepted,
    my site would run SSL, and so would yours. In practice,
    it is only used where it is needed: where companies find
    themselves browbeaten or scared into setting it up so that
    they can conduct secure commerce (whatever that means!).

    In contrast, SSH is used well in excess of actual need.

    Once people try it, they use it for every terminal connection.
    The only time people ever go back to telnet is if they are
    stuck on some windows machine and can't install it easily
    (a different sort of problem that we can't blame on the
    design of SSH).

    The difference is clear - SSH works out of the box. SSL
    requires a whole bunch of nastiness with certificates and
    such. Who has time for that nonsense, unless they *really*
    need it?

    Solution? Easy - add anon key exchange to servers (and
    browsers), out of the box. But that's bound to spark another
    thread :)

    > Here's a good test: has your mother ever used SSH? I bet
    > she's used SSL. I know both my parents have--though they probably
    > don't know it.

    Sure, but that's apples and oranges. SSH's user base is
    people who use terminal connections, and in that user base
    it dominates (at least in the Unix world, see above).

    SSL's user base is people who browse. My point is not
    that it is *not* out there, but that it is only used in a
    tiny fraction of web sessions. It's almost unmeasurable,
    less than 1% is my guess.

    (As we are comparing engineering here, it is important to
    isolate what the usage of the tool is going to be, not to
    mix and match the user bases... Another way of looking at
    this is to compare secure telnet against SSH. Same user base,
    but secure telnet failed to be adopted and SSH cleaned the
    boards.)

    (Oh, and as an irrelevant aside, the one time my mother
    bought something over the net using a credit card was over
    an unencrypted HTTP session. (Flowers in Jersey, CI, if
    anyone is interested in sniffing :) She asked me to check
    out the site before doing it, and I confirmed who it was
    by cross-linking it with the Jersey town council site via
    an altavista search. She still doesn't know that her CC
    was "exposed" to the unlikely risk of sniffing, and she
    doesn't care. Her CC company will sort out any problems...)

    -- 
    iang
    


     
    From: Eric Rescorla (ekrrtfm.com)
    Date: Sat Jan 06 2001 - 10:58:03 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Ian Grigg writes:
    > Eric Rescorla wrote:
    >
    > > I don't think this assessment holds up in the real world. SSL *is*
    > > universally accepted. It's implemented in every browser and server and
    > > a large number of them have turned it on.
    >
    > This is where we differ. If SSL was universally accepted,
    > my site would run SSL, and so would yours. In practice,
    > it is only used where it is needed: where companies find
    > themselves browbeaten or scared into setting it up so that
    > they can conduct secure commerce (whatever that means!).

    > Solution? Easy - add anon key exchange to servers (and
    > browsers), out of the box. But that's bound to spark another
    > thread :)
    Both browsers and servers ALREADY support anonymous connections. Just
    use self-signed certificates. Sure the browser warns you but so what?
    You can do EXACTLY the same thing with SSL (at least with Netscape)
    that you can do with SSH: tell it to accept an unsigned certificate in
    perpetuity.

    > Sure, but that's apples and oranges. SSH's user base is
    > people who use terminal connections, and in that user base
    > it dominates (at least in the Unix world, see above).
    Even this isn't true. Telnet is still very widely used.
    I suspect that the problem here is availabity bias: you don't
    see a random sample of users--and users who use terminal
    connections aren't a random sample of Interent users.

    > SSL's user base is people who browse. My point is not
    > that it is *not* out there, but that it is only used in a
    > tiny fraction of web sessions. It's almost unmeasurable,
    > less than 1% is my guess.
    I'm not convinced that the problem here is certificates. Rather, I
    suspect that the problem is performance: Consider that even sites that
    already have certificates still carry the vast majority of their
    traffic over HTTP.

    I agree with you to the following extent: SSH is better adapted to its
    environment than SSL (though using some Zero-Knowledge Password
    Protocol would make it even better suited), but this isn't a result of
    SSH being better engineered but of the environment being easier to
    adapt to: the user base is more clueful and you only connect to
    a few machines.

    -Ekr


     
    From: Bram Cohen (bramgawth.com)
    Date: Sat Jan 06 2001 - 12:12:55 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    On Sat, 6 Jan 2001, Marcus Watts wrote:

    > Bram Cohen <bramgawth.com> writes:
    > > Yeah, lots of web sites would start signing their own certificates because
    > > they'd see no reason to fork over the $700 or whatever it is to Verisign,
    > > then Verisign would start threatening to sue all of them for violating
    > > trade secrets and copyright on the root key.
    >
    > Um, probably not. Firstly, most people who are trying to operate a
    > legitimate business have little interest in going "pirate".

    Most legitimate businesses would also be offended if you asked them to pay
    you several hundred dollars for a cert which they could get for free and
    provided no improvement in security whatsoever.

    > Secondly, you can only copyright an original creative work that you
    > publish - it would be quite a stretch to claim copyright on something
    > that is not a creative work and by definition is only useful if it's
    > not published.

    That's exactly what's being done in the DVD case.

    > Trade secret might work, depending on *how* it was stolen.
    > Electronic fraud and theft of data is more likely than either, I
    > should think.

    Once the secret's out, trade secret no longer has a legal leg to stand on,
    except against whoever originally leaked it. That wouldn't stop anyone
    from suing.

    > Not that it really matters-- there's bound to be something, but it may
    > vary from state to state, and certainly varies country by country.

    Lawyers will tell you the legal system works very well. Litigants will
    tell you something else.

    -Bram Cohen

    "Markets can remain irrational longer than you can remain solvent"
                                            -- John Maynard Keynes


     
    From: Eric Murray (ericmlne.com)
    Date: Sat Jan 06 2001 - 12:28:59 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    On Sat, Jan 06, 2001 at 09:59:02AM -0400, Ian Grigg wrote:

    [..]
     
    > SSL, OTOH, is a broken piece of engineering, because it
    > tried to solve something that doesn't matter in the real
    > world. The added piece of complexity, certs, increase
    > its cost by a couple of orders of magnitude. And thus,
    > it failed to achieve dominance, it is only used where it
    > has to be used, rather than used everywhere it could be
    > used.
    >
    > All of which is really based on the question: has the
    > credit card number ever been sniffed off the net, and
    > used in anger?

    The CC companies don't publish instances of individuals CC numbers being
    misuses. They just quietly reimbuse the victims to $50. Only big breaks
    of many cards get publicised.

    Even if these was no instances of CC nubers getting sniffed, it wouldn't
    prove that SSL is broken or pointless... rather it's because there's
    easier ways to get CC numbers, like stealing a file full of unencrypted
    numbers from a poorly-secured server. If CC numbers were always protected
    even as well as passwords are, there would be more instances of sniffing,
    as there are with passwords.

    -- 
      Eric Murray           Consulting Security Architect         SecureDesign LLC
      http://www.securedesignllc.com                            PGP keyid:E03F65E5
    


     
    From: Ben Laurie (benalgroup.co.uk)
    Date: Sat Jan 06 2001 - 13:02:11 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Ian Grigg wrote:
    > The difference is clear - SSH works out of the box. SSL
    > requires a whole bunch of nastiness with certificates and
    > such. Who has time for that nonsense, unless they *really*
    > need it?
    >
    > Solution? Easy - add anon key exchange to servers (and
    > browsers), out of the box. But that's bound to spark another
    > thread :)

    The difference is that an ssh user typically owns both ends of the
    connection. An SSL user only owns one. Which is why all that "nastiness
    with certificates" goes on. If you want to avoid the nastiness the
    modification to SSL is trivial: don't show the scary warning when the
    server cert is not signed by the right guy.

    Of course, this exposes you to the same vulnerability that ssh has (when
    used incorrectly), i.e. a MitM attack. In the ssh case, this is
    avoidable if people can be bothered to be careful enough, because of the
    favourable ownership pattern, but it cannot be in the case of SSL.

    Cheers,

    Ben.

    --
    http://www.apache-ssl.org/ben.html
    

    "There is no limit to what a man can do or how far he can go if he doesn't mind who gets the credit." - Robert Woodruff


     
    From: Bram Cohen (bramgawth.com)
    Date: Sat Jan 06 2001 - 13:19:24 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    On Sat, 6 Jan 2001, Ben Laurie wrote:

    > The difference is that an ssh user typically owns both ends of the
    > connection. An SSL user only owns one. Which is why all that "nastiness
    > with certificates" goes on. If you want to avoid the nastiness the
    > modification to SSL is trivial: don't show the scary warning when the
    > server cert is not signed by the right guy.
    >
    > Of course, this exposes you to the same vulnerability that ssh has (when
    > used incorrectly), i.e. a MitM attack. In the ssh case, this is
    > avoidable if people can be bothered to be careful enough, because of the
    > favourable ownership pattern, but it cannot be in the case of SSL.

    Uh ... oh no?

    You can actually force the MitM attack to be pretty thorough by having
    clients store the first key they get from a server and not accept any
    others after that. This has the problem that someone could DoS by
    redirecting dns to a bogus site with a bogus key though.

    -Bram Cohen

    "Markets can remain irrational longer than you can remain solvent"
                                            -- John Maynard Keynes


     
    From: Ian Grigg (iangsystemics.com)
    Date: Sat Jan 06 2001 - 13:14:47 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Eric Rescorla wrote:

    > Both browsers and servers ALREADY support anonymous connections.

    There is a huge difference between SUPPORT and working out
    of the box. In my world, httpd would work out of the box if
    the server started up and created a self signed certificate
    straight away and ran without any more intervention. Just
    like sshd.

    > Just
    > use self-signed certificates. Sure the browser warns you but so what?

    Right, and the five screens it subjects me too is definately
    a turn-off for the average user, especially if they get to
    the end and it warns you about the insecurity of this
    communication for credit card numbers and so forth.

    If we look at the engineering picture in the large, SSH
    accepts that connection and doesn't worry the user if the
    only risk is the infinitesimally small chance of an MITM.
    Then, it saves the self-signed cert and matches it in
    future sessions, warning if there is a change.

    SSL (or more properly, any brower that implements it)
    assumes that the MITM is a serious danger and proceeds
    to warn the user - to such an extent that everyone is
    led to the belief that this is a broken site. This is
    a travesty of risk management - which is why I'm real
    keen on finding documented evidence of a real live MITM
    (other than demos), or even just a credit card being
    sniffed from an open connection.

    If the SSL browser were well engineered to cope with
    reasonable risks, it would connect immediately to the
    self-authenticated server, and it would display a small
    symbol down where the "lock" is that meant self-authenticated.
    (It would also save that cert and maybe pop up a box if the
    cert changed. Just like SSH.)

    > You can do EXACTLY the same thing with SSL (at least with Netscape)
    > that you can do with SSH: tell it to accept an unsigned certificate in
    > perpetuity.

    After the five boxes, sure. And what I can't seem to do is
    turn off the paranoid behaviour for all self-signed sites.

    > > Sure, but that's apples and oranges. SSH's user base is
    > > people who use terminal connections, and in that user base
    > > it dominates (at least in the Unix world, see above).
    > Even this isn't true. Telnet is still very widely used.
    > I suspect that the problem here is availabity bias: you don't
    > see a random sample of users--and users who use terminal
    > connections aren't a random sample of Interent users.

    Well, this is why I qualify it to the Unix world, the original
    user base for SSH. Telnet itself is widely used where SSH is
    not easily available out of the box, sure, but those problems
    are related to lack of good windows clients and distribution,
    not to the overall engineering choices we are discussing here.

    > > SSL's user base is people who browse. My point is not
    > > that it is *not* out there, but that it is only used in a
    > > tiny fraction of web sessions. It's almost unmeasurable,
    > > less than 1% is my guess.
    > I'm not convinced that the problem here is certificates. Rather, I
    > suspect that the problem is performance: Consider that even sites that
    > already have certificates still carry the vast majority of their
    > traffic over HTTP.

    True, performance is another consideration. But a secondary
    one. The majority of sites that make this choice are large,
    and thus are up against performance considerations because
    they accept thousands of connections. But the real majority
    of all sites couldn't care less about performance. They would
    use SSL if it came by default, I suggest. Just like the nobody
    cares about SSH performance.

    (I once had a Sun IPC that consumed 12% of CPU for a single
    SSH. So I switched from t-des to blowfish and it disappeared
    from view... PCs these days can do a hundred public key
    operations a second [type 'openssl', then 'speed rsa']. So,
    yes, for the big sites this might be an issue. But not for
    the vast majority.)

    > I agree with you to the following extent: SSH is better adapted to its
    > environment than SSL (though using some Zero-Knowledge Password
    > Protocol would make it even better suited), but this isn't a result of
    > SSH being better engineered but of the environment being easier to
    > adapt to: the user base is more clueful and you only connect to
    > a few machines.

    I'm not actually sure of that - the browser base is apparently
    good enough to understand what the little lock symbol is about.

    (I don't see what number of machines has to do with it?
    Hmm, maybe Ben's point pertains....)

    Security is about risk management more than it is about
    perfect protocols. The success of a good security system
    is in protecting the most for the least cost. Within its
    environment, SSH wins and SSL loses on a risk management
    scorecard; SSL tried to be 100% secure and thus sacrificed
    99% of its potential utility. SSH accepts 99% security
    (the 1% being an exaggeration of the infamous MITM), and
    achieved a dominating usage penetration.

    Multiple those numbers to get a utility ratio. Call
    SSH's market share in Unix terminal connections as 50%
    and you get 4950. Half the uses are protected 99% of the
    time.

    Against SSL's paltry 100. Sure, we can debate this formula
    for another 100 threads, but it is as good an index of the
    success of the engineering choices as any other we're likely
    to come up with.

    -- 
    iang
    


     
    From: Eric Rescorla (ekrrtfm.com)
    Date: Sat Jan 06 2001 - 13:58:53 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    > Eric Rescorla wrote:
    >
    > > Both browsers and servers ALREADY support anonymous connections.
    >
    > There is a huge difference between SUPPORT and working out
    > of the box. In my world, httpd would work out of the box if
    > the server started up and created a self signed certificate
    > straight away and ran without any more intervention. Just
    > like sshd.
    As I said earlier, SSL operates under a different threat model
    than SSH. SSH connections are by and large to servers you've
    already contacted before. SSL needs to support spontaneous
    connections to many hosts which you've never seen before and have
    absolutely no prior relationship with.

    > SSL (or more properly, any brower that implements it)
    > assumes that the MITM is a serious danger and proceeds
    > to warn the user - to such an extent that everyone is
    > led to the belief that this is a broken site. This is
    > a travesty of risk management - which is why I'm real
    > keen on finding documented evidence of a real live MITM
    > (other than demos), or even just a credit card being
    > sniffed from an open connection.
    I don't consider this to be a reasonable attitude when
    designing a security system. There are lots of attacks on TCP
    which were known when the protocol was designed (or shortly
    thereafter) but which we're only now starting to see real attacks
    based on.

    One of the guiding principles of network security is to design
    based on an attacker's capabilities, not his current behavior.

    > After the five boxes, sure. And what I can't seem to do is
    > turn off the paranoid behaviour for all self-signed sites.
    It's a matter of opinion whether this is a bug or a feature. You can turn
    it off for any SPECIFIC site.

    We're now far off the track of discussing SSL the protocol. We're
    discussing specific implementations. Not the same thing.

    > > > Sure, but that's apples and oranges. SSH's user base is
    > > > people who use terminal connections, and in that user base
    > > > it dominates (at least in the Unix world, see above).
    > > Even this isn't true. Telnet is still very widely used.
    > > I suspect that the problem here is availabity bias: you don't
    > > see a random sample of users--and users who use terminal
    > > connections aren't a random sample of Interent users.
    >
    > Well, this is why I qualify it to the Unix world, the original
    > user base for SSH.
    Telnet is still widely used in the Unix world.

    > Telnet itself is widely used where SSH is
    > not easily available out of the box, sure, but those problems
    > are related to lack of good windows clients and distribution,
    > not to the overall engineering choices we are discussing here.
    I disagree. Your argument hinges around the claim that SSH's
    ubiquity is a result of superior engineering. The observation
    that SSH isn't really ubiquitous destroys the very foundation of
    your argument.

    > True, performance is another consideration. But a secondary
    > one. The majority of sites that make this choice are large,
    > and thus are up against performance considerations because
    > they accept thousands of connections. But the real majority
    > of all sites couldn't care less about performance. They would
    > use SSL if it came by default, I suggest. Just like the nobody
    > cares about SSH performance.
    >
    > (I once had a Sun IPC that consumed 12% of CPU for a single
    > SSH. So I switched from t-des to blowfish and it disappeared
    > from view... PCs these days can do a hundred public key
    > operations a second [type 'openssl', then 'speed rsa']. So,
    > yes, for the big sites this might be an issue. But not for
    > the vast majority.)
    SSH has completely different perfromance behavior than SSL.
    SSL performance is dominated by handshake, not data transmission
    so the RSA operation is very important. Moreover, 'openssl speed rsa'
    rather overestimates the performance of SSL on real systems.

    Since you can't just switch out RSA, your story about switching from
    3DES to Blowfish isn't really relevant. In fact, most SSL connections
    already use RC4, which is even faster.

    > > I agree with you to the following extent: SSH is better adapted to its
    > > environment than SSL (though using some Zero-Knowledge Password
    > > Protocol would make it even better suited), but this isn't a result of
    > > SSH being better engineered but of the environment being easier to
    > > adapt to: the user base is more clueful and you only connect to
    > > a few machines.
    >
    > I'm not actually sure of that - the browser base is apparently
    > good enough to understand what the little lock symbol is about.
    >
    > (I don't see what number of machines has to do with it?
    > Hmm, maybe Ben's point pertains....)
    The point is that the attacker only has a very few chances to
    MITM SSH, because you have the one or two relevant keys cached.
    This doesn't apply to SSL where you are likely to connect to a large
    number of secure sites.

    > Security is about risk management more than it is about
    > perfect protocols. The success of a good security system
    > is in protecting the most for the least cost. Within its
    > environment, SSH wins and SSL loses on a risk management
    > scorecard; SSL tried to be 100% secure and thus sacrificed
    > 99% of its potential utility. SSH accepts 99% security
    > (the 1% being an exaggeration of the infamous MITM), and
    > achieved a dominating usage penetration.
    The problem is that it your utility index is highly environment
    specific. Sure, at the moment people don't actively attack SSL because
    the tools weren't available and there was low hanging fruit. As other
    easier security holes get closed, attackers will turn to the more
    difficult ones. That's the case I believe we should design for.
    If you don't agree with that design principle, I propose we
    agree to disagree.

    -Ekr


     
    From: Bram Cohen (bramgawth.com)
    Date: Sat Jan 06 2001 - 15:25:19 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    On Sat, 6 Jan 2001, Eric Rescorla wrote:

    > > SSL (or more properly, any brower that implements it)
    > > assumes that the MITM is a serious danger and proceeds
    > > to warn the user - to such an extent that everyone is
    > > led to the belief that this is a broken site. This is
    > > a travesty of risk management - which is why I'm real
    > > keen on finding documented evidence of a real live MITM
    > > (other than demos), or even just a credit card being
    > > sniffed from an open connection.
    >
    > I don't consider this to be a reasonable attitude when
    > designing a security system. There are lots of attacks on TCP
    > which were known when the protocol was designed (or shortly
    > thereafter) but which we're only now starting to see real attacks
    > based on.

    So what? TCP/IP has been very successfull, and part of that success comes
    from what at the time it was created were emminently reasonable tradeoffs
    between performance and security. It's certainly better in that regard
    than many of the protocols it beat out, which would go down accidentally,
    without any sort of malicious intervention at all.

    Besides, there's no way all the potential problems in TCP could have been
    forseen and fixed beforehand. The correct way to deal with such problems
    is to plan on a transition to something like IPv6, which is slowly in the
    process of happening.

    Projects which try to be perfect the first time always fail.

    -Bram Cohen

    "Markets can remain irrational longer than you can remain solvent"
                                            -- John Maynard Keynes


     
    From: Niels Möller (nisselysator.liu.se)
    Date: Sat Jan 06 2001 - 15:32:00 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Jim Choate <ravagessz.com> writes:

    > If I already trust the key why am I authenticating it?

    This sounds confused. There are two things that have to be checked
    before allowing access based on "public key" authentication:

    1. That the public key is "authorized" or "trusted". This sounds
       pretty vague, but what it really means is that there is some reason
       to believe that every user who knows the corresponding _private_
       key should be allowed access. Or put another way: that the owner of
       the resource being accessed has delegated access to the owner of
       that private key (whoever that owner is).

    2. That the user at the other end indeed knows the corresponding
       private keys.

    For the basic public-key mechanisms in ssh (all versions), checking
    (1) is simple but primitive: A public key is considered authorized iff
    it is present in the authorized_keys database (or known_hosts
    database, for server keys). It's up to the user and sysadm's to make
    sure that databases matches reality. The protocol exchange only checks
    (2).

    If you use x509/spki/openpgp certificates, the server software and
    protocol will do more of the work to check (1). No ssh implementation
    I know of really implements that, though. Mine (lsh) aims at using
    spki, but that support is still very limited.

    Bottom line: The "auth" part in "SSH public-key authentication" refers
    to authentication of a *user* (or server), not a key.

    Regards,
    /Niels


     
    From: Eric Rescorla (ekrrtfm.com)
    Date: Sat Jan 06 2001 - 15:48:02 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    > On Sat, 6 Jan 2001, Eric Rescorla wrote:
    >
    > > > SSL (or more properly, any brower that implements it)
    > > > assumes that the MITM is a serious danger and proceeds
    > > > to warn the user - to such an extent that everyone is
    > > > led to the belief that this is a broken site. This is
    > > > a travesty of risk management - which is why I'm real
    > > > keen on finding documented evidence of a real live MITM
    > > > (other than demos), or even just a credit card being
    > > > sniffed from an open connection.
    > >
    > > I don't consider this to be a reasonable attitude when
    > > designing a security system. There are lots of attacks on TCP
    > > which were known when the protocol was designed (or shortly
    > > thereafter) but which we're only now starting to see real attacks
    > > based on.
    >
    > So what? TCP/IP has been very successfull, and part of that success comes
    > from what at the time it was created were emminently reasonable tradeoffs
    > between performance and security.
    A number of the TCP security holes could have been prevented with
    only trivial changes to the protocol--SYN flooding and TCP sequence number
    prediction both come to mind.

    -Ekr


     
    From: Josh Crane (jcranebit.net.au)
    Date: Sat Jan 06 2001 - 16:52:19 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    I've been watching this post for a while now, amongst others, and I think I
    probably need an explanation in defence of SSL and any other session
    encyption for that matter. You will understand what I mean after my
    following comments.

    To be honest, I'm not so sure I find any data xfer protection between hosts
    all that relevant when there is so much capacity for direct host exploiting.
    By and large, I believe there is far more apropriate vulnerabilities already
    existing on the hosts themselves which would obviously allow interception of
    pre encrypted data.

    Despite what I've encountered to be popular belief, no server is wrapped up
    so tight that it has become an iron box with a mere peephole, not even the
    "big suckers". Why waste time in sniffing encrypted sessions when a simple
    insertion point between data generation / aggregation and encryption
    routines, or even better, manual data extraction, is near trivial compared
    to all this talk of POTENTIAL, sometimes successful encryption breach.

    All due credit to static encyption for long or even short term storage on
    any given host, but again there is always a routine before encryption or
    after decryption that can be penetrated or dis-assembled for exploitation.
    Still, it is nice to (with ease) wrap up your stuff nice and tight to add an
    extra step in potential accessibility, but certainly not to the point that
    where we're so concerned with it that we seemingly try to make it the be all
    and end all solution, because in reality I believe, it's almost nothing in
    the link to actual breach.

    Basically, if you've taken out the target, why must we concern ourselves
    with actual data session encryption at all?

    In argument to my point, I suppose it could be good to limit self-exposure
    to the actual source and target of a given session to maintain anonymity,
    but often times if you've exploited a hop on route for sniffing purposes,
    you'd be cleaning your mess up as you go, hence making for a clear path of
    attack directly to the host itself. Why not do it properly and really set
    yourself up, instead of a mere sniff of what's in the link.

    The only benefit of sniffing these sessions I guess is to identify what's
    there in the first place, only if it can't be done through other means.
    Though again, as I've seen in some discussion, it seems to me that it can be
    somewhat of an effort or even cost to set up session encryption, which would
    suggest that if it's there, it's worthwhile, otherwise they typcially
    wouldn't have bothered, right?

    Assuming that this is the type of predator that we'd ever be talking
    about... i.e. not lazy and good at what they do, would they not take a
    direct look anyway. Certainly anyone I know or have heard anything about
    wouldn't stuff around and get directly in the host.

    Cheers.


     
    From: Boot Man (freesignupearthlink.net)
    Date: Sat Jan 06 2001 - 16:24:15 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Dear coderpunkstoad.com,

    *********STOCKING STUFFER***********

    Got a New Hard Drive?

    Are you a professional that builds or fixes computers?

    Like To Play DUKE 3D or other DOS BASED GAMES?

    Has your Computer ever CRASHED?

    Just want to FORMAT and Start Over?

    THE ABSOLUTE MUST HAVE FOR ANY COMPUTER USER!!

    This Jam Packed Disk has Auto Drivers for Every CD-ROM on the Planet!

    100% Guaranteed to work perfectly!

    **********ORDER INFORMATION************
    Get This Disk Now
    http://greatbootdisk.allhere.com/
    Secure Visa/MC through paypal.com
    **********ORDER INFORMATION************

    This disk is designed to aid with the install of Windows 95/98. This disk has been thoroughly tested and has worked every time!

    The Ultimate Boot Disk also comes with a two page instruction guide to help with
    Formatting your Hard Drive
    AND
    Setting Up Windows 95/98

    **********ORDER INFORMATION************
    Get This Disk Now
    http://greatbootdisk.allhere.com/
    Secure Visa/MC through paypal.com
    **********ORDER INFORMATION************

    ORDER FORM for Check/Money Order Payments:
    --------------------------------------------------------------
    Please send $7.50 to:
    Boot Disk
    2204 Florida Dr.
    Fort Wayne, IN 46805

    Name_____________________________________________

    Address__________________________________________

    City_____________________________________________

    State / Zip______________________________________

    Phone #: ________________________________________
    (For problems with your order only. No salesmen will call.)

    Email Address____________________________________

    [ ] YES! Please rush my Ultimate Boot Disk. I
    understand I have a 100% Satisfaction Guarantee and can return
    my order for the purchase price at any time.

    [ ] DOUBLE YES! I am ordering before January 31st 2000!
    Please include the extra special bonuses!

    Note - If ordering outside continental US, please add $2 to S&H

    Get This Disk Now
    http://greatbootdisk.allhere.com/
    Secure Visa/MC through paypal.com

    You are receiving this list because you were targeted as a person who prefers to pay through the online service paypal.com. This email was not sent out by Paypal or endorsed by the company itself.
    To Remove Yourself From This List: reply to this email with the email
    address that you would like removed and the word REMOVE in the subject heading.


     
    From: Eric Rescorla (ekrrtfm.com)
    Date: Sat Jan 06 2001 - 22:06:26 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    > I've been watching this post for a while now, amongst others, and I think I
    > probably need an explanation in defence of SSL and any other session
    > encyption for that matter. You will understand what I mean after my
    > following comments.
    >
    > To be honest, I'm not so sure I find any data xfer protection between hosts
    > all that relevant when there is so much capacity for direct host exploiting.
    > By and large, I believe there is far more apropriate vulnerabilities already
    > existing on the hosts themselves which would obviously allow interception of
    > pre encrypted data.
    >
    > Despite what I've encountered to be popular belief, no server is wrapped up
    > so tight that it has become an iron box with a mere peephole, not even the
    > "big suckers". Why waste time in sniffing encrypted sessions when a simple
    > insertion point between data generation / aggregation and encryption
    > routines, or even better, manual data extraction, is near trivial compared
    > to all this talk of POTENTIAL, sometimes successful encryption breach.
    The whole purpose of encryption is to ensure that attacking the traffic is
    not the easiest attack.

    -Ekr


     
    From: James H. Cloos Jr. (cloosjhcloos.com)
    Date: Sat Jan 06 2001 - 23:04:53 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    >>>>> "Bram" == Bram Cohen <bramgawth.com> writes:

    Bram> This has the problem that someone could DoS by redirecting dns
    Bram> to a bogus site with a bogus key though.

    Not really any different than redirecting toa bogus site w/ bogus
    data, though, eh? Ie, no more of a problem than the status quo.

    -JimC

    -- 
    James H. Cloos, Jr.  <http://jhcloos.com/public_key>     1024D/ED7DAEA6 
    <cloosjhcloos.com>  E9E9 F828 61A4 6EA9 0F2B  63E7 997A 9F17 ED7D AEA6
    


     
    From: Olivier Galibert (galibertpobox.com)
    Date: Sun Jan 07 2001 - 12:23:30 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    I have 32768 16bit values that are the result of the hardware
    decryption of the same value (ffff) at 32768 consecutive adresses
    (starting at f0000). Nobody knows how the encryption work, except
    that it only depends on the address and the 16 bit value at that
    address (no hidden state).

    With these 36768 values, it should at least be possible to get a clue
    on how the address indluences the process. Problem is, I have no idea
    where to start. So it would be nice if you could point me to
    resources (books, websites, whatever) on the subject. All I can find
    is of the "algorithm known, key unknown" category.

      OG.

    PS: The 64K file is available on request for the curious.


     
    From: Ben Laurie (benalgroup.co.uk)
    Date: Sun Jan 07 2001 - 15:01:45 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Olivier Galibert wrote:
    >
    > I have 32768 16bit values that are the result of the hardware
    > decryption of the same value (ffff) at 32768 consecutive adresses
    > (starting at f0000). Nobody knows how the encryption work, except
    > that it only depends on the address and the 16 bit value at that
    > address (no hidden state).
    >
    > With these 36768 values, it should at least be possible to get a clue
    > on how the address indluences the process. Problem is, I have no idea
    > where to start. So it would be nice if you could point me to
    > resources (books, websites, whatever) on the subject. All I can find
    > is of the "algorithm known, key unknown" category.

    Spot the guy who is trying to hack a ROM. What's the bets its in a
    phone?

    BTW, I did this once, many years ago - it helps to remember that
    whatever the algorithm is is likely to be realisable in a relatively
    small number of gates, and not involve arithmetic (as such). Since it
    also has to be reversible (or, to put it another way, entropy
    conserving), it is likely to be entirely composed of transpositions and
    XORs.

    Cheers,

    Ben.

    --
    http://www.apache-ssl.org/ben.html
    

    "There is no limit to what a man can do or how far he can go if he doesn't mind who gets the credit." - Robert Woodruff


     
    From: Olivier Galibert (galibertpobox.com)
    Date: Sun Jan 07 2001 - 15:41:23 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    On Sun, Jan 07, 2001 at 09:01:45PM +0000, Ben Laurie wrote:
    > Spot the guy who is trying to hack a ROM. What's the bets its in a
    > phone?

    Bet lost. Anybody reading slashdot recently should be able to guess
    where the ROM is coming from ;-)

    > BTW, I did this once, many years ago - it helps to remember that
    > whatever the algorithm is is likely to be realisable in a relatively
    > small number of gates, and not involve arithmetic (as such). Since it
    > also has to be reversible (or, to put it another way, entropy
    > conserving), it is likely to be entirely composed of transpositions and
    > XORs.

    Yup, that's what I'm thinking too. Also, this particular hardware
    exists since 1993. It can't be that advanced.

      OG.


     
    From: Bram Cohen (bramgawth.com)
    Date: Sun Jan 07 2001 - 17:00:15 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    On 6 Jan 2001, James H. Cloos Jr. wrote:

    > >>>>> "Bram" == Bram Cohen <bramgawth.com> writes:
    >
    > Bram> This has the problem that someone could DoS by redirecting dns
    > Bram> to a bogus site with a bogus key though.
    >
    > Not really any different than redirecting toa bogus site w/ bogus
    > data, though, eh? Ie, no more of a problem than the status quo.

    With the current system once the dns entry is fixed the end user can view
    the site properly, if clients accepted all keys initially didn't allow
    sites to change them later that wouldn't be the case.

    -Bram Cohen

    "Markets can remain irrational longer than you can remain solvent"
                                            -- John Maynard Keynes


     
    From: James H. Cloos Jr. (cloosjhcloos.com)
    Date: Sun Jan 07 2001 - 19:01:50 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    >>>>> "Bram" == Bram Cohen <bramgawth.com> writes:

    Bram> With the current system once the dns entry is fixed the end user
    Bram> can view the site properly, if clients accepted all keys initially
    Bram> didn't allow sites to change them later that wouldn't be the case.

    I was thinking just of current clients and not of new ones.
    Point well taken.

    -JimC

    -- 
    James H. Cloos, Jr.  <http://jhcloos.com/public_key>     1024D/ED7DAEA6 
    <cloosjhcloos.com>  E9E9 F828 61A4 6EA9 0F2B  63E7 997A 9F17 ED7D AEA6
    


     
    From: Bram Cohen (bramgawth.com)
    Date: Sun Jan 07 2001 - 20:20:01 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Hey everyone, I have another question related to Envelope Mail :)

    The way Envelope Mail uses crypto is pretty clear now, and it looks like
    it might be possible for it to use PGP. Mostly, this depends on being able
    to get an implementation of the following API -

    String encrypt(String plaintext, String[] public_keys)
    String decrypt(String ciphertext, String private_key)
    String[] get_key_identifiers(String ciphertext)

    I think this is essentially a very simplified version of the API for PGP,
    so specific parameters would have to be picked. Does anyone know if my
    sense is accurate, and if so, would you have suggestions for what the
    parameters should be? (PGP version, cipher, key length, etc.)

    -Bram Cohen

    "Markets can remain irrational longer than you can remain solvent"
                                            -- John Maynard Keynes


     
    From: sbrown249excite.com
    Date: Sat Jan 06 2001 - 11:50:02 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]


    Looking For Sales, or Exposure,
    we offer fresh targeted or general emails
    sent for you with current email addresses.
    Watch your business grow.


    We GUARANTEE response !

    * Daily reports on your email send !

    * 2001 Introductory Special !!!

    * We can even create your ad or announcement for you !


    CALL 8 am. - 3:30 pm. P.S.T. 702-242-5725 or 702-528-2400



    For removal see below.





    ++++++++++++++++++++++++++++++++++++++++++++++++++++++++
    Sorry if you received this message in error.
    If you wish to be removed. Please, type "REMOVE"
    in the subject line:MAILTO: remove101excite.com
    ++++++++++++++++++++++++++++++++++++++++++++++++++++++++



    Looking For Sales, or Exposure,

    we offer fresh targeted or general emails

    sent for you with current email addresses.

    Watch your business grow.


     
    From: Alex Alten (Altenhome.com)
    Date: Mon Jan 08 2001 - 02:27:10 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    At 11:58 AM 1/6/2001 -0800, Eric Rescorla wrote:
    >> Eric Rescorla wrote:
    >>
    >> > Both browsers and servers ALREADY support anonymous connections.
    >>
    >> There is a huge difference between SUPPORT and working out
    >> of the box. In my world, httpd would work out of the box if
    >> the server started up and created a self signed certificate
    >> straight away and ran without any more intervention. Just
    >> like sshd.
    >As I said earlier, SSL operates under a different threat model
    >than SSH. SSH connections are by and large to servers you've
    >already contacted before. SSL needs to support spontaneous
    >connections to many hosts which you've never seen before and have
    >absolutely no prior relationship with.
    >

    Ian has a very valid point. The MitM threat model that SSL is trying
    to prevent was overkill for the vast majority of web users. A decent
    privacy-only design with say replay protection is all that's needed in
    general. Then you get rid of the lengthy handshake, the high cpu
    overhead of RSA and the cumbersome certificate management (for example,
    remember a year ago when many older browsers had their RSA certs expire,
    it was worse than Y2K).

    The only counter point I can think of is that you want to cover all
    types of transactions, including very high value ones. But, the
    default behavior of SSL (with server-only authentication) is no good
    anyway for those types of transactions.

    --
    

    Alex Alten

    AltenHome.Com


     
    From: Derek Atkins (warlordMIT.EDU)
    Date: Mon Jan 08 2001 - 09:41:21 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Unfortunately this is a VERY simplistic version of the PGP API... You
    would at least still need to supply the following for encryption:
            1) encryption cipher
            2) random numbers (for key generation)

    For decryption, you would need to pass a callback to ask for a
    password to decrypt the private key, and perhaps a pointer to a
    keyring. Unless your 'get_key_identifiers' is supposed to return the
    list of keys that can decrypt a ciphertext, in which case you would
    need to make two calls to the PGP API (it attempts to build a one-pass
    system).

    This all presumes you are not signing the ciphertext.

    -derek

    Bram Cohen <bramgawth.com> writes:

    > Hey everyone, I have another question related to Envelope Mail :)
    >
    > The way Envelope Mail uses crypto is pretty clear now, and it looks like
    > it might be possible for it to use PGP. Mostly, this depends on being able
    > to get an implementation of the following API -
    >
    > String encrypt(String plaintext, String[] public_keys)
    > String decrypt(String ciphertext, String private_key)
    > String[] get_key_identifiers(String ciphertext)
    >
    > I think this is essentially a very simplified version of the API for PGP,
    > so specific parameters would have to be picked. Does anyone know if my
    > sense is accurate, and if so, would you have suggestions for what the
    > parameters should be? (PGP version, cipher, key length, etc.)
    >
    > -Bram Cohen
    >
    > "Markets can remain irrational longer than you can remain solvent"
    > -- John Maynard Keynes
    >

    -- 
           Derek Atkins, SB '93 MIT EE, SM '95 MIT Media Laboratory
           Member, MIT Student Information Processing Board  (SIPB)
           URL: http://web.mit.edu/warlord/    PP-ASEL-IA     N1NWH
           warlordMIT.EDU                        PGP key available
    


     
    From: Bill Stewart (bill.stewartpobox.com)
    Date: Mon Jan 08 2001 - 11:30:32 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    At 12:27 AM 1/8/01 -0800, Alex Alten wrote:
    >Ian has a very valid point. The MitM threat model that SSL is trying
    >to prevent was overkill for the vast majority of web users. A decent
    >privacy-only design with say replay protection is all that's needed in
    >general. Then you get rid of the lengthy handshake, the high cpu
    >overhead of RSA and the cumbersome certificate management (for example,
    >remember a year ago when many older browsers had their RSA certs expire,
    >it was worse than Y2K).

    I disagree - it's much easier to do a DNS hack and implement MITM
    than to sniff bits off the wire except in special environments
    like universities. If DNSSEC had been widely deployed at the time
    the web commercialized, much of the need for complexity in SSL
    would have been eliminated, but that wasn't the case,
    and getting SSL out at all was a major end-run around crypto export laws.

    It's unnecessarily ugly, and much of the cumbersome cert management
    came from the X.509 world, but the authentication job has to be done,
    either in DNS or in SSL, so you won't dodge the RSA computation.
    Doing it in SSL has the advantage that you can protect the full pathname,
    while virtual servers let lots of machines share the same IP address,
    limiting what you can do with reverse lookups.
                                    Thanks!
                                            Bill
    Bill Stewart, bill.stewartpobox.com
    PGP Fingerprint D454 E202 CBC8 40BF 3C85 B884 0ABE 4639


     
    From: lcs Mixmaster Remailer (mixanon.lcs.mit.edu)
    Date: Mon Jan 08 2001 - 13:20:01 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    I've been looking at implementing "Practical Techniques for Searches
    on Encrypted Data", by Dawn Song, David Wagner, and Adrian Perrig,
    available from http://www.cs.berkeley.edu/~daw/papers/encsearch-oak00.ps.
    The purpose of this is to allow a server to hold encrypted data that
    it can't decrypt, but still be able to search for selected words in the
    data when requested by the owner of the decryption key.

    The basic idea is to encrypt using a stream cipher on a per-plaintext-
    word basis. The encryption stream (which gets xored with the plaintext)
    is the concatenation of stream cipher data and a keyed hash of the
    stream cipher data, where the key depends on the plaintext word and the
    user's password.

    Searching the encrypted data can be done by releasing the plaintext
    word (in the simplest model), allowing the server to recover the stream
    cipher output and then to compute the keyed hash and compare with the
    actual data. See the paper for elaborations which hide the word being
    searched for from the server.

    There are a couple of parameters in the paper which are left to the
    implementor to choose. One is n, the word size; another is m, the size
    of the "checksum" data which is appended to the stream cipher.

    The choice of m is free of security issues. Making it smaller saves
    space at the expense of increasing the chance of false positives -
    cases where the checksum gets matched solely by accident. For typical
    searches over documents with perhaps tens of thousands of words at most,
    24 or 32 bits would be more than large enough for m.

    Choosing n does involve security. As defined in the paper, n includes
    the m checksum bits. Therefore n-m bits of the stream cipher are used
    per word. The risk is that the same stream cipher encryption value may
    come up twice if n-m is too small; in that case the keyed hash would
    produce the same output if the same word were encrypted, and this could
    conceivably be detected by an attacker.

    Therefore it is necessary for n-m to be large enough to prevent duplicates
    in the stream cipher data. Probably 64 bits would be a minimum choice
    to maintain strong security, for the same reasons that it is the minimum
    reasonable block size for ciphers.

    This then makes n be a minimum of about 88 to 96 bits. Each word will
    be expanded to this size, about 12 bytes. This is about a factor of 2.5
    expansion for typical English text.

    Other implementation issues that arise relate to non-text words,
    punctuation and such. It is necessary for each word to be within
    its own encryption block of 12 bytes in order for the search to work.
    We'd like a word to be found regardless of what punctuation terminates
    it, whether it is a comma, a space or a period. (or something else like
    a parenthesis). This seems to require that inter-word punctuation be
    within its own 12-byte encryption block.

    In my implementation I assume that words are separated by single spaces,
    since that is the most common case, and only use a punctuation block when
    there is non-single-space punctuation between the two words. This means
    that each comma, newline, period or other punctuation expands to 12 bytes.
    It's costly, and contributes to text expansion.

    Words 12 bytes or longer get stored as more than one block in my
    implementation, meaning that you can only search on the first 12 letters
    of a long word (and might get some false positives by hits on the second
    12 letters of words). However few words are this long so it is hopefully
    not a big problem.

    After all this analysis, it seems that there might be a simpler method
    of achieving the goals of the paper. Rather than building a checksum
    into the encryption stream, consider encrypting the message in some fully
    conventional way, but also outputting a separate keyed hash of each word
    of the document. Decryption would ignore the hash list and just use
    the encrypted data, while searching would use only the hash list and
    not the encryption.

    After some trial and error, a suitable form for the hash would seem to be:
    H( sequence_number, H( key, word ) ). Sequence_number is the sequence
    number of the word in the document (1, 2, 3, etc.), present to keep it
    from being obvious when the same word appears more than once. Key is the
    user's passphrase, and word is the word being searched for. The user
    reveals H( key, word ) and the server hashes that with consecutive
    sequence numbers, comparing with the correspondingly numbered entries
    in the hash list.

    Are there security weaknesses in this which I have overlooked?

    If it works OK (or any weaknesses can be repaired) then this would seem
    to have some efficiency advantages. First, the document itself can be
    encrypted conventionally, improving compatibility with existing systems
    and also allowing for compression to be used, which is impossible in the
    Song/Wagner/Perrig method. Second, punctuation can be left entirely out
    of the hash table, eliminating one of the causes of ciphertext expansion.
    These two factors should hopefully lead to smaller ciphertexts.

    Thanks for any comments.


     
    From: RecruitmentKSM2000.com
    Date: Mon Jan 08 2001 - 14:53:43 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    SOFTWARE BETA TESTERS REQUIRED

    Welcome to KSM2000, we are the fulfilment agents for our clients MicroService.

    Our client is actively seeking to recruit 1000 beta software testers throughout Europe and we have been placed with the challenge of locating them.

    So where better than here in your newsgroup, will we find possible candidates. This is not a SPAM mail.

    If you thing that this type of opportunity would be of interest to you, we would be grateful if you would use the link below to mail us your interest.

    The subject line should contain: Beta Microservice

    And the contents: Your full name, address, postcode and of course your E-mail address. On receipt of this mail we will forward you full details of the positions available.

    Please note this is not a full time employment opportunity.

    Mailto: Microservice.Ksm2000.com


     
    From: Bram Cohen (bramgawth.com)
    Date: Mon Jan 08 2001 - 17:08:30 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    On 8 Jan 2001, Derek Atkins wrote:

    > Unfortunately this is a VERY simplistic version of the PGP API...

    That's fine. Just so long as the PGP API doesn't have too much weird crap
    in it.

    > You would at least still need to supply the following for encryption:
    >
    > 1) encryption cipher
    > 2) random numbers (for key generation)

    Those are both doable, in fact the second one I left off as a feature
    'cause I thought it would be a problem.

    > For decryption, you would need to pass a callback to ask for a
    > password to decrypt the private key, and perhaps a pointer to a
    > keyring. Unless your 'get_key_identifiers' is supposed to return the
    > list of keys that can decrypt a ciphertext, in which case you would
    > need to make two calls to the PGP API (it attempts to build a one-pass
    > system).

    *sigh*

    One *could* use the whole public key as the identifier. I foolishly
    assumed PGP actually had some decent engineering somewhere in there.

    But it is, essentially, possible to do the wrapping I want? Are the only
    arbitrary decisions I need to make along the lines of picking 3des for the
    cipher, picking the number of bits for the public keys, and picking some
    way of making a stream cipher for the random numbers?

    > This all presumes you are not signing the ciphertext.

    No signing right now. That might be added later, but not now.

    -Bram Cohen

    "Markets can remain irrational longer than you can remain solvent"
                                            -- John Maynard Keynes


     
    From: ispypost.com
    Date: Mon Nov 08 1999 - 17:48:55 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

     
    ////////////////////////////////////////
    one time mailing-
    no need to remove
    ////////////////////////////////////////

    CONFIDENTIAL INFORMATION YOU WANT TO KNOW.

    This is the software they want banned from the INTERNET!

    "The Internet Desktop Spy" shows you how to get the facts on anyone using the
    Internet.

    LOCATE MISSING PERSONS, find lost relatives, obtain addresses and phone
    numbers of old school friends, even skip trace dead beat spouses. This is
    not a Private Investigator, but a SOFTWARE program DESIGNED to automatically
    CRACK YOUR CASE with links to thousands of Public Record Databases

    Find out SECRETS about your relatives, friends, enemies, and everyone else!
    -- even your spouse! With the New - "Internet Desktop SPY"

    You will be AMAZED at what you can discover:

    LICENSE PLATE NUMBER - Get anyone's name and address with just a license
    plate number! (Find that girl you met in traffic!)

    DRIVING RECORD - Get anyone's driving record!

    SOCIAL SECURITY NUMBER - Trace anyone by social security number!

    ADDRESS - Get anyone's address with just a name!

    UNLISTED PHONE NUMBERS - Get anyone's phone number with just a name- even
    unlisted numbers!

    LOCATE - Long lost friends, relatives, a past lover who broke your heart!

    E-MAIL - Send anyone anonymous e-mail that's completely untraceable!

    DIRTY SECRETS - Discover dirty secrets your in-laws don't want you to know!

    INVESTIGATE ANYONE - Use the sources that private investigators use (all on
    the Internet) secretly!

    EX-SPOUSE - Learn how to get information on an ex-spouse that will help you
    win in court! (Dig up old skeletons)

    CRIMINAL SEARCH - BACKGROUND CHECK - Find out about your daughter's
    boyfriend! (or her husband)

    FIND OUT - If you are being investigated!

    NEIGHBORS - Learn all about your mysterious neighbors! Find out what they
    have to hide!

    PEOPLE YOU WORK WITH - Be astonished by what you'll learn about the people
    you work with!

    EDUCATION VERIFICATION - Did he really graduate college? Find out!

    "The Internet Desktop Spy" will help you discover ANYTHING about anyone, with
    clickable hyperlinks and no typing in Internet addresses! Just download the
    software and go! You will be shocked and amazed by the secrets that can
    be discovered about absolutely everyone! Find out the secrets they don't
    want you to know! About others, about yourself!

    LIMITED TIME OFFER -- ORDER TODAY! ONLY $20 (US)

    You can dowmload the "The Internet DeskTop Spy" software NOW so you can begin
    discovering all the secrets you ever wanted to know! You can know EVERYTHING
    about ANYONE with "The Internet DeskTop Spy" software.

    - Works with all browsers and all versions of AOL
    - PC Versions available Only!

    DON'T WAIT TO GET STARTED… It's as easy as 1, 2, 3.
    ORDER TODAY - While this software is still legal!

    VISA/MC ONLY

    STEP 1: Print out the below ORDER FORM
    STEP 2: Type or Print your order information into the form
    STEP 3: FAX Your order to us.

    FAX to: 650-745-3345

    (Order with confidence. This is a secure fax area. Only our qualified sales team will have access to your order information)

    ***************************************************************************************************************************
     "The Internet DeskTop Spy" ORDER FORM - PLEASE WRITE CLEARLY

    Name: ________________________________

    Address: ________________________________ (BILLING ADDRESS ON CREDIT CARD ONLY)

    City, State, ZIP: ________________________________

    Country: ______________ (International Orders)

    Phone Number: ______________ (In case we can't make out your order)

    TOTAL COST OF ORDER IS $20.00

     ALL ORDERS WILL BE PROCESSED WITHIN 48 HOURS OF RECEIPT

    METHOD OF PAYMENT – ID Code AXXX

    [ ]Visa [ ]MasterCard

    Credit Card #: __________________________________

    Exp Date: _______________

    Signature: ____________________________ (Required)

     E-Mail Address: ____________________________ *(VERY IMPORTANT-PRINT CLEARLY!! THIS MUST BE LEGIBLE)

     -NOTES: - This program will not work on Windows 3.11 and older.
    - Sorry, Mac versions not yet available.
     - DISCLAIMER - The seller of this powerful software resource will not be held responsible for how the purchaser chooses to use its resources.

     


     
    From: Microserviceksm2000.com
    Date: Tue Jan 09 2001 - 02:21:46 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    SOFTWARE BETA TESTERS REQUIRED

    Welcome to KSM2000, we are the fulfilment agents for our clients MicroService.

    Our client is actively seeking to recruit 1000 beta software testers throughout Europe and we have been placed with the challenge of locating them.

    So where better than here in your newsgroup, will we find possible candidates. Please ignore this mail and/or accept our apologies if it is not relevant to your newsgroup, but some of your users might just be interested.

    If you think that this type of opportunity would be of interest to you, we would be grateful if you would use the link below to mail us your interest.

    The subject line should contain: Beta Microservice

    And the contents: Your full name, address, postcode and of course your E-mail address. On receipt of this mail we will forward you full details of the positions available as soon as possible.

    Please note this is not a full time employment opportunity.

    mailto:MicroserviceKsm2000.com


     
    From: Nelson Brito (a.k.a. stderr) (stderrsekure.org)
    Date: Tue Jan 09 2001 - 07:58:29 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    -------- Original Message --------
    Subject: Advisory: PGP 7.0 signature verification vulnerability
    Date: Mon, 8 Jan 2001 15:58:58 +0100
    From: Michael Kjorling <michaelKJORLING.COM>
    Reply-To: Michael Kjorling <michaelKJORLING.COM>
    To: BUGTRAQSECURITYFOCUS.COM

    -----BEGIN PGP SIGNED MESSAGE-----
    Hash: SHA1

    Product: Pretty Good Privacy
    Severity: Medium to high
    Impact: Users with write access to signed exported key blocks may
    replace them with arbitrary keys without any warning being issued
    upon import of those keys
    Local: Yes
    Remote: No (though man-in-the-middle attacks is a possibility)
    Vendor status: Network Associates was contacted December 20; see
    below

    Confirmed vulnerable: PGP for Desktop Security, version 7.0.0.0 build
    242, on Windows 2000
    Suspected vulnerable: All versions of PGP 7.0
    Confirmed not vulnerable: none

    Disclaimer:

    This information is provided "as is", with no warranties of any kind,
    either expressed or implied. It was discovered through trial and
    error; the source code has not been examined as it has been out of my
    reach. I take no responsibility for how the information contained
    within this advisory is utilized.

    Description:

    There seems to be a vulnerability in the key import code in PGP 7.0
    on the Win32/Intel platform, causing a signature on a full exported
    and ASCII armored key block not to be checked when "Decrypt/Verify"
    is selected to import the key(s). This means that any signatures on
    the full exported key block is not checked, opening the possibility
    for anyone who have write access to the file to replace the keys
    without having to generate a new signature. Key signature
    verification, however, is not affected by this vulnerability.

    Exploit:

    Given the possibility to write to the PGP signed file containing the
    exported key(s), replace the keys without altering the signature. PGP
    will not warn the user upon import of the keys that the signature has
    become invalid. Man-in-the-middle attacks are also a possibility,
    given an eavesdropper listening on the communications channel and
    replacing the key material as it flows through the wires.

    Workaround:

    There is no known workaround, besides always verifying fingerprints
    with the owner of the key as well as not trusting keys that have no
    or just a few signatures.

    Vendor status:

    Network Associates was contacted by email to <pgpsupportnai.com> as
    per instructions from their support department on December 20th,
    2000, and they were advised that an advisory would be posted to
    Bugtraq on Jan 8. The email was encrypted with their "Software
    Release Key" which was the key I was pointed to when asking to whom I
    should encrypt the email, but I still have not heard back from them.

    Michael Kjörling
    michaelkjorling.com

    -----BEGIN PGP SIGNATURE-----
    Version: PGP 7.0
    Comment: All computers wait at the same speed.

    iQA/AwUBOlnVfSqje/2KcOM+EQLUgACePUxBaAKla2jBZzdquOeba3nESYYAoNdt
    0vzBXN6YIZ1V50EboF4maM3/
    =hJXy
    -----END PGP SIGNATURE-----

    -- 
    Nelson Brito
    Security Analyst && Penetration Tester
    Security Networks AG / IBQN - http://www.secunet.de/
    


     
    From: cablewageslave.co.uk
    Date: Tue Jan 09 2001 - 09:09:44 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    NOTE: THIS IS AN ADVERTISEMENT FOR LEGAL TV
    DE-SCRAMBLER IF YOU HAVE NO INTEREST IN THIS INFORMATION
    PLEASE CLICK DELETE NOW. THANK YOU--


    LEGAL CABLE TV DE-SCRAMBLER

    Want to watch Sporting Events?--Movies?--Pay-Per-View??

    *This is the Famous R-D-O Shack TV Descrambler
    You can assemble it from R-D-O Shack parts for about $12 or $15.

    We Send You:
    E-Z To follow Assembly Instructions.
    E-Z To read Original Drawings.
    The Famous R-D-O Shack Parts List.

    PLUS SOMETHING NEW YOU MUST HAVE!

    Something you can't do without.

    THE UP-TO-DATE REPORT: USING A DESCRAMBLER LEGALLY



    Warning: You should not build a TV Descrambler without
    reading this report first.

    Frequently Asked Questions--CABLE TV DESCRAMBLER

    Q: Will the descrambler work on Fiber, TCI, Jarrod
    and satellite systems?
    A: The answer is YES. In respect to satellite,
    you just get more stuff! There is one exception:
    The descrambler will not work with DSS satellite.

    Q: Do I need a converter box?
    A: This plan works with or without a converter box.
    Specific instructions are included in the plans for each!

    Q: Can the cable company detect that I have the descrambler?
    A: No, the signal descrambles right at the box and does
    not move back through the line!

    Q: Do I have to alter my existing cable system,
    television or VCR?
    A: The answer is no!

    Q: Does this work with my remote control?
    A: The answer is yes. The descrambler is
    manually controlled--but very easy to use!

    Q: Can you email me the plans?
    A: No the program comes with an easy to follow picture guide.

    Q: Does this work everywhere across the country?
    A: Yes, every where in the USA plus England,
    Brazil, Canada and other countries!

    Q: When I order, when will I get my stuff?
    A: We mail out all orders within 48 hours of receiving them.

    YOU SUPPLY A SELF-ADDRESSED, STAMPED, #10 LONG ENVELOPE, WITH
    TWO-FIRST CLASS STAMPS.


    Q: How much does it cost to get the instruction
    plans, the easy to follow diagram, and most
    important of all the Using a Descrambler LEGALLY.

    A: You get the complete package all for just--$10.00
    (Cash, Check or Postal Money Order.)
    (Arizona residents include 7% Arizona State Sales Tax)

    (All orders outside the U.S.A. add $5.00)

    ORDERS OUTSIDE THE US MUST BE IN THE FORM OF AN
    INTERNATIONAL MONEY ORDER PAYABLE FROM A US BANK OR US CASH!
    NO POSTAGE COUPONS ACCEPTED!
    FOREIGN CHECKS WILL BE RETURNED!

    Q: How do I order?
    A: Fill out form below and send it, along with your payment
    AND YOUR SELF ADDRESSED 2 STAMPED ENVELOPE to:

    N Duran
    PO BOX 8051
    Mesa, AZ 85214-8051

    MAKE CHECKS PAYABLE TO: N Duran

    PRINT YOUR:
    (orders without an envelope or stamps will be processed
    up to 2 weeks later than complete orders)

    DO NOT FORGET YOUR STAMPS!

    NAME_____________________________________________

    ADDRESS__________________________________________

    CITY/STATE/ZIP_____________________________________

    DO NOT FORGET YOUR 2, 34 cent stamps and #10 evenlope!





    *N Duran is NOT ASSOCIATED in any way with RADIO SHACK.
    Neither the design nor instructions were developed
    by, are sold by, or are endorsed by Radio Shack.
    Parts for this fine-tuning device are available
    at many electronics stores (including Radio Shack)
    This is not a Radio Shack product.








    **********************************************************************
    All REMOVE requests AUTOMATICALLY honored upon receipt.

    PLEASE understand that any effort to disrupt, close or block this
    REMOVE account can only result in difficulties for others wanting
    to be removed from our mailing list as it will be impossible to take
    anyone off the list if the remove instruction can not be received.

    To be removed from our mailing list please
    send an email to: movemeplease13looksmart.com.au
    and place remove in the subject
    Thank you
    *********************************************************


     
    From: partnersgetyourcasinonow.com
    Date: Tue Jan 09 2001 - 12:23:13 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Hello,
     
    I recently visited your website and believe you may be interested in forming a strategic partnership. Our company owns and operates fully licensed online casinos. We have over 30,000 clients and 8,500 partner websites.

    The online gaming industry is the most explosive on the net, with over $10 billion projected by 2002. We would like to offer you the following proposal:

    Qwest Global Intertainment provides:

    * Casino / sportsbook front end design (for an example, go to www.GetYourCasinonow.com)

    * All gaming software, customer service, credit card processing, and logistical support

    * Up to 50% of casino net-win (tracked in real-time)

    * Profit checks mailed each Friday, rain or shine

    You provide:

    * Website Promotion via banners, email, or search engine placement.

    Without assuming any of the risk, you can drive traffic to your personal

    Internet casino and immediately increase your company's residual income.

    I invite you to look at our corporate website at the following address:

    http://www.GetYourCasinonow.com

    I look forward to hearing from you!

    Partner Manager
    partnersgetyourcasinonow.com
    http://www.getyourcasinonow.com


     
    From: R. A. Hettinga (rahshipwright.com)
    Date: Tue Jan 09 2001 - 15:02:47 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    --- begin forwarded text

    Date: Tue, 9 Jan 2001 14:58:50 -0500
    To: dcsbai.mit.edu, dcsb-announceai.mit.edu
    From: "R. A. Hettinga" <rahshipwright.com>
    Subject: DCSB: Ted Byfield; ICANN, Intellectual Property, and Digital
     Commerce
    Cc: Ted Byfield <tbyfieldpanix.com>, Scott Moskowitz <scottbluespike.com>
    Sender: bounce-dcsbreservoir.com
    Reply-To: "R. A. Hettinga" <rahshipwright.com>

    -----BEGIN PGP SIGNED MESSAGE-----

    [Note that the Harvard Club is now "business casual". No more jackets
    and ties... --RAH]

              The Digital Commerce Society of Boston

                             Presents

                            Ted Byfield,
                         Moderator, Nettime
                       (among other things...)

                   ICANN, Intellectual Property,
                        and Digital Commerce

                     Tuesday, February 6th, 2000
                             12 - 2 PM
                  The Downtown Harvard Club of Boston
                    One Federal Street, Boston, MA

    Through an erratic process intended to "lessen the burdens of
    government," the Clinton administration transferred governance of the
    Internet's essential functions to the Internet Corporation for
    Assigned Names and Numbers. In trying to cement its status, ICANN has
    sought to transform the net's cooperative structures into a
    hierarchical contractual regime geared toward expanding and enforcing
    intellectual property claims. The result of ICANN's deviation from
    its technical coordination mandate into a captured policy-making
    proxy for an absent-minded US government is a centralized namespace
    that privileges the demands of late-adopters over innovative
    expansions of DNS. This talk will provide a survey of ICANN's
    activities to date and how they may advance alternative models and
    extensions of DNS as a decentralized, cooperative system that is more
    secure and less subject to political whim.

    After working for over a decade as decade as an editor focusing on
    intellectual and cultural history, Ted Byfield joined the faculty of
    Parsons School of Design in New York City, where he teaches about the
    social and political aspects of design. In addition to writing and
    lecturing about areas where the technical and cultural collide, he is
    a member of the rump Boston Working Group, co-moderates the Nettime
    mailing list, and serves as an boardmember and advisor for various
    New York-area cultural organizations.

    This meeting of the Digital Commerce Society of Boston will be held
    on Tuesday, February 6th, 2000, from 12pm - 2pm at the Downtown
    Branch of the Harvard Club of Boston, on One Federal Street. The
    price for lunch is $35.00. This price includes lunch, room rental,
    A/V hardware if necessary, and the speakers' lunch. The Harvard Club
    has relaxed its dress code, which is now "business casual", meaning
    no sneakers or jeans. Fair warning: since we purchase these luncheons
    in advance, we will be unable to refund the price of your meal if the
    Club finds you in violation of what's left of its dress code.

    We need to receive a company check, or money order, (or, if we
    *really* know you, a personal check) payable to "The Harvard Club of
    Boston", by Saturday, January 3rd, or you won't be on the list for
    lunch. Checks payable to anyone else but The Harvard Club of Boston
    will have to be sent back.

    Checks should be sent to Robert Hettinga, 44 Farquhar Street, Boston,
    Massachusetts, 02131. Again, they *must* be made payable to "The
    Harvard Club of Boston", in the amount of $35.00. Please include your
    e-mail address so that we can send you a confirmation

    If anyone has questions, or has a problem with these arrangements
    (we've had to work with glacial A/P departments more than once, for
    instance), please let us know via e-mail, and we'll see if we can
    work something out.

    Upcoming speakers for DCSB are:

    March 6 TBA
    April 3 Scott Moskowitz Watermarking and Bluespike

    As you can see, :-), we are actively searching for future speakers.
    If you are in Boston on the first Tuesday of the month, are a
    principal in digital commerce, and would like to make a presentation
    to the Society, please send e-mail to the DCSB Program Committee,
    care of Robert Hettinga, <mailto: rahshipwright.com>.

    -----BEGIN PGP SIGNATURE-----
    Version: PGP 7.0

    iQEVAwUBOlttV8UCGwxmWcHhAQHyQgf9EFME11YN9QQUHfMidGJW/Jl4JYS4kz+c
    O+aS217xG7jrHhSzcobImq4Be16XkSz90hNEGfPEikOhOjbv0MHDQue5nOnJy9dN
    5TCydlsSbD3Sz2f29FdpU+yV0MM2/puGDFGzZ3mdLFJJENGmAUdmy4FJGZbyLuSI
    PWeOikiuRYfuJlsQrzGNT+v6AzvB0DbzufCgGN2nNFRVXdHJny/p3HYj2ZH+53ZR
    e4pR1fhRzsK0xA3aQrMBErdGZcOR7iWrDj5va0DMjhw8ZdXQhQDNcQWigdCOnNx6
    heY6pvuvSJDLMWb0sV+1QB6NKagKdiYP8U1S6iU1/49/lXToJH2LLw==
    =zbvY
    -----END PGP SIGNATURE-----

    -- 
    -----------------
    R. A. Hettinga <mailto: rahibuc.com>
    The Internet Bearer Underwriting Corporation <http://www.ibuc.com/>
    44 Farquhar Street, Boston, MA 02131 USA
    "... however it may deserve respect for its usefulness and antiquity,
    [predicting the end of the world] has not been found agreeable to
    experience." -- Edward Gibbon, 'Decline and Fall of the Roman Empire'
    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
    To unsubscribe from this list, send a letter to: Majordomoreservoir.com
    In the body of the message, write:  unsubscribe dcsb-announce
    Or, to subscribe,           write:  subscribe dcsb-announce
    If you have questions, write to me at Owner-DCSBreservoir.com
    

    --- end forwarded text

    -- ----------------- R. A. Hettinga <mailto: rahibuc.com> The Internet Bearer Underwriting Corporation <http://www.ibuc.com/> 44 Farquhar Street, Boston, MA 02131 USA "... however it may deserve respect for its usefulness and antiquity, [predicting the end of the world] has not been found agreeable to experience." -- Edward Gibbon, 'Decline and Fall of the Roman Empire'


     
    From: Xiao, Peter (pxiaoLiberate.com)
    Date: Tue Jan 09 2001 - 17:42:45 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Hi,

    I am currently looking for crypto implementation that can fit into small
    footprint (in the order of 50K or less) devices. Ideally, an SSL type of
    protocol meets my requirements but it is almost impossible to implement it
    within 50K even with selected cipher suites. So, I am looking for
    alternatives (either symmetric key or public key based). I was thinking
    about WTLS but looks like its implementation can not be significantly
    smaller than that of TLS since it is also based on Public Key cryptography
    (I am wondering how it fits into a cellphone). Can any one tell me what is
    the approximate size of the client implementation of WTLS. Also, would
    anyone send some pointers to me regarding what I am looking for.

    Thanks in advance!!

    Peter


     
    From: Tim Dierks (timdierks.org)
    Date: Tue Jan 09 2001 - 19:38:05 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Peter -

    We may well be able to help you. Our SSL library for Palm OS weighs in at
    under 64K, including all necessary crypto. Our WTLS library is, I believe,
    smaller. I'm certain we can build custom protocols that are much, much
    smaller, but with similar functionality. Depending on what your platform and
    needs are, I'm sure we can solve your problem.

    Thanks,
     - Tim Dierks
       Certicom
       tdierkscerticom.com

    > -----Original Message-----
    > From: owner-coderpunkstoad.com [mailto:owner-coderpunkstoad.com]On
    > Behalf Of Xiao, Peter
    > Sent: Tuesday, January 09, 2001 3:43 PM
    > To: 'coderpunkstoad.com'; cypherpunkstoad.com
    > Subject: crypto implementation for small footprint devices
    >
    >
    > Hi,
    >
    > I am currently looking for crypto implementation that can fit into small
    > footprint (in the order of 50K or less) devices. Ideally, an SSL type of
    > protocol meets my requirements but it is almost impossible to implement it
    > within 50K even with selected cipher suites. So, I am looking for
    > alternatives (either symmetric key or public key based). I was thinking
    > about WTLS but looks like its implementation can not be significantly
    > smaller than that of TLS since it is also based on Public Key cryptography
    > (I am wondering how it fits into a cellphone). Can any one tell me what is
    > the approximate size of the client implementation of WTLS. Also, would
    > anyone send some pointers to me regarding what I am looking for.
    >
    > Thanks in advance!!
    >
    > Peter
    >


     
    From: Phillip Zakas (pzakastoucancapital.com)
    Date: Tue Jan 09 2001 - 20:07:24 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    what kind of platform? are you counting on an internal processor, or are you
    just storing a key to be acted on via a second device? need more info.
    pz

    -----Original Message-----
    From: owner-cypherpunksAlgebra.COM
    [mailto:owner-cypherpunksAlgebra.COM]On Behalf Of Xiao, Peter
    Sent: Tuesday, January 09, 2001 6:43 PM
    To: 'coderpunkstoad.com'; cypherpunkstoad.com
    Subject: crypto implementation for small footprint devices

    Hi,

    I am currently looking for crypto implementation that can fit into small
    footprint (in the order of 50K or less) devices. Ideally, an SSL type of
    protocol meets my requirements but it is almost impossible to implement it
    within 50K even with selected cipher suites. So, I am looking for
    alternatives (either symmetric key or public key based). I was thinking
    about WTLS but looks like its implementation can not be significantly
    smaller than that of TLS since it is also based on Public Key cryptography
    (I am wondering how it fits into a cellphone). Can any one tell me what is
    the approximate size of the client implementation of WTLS. Also, would
    anyone send some pointers to me regarding what I am looking for.

    Thanks in advance!!

    Peter


     
    From: Josh Richards (jrichardcubicle.net)
    Date: Tue Jan 09 2001 - 20:20:36 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    * Xiao, Peter <pxiaoLiberate.com> [20010109 16:01]:
    >
    > I am currently looking for crypto implementation that can fit into small
    > footprint (in the order of 50K or less) devices. Ideally, an SSL type of
    > protocol meets my requirements but it is almost impossible to implement it
    > within 50K even with selected cipher suites. So, I am looking for
    > alternatives (either symmetric key or public key based). I was thinking
    > about WTLS but looks like its implementation can not be significantly
    > smaller than that of TLS since it is also based on Public Key cryptography
    > (I am wondering how it fits into a cellphone). Can any one tell me what is
    > the approximate size of the client implementation of WTLS. Also, would
    > anyone send some pointers to me regarding what I am looking for.

    How small of footprint? 50K (presuming you mean in currency) isn't really
    a measurement of footprint size to me. :) Would something along the lines
    of a Java iButton <URL:http://www.ibutton.com/> match your requirements?
    It truly depends on what you need the device to be capable of...and I don't
    just mean the crypto implementation but is this a device to be self-powered?
    How do you need to interface with it? Etc.

    -jr

    ----
    Josh Richards [JTR38/JR539-ARIN]
    <jrichardgeekresearch.com/cubicle.net/fix.net/freedom.gen.ca.us>
    Geek Research LLC - <URL:http://www.geekresearch.com/>
    IP Network Engineering and Consulting
    

    -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.0.4 (GNU/Linux) Comment: For info see http://www.gnupg.org

    iEYEARECAAYFAjpbxvEACgkQ8VgqD3XNPNUL9ACglfLcpuNY0XcMnVYCcWQk56hJ sB8AoNpFRri73QCLINanyn45m1QUw74O =Fcz4 -----END PGP SIGNATURE-----


     
    From: Xiao, Peter (pxiaoLiberate.com)
    Date: Tue Jan 09 2001 - 21:12:43 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    -----Original Message-----
    From: Josh Richards [mailto:jrichardcubicle.net]
    Sent: Tuesday, January 09, 2001 6:21 PM
    To: coderpunkstoad.com; cypherpunkstoad.com
    Subject: Re: crypto implementation for small footprint devices

    * Xiao, Peter <pxiaoLiberate.com> [20010109 16:01]:
    >
    > I am currently looking for crypto implementation that can fit into small
    > footprint (in the order of 50K or less) devices. Ideally, an SSL type of
    > protocol meets my requirements but it is almost impossible to implement it
    > within 50K even with selected cipher suites. So, I am looking for
    > alternatives (either symmetric key or public key based). I was thinking
    > about WTLS but looks like its implementation can not be significantly
    > smaller than that of TLS since it is also based on Public Key cryptography
    > (I am wondering how it fits into a cellphone). Can any one tell me what is
    > the approximate size of the client implementation of WTLS. Also, would
    > anyone send some pointers to me regarding what I am looking for.

    How small of footprint? 50K (presuming you mean in currency) isn't really
    a measurement of footprint size to me. :) Would something along the lines
    of a Java iButton <URL:http://www.ibutton.com/> match your requirements?
    It truly depends on what you need the device to be capable of...and I don't
    just mean the crypto implementation but is this a device to be self-powered?
    How do you need to interface with it? Etc.

    The device is a DCT2000 set-top box with very limited footprint. Since the
    box needs to run a lot of other applications, 50K is the space that we would
    like to spend on the security purpose. The platform supports C interface.

    -jr

    ----
    Josh Richards [JTR38/JR539-ARIN]
    <jrichardgeekresearch.com/cubicle.net/fix.net/freedom.gen.ca.us>
    Geek Research LLC - <URL:http://www.geekresearch.com/>
    IP Network Engineering and Consulting
    


     
    From: Phillip Zakas (pzakastoucancapital.com)
    Date: Tue Jan 09 2001 - 21:53:30 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    I know RSA B-Safe stuff is made to fit onto cell phones and pagers. They
    also are the public key vendor for DOCSIS cable boxes. Maybe they can help
    you. www.rsa.com

    pz

    -----Original Message-----
    From: owner-cypherpunksAlgebra.COM
    [mailto:owner-cypherpunksAlgebra.COM]On Behalf Of Xiao, Peter
    Sent: Tuesday, January 09, 2001 10:13 PM
    To: 'Josh Richards'; coderpunkstoad.com; cypherpunkstoad.com
    Subject: RE: crypto implementation for small footprint devices

    -----Original Message-----
    From: Josh Richards [mailto:jrichardcubicle.net]
    Sent: Tuesday, January 09, 2001 6:21 PM
    To: coderpunkstoad.com; cypherpunkstoad.com
    Subject: Re: crypto implementation for small footprint devices

    * Xiao, Peter <pxiaoLiberate.com> [20010109 16:01]:
    >
    > I am currently looking for crypto implementation that can fit into small
    > footprint (in the order of 50K or less) devices. Ideally, an SSL type of
    > protocol meets my requirements but it is almost impossible to implement it
    > within 50K even with selected cipher suites. So, I am looking for
    > alternatives (either symmetric key or public key based). I was thinking
    > about WTLS but looks like its implementation can not be significantly
    > smaller than that of TLS since it is also based on Public Key cryptography
    > (I am wondering how it fits into a cellphone). Can any one tell me what is
    > the approximate size of the client implementation of WTLS. Also, would
    > anyone send some pointers to me regarding what I am looking for.

    How small of footprint? 50K (presuming you mean in currency) isn't really
    a measurement of footprint size to me. :) Would something along the lines
    of a Java iButton <URL:http://www.ibutton.com/> match your requirements?
    It truly depends on what you need the device to be capable of...and I don't
    just mean the crypto implementation but is this a device to be self-powered?
    How do you need to interface with it? Etc.

    The device is a DCT2000 set-top box with very limited footprint. Since the
    box needs to run a lot of other applications, 50K is the space that we would
    like to spend on the security purpose. The platform supports C interface.

    -jr

    ----
    Josh Richards [JTR38/JR539-ARIN]
    <jrichardgeekresearch.com/cubicle.net/fix.net/freedom.gen.ca.us>
    Geek Research LLC - <URL:http://www.geekresearch.com/>
    IP Network Engineering and Consulting
    


     
    From: Declan McCullagh (declanwell.com)
    Date: Wed Jan 10 2001 - 01:00:23 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    It also might be worth checking out the elliptic curve apps that run
    on Palm OS. --Declan

    On Tue, Jan 09, 2001 at 10:53:30PM -0500, Phillip Zakas wrote:
    >
    > I know RSA B-Safe stuff is made to fit onto cell phones and pagers. They
    > also are the public key vendor for DOCSIS cable boxes. Maybe they can help
    > you. www.rsa.com
    >
    > pz
    >
    >
    > -----Original Message-----
    > From: owner-cypherpunksAlgebra.COM
    > [mailto:owner-cypherpunksAlgebra.COM]On Behalf Of Xiao, Peter
    > Sent: Tuesday, January 09, 2001 10:13 PM
    > To: 'Josh Richards'; coderpunkstoad.com; cypherpunkstoad.com
    > Subject: RE: crypto implementation for small footprint devices
    >
    >
    >
    >
    >
    > -----Original Message-----
    > From: Josh Richards [mailto:jrichardcubicle.net]
    > Sent: Tuesday, January 09, 2001 6:21 PM
    > To: coderpunkstoad.com; cypherpunkstoad.com
    > Subject: Re: crypto implementation for small footprint devices
    >
    >
    > * Xiao, Peter <pxiaoLiberate.com> [20010109 16:01]:
    > >
    > > I am currently looking for crypto implementation that can fit into small
    > > footprint (in the order of 50K or less) devices. Ideally, an SSL type of
    > > protocol meets my requirements but it is almost impossible to implement it
    > > within 50K even with selected cipher suites. So, I am looking for
    > > alternatives (either symmetric key or public key based). I was thinking
    > > about WTLS but looks like its implementation can not be significantly
    > > smaller than that of TLS since it is also based on Public Key cryptography
    > > (I am wondering how it fits into a cellphone). Can any one tell me what is
    > > the approximate size of the client implementation of WTLS. Also, would
    > > anyone send some pointers to me regarding what I am looking for.
    >
    > How small of footprint? 50K (presuming you mean in currency) isn't really
    > a measurement of footprint size to me. :) Would something along the lines
    > of a Java iButton <URL:http://www.ibutton.com/> match your requirements?
    > It truly depends on what you need the device to be capable of...and I don't
    > just mean the crypto implementation but is this a device to be self-powered?
    > How do you need to interface with it? Etc.
    >
    > The device is a DCT2000 set-top box with very limited footprint. Since the
    > box needs to run a lot of other applications, 50K is the space that we would
    > like to spend on the security purpose. The platform supports C interface.
    >
    > -jr
    >
    > ----
    > Josh Richards [JTR38/JR539-ARIN]
    > <jrichardgeekresearch.com/cubicle.net/fix.net/freedom.gen.ca.us>
    > Geek Research LLC - <URL:http://www.geekresearch.com/>
    > IP Network Engineering and Consulting
    >
    >


     
    From: Robert Guerra (rguerrayahoo.com)
    Date: Wed Jan 10 2001 - 06:53:42 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    --On Wednesday, January 10, 2001 2:00 AM -0500 Declan McCullagh
    <declanwell.com> wrote:

    > It also might be worth checking out the elliptic curve apps that run
    > on Palm OS. --Declan
    >

    Declan:

    A Canadian company, Certicom <www.certicom.com> has been developping
    Elliptic curve crypto libraries for quite a while. Thier software is in
    many embedded devices and several PDA's including the palm.

    hope it's of help

    regards

    robert


     
    From: mailmanjournalist.com
    Date: Wed Jan 10 2001 - 06:27:23 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Hello,

    As you are in the E-mail industry, I think you will be very interested in our
    software . Our exclusive software is the best opt-in, targeted e-mail manager and mailer package
    available.

    This software has the ability to mail out using 256 ports on your computer giving you very fast mailing speed. Thus letting you send to your subscriber data base in minutes. E.g. you could let
    all your data base know of new developments as they happen.

    Act as mail server turns your computer into a full on mailing machine. This means you are not sending it through your ISP.

    Search for email addresses pertaining to any category, e.g. you may like to get email addresses of other E-mailing companies (I found over 12,000 in a very short time). You
    can search for email addresses by any search string in all the main search engines. Search for email addresses in over 50,000 newsgroups. Search for email addresses by country or by
    state in US.+more.

    If you are interested I can send you a link to my URL, here you can download the trial version.

    Please read below to see the full list of features.

    I look forward to your response.

    Kind Regards

    Julian

    Ps Would you be interested in doing a reciprocal a link/banner?Please enqiure about our affiliate program.

     Fast Responsible Efficient Targeted

    Enterprise Level Contact Management Suite

    A crisp, sharp, easy-to-use interface allows you to get to work immediately.
    All of the tools contained within this marketing suite are unmatched in
    speed by any other available software. This opt in software is truly a
    remarkable product suite that will not only reliably manage your existing
    client base but will also fully automate the process of its growth. It is
    NOT a SPAM tool and should never be utilized as such.

     Does the drudge work - you do the marketing.

    Access to an Internet connection is all you need to unleash it's full suite
    of capabilities. All the required tools are included in this one package -
    there is no need to purchase separate software for separate functions. Once
    the software has been set up, the process is completely automated, allowing
    you to use other computer resources while it does the work.

    The full version comes with one year of FREE upgrades.

    Whatever your business, you can benefit

    A complete marketing package, it comes with all the tools that you will ever
    need in order to successfully maintain and grow your current opt-in client
    base. Listed below are the features which we feel will be of most interest
    to you.

    Overall

    Support for up to 256 ports - all of the program entities can now
    simultaneously scream out across 256 ports.

    True Client/Server capable - 100% ODBC compliant, 100% C++ code, 100%
    multi-user capable, 100% capable of integrating within your already existing
    RDB environment whether it be Sybase, Oracle, Microsoft., etc.

    Feed and Mail Concurrently - Now you can have an unlimited amount of
    concurrent List Programs running simultaneously all performing different
    tasks, even on the same entities if you wish.

    POP3 Rule Sets - create an unlimited amount of auto-responders, e-mail
    redirects, and kill file addition rules.

    Unlimited external SMTP support - in addition to the "Act as Mail Server"
    mode you may now stream concurrently & evenly to an unlimited amount of SMTP
    Servers

    Subject Rotation - support for an unlimited amount of subject rotations,
    make your e-mail's more interesting, measure which subject gain the greatest
    interest.

    Reply To Rotation - support for an unlimited amount of Reply to rotations.
    When used in unison with the subject rotations these feature makes it even
    easier to track the success of which subjects pull the best.

    Enhanced user mode extraction - now not only extract persons e-mail address
    but now you can fully and dynamically personalize your outgoing mail even
    more.

    Global Inclusion/Exclusion Support - You may set-up your entity rules both
    in an inclusion & exclusion format.

    List Management Utilities - such as external file split, and external file
    purge.

    Lightning quick Mailings - superior mailing technology gets your message out
    faster
    Create your own Mail Server - use the resources that you have paid for. Now
    you don't have to pass the workload over to your ISP mail server.

    Keeps all your lists in an organized fashion - each list is kept as its own
    independent entity, let internally cross related to others. Importing,
    exporting deleting of any list is just a simple mouse click away.

    Wizards throughout to ease you through the major processes

    Import files from a variety of sources using tab delimited format, or import
    files saved using format (.lsp) which includes a variety of extended
    information such as time e-mail was added, the method that was used to
    obtain the e-mail and so forth, and all the associated dynamic data.

    Simple and effortless storage and handling of data - store an unlimited
    numbers of lists, e-mail templates and mailings, undeliverable, kill files
    entries, POP3 rule sets etc., limited only by your hard drive space

    Global Kill File - Automatically removes the e-mail's of those who have
    expressed the wish not to receive mailings from any list you create

    Global Seed File - Automatically ensures that all entries that contain the
    seed file are included in every outgoing list

    Global Exclusion Wild cards - Ensures that both URL and e-mail patterns are
    excluded from lists
    Scan POP3 for applicable POP3 Rule Sets - if they don't want to hear from
    you again, they won't, if they want more information they will automatically
    receive it, if it an undeliverable it will go to the undeliverable file, if
    you want it forwarded to another e-mail account it will be forwarded, if you
    wish to revalidate it will be revalidated. Create an unlimited amount of
    rule sets to process, create an unlimited amount of possibilities..

     Lists

    Complete control of every facet of the list creation process, ensuring that
    your lists are targeted, unique and effective
    Multiple list storage
    Import from external files.
    Perform merge/purges easily
    E-mail extraction using Automation with IE4.0 and above
    URL extraction using Automation with IE4.0 and above
    E-mail & URL exclusions through modifiable tables
    List level and global e-mail uniqueness assurance
    Supports clipboard pasting, great for pasting e-mail's into your favourite
    external programs.
    Exporting of e-mail's within list to external file.
    Inclusion of seeds
    Exclusion of kill file
    Exclusion using URL and e-mail exclusion wild cards

      E-mail Templates
    Multiple E-mail Template storage
    Paste directly from MS Word or your favourite application to the clipboard
    Inclusion of globally saved header and trailer text information.
    Simple macro substitution allows you to easily personalize your outgoing
    message!
    Full support of HTML and its extensions i.e., javascript, java applets,
    embedded graphics, etc.
    Full support for external file attachments

    Mailing
    Supports an unlimited amount SMTP servers each with a definable batch size
    parameter.

    Able to act as its own mail server, therefore not harnessing upon your ISP
    mail server resources

    Places any undeliverable e-mail addresses into your Kill File, excluding
    them from future lists created.

    Ability to perform mailings in sections, as it remembers where it last left
    off and gives you the option to continue from there

    New superior technology will temporary suspend any listed SMTP server
    streaming in the event that it becomes sluggish, and or inactive.

      Kill File Entries
    Supports an unlimited amount of entries only to be limited by your available
    hard disk space.

    Once kill file entries have been added it automatically ensures
    that no one listed will ever hear from you again.
    you can also use the kill file to effectively purge external lists.

      Undeliverable File Entries
    Supports an unlimited amount of entries only to be limited by your available
    hard disk space.

    Once these entries have been added it automatically ensures that no matching
    entries will ever be added to any of your lists. you can also use the
    undeliverable file to effectively purge external lists.

    Seeds
    Supports an unlimited amount of entries only to be limited by your available
    hard disk space.
    Once these entries have been added it automatically ensures that all out
    going lists will incorporate all of the seed entries.

     Global Exclusions
    Supports an unlimited amount of entries only to be limited by your available
    hard disk space.
    Once these entries have been added it automatically ensures that
    all entries within one or all lists will strictly adhere to the exclusions
    which you have set up.

    Global Inclusions
    Supports an unlimited amount of entries only to be limited by your available
    hard disk space.
    Once these entries have been added it automatically ensures that all entries
    within one or all lists will strictly adhere to the inclusions which you
    have set up.

     POP3 Rule Sets
    Supports an unlimited amount of entries only to be limited by your available
    hard disk space.
    each on these entries will be processed up against each e-mail within your
    POP3 inbox. When a match is found the appropriate action ( as listed within
    your rule set ) will be taken and then the message will be automatically
    removed from your inbox.

    Program = L

    The Complete Package for All of
    Your Marketing Needs
     
    Table of Contents

    WHAT IS L
    FEATURES
    OVERALL
    LISTS
    EMAIL TEMPLATES
    MAILING
    POP3 RULE SETS
    HARDWARE AND SOFTWARE REQUIREMENTS
    THE MAIN SCREEN
    TOOLBAR BUTTONS
    PULL-DOWN MENUS
    MODIFICATIONS
    PROCEDURES
    CONFIGURATION
    VIEW
    HELP
    UTILITIES
    L ENTITIES
    GLOBAL CONFIGURATIONS: LAYING THE FOUNDATION
    Setting your Mail & DNS Configurations
    Setting-up your Global Email Templates Headers and Trailers
    LISTS
    Setting-up your Default POP3 Rule Set
    LISTS
    Creating A List
    Modifying an Existing List
    EMAIL TEMPLATES
    Creating an Email Template
    MACRO LANGUAGE
    Modifying an Existing Email Template
    MAILINGS
    Creating A Mailing
    Modifying and Initiating a Mailing
    POP3 RULE SETS
    Creating A POP# Rule Set
    UNDELIVERABLES
    MASTER KILL FILE
    MASTER SEED FILE
    GLOBAL EXCLUSIONS
    Global Exclusions Syntax
    WILD CARD MATCHES
    TESTING YOUR CONFIGURATION: A SHORT WALKTHROUGH
    CREATE A NEW EMAIL LIST
    CREATE AN EMAIL TEMPLATE
    CREATE A NEW MAILING
    PROCESS POP3 RULE SETS

    What is L?

    It is a dynamic list creation tool that generates precisely targeted email lists. With
    thisyou have simple and free access to the tens of millions of email addresses
    available on the World Wide Web.

    It allows you to market your products or services to a carefully selected Internet
    audience. You specify how you want it to conduct your search, the criteria to look
    for and what it should exclude; it then retrieves the emails from the Web pages that
    match your criteria. This software gives you the freedom of no longer having to
    purchase direct i-mail lists from outside sources or having to forward annoying spam
    mailings to get your message out.

    Access to an Internet connection is all you need to unleash its full suite of capabilities.
    All the searching and mailing functions are included in this one package - there is no
    need to purchase separate software for separate functions. Once it has been set up,
    the process is completely automated, allowing you to use other computer resources
    while it does the work.

    Features

    Overall
     
    · Complete marketing package - it's not necessary to purchase any other software
    · Access to millions of fresh email addresses, all of them free and most of them
    unavailable from commercial mailing lists
    · Ability to export lists for possible resale - instead of wasting all that money
    purchasing mailing lists, sell a few of your own!
    · Wizards integrated throughout to ease you through the major processes
    · Import files from a variety of sources using tab delimited format, or import files
    saved using format which includes a variety of extended information such as time
    email was collected, the URL the email was found on, the method that was used to
    obtain the email and so forth.
    · Simple and effortless storage and handling of data - store unlimited numbers of lists,
    email templates and mailings, limited only by your hard drive space
    · Global Kill File - Automatically removes the emails of those who have expressed
    the wish not to receive mailings from any list you create
    · Global Seed File - Automatically ensures that all entries included the seed file are
    included in every outgoing list
    · Global Exclusion Wildcards - Ensures that both URL and email patterns are
    excluded from lists
    · Scan for removes from your current POP3 account - if they don't want to hear
    from you again, they won't
    · Full support for email relaying and auto responders.
    · Ability to open an unlimited amout of program copies on the same machine and
    have multiple copies feeding and mailing from the same lists simultaneously.
    · Support for an unlimited amount of external SMTP servers.

    Lists

    · Complete control of every facet of the list creation process, ensuring that your lists
    are targeted, unique and effective
    · Multiple list storage
    · Import from external files.
    · Perform merge/purges easily
    · Clean your lists - multiple options to eliminate unwanted emails
    · Email extraction using Automation with IE4.0 and above
    · Email extraction from direct search engine queries (using Yahoo, Lycos, HotBot or
    any other search engine)
    · Email extraction with embedded webspider, able to descend multilevels
    · URL extraction using Automation with IE4.0 and above
    · Email & URL exclusions through modifiable tables
    · List level and global email uniqueness assurance
    · Never visits the same link twice
    · Extraction of additional information through registration lookups (such as Name or
    Telephone).
    · Saves URL addresses from which email extraction took place (great for quality
    assurance and embedding into outgoing emails)
    · Supports clipboard pasting, great for pasting emails into your favorite external
    programs.
    · Exporting of emails gathered to external file.
    · Inclusion of seeds
    · Exclusion of kill file
    · Exclusion using URL and email exclusion wildcards
    · *Inclusion of email using inclusion wildcards
    · *Ability to attach to existing lists, thereby allowing different running copies of l to
    feed the same list.
    · *When in user mode l will also save the email recipients first & surname to the list.

    Email Templates

    · Multiple Email Template storage
    · Paste directly from MS Word or your favorite application to the clipboard
    · Inclusion of globally saved header and trailer text information.
    · Simple macro substitution (i.e. URL that email was extracted from)
    · *Support for macro substitution within the subject field.
    · *Support for an unlimited amount of Subject rotations.
    · *Support for an unlimited amount of Reply to addresses.
    ·

    Mailing

    · Supports SMTP through user definable batch size parameter.
    · Able to act as its own mail server, therefore makes your ISP less easy to track
    · Places any undeliverable email addresses into your Kill File, excluding them from
    future lists created.
    · Master Kill File Import - Import your kill files from another l user or from other
    sources.
    · Ability to perform mailings in sections, as it remembers where it last left off and
    gives you the option to continue from there
    · *Ability to have several open active mailings trickling on an open list that is also
    being fed by a variety of sources simultaneously.
    · *Option now to presort mail by domain prior to mailing

    POP3 Rule Sets

    · Ability to setup a "Catch All" rule set as well as create an unlimited amount of
    additional rule sets.
    · A rule set may reroute incoming mail to another email address
    · A rule set may be used to add the recipient to the kill file
    · A rule set may be used as an auto responder to send information back to a
    recipient based upon the contents of the recipients response.

    Hardware and software requirements

    · Operating systems: Windows 95 or better (will not run in DOS)
    · 8 Mb RAM
    · l requires approximately 4 Mb of hard disk space. Additional space will be needed
    on your hard drive for the storage of the lists you create.
    · Recommended: Microsoft Internet Explorer 4.0 or better (required if you wish to
    use the Automation feature).

     The Main Screen

    The Main Screen.

    Toolbar Buttons

    The Toolbar Buttons can initially (the Toolbar is dockable) be found along the upper
    left-hand side of the Main Screen:

     
    Create a new list of email addresses. This button will launch the List Creation
    Wizard, which will allow you to quickly generate precisely targeted lists.

    Create a new email template. This will begin the Email Template Wizard, which will
    let you compose what you want to say to the waiting masses.

     
    Create a new mailing. Clicking this button will launch the Mailing Creation Wizard,
    sending your message across the Internet to those you've carefully selected.

    Create a new POP3 Rule set. Clicking this button will launch the POP3 Rule Set
    Creation Wizard, which will allow you to easily create forwarders, auto responders
    and kill file rules.

    Modify the selected item. You can use this to immediately adjust the settings of any
    selected item.

    Scan your POP3 account and apply pop3 rule sets. Clicking on this button will
    connect you to your server, scan your account for any emails matching your pop3
    rule sets.

    Modify global configurations. Click this and you can adjust the SMTP Server
    Configuration (use the same settings you do for your mail server) or the Global Email
    Template Headers (to select your favorite header and trailer text).

    Exit program.

     Minimize window.

    Perform and display l database entity record counts.

    About L

     Pull-Down Menus

    The Pull-Down Menus can be found along the top of the Main Screen. Click with
    your mouse cursor over one of the menu headings to access that menu; left click
    again over the option in that menu you wish to launch.

    Creation Wizards

    This menu will access L three main processes:
     
    1. Create a new list of email addresses: This will initiate the List Creation Wizard.

    2. Create a new email template: Starts the Email Template Wizard.

    3. Create a new mailing: Clicking over this will initiate the Mailing Creation Wizard.
     

    Modifications

    This will allow you to modify the parameters of the currently selected item.

    Procedures

    Process POP3 Kill File:

    1. This will process your POP3 account, using the parameters you have specified
    within the Global Configuration settings.

    2. It will scan for and then remove any emails that contain the word 'remove' in the
    subject line.

    3. The removed emails will then be sent to your Kill File.

    Import Master Kill File Data:

    1. You will be able to import Kill Files from other L users using the .L format, which
    will include information on the date the emails were collected, the URLs the emails
    were found on, the way the email was found (website, user or automation) and other
    data.

    2. It is also possible to import files from a variety of other sources using the delimited
    file format (.txt or .sdf).
     Export Master Kill File Data:

    3. You will be able to export Kill Files to other L users using the L format, which will
    include information on the date the emails were collected, the URLs the emails were
    found on, the way the email was found (website, user or automation) and other data.

    4. It is also possible to export files to a variety of other sources using the delimited
    file format (.txt or .sdf).

     Purge Master Kill File Data:
     
     Selecting this option will purge/delete all master kill file entries globally.

    Purge Undeliverable File Data:

    Selecting this option will purge/delete all undeliverable file entries globally.

    Backup Database:
    Selecting this option will initiate the L database backup procedures. All newly
    backed L entities will be placed into a directory called backups located just beneath
    the data directory of where you had installed L. If you accepted the L installation
    defaults then your backups would be located within "c:\Program
    Files\DolfWare\L\Data\Backups".

    Restore Database:
    Selecting this option will initiate the L database restore procedures. The L program
    state and files contents will be restored to the state they were at the time that you
    performed a "Backup Database".

    Clean/Finalize Lists:

    1. Apply Global Exclusions: Removes emails from your list that match any of the
    wildcards selected within the Global Exclusions file.

    2. Purge Master Kill File Entries: Processes the Kill File - basically, this compares
    the email addresses on your email lists to those on your Kill File, removing any
    emails on your list that are included in the Kill File.

    3. Append Seed File Entries: Adds entries from the Seed File to the list.

    4. Eliminate multi-emails per URL: Selecting this if you only want one email per
    URL on your list. If selected, L will purge the excess emails intelligently - for
    example, it will keep an email like 'webmasterxyz.com' over 'fidoxyz.com'.

    Check Database Integrity:

    Assures that your files are properly formatted.

    *Backup Database:

    Initiates database backup procedures. Performing this regularly will insure that if
    something happens you will not lose all your hard work within L.

    *Restore Database:

    Initiating this procedure will bring your L databases to the exact state that they were
    when you last performed a database backup.

    *Display Database Counts:

    Selecting this option will cause L to go out a count (tally up) all entity areas. Once
    completed it will present you with listing of record counts.

    Configuration

    · Modify global configuration: This will open the Global Configuration Settings
    dialogue box. Clicking on the SMTP Server Configuration tab will let you select
    your email preferences (use the same settings as your current email program);
    clicking on the Global Email Template Headers tab will allow you to change your
    default header and trailer text, which may then be included in your templates.

    View

    · Toolbar: Checking this (the default setting) will display the Toolbar Buttons at the
    left-hand side of the screen.

    · Status Bar: When this is checked (the default setting) the Status Bar will be
    displayed along the bottom of the screen. The Status Bar will display messages that
    will tell you the current progress of whatever task you've set L to do.

    Help

    · Tip of the day: These cunning tricks will save you time and effort. These tips are
    also viewed, by default, when you begin L.

    · Upgrades: If you have an open Internet connection and IE 4.0 or better, and are a
    Registered User, this will take you to our Web site, where you can download the
    upgrades that will keep L on the cutting edge of Marketing Technology (we sure are
    modest_).

    · Product Support: If you have any problems that are not addressed by the User
    Guide, or wish to report possible bugs, this will take you to the relevant section of
    our Web site.

    · Help: This will launch Online Help for L - essentially, this consists of the latest
    edition of this User's Guide, available at our Web site.

    Exit

    · Exit, not too surprisingly, will end your session with L

    Tabs

    The Tabs can be found near the bottom of the screen, just above the Status Bar. All
    of the Tabs use a common interface. The Tabs allow you to access and modify the
    various files you use with L. If you have ever used a database or spreadsheet, then
    most likely the tabular format and information fields will look familiar to you.

    All of the Tab displays support these common features:

    · Columns and rows are resizeable. The information displayed when you select one
    of the Tabs is in columns and rows, with the columns going from top to bottom, and
    the rows extending from left to right. You can adjust columns by clicking on the right
    or left edges, then holding down the mouse button and dragging to where you want
    to reposition it. The height of rows can be adjusted by clicking on the top or bottom
    edge of the row, then dragging - this will affect the height of all the rows under that
    Tab.

    · Columns are dragable. You can modify the order in which the columns appear.

    · You can scroll through lists. If you have many lists, you can scroll down through
    them by clicking on the Scrollbar, located on the right side of the screen.

    · Columns and rows are selectable. Double clicking in a field will select that field.
    Once a field is selected, you can modify it either by clicking on the modify the
    selected item Toolbar Button or by selecting modify current selected item under
    Modifications on the Pull-Down Menu.

    · You can use the clipboard. Right-clicking on an item, or hitting Control C on the
    keyboard when an item is selected, will call up a dialogue box, which will allow you
    to Cut, Copy or Paste the record to the Clipboard. You can also Delete the selected
    record or call up our online Help file.

    · You can select more than one item at a time. Click on a field then, holding down
    the mouse button, drag the cursor over the other lists you want to select, then release
    the mouse button. Selected lists will have white text with a black background.
    Another way to select multiple lists is to hold down the Control and 'C' keys
    simultaneously and click the mouse cursor over the lists you want to add. Note that
    this last method does not require the lists to be next to each other.

    Utilities

    · Split Files: This will open a window with in which you will be able to split existing
    txt and L formatted files into multiple files containing a user specifiable record count.
    · Purge External file: Selecting this option will allow you to purge extern
    Responsible Use of Bulk Email is Virtually Endless
    · An inbound tourism operator can appraise travel agents of windows of opportunity
    and new tourism packages for their price conscious customers.
    · A doctor can inform patients of new medical developments. For example, the
    doctor can send a message to all of his patients who suffer from migraine headaches
    to inform them of a prescription drug which is now available over the counter.
    · An insurance agent sends messages to his clients in a particular geographic location
    informing them of their status in cases of natural disaster, such as floods or
    earthquakes.
    · An accounting manager can send monthly statements to customers. If payment is
    late, the statement reminds the customer of the terms of payments and states the
    number of days by which the account is overdue.
    · A real estate agent informs clients of new offerings and open houses, based on the
    criteria and price range of each customer.
    · Peak Bodies, Associations and Guilds can use bulk email to keep members up to
    date on current issues. Bulk email Intervention makes it easy to get information out
    quickly; call for votes and gazette the results. Also, the PR representative can track
    who received each message and when.
    · A Dentist can send out email messages informing patients of their upcoming
    appointments, and reminding other patients that it is time to schedule another
    cleaning.
    · The publisher of a newsletter can inform customers when subscriptions are up for
    renewal. Each month a different group of subscribers receives the notices.
    · A graphic design agency can inform customers of an address change and the
    addition of a new partner to the firm.
    · A local copy shop can inform customers when new equipment is added, expanding
    the range of services available. Messages to preferred customers include special
    discount offers.
    · A software developer can send out advance upgrade notices to customers. Each
    message includes the cost to upgrade based upon the customer's current version and
    number of registered copies.
    · An advertising sales representative can inform advertisers of rate changes, and
    upcoming editorial coverage.
    · A local restaurant owner can inform customers of weekly lunch specials.
    · A town administrator can inform residents of upcoming recreational events, changes
    in parking regulations and new office hours.
    · A florist can send quarterly newsletters to customers regarding plant nutrition and
    lawn care. Business accounts are informed of new payments terms.
    · A software quality assurance manager can send out updates to beta users. Certain
    users receive special installation instructions based upon their hardware.
    · A community theater director can announce show schedules and ticket availability.
    Family members of the cast receive advance notices in order to reserve seating.
    · A little league baseball coach can inform players and parents of practice and game
    schedules.
    · A school nurse can inform parents about when and where they can get flu shots for
    their children. Parents are also informed if a child does not pass the yearly eye
    exam.

    Companies viewpoints/success with direct mail.

    "America Online's own product pitches, made to customers as they sign on, are
    phenomenally successful. They are the profit driver for the company."

    *Greg Shove, V.P. of America Online
    "A gold mine for those who can take advantage of bulk email programs."

    *The New York Times
    "Email is an incredible lead generation tool."


     
    From: Gé Weijers (gecobalt.com)
    Date: Wed Jan 10 2001 - 08:59:13 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    On Tue, Jan 09, 2001 at 03:42:45PM -0800, Xiao, Peter wrote:
    > Hi,
    >
    > I am currently looking for crypto implementation that can fit into small
    > footprint (in the order of 50K or less) devices. Ideally, an SSL type of
    > protocol meets my requirements but it is almost impossible to implement it
    > within 50K even with selected cipher suites. So, I am looking for
    > alternatives (either symmetric key or public key based). I was thinking
    > about WTLS but looks like its implementation can not be significantly
    > smaller than that of TLS since it is also based on Public Key cryptography
    > (I am wondering how it fits into a cellphone). Can any one tell me what is
    > the approximate size of the client implementation of WTLS. Also, would
    > anyone send some pointers to me regarding what I am looking for.
    >
    > Thanks in advance!!
    >
    > Peter

    It's not the public-key operations themselves that use the space. I've
    managed to squeeze OAEP-formatted RSA encryption into less than
    20K. The public key was hard-wired, though. You probably want to stay
    away from ASN.1 formatted data if space is a concern.


    -- 
    --
    Gé Weijers             Voice: (614)485-2900
    Sun Microsystems         Fax: (614)485-2929
    Server Appliance Business Unit
    1160 Dublin Rd., Ste 100, Columbus OH 43215
    


     
    From: partnersgetyourcasinonow.com
    Date: Wed Jan 10 2001 - 08:43:38 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Hello,
     
    I recently visited your website and believe you may be interested in forming a strategic partnership. Our company owns and operates fully licensed online casinos. We have over 30,000 clients and 8,500 partner websites.

    The online gaming industry is the most explosive on the net, with over $10 billion projected by 2002. We would like to offer you the following proposal:

    Qwest Global Intertainment provides:

    * Casino / sportsbook front end design (for an example, go to www.GetYourCasinonow.com)

    * All gaming software, customer service, credit card processing, and logistical support

    * Up to 50% of casino net-win (tracked in real-time)

    * Profit checks mailed each Friday, rain or shine

    You provide:

    * Website Promotion via banners, email, or search engine placement.

    Without assuming any of the risk, you can drive traffic to your personal

    Internet casino and immediately increase your company's residual income.

    I invite you to look at our corporate website at the following address:

    http://www.GetYourCasinonow.com

    I look forward to hearing from you!

    Partner Manager
    partnersgetyourcasinonow.com
    http://www.getyourcasinonow.com


     
    From: lcs Mixmaster Remailer (mixanon.lcs.mit.edu)
    Date: Wed Jan 10 2001 - 11:20:03 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Apologies for the long message yesterday, which required reading an even
    longer postscript paper to understand. Here is a question which came
    up at the bottom of the message that people may be able to help with.

    Suppose you want to create a data structure that will let an untrusted
    server tell whether an encrypted document has certain words or strings
    of words in it. This will be an auxiliary data structure that allows
    answering this question, but we want to leak as little information
    as possible.

    One idea is to break the document into words, and then to create an
    extra data structure which holds the hash of every (plaintext) word in
    the document, in order. To search, you reveal the hash of the word or
    words you are looking for, and the server can then compare against the
    hashes in the list.

    The obvious problem is that the server can search for words of its
    own choosing by hashing them and comparing with the hash list.

    To fix this, use a keyed hash. Only the key holder knows how to
    turn a word into its hash form, and he gives these hashes to the
    server to look for matches.

    Now, this has one flaw that I know of. Can you find it? Can you suggest
    a fix?


     
    From: Eric Murray (ericmlne.com)
    Date: Wed Jan 10 2001 - 11:55:12 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    On Wed, Jan 10, 2001 at 07:59:13AM -0700, Gé Weijers wrote:
    > On Tue, Jan 09, 2001 at 03:42:45PM -0800, Xiao, Peter wrote:
    > > Hi,
    > >
    > > I am currently looking for crypto implementation that can fit into small
    > > footprint (in the order of 50K or less) devices. Ideally, an SSL type of
    > > protocol meets my requirements but it is almost impossible to implement it
    > > within 50K even with selected cipher suites. So, I am looking for
    > > alternatives (either symmetric key or public key based). I was thinking
    > > about WTLS but looks like its implementation can not be significantly
    > > smaller than that of TLS since it is also based on Public Key cryptography
    > > (I am wondering how it fits into a cellphone). Can any one tell me what is
    > > the approximate size of the client implementation of WTLS. Also, would
    > > anyone send some pointers to me regarding what I am looking for.
    > >
    > > Thanks in advance!!
    > >
    > > Peter
    >
    > It's not the public-key operations themselves that use the space. I've
    > managed to squeeze OAEP-formatted RSA encryption into less than
    > 20K. The public key was hard-wired, though. You probably want to stay
    > away from ASN.1 formatted data if space is a concern.

    Unfortunately anything that uses X.509 (like SSL) will require it.
    It's possible to write small X.509/ASN.1 decoding packages. One that I
    wrote for a small-device SSL package takes about 11k code (gcc on Intel
    PIII) and it's not very optimized- there's lots of room to squeeze it
    down farther than the original application required.

    Encoding ASN.1 really eats space though, because of the nested nature
    of complex ASN.1... unless you do some tricks like I did in US patent
    6,111,660. Using this trick, we were able to encode SET messages
    (really ugly ASN.1) using only 4 bytes more than the size of the final
    message. So we could comfortably run client-side SET in less than 24k
    of RAM.

    -- 
      Eric Murray           Consulting Security Architect         SecureDesign LLC
      http://www.securedesignllc.com                            PGP keyid:E03F65E5
    


     
    From: David Honig (honigsprynet.com)
    Date: Wed Jan 10 2001 - 12:37:12 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    At 05:20 PM 1/10/01 -0000, lcs Mixmaster Remailer wrote:
    >Apologies for the long message yesterday, which required reading an even
    >longer postscript paper to understand. Here is a question which came
    >up at the bottom of the message that people may be able to help with.
    >
    >Suppose you want to create a data structure that will let an untrusted
    >server tell whether an encrypted document has certain words or strings
    >of words in it. This will be an auxiliary data structure that allows
    >answering this question, but we want to leak as little information
    >as possible.
    >
    >One idea is to break the document into words, and then to create an
    >extra data structure which holds the hash of every (plaintext) word in
    >the document, in order. To search, you reveal the hash of the word or
    >words you are looking for, and the server can then compare against the
    >hashes in the list.
    >
    >The obvious problem is that the server can search for words of its
    >own choosing by hashing them and comparing with the hash list.
    >
    >To fix this, use a keyed hash. Only the key holder knows how to
    >turn a word into its hash form, and he gives these hashes to the
    >server to look for matches.
    >
    >Now, this has one flaw that I know of. Can you find it? Can you suggest
    >a fix?

    When an authorized user submits a key, the malicious server stores
    it and later uses a dictionary and lots of querying to list the words
    you've kept hashes of.

    I would maintain an 'unclassified' english description of the encrypted
    text and simply search on that. I would use a human to perform the gisting,
    because its not clear how to automatically find keywords without giving
    away too much meaning.

     

      


     
    From: dmolnar (dmolnarhcs.harvard.edu)
    Date: Wed Jan 10 2001 - 15:17:02 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    On 10 Jan 2001, lcs Mixmaster Remailer wrote:

    > To fix this, use a keyed hash. Only the key holder knows how to
    > turn a word into its hash form, and he gives these hashes to the
    > server to look for matches.
    >
    > Now, this has one flaw that I know of. Can you find it? Can you suggest
    > a fix?

    Do you mean that the server can build a database of hashes it has seen,
    and knows exactly what those hashes correspond to in its encrypted
    database? That's the analogy from ECB mode in ciphers which pops to mind.

    The first impulse I have is "private information retreival", but if you
    had that, you wouldn't need this at all. Plus PIR is fairly annoying
    computation-wise last I looked.

    The second impulse I have is something along the lines of Skala's "blind
    substring search" where the substring being searched for is the keyed
    hash. That is, he shows how to build a function F given a target
    string t such that

            F(s) = 1 if t is a substring of s
                   0 otherwise

    and yet t is hard to recover from the description of F,

    based on some properties of boolean functions. (By the way, this can be
    turned into a chameleon hash scheme). So you would make
    the keyed hash output on your item I the target t and then build a
    suitable F. Send it to the server and trust it to please send you the
    result.

    This isn't satisfactory, of course, because a) the server could lie to you
    and b) the server could start pulling blocks from its data store and
    continue querying F until it figures out what t is. So you would need to
    augment F in such a way that it recognizes when it's being evaluated on
    the proper data store and "balks" otherwise. It's not clear to me that
    this is possible.

    My kiosk time is about to run out, so that's it for now.

    -David


     
    From: leah262excite.com
    Date: Tue Jan 09 2001 - 16:16:51 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]


    Looking For Sales, or Exposure,
    we offer fresh targeted or general emails
    sent for you with current email addresses.
    Watch your business grow.


    We GUARANTEE response !

    * Daily reports on your email send !

    * 2001 Introductory Special !!!

    * We can even create your ad or announcement for you !


    CALL 8 am. - 3:30 pm. P.S.T. 702-242-5725 or 702-528-2400



    For removal see below.





    ++++++++++++++++++++++++++++++++++++++++++++++++++++++++
    Sorry if you received this message in error.
    If you wish to be removed. Please, type "REMOVE"
    in the subject line:MAILTO: remove101excite.com
    ++++++++++++++++++++++++++++++++++++++++++++++++++++++++



     
    From: Search Engine Dept (sepinteradnetwork.com)
    Date: Wed Jan 10 2001 - 17:17:20 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    ******************************************************************************
               Complete list REMOVAL instructions outlined below message.

                                removesinteradnetwork.com
               Secure Removal - https://www.interadnetwork.com/removal.htm
    ******************************************************************************

                                F R E E R E P O R T

    Is your website at the top of the major search engines? It needs to be! If
    it is not, you are missing out on serious amounts of web traffic and business!

    Did you know that 85% of web traffic originates from search engines? AND
    did you know that 98.2% of searches do NOT go past the third page of search
    results? (from the GVU 10th WWW User survey, Oct-Dec 1999)

    As a means of introduction we are offering you FREE a one time, no
    obligation, report of your website`s rank on the major search engines. You
    must know whether or not your website is achieving top rank on the major
    search engines. If you are not within the first 30 results you loose a
    distinct advantage over your competition. Obviously the higher the better.

    Click the link below and find out immediately if your website has the
    ranking that will make you money.

              http://www.interadnetwork.com/search-engine-free-report.htm

    If you have any questions or comments either before or after you have
    received your free report, please don`t hesitate to write us at

              infointeradnetwork.com

    Thank you for your time

    Your search engine Placement Specialists

              http://www.interadnetwork.com

    Creating Positive Solutions for Your Internet Business

    We apologies if you are not interested in internet traffic building
    technologies. E-mail is the fastest method of distributing this type of
    timely business information. If you wish to have your e-mail address
    removed from our business information update data base simply click on the
    hyperlink below:

              https://www.interadnetwork.com/removal.htm

    This message is being sent to you in compliance with the Federal legislation
    for commercial e-mail (S.1618-SECTION 301) This letter is not considered
    spam as long as we include contact information and a remove link.

    Search Engine Department <sepinteradnetwork.com>
    Inter-Networking Promotions Specialist

    ******************************************************************************
                                Removal Instructions

    To unsubscribe from the InterAD Network (www.interadnetwork.com) emailing list,
    please browse to the following URL:

          https://www.interadnetwork.com/removal.htm

    This page is secured by a 128 bit SSL Encryption for your protection and email
    privacy. You may list as many emails you wish to be removed from this and all
    sequent messages. We keep an extensive and complete database of removes that
    is cross referenced before any new promotions are broadcast.

    You may also email with "UNSUBSCRIBE" in the Subject Line:

              removesinteradnetwork.com

    This email is in complete compliance to Opt-Out mailing practices as stated in
    the Rules under California Business & Professions Code Section 17538.45

     Complete information can be viewed at- http://www.spamlaws.com/state/ca.html

    ******************************************************************************


     
    From: David Wagner (dawmozart.cs.berkeley.edu)
    Date: Wed Jan 10 2001 - 20:01:26 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    lcs Mixmaster Remailer wrote:
    >Suppose you want to create a data structure that will let an untrusted
    >server tell whether an encrypted document has certain words or strings
    >of words in it. [...]
    >
    >One idea is to break the document into words, and then to create an
    >extra data structure which holds the [keyed] hash of every (plaintext) word in
    >the document, in order. To search, you reveal the hash of the word or
    >words you are looking for, and the server can then compare against the
    >hashes in the list. [...]
    >
    >Now, this has one flaw that I know of. Can you find it? Can you suggest
    >a fix?

    This seems to have the same problem as ECB mode. Namely, repeated
    words in the plaintext will show up as repeats in the ciphertext.
    Is this the same flaw that you were thinking of?


     
    From: David Wagner (dawmozart.cs.berkeley.edu)
    Date: Wed Jan 10 2001 - 19:58:04 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Dear anonymous,

    Here are a few comments on your note about searching on encrypted data.
    I apologize to anyone else who may not be interested in this topic for
    posting this publicly, but I did not see any address for private replies.

    First, let me thank you for your many insightful observations on the
    problem of searching on encrypted data in practice.

    Regarding your comments on the choice of n, I'm not sure, but I think
    it may suffice to ensure that no word is repeated more than 2^{(n-m)/2}
    times. Since we will probably want to exclude very common words (such
    as "a", "the", and so on), this means it might be possible to use values
    of n as small as 48 bits or so. (However, I haven't tried to write down
    a proof of this claim, so I could be wrong.) Would this help at all?

    Note that in principle it is possible to handle long words more graciously
    by using techniques described in Section 5.3. This technique allows us
    to search on words longer than the block length. But is this worth the
    bother in practice? It seems quite plausible that your clever method of
    simply searching on prefixes may be preferable, since we may not expect
    to encounter long words that share the same block-length prefix very often.

    The issues with punctuation and compression hadn't occurred to me.
    Thank you for pointing them out!

    As for your proposed new scheme, it looks quite interesting. I don't
    see any obvious problems in it, but I must apologize that I haven't had
    a chance to think about it deeply, so I could easily be missing something.

    One theoretical drawback is that it expands the size of the ciphertext
    (whereas in principle the Song/Wagner/Perrig technique need not cause
    any message expansion, in the lucky case of constant-sized words), but
    as you showed in your post, this may be purely a theoretical issue. In
    practice, it seems that your proposal could have considerably lower
    overhead, for keyword searching on English text.

    One minor suggested tweak: it might be slightly better to look at
       F(F(key, word), sequence_number)
    where F(k,x) denotes the application of some PRF (e.g., SHA1-HMAC) with
    key x to the input x. With this modification, it might just be possible
    to prove something about the security of the scheme.

    In the setting where the server stores many documents, and the results
    of the search should be a list of documents that contain at least one
    match with the query, we might tweak this a bit further to become
      F(F(key, <word, occurrence>), document_number)
    where occurrence is one for the first occurrence of the word, two for the
    second occurrence, and so on. Then, to search on a word W, we can send
    F(key, <W,1>) to the server, and ask for the list of matching documents.

    Regards,
    -- David Wagner


     
    From: Eric Young (eaypobox.com)
    Date: Thu Jan 11 2001 - 03:23:01 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Eric Murray wrote:
    >
    > On Wed, Jan 10, 2001 at 07:59:13AM -0700, Gé Weijers wrote:
    > > On Tue, Jan 09, 2001 at 03:42:45PM -0800, Xiao, Peter wrote:
    > > > Hi,
    > > > I am currently looking for crypto implementation that can fit into small
    > > > footprint (in the order of 50K or less) devices. Ideally, an SSL type of
    > > > protocol meets my requirements but it is almost impossible to implement it
    > > > within 50K even with selected cipher suites. So, I am looking for
    > > > alternatives (either symmetric key or public key based). I was thinking
    > > > about WTLS but looks like its implementation can not be significantly
    > > > smaller than that of TLS since it is also based on Public Key cryptography
    > > > (I am wondering how it fits into a cellphone). Can any one tell me what is
    > > > the approximate size of the client implementation of WTLS. Also, would
    > > > anyone send some pointers to me regarding what I am looking for.
    > >
    > > It's not the public-key operations themselves that use the space. I've
    > > managed to squeeze OAEP-formatted RSA encryption into less than
    > > 20K. The public key was hard-wired, though. You probably want to stay
    > > away from ASN.1 formatted data if space is a concern.

    I have been doing some work on this recently, and also have gotten good,
    results, specifically, PKCS#1 RSA multi-prime on a Palm is 16.5k
    (1024-2 17.63sec, 1024-3 9.6sec, palm IIIx (68xxx 20mhz)), or more
    interestingly
    18k on a Psion (ARM7 36mhz, 1024-3 private in 0.18sec and 1024-2 in 0.34sec).
    I'm waiting for ARM (or SH3/4 or anything other than 68xxx) to take over
    the world. It make the choice of public key algorithm based on
    CPU load less irrelevant when low end devices have this sort of grunt.

    I am interested in knowing how small EC can be for both
    public/private operations. Any public information or peoples experiences?

    > Unfortunately anything that uses X.509 (like SSL) will require it.
    > It's possible to write small X.509/ASN.1 decoding packages. One that I
    > wrote for a small-device SSL package takes about 11k code (gcc on Intel
    > PIII) and it's not very optimized- there's lots of room to squeeze it
    > down farther than the original application required.

    Similar experiences here, we have an ASN.1 encoder/decoder in 8k.
    I have not tries the really complex stuff yet,
    like SET (and hopefully never will :-). It is nice to have an ASN.1 encoder
    this small but rather obviously it requires a bit of work per
    ASN.1 data type.

    eric (who has a day job at eayrsasecurity.com.au)


     
    From: Rich Salz (rsalzcaveosystems.com)
    Date: Thu Jan 11 2001 - 07:22:01 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    > Similar experiences here, we have an ASN.1 encoder/decoder in 8k.

    At CertCo we used a slightly modified version of the Umich BER decoder
    that
    can now be found within openldap. I don't know how big it was, but it
    fit
    into a Chrysalis card with a whole bunch of other certco firmware.
            /r$


     
    From: Rich Salz (rsalzcaveosystems.com)
    Date: Thu Jan 11 2001 - 07:34:55 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    > Encoding ASN.1 really eats space though, because of the nested nature
    > of complex ASN.1... unless you do some tricks like I did in US patent
    > 6,111,660.

    It sure looks like the Umich LDAP library is prior art which invalidates
    most, if not all, of the independant claims. (At least 1 and 6, which
    are the key ones.) This library was documented in RFC 1823, published
    in August 1995.
            /r$


     
    From: Dave Del Torto (meetingpunks-admincryptorights.org)
    Date: Thu Jan 11 2001 - 16:40:31 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Greetings,

    Cypherpunks/Meetingpunks Announcements for January 2001!

    Every month they seem to doubt us and expect our early demise, but
    EVERY SECOND SATURDAY, rain or shine, we have ... wait for it ...
    that's right: a Cypherpunks Physical Meeting (that means you show
    up!) somewhere in the San Francisco Bay Area, and this coming Second
    Saturday is no different... no budget, no frills, no BS (just the way
    Martin would've liked it) we're not going away until the NSA does.
    Check out the complete scoop at:

      This Month in SF: <http://cryptorights.org/cypherpunks/2001/0113-SF.html>

      All Jan Meetings: <http://cryptorights.org/cypherpunks/2001/01.html>
       Admin/List Page: <http://cryptorights.org/cypherpunks/meetingpunks.html>
    The Handy Shortcut: <http://cryptorights.org/meetingpunks>

    January 2001/San Francisco Meeting Synopsis:
    ............................................................................

    SF Bay Area Cypherpunks (80th Chairborne Regiment)
    January 2001 Physical Meeting Announcement

    General Info:

    DATE: Saturday 13 January 2001
    TIME: 1:00 - 6:00 PM (Pacific Time)
    PLACE: San Francisco Law Enforcement Regional Training Center
            (San Francisco Police Academy)
             Room 102 (or follow the cribs)

      This is the First Cypherpunks Meeting of the Millennium!

      The January 2001 Physical Meeting of the San Francisco Bay Area
      Cypherpunks will feature Steven Levy, author of the new
      cypherpunk book "CRYPTO". If you haven't got your copy yet, buy one
      and bring it to the meeting! We'll also spend some time catching up
      with Cindy Cohn on the EFF's DVD/DeCSS case. At the end of
      the meeting, we'll remember our departed friend Martin Minow
      (who would have really enjoyed Steven's book).

      As always, this is an Open Meeting on US Soil and members of the
      Public are encouraged to attend, especially Martin's Friends and Family.

    Meeting Agenda: (all timings are approximate)

          "Our agenda is a widely-held secret."

      12:00 - 1:00 - Informal milling about, food & beverages.
       1:00 - 3:00 - General Meeting:
                      HAL2001 Planning
                      A Report from Burma!
                      CryptoRights Foundation News
                      MojoNation Update
                      (Possible Mystery Ph.D.: Vna Tbyqoret)
       3:00 - 4:30 - Special Guest: Steven Levy, author of "CRYPTO"
       4:30 - 5:15 - Cindy Cohn, EFF: Update on the DVD/DeCSS Case
       5:15 - 6:00 - "Remembering Martin Minow"
       6:00 - ? - Dinner at a nearby restaurant usually follows the
                       meeting.

    FULL INFO: <http://cryptorights.org/cypherpunks/2001/0113-SF.html>

    ................................. end here .................................


     
    From: lcs Mixmaster Remailer (mixanon.lcs.mit.edu)
    Date: Fri Jan 12 2001 - 12:00:18 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    David Wagner writes:

    > Regarding your comments on the choice of n, I'm not sure, but I think
    > it may suffice to ensure that no word is repeated more than 2^{(n-m)/2}
    > times. Since we will probably want to exclude very common words (such
    > as "a", "the", and so on), this means it might be possible to use values
    > of n as small as 48 bits or so. (However, I haven't tried to write down
    > a proof of this claim, so I could be wrong.) Would this help at all?

    Well, the word size would go down to maybe 48+24 instead of 64+32 (if
    we also cut down the size of m somewhat) or 72 vs 96 bits, a 25% savings.

    I think you would have to modify your proof of security, because after all
    the proof made no assumptions about the nature of the plaintext. As far
    as the proof is concerned the plaintext could be nothing but repetitions
    of the same English word and you'd still have provable security. So in
    the general case you still need to have 2^((n-m)/2) be comfortably larger
    than the number of words in the message, which is what the proof says.
    Now if you introduced assumptions about the number of times a given word
    could appear you could probably modify the proof in the way you describe.

    > Note that in principle it is possible to handle long words more graciously
    > by using techniques described in Section 5.3. This technique allows us
    > to search on words longer than the block length. But is this worth the
    > bother in practice? It seems quite plausible that your clever method of
    > simply searching on prefixes may be preferable, since we may not expect
    > to encounter long words that share the same block-length prefix very often.

    Another problem with searching on prefixes is false matches on the
    suffixes of long words. This gets worse if the word size n is smaller.

    > The issues with punctuation and compression hadn't occurred to me.
    > Thank you for pointing them out!

    On further thought there are probably better ways of dealing with the
    punctuation problem. Rather than simply encrypt everything in order,
    the document should be pre-processed. All the words should be extracted
    (in order) and encrypted using your techniques. Then there can be
    an auxiliary data structure in compressed form (encrypted of course)
    which tells how to put the words together and what punctuation to use.
    Something like "7 words separated by spaces, then a period and two
    spaces, then 8 words separated by spaces," etc. This could be encoded
    in a compressed string in some concise form, and we wouldn't have to
    waste a whole word every time a comma appeared in the document.

    This approach would also allow efficient ignore-case searching, where
    all the words are encrypted in lower case form and the auxiliary data
    tells how to capitalize them where necessary. This would avoid the
    need to search redundantly for capitalized and uncapitalized forms of
    words which may appear at the beginning of sentences.

    So I think there are a number of tricks which can be used to increase
    the efficiency of the scheme if expansion is a problem (and even in
    the worst case 3x expansion is not a big problem in most cases).

    > As for your proposed new scheme, it looks quite interesting. I don't
    > see any obvious problems in it, but I must apologize that I haven't had
    > a chance to think about it deeply, so I could easily be missing something.
    >
    > One theoretical drawback is that it expands the size of the ciphertext
    > (whereas in principle the Song/Wagner/Perrig technique need not cause
    > any message expansion, in the lucky case of constant-sized words),

    (if the words are large enough that the block size is secure...)

    > but
    > as you showed in your post, this may be purely a theoretical issue. In
    > practice, it seems that your proposal could have considerably lower
    > overhead, for keyword searching on English text.
    >
    > One minor suggested tweak: it might be slightly better to look at
    > F(F(key, word), sequence_number)
    > where F(k,x) denotes the application of some PRF (e.g., SHA1-HMAC) with
    > key x to the input x. With this modification, it might just be possible
    > to prove something about the security of the scheme.

    Interesting. This differs from my proposal only in the ordering of the
    two arguments to the outer F. So the properties of F(k,x) are different
    enough from F(x,k) to change whether a proof is possible? In the simplest
    case, I have a secret key and a word, and I reveal F(key, word), and
    it's imperative that he not be able to guess either the key or the word.
    Is this provable, or is it the nature of random functions that you can
    only prove (or assume) that one of the two "slots" is protected?

    > In the setting where the server stores many documents, and the results
    > of the search should be a list of documents that contain at least one
    > match with the query, we might tweak this a bit further to become
    > F(F(key, <word, occurrence>), document_number)
    > where occurrence is one for the first occurrence of the word, two for the
    > second occurrence, and so on. Then, to search on a word W, we can send
    > F(key, <W,1>) to the server, and ask for the list of matching documents.

    Yes, that's a nice trick, similar to the one in the paper. One problem
    is it interferes with string searches - you can't search for "traffic
    analysis" as easily because this might be the 1st occurrence of "traffic"
    but the 3rd of "analysis".

    Thanks for the good advice -


     
    From: David Wagner (dawmozart.cs.berkeley.edu)
    Date: Fri Jan 12 2001 - 13:03:10 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    lcs Mixmaster Remailer wrote:
    >Interesting. This differs from my proposal only in the ordering of the
    >two arguments to the outer F. So the properties of F(k,x) are different
    >enough from F(x,k) to change whether a proof is possible?

    Yes. If you use
       F(s, F(k,w))
    where w is the word, s the sequence number, and F is only assumed to
    be a pseudorandom function (whose first input is the key), this is in
    general not secure.

    The problem is that the "key" s to the outer invocation of F is known,
    and thus all bets are off.

    Here is a counterexample. Set F(k,x) = E_k(x) where E is some block cipher.
    This F is a pseudorandom function. However, given s and F(s, F(k,w)), the
    adversary can compute F(k,w) by simply applying the decryption function
    D_s(). Then the attacker can use F(k,w) to tell when the words at two
    positions are the same, and this allows ECB mode attacks.

    Thus, F(s, F(k,w)) is not necessarily secure.

    (If you make some extra assumptions about F, it might be secure. But just
    using F(F(k,w), s) seems to avoid the need for extra assumptions, which
    suggests that the latter is to be preferred.)


     
    From: R. A. Hettinga (rahshipwright.com)
    Date: Fri Jan 12 2001 - 20:13:12 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    --- begin forwarded text

    Date: Fri, 12 Jan 2001 15:01:53 -0800
    To: mac-cryptovmeng.com
    From: Vinnie Moscaritolo <vinnievmeng.com>
    Subject: Announcement: Mac Crypto Conference / January 29-30, 2001
    Sender: <mac-cryptovmeng.com>

    The Membership of the Mac-Crypto List invites you to:

      "The Second Millennium Mac-Crypto Conference
    on Macintosh Cryptography and Internet Commerce "
            January 29-30, 2001

    DeAnza 3 Auditorium
    Apple R&D Campus
    10500 N DeAnza Blvd, Cupertino, CA, USA

    Yes, we are once again hosting our workshop, where you are sure to
    find the latest and greatest information about what's going on in the
    Macintosh cryptography world.

    The agenda is posted at the Mac Crypto site at http://www.vmeng.com/mc/

    This years talks include:

    Keynotes:
    * The Effect of Anti-Circumvention Provisions on Security
    * Crypto Anarchy

    Crypto Law and Policy:
    * Crypto Law and the Mac Developer
    * Privacy Legislation and the Internet Mac
    * Transnational Regulation of Cryptography for the Mac

    Cryptanalysis and Security:
       * Internet Security and Authentication Issues
       * Security Analysis of the WEP algorithm

      New Opportunities for Macintosh Cryptography:
       * Future Directions for PGP
       * Introduction to Smartcards

    Internet Payments and Finance:
       * Bluespike: Content Control for the Macintosh
       * Intro to Internet Payments for Mac Developers
       * Internet Bearer Payments
       * Secure, Real-Time Financial Transactions using WebFunds on the Mac.
       * Mojonation and the Mac

    As usual the conference is free, and low key. In keeping with the theme of
    privacy we will not require any formal registration. Just be there.

      We have also left time open for a few last-minute speakers. If you
    would like to present a paper or give a talk, please contact
    Vinnie Moscaritolo at vinnieapple.com

    --- end forwarded text

    -- 
    -----------------
    R. A. Hettinga <mailto: rahibuc.com>
    The Internet Bearer Underwriting Corporation <http://www.ibuc.com/>
    44 Farquhar Street, Boston, MA 02131 USA
    "... however it may deserve respect for its usefulness and antiquity,
    [predicting the end of the world] has not been found agreeable to
    experience." -- Edward Gibbon, 'Decline and Fall of the Roman Empire'
    


     
    From: R. A. Hettinga (rahshipwright.com)
    Date: Fri Jan 12 2001 - 20:15:54 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    --- begin forwarded text

    Date: Fri, 12 Jan 2001 15:55:45 -0500 (EST)
    From: Christof Paar <christofece.WPI.EDU>
    To: "Interested in CHES 99, 2000, and 2001": ;
    Subject: CHES 2001 --- 2nd CFP
    Sender: bounce-dcsbreservoir.com
    Reply-To: Christof Paar <christofece.WPI.EDU>

    We apolgize for multiple mailings. -Christof Paar

    ===================================================================

            WORKSHOP ON CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS
                                  (CHES 2001)

                              www.chesworkshop.org

                                 Paris - France
                                May 13 - 16, 2001

                             Second Call for Papers

    General Information

    The focus of this workshop is on all aspects of cryptographic
    hardware and embedded system design. The workshop will be a forum of
    new results from the research community as well as from the industry.
    Of special interest are contributions that describe new methods for
    efficient hardware implementations and high-speed software for
    embedded systems, e.g., smart cards, microprocessors, DSPs, etc. We
    hope that the workshop will help to fill the gap between the
    cryptography research community and the application areas of
    cryptography. Consequently, we encourage submission from academia,
    industry, and other organizations. All submitted papers will be
    reviewed.

    This will be the third CHES workshop. The first workshop, CHES '99,
    was held at WPI in August of 1999 and was very well received by
    academia and industry. There were 170 participants, more than half of
    which were from outside the United States. The second workshop, CHES
    2000, was also held at WPI in August of 2000 and had an attendance of
    180.

    The third workshop, CHES 2001, will be held in Paris in May of 2001.
    The topics of interest include but are not limited to:

       * Computer architectures for public-key cryptosystems
       * Computer architectures for secret-key cryptosystems
       * Reconfigurable computing and applications in cryptography
       * Cryptographic processors and co-processors
       * Modular and Galois field arithmetic architectures
       * Tamper resistance on the chip and board level
       * Smart card attacks and architectures
       * Efficient algorithms for embedded processors
       * Special-purpose hardware for cryptanalysis
       * Fast network encryption
       * True and pseudo random number generators
       * Cryptography in wireless applications

    Instructions for Authors

    Authors are invited to submit original papers. The preferred
    submission form is by electronic mail to submissionchesworkshop.org.
    Papers should be formatted in 12pt type and not exceed 12 pages (not
    including the title page and the bibliography). The title page should
    contain the author's name, address (including email address and an
    indication of the corresponding author), an abstract, and a small
    list of key words. Please submit the paper in Postscript or PDF. We
    recommend that you generate the PS or PDF file using LaTeX, however,
    MS Word is also acceptable. All submissions will be refereed.

    Only original research contributions will be considered. Submissions
    must not substantially duplicate work that any of the authors have
    published elsewhere or have submitted in parallel to any other
    conferences or workshops that have proceedings.

    Important Dates

     Submission Deadline: February 15th, 2001.
     Acceptance Notification: March 31st, 2001.
     Final Version due: April 21st, 2001.
     Workshop: May 13th - 16th, 2001.

    NOTE: The CHES dates May 13th - 16th are the Sunday - Wednesday
    succeeding Eurocrypt 2001 which ends on Thursday, May 10th.

    Mailing List

    If you want to receive emails with subsequent Call for Papers and
    registration information, please send a brief mail to:
      mailinglistchesworkshop.org

    Invited Speakers

    Ross Anderson, University of Cambridge, U.K.
      Protecting Embedded Systems - the Next Ten Years

    Program Committee

    Ross Anderson, University of Cambridge, England
    Jean-Sebastien Coron, Gemplus, France
    Kris Gaj, George Mason University, USA
    Jim Goodman, Chrysalis-ITS, Canada
    Anwar Hasan, University of Waterloo, Canada
    Peter Kornerup, Odense University, Denmark
    Bart Preneel, Katholieke Universiteit Leuven, Belgium
    Jean-Jacques Quisquater, Universite Catholique de Louvain, Belgium
    Christoph Ruland, University of Siegen, Germany
    Erkay Savas, cv cryptovision, Germany
    Joseph Silverman, Brown University and NTRU Cryptosystems, Inc., USA
    Jacques Stern, Ecole Normale Superieure, France
    Colin Walter, Computation Department - UMIST, U.K.
    Michael Wiener, Entrust Technologies, Canada

    Organizational Committee

    All correspondence and/or questions should be directed to either of the
    Organizational Committee Members:

    Cetin Kaya Koc
    (Publications Chair)
    Dept. of Electrical & Computer Engineering
    Oregon State University
    Corvallis, Oregon 97331, USA
    Phone: +1 541 737 4853
    Fax: +1 541 737 8377
    Email: Kocece.orst.edu

    David Naccache
    (Program Chair and Local Organization)
    Gemplus Card International
    34 Rue Guynemer
    92447 Issy les Moulineaux Cedex, FRANCE
    Phone: +33 1 46 48 20 11
    Fax: +33 1 46 48 20 04
    Email: David.Naccachegemplus.com

    Christof Paar
    (Publicity Chair)
    Dept. of Electrical & Computer Engineering
    Worcester Polytechnic Institute
    Worcester, MA 01609, USA
    Phone: +1 508 831 5061
    Fax: +1 508 831 5491
    Email: christofece.wpi.edu

    Workshop Proceedings

    The post-proceedings will be published in Springer-Verlag's Lecture
    Notes in Computer Science (LNCS) series. Notice that in order to be
    included in the proceedings, the authors of an accepted paper must
    guarantee to present their contribution at the workshop.

    For help on using this list (especially unsubscribing), send a message to
    "dcsb-requestreservoir.com" with one line of text: "help".

    --- end forwarded text

    -- 
    -----------------
    R. A. Hettinga <mailto: rahibuc.com>
    The Internet Bearer Underwriting Corporation <http://www.ibuc.com/>
    44 Farquhar Street, Boston, MA 02131 USA
    "... however it may deserve respect for its usefulness and antiquity,
    [predicting the end of the world] has not been found agreeable to
    experience." -- Edward Gibbon, 'Decline and Fall of the Roman Empire'
    


     
    From: R. A. Hettinga (rahshipwright.com)
    Date: Fri Jan 12 2001 - 21:52:41 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    --- begin forwarded text

    To: mojonation-userslists.sourceforge.net,
            mojonation-devellists.sourceforge.net
    From: zookomad-scientist.com
    Subject: [Mojonation-devel] announcing Mojo Nation 0.936
    Sender: mojonation-devel-adminlists.sourceforge.net
    Reply-To: mojonation-devellists.sourceforge.net
    List-Help: <mailto:mojonation-devel-requestlists.sourceforge.net?subject=help>
    List-Post: <mailto:mojonation-devellists.sourceforge.net>
    List-Subscribe: <http://lists.sourceforge.net/lists/listinfo/mojonation-devel>,
            <mailto:mojonation-devel-requestlists.sourceforge.net?subject=subscribe>
    List-Id: For developers hacking Mojo Nation code
    <mojonation-devel.lists.sourceforge.net>
    List-Archive: <http://lists.sourceforge.net/archives//mojonation-devel/>
    Date: Fri, 12 Jan 2001 19:44:18 -0800

     The Evil Geniuses For A Better Tomorrow are pleased to announce
     version 0.936 of Mojo Nation.

     This version contains several important bugfixes and improvements to the
     user interface.

     Mojo Nation is the peer to peer file system with "swarm" delivery[1],
     distributed load balancing[2], optional integrated micropayments[3], a
     global hash-based name space[4], 4-out-of-8 block reconstruction[5], and
     many other features[6].

     In addition, Mojo Nation actually works.[7]

     To download the latest version of Mojo Nation for Windows, Linux or
     FreeBSD:

     http://mojonation.net/

     (Or search the "software" category on Mojo Nation.)

     ChangeLog:

      core:
       + a bug introduced in 0.934 that would cause needless 100% cpu usage
         in the comms code has been fixed.
       + a bug in which Windows runs out of file descriptors has been fixed.
       + a bug that could cause publishing to hang has been fixed.
       + brokers directly connected to the internet will recheck their
         IP address once every few minutes for people using DHCP with flakey
         ISPs.

      user interface:
       + it now displays a notice when downloading the users initial mojo so
         that they don't think they need more.
       + many consistency improvments and a new background color.

    -------

    footnotes:

    [1] "Swarm" delivery splits files into many pieces and uses a dynamic
    file retrieval algorithm so that many servers, each with a low-bandwidth
    connection, can deliver a file to a client at high-bandwidth speed.

    [2] Distributed load balancing is provided by an algorithm which
    dynamically selects the servers that are performing best for *you*.

    [3] Integrated "Mojo" micropayments provide a way to ensure that the people
    connecting to your server are peers, not leeches. If you prefer to be
    more generous (or if you want to establish a reputation as a new but
    powerful server), you can set your prices to "0" which gives access to
    your disk space and bandwidth for free.

    [4] The global hash-based namespace, implemented with the SHA1
    cryptographic hash, provides a way for any participant to uniquely
    identify a file and to verify that file's identify. For example, if you
    have Mojo Nation installed and you go to the URL
    "id/RDHYEsPIfSX8X9Vf-lQzDRFdYcA" then you will see a JPEG of two Evil
    Geniuses suiting up to enter the Research Chamber. The hash-based
    namespace makes it is impossible for any peer on the network to
    substitute a different file in place of that JPEG.

    [5] 4-out-of-8 block reconstruction, using Rabin's Information Dispersal
    Algorithm, means that for each block there are 8 "shares", each 1/4th as
    big as the block, and combining any 4 of them yields the original block.
    This increases availability of files when some of your peers are
    unavailable.

    [6] Too many to list.

    [7] Try it.

    _______________________________________________
    Mojonation-devel mailing list
    Mojonation-devellists.sourceforge.net
    http://lists.sourceforge.net/lists/listinfo/mojonation-devel

    --- end forwarded text

    -- 
    -----------------
    R. A. Hettinga <mailto: rahibuc.com>
    The Internet Bearer Underwriting Corporation <http://www.ibuc.com/>
    44 Farquhar Street, Boston, MA 02131 USA
    "... however it may deserve respect for its usefulness and antiquity,
    [predicting the end of the world] has not been found agreeable to
    experience." -- Edward Gibbon, 'Decline and Fall of the Roman Empire'
    


     
    From: 1w89hy4rtrw76wednsdaybellsouth.net
    Date: Sat Jan 13 2001 - 03:10:21 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    For Removal mailto:removeit_pleasen2mail.com?Subject=REMOVEccma

    Increase sales up to 500 % !!!
    It's easy!
    By having the ability to accept credit cards from
    your internet site we guarantee your sales will improve!

    We can get you set up NOW!
    No application fee!
    No immediate committment!
    It's FREE to inquire!

    If you would like more information on merchant services,
    please you must include your name and phone number, eve and day and
    the best time to call.
    mailto:moresalesn2mail.com.?Subject=infoCCMA
    DO NOT USE THIS EMAIL ADDRESS FOR REMOVE SEE BELOW

    **** MUST INCLUDE YOUR NAME & PHONE NUMBER*****

    ++++++++++++++++++++++++++++++++++++++++++++
    For Removal mailto:removeit_pleasen2mail.com?Subject=REMOVEccma


     
    From: Spyword (salesspyworld.co.uk)
    Date: Sat Jan 13 2001 - 12:45:23 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

     coderpunkstoad.com recently visited Spyworld Ltd, Spyworld Ltd specialise in providing
    surveillance and counter surveillance equipment.

    to find out more go to www.spyworld.co.uk

    Regards,

    Marketing Division
    Spyworld Ltd


     
    From: removalsprontomail.com
    Date: Sat Jan 13 2001 - 12:15:08 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    REICIPE FOR FREE SMOKING:- STIR 500 SEEDS INTO SOIL (YOU PROVIDE SOIL), SIMMER FOR 10 WEEKS. NOW INTRODUCE THE PLANTS TO YOUR GARDEN, THEY WILL BE VISITING YOUR FLOWER BEDS FOR 3 TO 4 MONTHS. YOU WILL BE ACCUSED OF GROWING POT PLANTS, LAUGH IT OFF. TO FIND OUT MORE GO TO THE SITE, IT IS PACKED WITH INFORMATION, AND SEE THE FILM ON PAGE ONE FOR THE END PRODUCT!
     
    50 Tobacco plants and 1x8 metres of garden = 5000 cigarettes worth nearly £1000.Our kit contains 500 seeds, you work it out. If you smoke and have green / nicotine stained fingers, stuck for a Challenge in the New Year, try an outdoor hobby. If you are a non smoker and think this will encorage people to smoke, forget it! It takes a commited smoker to spend 4 months during there Summer in the garden growing this weed, only to set fire to it afterwards.Visit www.smoke4free.com , we provide the seeds and full instructions on growing to curing, on line help, and free membership with your order.

    This is a one-time mailing, your address will automatically be removed from our mailing list.
     


     
    From: dsokolosnut.com
    Date: Sat Jan 13 2001 - 07:38:17 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Design Your Own Herbal and Nutritional Supplements and Reap the Financial Benefits

    coderpunkstoad.com,                                                                                                            

        It was a pleasure learning about your interests in herbs from your website.  Based on your credentials, I am offering you the following opportunity, which I hope you may find worthwhile.

    Thank you,

    Daniel

     Have your nutraceutical ideas become reality and marketed to the general public-and perhaps even globally.

    Design Your Own Herbal and Nutritional Supplements and Reap the Financial Benefits from the Quality of your own ideas!

    Kava Kava, Ginseng, Echinacea, St. John's Wort...

    For FREE information on these nutraceuticals, including their methods of synthesis,  you can go to http://www.osnut.com/freeinfo.htm by clicking HERE.

    The explosion in the nutraceutical industry has left open the possibility for considerable profits.  New nutraceuticals and herbal formulas are being discovered, designed, and marketed every day!  If you have a background in herbs/ biology/ chemistry /nutrition and/or medicine, then OSnutraceuticals is the company for you.

    Open Source Nutraceuticals, Inc. is a company committed to excellence in the nutraceutical industry by providing an open source for the creation and standardization of nutraceuticals for naturally treating all kinds of conditions. By implementing a linux-like platform for discussion and protection of your ideas, OSnutraceuticals can be the best way to have your innovations marketed to the general public and for you to reap the financial benefits from the sales.

    Sign up NOW and get 2 months FREE!

    For more information, visit www.osnut.com

    by clicking HERE!

    (Note: www.osnut.com is best viewed using Microsoft's Internet Explorer but can also be viewed with Netscape as well)

     If you feel you received this ad by mistake, please contact dsokolosnut.com and put the word "remove" in the subject line.  You will automatically be taken off our mailing list!


     
    From: B Swanson (money2000charter.net)
    Date: Sun Jan 14 2001 - 08:44:54 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Hello-

    I am an e-bay seller making $75,000+ per year, but I want to show
    you what I
    took a skeptical chance on, which I have come to realize has made
    our family
    at least
    an ADDITIONAL $252,000 THIS YEAR to date! This is a project and
    business
    that takes dedication, however it has ultilized only a fraction
    of the time
    that my regular
    selling does, without the costly fees that Ebay charges.

    There are countless different concepts of multi-level marketing,
    but sound
    marketing strategies are the key to secure financial success. In
    the summer
    of 1999 Donald Trump (A Multi-Millionaire touted by Forbes
    Magazine as one
    of the wealthiest men in the country) made an appearance on the
    David
    Letterman show. Dave asked him what he would do if he lost
    everything and
    had to start over from scratch. Without hesitating, Trump said
    he would
    find a good network marketing company and get to work. The
    audience started
    to hoot and boo him. He looked out at the audience and
    dead-panned his
    response "That's why I'm sitting up here and you are all sitting
    out there!"

    In this program I send out emails just like this one, as many as
    I can, and
    people send me cash in the mail for marketing information that I
    email back
    to them upon receipt of funds. Being a service, it is all
    completely legal,
    and I get to make that walk to the mailbox every day knowing that
    it is full
    of $5 bills for me!!

    Do the math... If you send out 100,000 emails (which you can do
    for free,
    the reports will show you how) and only 1 in 1000 people
    participates, you
    just made $500...and that was only on the first level!!!

    At the fifth level, you have a realistic chance to be at over
    $500,000! And
    that is ONLY ONE person participating out of 1000 at each level!

    Report #2 will even show you where you can get One MILLION e-Bay
    email
    addresses and all of the software you will need to send emails to
    them, and
    HOW!!

    This is not just a mail about marketing, and obtaining
    information, however.

    Realize FAST how much money there is to be made, and how EASY it
    is to do
    over and over... Then act. Make this the one email like this you
    decide to
    act on.

    Do you HONESTLY think you wont see your meager, one-time $25
    returned to you
    a hundredfold AT LEAST?? PLUS, look at the value of the
    informational
    reports you are getting for your money, and understand that you
    will be able
    to sell them over and over forever, even AFTER you have used them
    for your
    own monetary gain!!!

    And then you can run the whole program over and over for free!!
    If you
    have been looking for a little fun in your life, wait till you
    try THIS
    fun...the kind that puts cash in your mailbox!!

    Good Luck!!!

    Matt Farruggio

                    
    ==================================================

    DEAR FRIENDS AND FUTURE MILLIONAIRES:

     AS SEEN ON NATIONAL TV : (Reportedly on 48 Hours, in a 1999
    feature
    report.)

    ''Making over half million dollars every 4 to 5 months from your
    home for an
    investment of only $25 U.S. Dollars expense one time''

    THANKS TO THE COMPUTER AGE AND THE INTERNET !

                     
    ==================================================

    BECOMING A MILLIONAIRE WITHIN A YEAR!!!

    Before you say ''Bull'', please read the following. This is the
    letter you
    have been hearing about on the news lately. Due to the popularity
    of this
    letter
    on the Internet, a national weekly news program, reportedly "48
    hours",
    recently devoted an entire show to the investigation of this
    program
    described below, to see if it really can make people money. The
    show also
    investigated whether or not the program was legal.

    Their findings proved once and for all that there are
    ''absolutely NO Laws
    prohibiting the participation in the program and if people can
    -follow the
    simple instructions, they are bound to make some mega bucks with
    only $25
    out of pocket cost''. DUE TO THE RECENT INCREASE OF POPULARITY &
    RESPECT
    THIS PROGRAM HAS ATTAINED, IT IS CURRENTLY WORKING BETTER THAN
    EVER.

    Here is what Pam Hedland, from Fort Lee, New Jersey had to say:
    '' Thanks to
    this profitable opportunity. I was approached many times before
    but each
    time I passed on it. I am so glad I finally joined just to see
    what one
    could expect in return for the minimal effort and money required.
    To my
    astonishment, I received total $ 610,470.00 in 21 weeks, with
    money still
    coming in''. Pam Hedland, Fort Lee, New Jersey.

    ===============================================================

    Here is another testimonial: ''' This program has been around for
    a long
    time but I never believed in it. But one day when I received this
    again in
    the
    mail I decided to gamble my $25 on it. I followed the simple
    instructions
    and
    voila' ... 3 weeks later the money started to come in. First
    month I only
    made $240.00 but the next 2 months after that I made a total of
    $290,000.00. So far, in the past 8 months by re-entering the
    program, I have
    made over $710,000.00 and I am playing it again. The key to
    success in this
    program is to follow the simple steps and NOT change anything.''
    More
    testimonials later but first.

    =======PRINT THIS NOW FOR YOUR FUTURE REFERENCE ==========

    $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$

    If you would like to make at least $500,000 every 4 to 5 months
    easily and
    comfortably, please read the following. THEN READ IT AGAIN and
    AGAIN !!!

    $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$

     FOLLOW THE SIMPLE INSTRUCTION BELOW AND YOUR FINANCIAL DREAMS
    WILL COME
    TRUE, GUARANTEED! INSTRUCTIONS:

    ======== Order all 5 reports shown on the list below.===========

    For each report, send $5 CASH, THE NAME & NUMBER OF THE REPORT
    YOU ARE
    ORDERING and YOUR E-MAIL ADDRESS to the person whose name appears
    ON THAT
    LIST next to the report. MAKE SURE YOUR RETURN ADDRESS IS ON YOUR
    ENVELOPE
    TOP LEFT CORNER in case of any mail problems.

    === When you place your order, make sure you order each of the 5
    reports.
    You will need all 5 reports so that you can save them on your
    computer and
    resell them. YOUR TOTAL COST $5 X 5=$25.00.

     === Within a few days you will receive, vie e-mail, each of the
    5 reports
    from these 5 different individuals. Save them on your computer so
    they will
    be accessible for you to send to the 1,000's of people who will
    order them
    from you. Also make a floppy of these reports and keep it on your
    desk in
    case something happen to your computer.

    === IMPORTANT __ DO NOT alter the names of the people who are
    listed next to
    each report, or their sequence on the list, in any way other than
    what is
    instructed below in step '' 1 through 6 '' or you will lose out
    on majority
    of your profits.

    Once you understand the way this works, you will also see how it
    does not
    work if you change it. Remember, this method has been tested, and
    if you
    alter, it will NOT work !!! People have tried to put their
    friends/relatives
    names on all five thinking they could get all the money. But it
    does not
    work this way. Believe us, we all have tried to be greedy and
    then nothing
    happened. So Do Not try to change anything other than what is
    instructed.
    Because if you do, it will not work for you. Remember, honesty
    reaps the
    reward!!!

    1.. After you have ordered all 5 reports, take this advertisement
    and REMOVE
    the name & address of the person in REPORT # 5. This person has
    made it
    through the cycle and is no doubt counting their fortune.

     2.. Move the name & address in REPORT # 4 down TO REPORT # 5.

    3.. Move the name & address in REPORT # 3 down TO REPORT # 4.

    4.. Move the name & address in REPORT # 2 down TO REPORT # 3.

    5.. Move the name & address in REPORT # 1 down TO REPORT # 2

    6.. Insert YOUR name & address in the REPORT # 1 Position. PLEASE
    MAKE SURE
    you copy every name & address ACCURATELY!

    ===============================================================

    *** Take this entire letter, with the modified list of names, and
    save it on
    your computer. DO NOT MAKE ANY OTHER CHANGES.

    Save this on a disk as well just in case if you lose any data. To
    assist you
    with marketing your business on the internet, the 5 reports you
    purchase
    will provide you with invaluable marketing information which
    includes how to
    send
    bulk e-mails legally, where to find thousands of free classified
    ads and
    much more. There are 2 Primary methods to get this venture
    going:

    METHOD # 1: BY SENDING BULK E-MAIL LEGALLY
                
    ===============================================================
    Let's say that you decide to start small, just to see how it
    goes, and we
    will assume You and those involved send out only 5,000 e-mails
    each. Let's
    also
    assume that the mailing receive only a 0.2% response (the
    response could be
    much better but lets just say it is only 0.2%. Also many people
    will send
    out hundreds of thousands e-mails instead of only 5,000 each).

    Continuing with this example, you send out only 5,000 e-mails.

    With a 0.2% response, that is only 10 orders for report # 1.
    Those 10 people
    responded by sending out 5,000 e-mail each for a total of 50,000.
    Out of
    those 50,000 e-mails only 0.2% responded with orders. That's=100
    people
    responded and ordered Report # 2.

    Those 100 people mail out 5,000 e-mails each for a total of
    500,000 e-mails.
    The 0.2% response to that is 1000 orders for Report # 3.

    Those 1000 people send out 5,000 e-mails each for a total of 5
    million
    e-mails sent out. The 0.2% response to that is 10,000 orders for
    Report # 4.

    Those 10,000 people send out 5,000 e-mails each for a total of
    50,000,000
    (50 million) e-mails. The 0.2% response to that is 100,000
    orders for
    Report # 5 THAT'S 100,000 ORDERS TIMES $5 EACH=$500,000.00 (half
    million).

    Your total income in this example is: 1... $50 + 2... $500 + 3...
    $5,000 + 4... $50,000 + 5... $500,000 .... Grand Total=
    $555,550.00

    NUMBERS DO NOT LIE. GET A PENCIL & PAPER AND FIGURE OUT THE WORST
    POSSIBLE
    RESPONSES AND NO MATTER HOW YOU CALCULATE IT, YOU WILL STILL MAKE
    A LOT OF
    MONEY !
               
    ===============================================================

    REMEMBER FRIEND, THIS IS ASSUMING ONLY 10 PEOPLE ORDERING OUT OF
    5,000 YOU
    MAILED TO. Dare to think for a moment what would happen if
    everyone or half
    or even one 4th of those people mailed 100,000 e-mails each or
    more? There
    are over 150 million people on the Internet worldwide and
    counting. Believe
    me, many people will do just that, and more!

    METHOD # 2 : BY PLACING FREE ADS ON THE INTERNET
    =============================================================

    Advertising on the net is very very inexpensive and there are
    hundreds of
    FREE places to advertise. Placing a lot of free ads on the
    Internet will
    easily get a larger response. We strongly suggest you start with
    Method # 1
    and add METHOD # 2 as you go along. For every $5 you receive, all
    you must
    do is e-mail them the Report they ordered. That's it. Always
    provide same
    day service on all orders.

    This will guarantee that the e-mail they send out, with your name
    and
    address on it, will be prompt because they can not advertise
    until they
    receive the report.

     ===================== AVAILABLE REPORTS====================

    ORDER EACH REPORT BY ITS NUMBER & NAME ONLY. Notes: Always send
    $5 cash
    (U.S. CURRENCY) for each Report. Checks NOT accepted. Make sure
    the cash is
    concealed by wrapping it in at least 2 sheets of paper. On one of
    those
    sheets of paper, Write the NUMBER & the NAME of the Report you
    are ordering,
    YOUR E-MAIL ADDRESS and your name and postal address.

    PLACE YOUR ORDER FOR THESE REPORTS NOW :

    ===============================================================
    ______________________________________________________________

    REPORT # 1 : ''The Insider's Guide to Advertising for Free on the
    Net''

    Order Report #1 from:

    Brad Swanson
    4920 204th St W
    Farmington, MN 55024
    USA

    ____________

    REPORT # 2 : ''The Insider's Guide to Sending Bulk e-mail on the
    Net''

    Order Report # 2 from :

    Matt Farruggio
    6890 East Sunrise Dr
    Suite #120
    PMB 351
    Tucson, Arizona 85750

     ________________________________________________________________

    REPORT # 3 : ''The Secret to Multilevel marketing on the net''

    Order Report # 3 from:

    Mike Nichols
    PO Box 270061
    Flower Mound, TX 75027
    USA

     ________________________________________________________________

    REPORT # 4 : ''How to become a millionaire utilizing MLM & the
    Net''

    Order Report # 4 from:

    Jack Zampell
    4511 Rockford Ln.
    Chattanooga, TN 37411
    USA

     ________________________________________________________________

    REPORT # 5 : ''HOW TO SEND 1 MILLION E-MAILS FOR FREE''

    Order Report # 5 from:

    Heidi Bohm
    1095 Osceola Ave #103
    St Paul, MN 55105
    USA

    ______________________________________________________________

         $$$$$$$$$ YOUR SUCCESS GUIDELINES $$$$$$$$$$$

    Follow these guidelines to guarantee your success:

    === If you do not receive at least 10 orders for Report #1 within
    2 weeks,
    continue sending e-mails until you do.

    === After you have received 10 orders, 2 to 3 weeks after that
    you should
    receive 100 orders or more for REPORT # 2. If you did not,
    continue
    advertising or sending e-mails until you do.

    === Once you have received 100 or more orders for Report # 2, YOU
    CAN RELAX,
    because the system is already working for you, and the cash will
    continue to
    roll in ! THIS IS IMPORTANT TO REMEMBER: Every time your name is
    moved down
    on the list, you are placed in front of a different report.

     You can KEEP TRACK of your PROGRESS by watching which report
    people are
    ordering from you. IF YOU WANT TO GENERATE MORE INCOME SEND
    ANOTHER BATCH OF
    E-MAILS AND START THE WHOLE PROCESS AGAIN. There is NO LIMIT to
    the income
    you can generate from this business !!!

             
    ===============================================================

    FOLLOWING IS A NOTE FROM THE ORIGINATOR OF THIS PROGRAM:

    You have just received information that can give you financial
    freedom for
    the rest of your life, with NO RISK and JUST A LITTLE BIT OF
    EFFORT. You can
    make more money in the next few weeks and months than you have
    ever
    imagined. Follow the program EXACTLY AS INSTRUCTED. Do Not change
    it in
    anyway. It works exceedingly well as it is now. Remember to
    e-mail a copy of
    this exciting report after you have put your name and address in
    Report #1
    and moved others to #2 ......# 5 as instructed above. One of the
    people you
    send this to may send out 100,000 or more e-mails and your name
    will be on
    every one of them. Remember though, the more you send out the
    more potential
    customers you will reach. So my friend, I have given you the
    ideas,
    information, materials and opportunity to become financially
    independent. IT
    IS UP TO YOU NOW!

       =================== MORE TESTIMONIALS======================

    '' My name is Mitchell. My wife, Jody and I live in Chicago. I am
    an
    accountant with a major U.S. Corporation and I make pretty good
    money. When
    I received this program I grumbled to Jody about receiving
    ''junk mail''. I
    made fun of the whole thing, spouting my knowledge of the
    population and
    percentages involved. I ''knew'' it wouldn't work. Jody totally
    ignored my
    supposed intelligence and few days later she jumped in with both
    feet. I
    made merciless fun of her, and was ready to lay the old ''I told
    you so''
    on her when the thing didn't work. Well, the laugh was on me!
    Within 3
    weeks she had received 50 responses. Within the next 45 days she
    had
    received total $ 147,200.00 ...... all cash! I was shocked. I
    have joined
    Jody in her ''hobby''.

    Mitchell Wolf, Chicago, Illinois

    =============================================================

    '' Not being the gambling type, it took me several weeks to make
    up my mind
    to participate in this plan. But conservative that I am, I
    decided that the
    initial investment was so little that there was just no way that
    I wouldn't
    get enough orders to at least get my money back''. '' I was
    surprised when I
    found my medium size post office box crammed with orders. I made
    $319,210.00
    in the first 12 weeks. The nice thing about this deal is that it
    does not
    matter where people live. There simply isn't a better investment
    with a
    faster return and so big''.

    Dan Sondstrom, Alberta, Canada

    ===============================================================

    '' I had received this program before. I deleted it, but later I
    wondered if
    I should have given it a try. Of course, I had no idea who to
    contact to get
    another copy, so I had to wait until I was e-mailed again by
    someone
    else.....11 months passed then it luckily came again... I did not
    delete
    this one! I made more than $490,000 on my first try and all the
    money came
    within 22 weeks''.

    Susan De Suza, New York, N.Y.

    ===============================================================

    '' It really is a great opportunity to make relatively easy money
    with
    little cost to you. I followed the simple instructions carefully
    and within
    10 days
    the money started to come in. My first month I made $ 20,560.00
    and by the
    end of third month my total cash count was $ 362,840.00. Life is
    beautiful, Thanx to internet''.

    Fred Dellaca, Westport, New Zealand

    ==============================================================

    ORDER YOUR REPORTS TODAY AND GET STARTED ON YOUR ROAD TO
    FINANCIAL FREEDOM !

               
    ==============================================================

    If you have any questions of the legality of this program,
    contact the
    Office of Associate Director for Marketing Practices, Federal
    Trade
    Commission,
    Bureau of Consumer Protection, Washington, D.C.

    ==========================THE END======================

    This message is sent in compliance of the new e-mail bill:
    SECTION 301. Per
    Section 301, Paragraph (a)(2)(C) of S. 1618,

    http://www.senate.gov/~murkowski/commercialemail/S771index.html

    This is a one time only unsolicited commercial email. Further
    transmissions
    to you by the sender of this email may be stopped at no cost to
    you by
    sending a reply to this email address with the word "remove" in
    the subject
    line.

     
     
     
     
     
     
     
     
     


     
    From: toner1toner1hotmail.com
    Date: Sun Jan 14 2001 - 02:33:36 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    PLEASE FORWARD TO THE PERSON
    RESPONSIBLE FOR PURCHASING
    YOUR LASER PRINTER SUPPLIES

    **** VORTEX SUPPLIES ****

    --LASER TONER SUPPLIES AT DISCOUNT PRICES--

    LASER PRINTER TONER CARTRIDGES
    COPIER AND FAX CARTRIDGES

    WE ARE -->THE<-- PLACE TO BUY YOUR TONER CARTRIDGES BECAUSE YOU
    SAVE UP TO 30% FROM OFFICE DEPOT'S, QUILL'S OR OFFICE MAX'S EVERY DAY
    LOW PRICES

    ORDER BY PHONE:1-888-288-9043
    ORDER BY FAX: 1-888-977-1577
    CUSTOMER SERVICE: 1-888-248-2015
    E-MAIL REMOVAL LINE: 1-888-248-4930

    UNIVERSITY AND/OR SCHOOL PURCHASE ORDERS WELCOME. (NO CREDIT APPROVAL REQUIRED)
    ALL OTHER PURCHASE ORDER REQUESTS REQUIRE CREDIT APPROVAL.

    PAY BY CHECK (C.O.D), CREDIT CARD OR PURCHASE ORDER (NET 30 DAYS).

    IF YOUR ORDER IS BY CREDIT CARD PLEASE LEAVE YOUR CREDIT CARD # PLUS EXPIRATION DATE.
    IF YOUR ORDER IS BY PURCHASE ORDER LEAVE YOUR SHIPPING/BILLING ADDRESSES AND YOUR P.O. NUMBER
    NO SHIPPING CHARGES FOR ORDERS $49 OR OVER
    ADD $4.75 FOR ORDERS UNDER $49.
    C.O.D. ORDERS ADD $4.5 TO SHIPPING CHARGES.

    OUR CARTRIDGE PRICES ARE AS FOLLOWS:

    (PLEASE ORDER BY PAGE NUMBER AND/OR ITEM NUMBER)
                                     
    HEWLETT PACKARD: (ON PAGE 2)
                                       
    ITEM #1 LASERJET SERIES 4L,4P (74A)------------------------$44
    ITEM #2 LASERJET SERIES 1100 (92A)-------------------------$44
    ITEM #3 LASERJET SERIES 2 (95A)-------------------------------$39
    ITEM #4 LASERJET SERIES 2P (75A)-----------------------------$54
    ITEM #5 LASERJET SERIES 5P,6P,5MP, 6MP (3903A)--$44
    ITEM #6 LASERJET SERIES 5SI, 5000 (29A)------------------$95
    ITEM #7 LASERJET SERIES 2100 (96A)-------------------------$74
    ITEM #8 LASERJET SERIES 8100 (82X)-----------------------$145
    ITEM #9 LASERJET SERIES 5L/6L (3906A0------------------$35
    ITEM #10 LASERJET SERIES 4V-------------------------------------$95
    ITEM #11 LASERJET SERIES 4000 (27X)-------------------------$72
    ITEM #12 LASERJET SERIES 3SI/4SI (91A)--------------------$54
    ITEM #13 LASERJET SERIES 4, 4M, 5,5M-----------------------$49

    HEWLETT PACKARD FAX (ON PAGE 2)

    ITEM #14 LASERFAX 500, 700 (FX1)----------$49
    ITEM #15 LASERFAX 5000,7000 (FX2)------$54
    ITEM #16 LASERFAX (FX3)------------------------$59
    ITEM #17 LASERFAX (FX4)------------------------$54

    LEXMARK/IBM (ON PAGE 3)

    OPTRA 4019, 4029 HIGH YIELD---------------$89
    OPTRA R, 4039, 4049 HIGH YIELD---------$105
    OPTRA E----------------------------------------------------$59
    OPTRA N--------------------------------------------------$115
    OPTRA S--------------------------------------------------$165
    -
    EPSON (ON PAGE 4)

    ACTION LASER 7000,7500,8000,9000-------$105
    ACTION LASER 1000,1500-------------------------$105

    CANON PRINTERS (ON PAGE 5)

     PLEASE CALL FOR MODELS AND UPDATED PRICES
     FOR CANON PRINTER CARTRIDGES

    PANASONIC (0N PAGE 7)

    NEC SERIES 2 MODELS 90 AND 95----------$105

    APPLE (0N PAGE 8)

    LASER WRITER PRO 600 or 16/600------------$49
    LASER WRITER SELECT 300,320,360---------$74
    LASER WRITER 300 AND 320----------------------$54
    LASER WRITER NT, 2NT------------------------------$54
    LASER WRITER 12/640--------------------------------$79

    CANON FAX (ON PAGE 9)

    LASERCLASS 4000 (FX3)---------------------------$59
    LASERCLASS 5000,6000,7000 (FX2)---------$54
    LASERFAX 5000,7000 (FX2)----------------------$54
    LASERFAX 8500,9000 (FX4)----------------------$54

    CANON COPIERS (PAGE 10)

    PC 3, 6RE, 7 AND 11 (A30)---------------------$69
    PC 300,320,700,720 and 760 (E-40)--------$89

    IF YOUR CARTRIDGE IS NOT LISTED CALL CUSTOMER SERVICE AT 1-888-248-2015

    90 DAY UNLIMITED WARRANTY INCLUDED ON ALL PRODUCTS.

    ALL TRADEMARKS AND BRAND NAMES LISTED ABOVE ARE PROPERTY OF THE
    RESPECTIVE HOLDERS AND USED FOR DESCRIPTIVE PURPOSES ONLY.


     
    From: XVA International (xi11201address.com)
    Date: Mon Jan 15 2001 - 04:35:44 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    WOULD YOU STUFF
    ENVELOPES FOR
    $1,000'S WEEKLY?

    $2 For Each Envelope You Stuff
    SIMPLE, PLEASANT WORK YOU CAN DO AT HOME!!!

    HELP SOLVE YOUR MONEY PROBLEMS. No more worries over inflation,
    recession, bills, rising gasoline and other costs. If you are looking for
    easy extra income, to relieve financial pressures, you owe it to yourself
    to investigate our offer.

    HERE IS YOUR CHANCE to earn extra money working at home by becoming an
    active participant of our successful mailing association. You receive
    cash daily for the envelopes you stuff. There is no limit. You stuff as
    many as you wish.

    NO EXPERIENCE OR SPECIAL SKILLS REQUIRED. Our HOMEMAILER'S PROGRAM is
    designed especially for people with little or no business experience and
    provides step-by step instructions.

    $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$

    WHY IS THIS POSSIBLE?
    There are many mail-order companies who want to expand their business, but
    do not want to hire more people. If they hired more employees, they would
    have to supervise them, rent more office space, pay more taxes and
    insurance, all involving more paperwork. It is much easier for them to
    set it up so that independent homeworkers can earn money doing the work
    themselves.

    This program is designed to help people cash in with a company who needs
    homeworkers. Each member is an independent homeworker. You serve a
    company that pays good commissions to have their circulars mailed. This
    program has been perfected so that it has become one of the most
    successful and profitable ones ever.

    We invite you to take part in our success. The money you earn is up to
    you. We do not require that you mail a certain number of pieces each
    week. You can take on whatever amount of business that fits your
    schedule, and you can quit whenever you want, there are no obligations.
    This work mainly consists of the securing of envelopes.

    $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$

    You may work in the comfort of your own home, choose your own hours, and
    set your own pace. No need to leave your present job. The possibilities
    are unlimited - get the whole family to join in. Form workshops with your
    friends. We will further show you how to expand your operation and boost
    your new income as high as you wish to go.

    NOW, IT'S ALL UP TO YOU!
    The opportunity for the better life is here - it's waiting! But only YOU
    can take that all-important step that separates the achievers from the
    dreamers! Order NOW!

    $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$

    ALL BUSINESS can be done by MAIL and we give you complete assistance at
    every step to insure your success. You can START THE SAME DAY you receive
    the instructions and begin RECEIVING MONEY WITHIN TWO WEEKS and every week
    from then on, as long as you desire.

    You will be supplied with the materials to be stuffed. Envelopes will be
    already stamped and addressed.

    $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$

    GUARANTEE: We welcome you to this program and extend to you our
    unconditional guarantee that everything we have said about this program is
    true and that you will be delighted with the money you make. Our goals
    and continued success depends on your 100% satisfaction with the
    HOMEMAILER'S PROGRAM.

    $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$

    DON'T BE FOOLED
    There are many fraudulent envelope addressing and chain letter schemes
    being sold today. We recommend that you avoid them. Why fool with some
    questionable scheme when our program enables you to earn so much money
    legally. This is not an offer of employment. It is an opportunity to
    become an independent commission mailer for our company. Remember, unlike
    the others, this is not a get-rich-quick scheme. It is a proven program
    for making money while filling the needs of a company who need people to
    mail their circulars.

    IN ORDER TO GET YOU STARTED IMMEDIATELY, we must require a one-time fee of
    only $13.95. This covers our expense in showing you what to do and
    guarantees you can work with us as long as desired. You will not be
    required or asked to pay for any additional information or manuals.
    Inasmuch as we would like to send you our program with the small charge,
    we must protect ourselves from those who are not serious and have no
    intention other than to satisfy their own curiosity. Naturally, no
    business can afford to send out costly material to everyone who writes in
    asking for it. This small charge assures us that you are serious about
    wanting to earn money at home.

    DON'T DELAY - START IMMEDIATELY!!!
    This is money. You can begin now by putting your time to the best of use.
    The next few minutes can literally change your life. Don't let this
    extraordinary opportunity pass.

    YOUR REGISTRATION FEE REFUNDED
    as soon as you submit your first 100 envelopes.

    Send a check or money order in the amount of $13.95 to:

    X V A International
    11948, 207th Street, Suite 309
    Maple Ridge, BC, Canada
    V2X 1X7

    Don?t forget to include your name, address, and an email address.

    Never send cash through the mail.

    XVA International is a licensed business operating in BC, Canada; license
    #14126.

    Please allow 4 to 6 weeks for delivery of your starter kit.

    This message is sent in compliance of the new e-mail bill: SECTION 301.
    Per Section 301, Paragraph (a)(2)(C) of S. 1618. Further transmissions to
    you by the sender of this email may be stopped at no cost to you by
    sending a reply to this email with the word "remove" in the subject line.

    ____________________________________________________________________
    Get Free Internet Access and WebEmail at http://www.address.com Click on this link http://www.address.com/giveaways/free.asp for great offers.


     
    From: R. A. Hettinga (rahshipwright.com)
    Date: Mon Jan 15 2001 - 18:38:13 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    --- begin forwarded text

    From: Mary_Ellen_Zurkoiris.com
    Subject: NSPW 2001 CFP
    To: dcsbai.mit.edu
    Cc: crispinwirex.com, Mary_Ellen_Zurkoiris.com
    Date: Mon, 15 Jan 2001 18:21:48 -0500
    Sender: bounce-dcsbreservoir.com
    Reply-To: Mary_Ellen_Zurkoiris.com

    ========================================================================
                                Call For Papers
                      New Security Paradigms Workshop 2001
                        An ACM/SIGSAC sponsored workshop
                             11 - 13 September 2001
                           Cloudcroft, New Mexico, USA
                               http://www.nspw.org
    ========================================================================

    2001 is the tenth anniversary of the New Security Paradigms Workshop
    (NSPW), which has provided a productive and highly interactive forum for
    innovative new approaches to computer security. The workshop offers a
    constructive environment where experienced researchers and practitioners
    work alongside newer participants in the field. The result is a unique
    opportunity to exchange ideas. NSPW 2001 will take place September 11 -
    13, 2001 at the Cloudcroft Lodge, Cloudcroft, New Mexico, 20 miles from
    Alamogordo/White Sands.

    In order to preserve the small, focused nature of the workshop,
    participation is limited to authors of accepted papers and conference
    organizers. Because we expect new paradigms we accept wide-ranging
    topics in information security. Any paper that presents a significant
    shift in thinking about difficult security issues or builds on a
    previous shift is welcomed.

    NSPW is highly interactive in nature. Authors are encouraged to present
    ideas that might be considered risky in some other forum. All
    participants are charged with providing feedback in a constructive
    manner. The resulting brainstorming environment has proven to be an
    excellent medium for furthering the development of these ideas. Many
    authors have mentioned that they received more useful feedback and ideas
    than from any other conference. The proceedings, published after the
    workshop, have consistently benefited from the inclusion of workshop
    feedback.

    What makes a paper acceptable for NSPW? While we reject plenty of
    excellent papers that would do very well at other venues, our eclectic
    program committee particularly looks for new paradigms, innovative
    approaches to older problems, early thinking on new topics that are not
    necessarily fully polished, and controversial issues that might not make
    it into other conferences but deserve to have their try at shaking and
    breaking the mold. Conversely, a great paper that does not have a new
    paradigm, does not challenge the status quo, or does not critique an
    older paradigm will almost certainly get rejected.

    To participate, please submit your paper, justification, and attendance
    statement, preferably via e-mail, to both Program Chairs -- Brenda
    Timmerman <btimmerecs.csun.edu> and Darrell Kienzle <DKienzleNAI.com>
    -- by Friday, March 30, 2001 (hardcopy submissions must be received by
    Friday, March 23, 2001). Further details on the required format of
    submissions follow.

    1 - Your Paper
    You should submit either a research paper, a 5 - 10 page position paper,
    or a discussion topic proposal. Submissions of any type must not have
    been published elsewhere. Discussion topic proposals should include an
    in-depth description of the topic to be discussed, a convincing argument
    that the topic will lead to a lively discussion, and any other
    supporting materials.

    Softcopy submissions should be in Postscript, PDF, Word/RTF or ASCII
    format. Papers may be submitted as hardcopy. To submit hardcopy, please
    mail 5 (five) copies to Program Co-chair Brenda Timmerman. Please allow
    adequate time for delivery.

    2 - Justification
    You should describe, in one page or less, why your paper is appropriate
    for the New Security Paradigms Workshop. A good justification will
    describe the new paradigm being proposed, explain how it is a departure
    from existing theory or practice, and identify those aspects of the
    status quo it challenges or rejects.

    3 - Attendance Statement
    You should state how many authors wish to attend the workshop. Accepted
    papers require the attendance of at least one author. In order to ensure
    that all papers receive equally strong feedback, all attendees are
    expected to stay for the entire duration of the workshop.

    The program committee will referee the papers and notify the authors of
    acceptance status by June 8, 2000. We expect to be able to offer a
    limited amount of financial aid to those who require it. More
    information will be provided on our web site <http://www.nspw.org> as it
    becomes available.

    Workshop General and Vice Chairs

    Steven J. Greenwald Cristina Serban
    Independent Consultant AT&T Labs
    2521 NE 135th Street 307 Middletown-Lincroft Rd.
    North Miami, FL 33181 USA Lincroft, NJ 07748 USA
    Email: sjg6gate.net Email: cserbanatt.com
    Voice: +1 (305) 944-7842 Voice: +1 (732) 576-3279
    Fax: +1 (305) 489-8129 Fax: +1 (732) 576-6406

    Program Committee Co-Chairs

    Brenda Timmerman Darrell Kienzle
    California State University NAI Labs at Network Associates
    18111 Nordhoff Street 8000 Westpark Dr. Suite 600
    Northridge, CA 91330-8281 USA McLean, VA 22102 USA
    Email: btimmerecs.csun.edu Email: DKienzleNAI.com
    Voice: +1 (818) 677-7341 Voice: 703-356-4938
    Fax: +1 (818) 677-2140 Fax: 703-821-8426

    Program Committee

    Bob Blakley, Tivoli Systems
    Thomas E. Daniels, CERIAS/Purdue University
    Heather Hinton, Tivoli Systems
    Jun Li, University of California, Los Angeles
    Carla Marceau, Odyssey Research Associates
    Cathy Meadows, Naval Research Laboratory
    Ira Moskowitz, Naval Research Laboratory
    Susan Pancho, University of Cambridge
    Kai Rannenberg, Microsoft Research, Cambridge
    Emilia Rosti, Universita` degli Studi di Milano
    Sami Saydjari, SRI International
    Abe Singer, University of California, San Diego
    John Michael Williams, USA
    Bradley J. Wood, SRI International

    Local Arrangements
    John McHugh, SEI/CERT, +1 (412) 268-7737 <jmchughcert.org>

    Financial Aid
    Hilary Hosmer, Data Security Inc., +1 (781) 275-8231
    <hosmerdatasecinc.com>
    John McHugh, SEI/CERT, +1 (412) 268-7737, <jmchughcert.org>

    Publicity
    Crispin Cowan (WireX Communications, Inc.) +1 (503) 241-6575

    ACM-SIGSAC Chair
    Ravi Sandhu (George Mason University) +1 (703) 993-1659

    Steering Committee
    Bob Blakley, Steven J. Greenwald, Hilary Hosmer, Darrell Kienzle,
    Catherine Meadows, Cristina Serban, Brenda Timmerman, Mary Ellen Zurko

    For help on using this list (especially unsubscribing), send a message to
    "dcsb-requestreservoir.com" with one line of text: "help".

    --- end forwarded text

    -- 
    -----------------
    R. A. Hettinga <mailto: rahibuc.com>
    The Internet Bearer Underwriting Corporation <http://www.ibuc.com/>
    44 Farquhar Street, Boston, MA 02131 USA
    "... however it may deserve respect for its usefulness and antiquity,
    [predicting the end of the world] has not been found agreeable to
    experience." -- Edward Gibbon, 'Decline and Fall of the Roman Empire'
    


     
    From: R. A. Hettinga (rahshipwright.com)
    Date: Mon Jan 15 2001 - 21:01:09 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    --- begin forwarded text

    Resent-Date: Mon, 15 Jan 2001 21:40:34 -0400
    Date: Tue, 16 Jan 2001 02:40:21 +0100 (MET)
    From: "R. Hirschfeld" <R.Hirschfeldcwi.nl>
    To: fcifca.ai
    Subject: early registration deadline for Financial Cryptography '01
    Reply-to: rayunipay.nl
    Resent-From: fcoffshore.com.ai
    Resent-Sender: fc-requestoffshore.com.ai

    Just a reminder that the next few hours are the last chance to
    register for the FC01 conference for the early registration fee.
    After that the price will increase by $150.

    A preliminary program is available on the conference website,
    http://fc01.ai.

    --- end forwarded text

    -- 
    -----------------
    R. A. Hettinga <mailto: rahibuc.com>
    The Internet Bearer Underwriting Corporation <http://www.ibuc.com/>
    44 Farquhar Street, Boston, MA 02131 USA
    "... however it may deserve respect for its usefulness and antiquity,
    [predicting the end of the world] has not been found agreeable to
    experience." -- Edward Gibbon, 'Decline and Fall of the Roman Empire'
    


     
    From: Bruce Schneier (schneiercounterpane.com)
    Date: Mon Jan 15 2001 - 22:19:52 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

                      CRYPTO-GRAM

                    January 15, 2001

                   by Bruce Schneier
                    Founder and CTO
           Counterpane Internet Security, Inc.
                schneiercounterpane.com
              <http://www.counterpane.com>

    A free monthly newsletter providing summaries, analyses, insights, and
    commentaries on computer security and cryptography.

    Back issues are available at <http://www.counterpane.com>. To subscribe or
    unsubscribe, see below.

    Copyright (c) 2001 by Counterpane Internet Security, Inc.

    ** *** ***** ******* *********** *************

    In this issue:
          A Cyber UL?
          Crypto-Gram Reprints
          News
          Counterpane Internet Security News
          Crypto-Gram News
          Solution in Search of a Problem: SafeMessage
          A Social Engineering Example
          The Doghouse: Gianus Technologies
          NIST Crypto Update
          Code Signing in Microsoft Windows
          PGP Broken
          Comments from Readers

    ** *** ***** ******* *********** *************

                    A Cyber UL?

    Underwriters Laboratories (UL) is an independent testing organization that
    rates electrical equipment, safes, and a whole lot of other things. It all
    started in 1893, when William Henry Merrill was called in to find out why
    the Palace of Electricity at the Columbian Exposition in Chicago kept
    catching on fire (not the best way to tout the wonders of
    electricity). After making the exhibit safe, he realized he had a business
    model on his hands. He approached insurance underwriters with the idea of
    an independent testing lab. They were all sick of paying for electricity
    fires, and took him up on the deal. Eventually, if your electrical
    equipment wasn't UL certified, you couldn't get insurance.

    Today, UL rates many different things. Safes, for example, are rated based
    on time and materials. A "TL-15" rating means that the safe is secure
    against a burglar limited to safecracking tools and 15 minutes' working
    time. Other ratings certify the safe for longer periods of time, or
    against burglars with blowtorches and explosives. These ratings are not
    theoretical; actual hotshot safecrackers, employed by UL, take actual safes
    and test them. If a company comes out with a new version of a safe, it has
    to get it retested -- the rating does not carry forward.

    Applying this sort of thinking to computer networks -- firewalls, operating
    systems, Web servers -- is a natural idea. And the newly formed Center for
    Internet Security plans to implement it. I'll talk about the general idea
    first, and then the specifics.

    I don't believe that this is a good idea, certainly not now and possibly
    not ever. First, network security is too much of a moving target. Safes
    are easy. Safecracking tools don't change much. Maybe someone invents a
    hotter torch. Or someone else invents a more sensitive microphone. But
    most of the time, techniques of safecracking remain constant. Not so with
    the Internet. There are always new vulnerabilities, new attacks, new
    countermeasures. There are a couple of dozen new vulnerabilities each week
    in major software products; any rating is likely to become obsolete within
    months, if not weeks.

    Second, network security is much too hard to test. Again, safes are
    easy. Breaking into them requires skill, but is reasonably
    straightforward. Modern software is obscenely complex: there are an
    enormous number of features, configurations, implementations. And then
    there are interactions between different products, different vendors, and
    different networks. In the past, I've written extensively about complexity
    and the impossibility of testing security. For now, suffice it to say that
    testing any reasonably sized software product would cost millions of
    dollars, and wouldn't guarantee anything at the end. And worse, if you
    updated the product you'd have to test it all over again.

    Third, I'm not sure how to make security ratings meaningful. Intuitively,
    I know what it means to have a safe rated at 30 minutes and another rated
    at an hour. But computer attacks don't take time in the same way that
    safecracking does. The Center for Internet Security talks about a rating
    from 1 to 10. What does a 9 mean? What does a 3 mean? How can ratings be
    anything other than binary: either there is a vulnerability or there isn't?

    The moving-target problem particularly exacerbates this issue. Imagine a
    server with a 10 rating; there are no known weaknesses. Someone publishes
    a single vulnerability that allows an attacker to easily break in. What is
    the server's rating now? 9? 1? How are users notified of this
    change? Is the manufacturer required to change his official rating on his
    Web site? On his packaging? How does the Center re-rate the server once
    it is updated? But then the rating only affects certain patch levels of
    the product; how do you explain that? And once you've solved that, how do
    you deal with vulnerabilities that only affect the product in some
    configurations?

    Fourth, failures in network security are not always obvious. If a safe is
    broken into, the owner learns about it when he next opens his safe. If a
    network is broken into, the owner might never know. Data isn't stolen in
    the same way as diamonds or cash: it is copied, it is modified, or it is
    just examined. Remember that Microsoft's network was compromised for weeks
    before anyone knew about it. I believe that most network intrusions are
    never even noticed. A "secure" network product might fail completely, and
    no one would be the wiser.

    Fifth, I don't see how a rating could take context into account. Safes are
    just as hard to crack in a bank as they are in a house; network security
    products are highly dependent on their environment. A product rating
    cannot take into account the environment and interactions that a component
    will deal with. Network components would be certified in isolation, but
    deployed in a complex interacting environment. It is common to have
    several individual "secure" components completely blow a security model
    when they are all forced to interact with each other.

    Sixth, I don't see how to combine this concept with security
    practices. Today the biggest problem with firewalls is not how they're
    built, but how the user configures them. How does a security rating take
    that into account? How does a security rating take into account the people
    problem: users naively executing e-mail attachments, or resetting passwords
    when a stranger calls and asks them to?

    And seventh, this kind of thing could easily fall into the trap of bashing
    small products and protecting large products. A little-discussed fact of
    computer security is that minority products are more secure than popular
    products for the simple reason that there aren't as many exploits for
    them. But the unpopularity of those products might make it difficult for
    them to pay for evaluation. And can major vendors be held to the same
    standards as everyone else? It will take a lot of organizational fortitude
    to fail Microsoft's security, for example.

    This is not to say that there's no hope. I believe that the insurance
    industry will eventually drive network security, and that some sort of
    independent testing is inevitable. But I don't think that providing a
    rating, or a seal of approval, is possible anytime soon.

    Even so, the Center for Internet Security is tackling the
    challenge. Unfortunately, I don't particularly like what I see so far
    (although admittedly, I haven't seen much). Looking at their Web site, it
    seems more like a marketing scheme than anything else. A security supplier
    or consulting organization can spend $25K to become a
    member. (Organizations that use security can join for only $7K.) Benefits
    include "your organization's name...on Center brochures and benchmarks
    documents," "your organization's name included on the Center's website,"
    and "the privilege of using the Center's logo on your website." The last
    time I checked, there were 71 charter members.

    Their initial push is to consolidate a bunch of the mediocre security
    requirements documents out there (such as BS7799) and come up with a "final
    set of minimum benchmarks to be used as a basis for demonstrating due
    care," and to create a suite of tests that can give computer owners some
    kind of security rating or feeling of confidence.

    I see ideas like this as part of the Citadel model of security, as opposed
    to the Insurance model. The Citadel model basically says: "If you have
    this stuff and do these things, you'll be safe." The Insurance model says:
    "Inevitably things will go wrong, so you need to plan for what happens when
    they do." In theory, the Citadel model is a much better model than the
    pessimistic, fatalistic Insurance model. But in practice, no one has ever
    built a citadel that is both functional and dependable.

    My worry is that the Center for Internet Security will become an
    "extort-a-standard" body, which charges companies for a seal of
    approval. I believe that the people behind the Center for Internet
    Security have completely pure motives; you can be an ethical extortionist
    with completely honorable intentions. What makes it extortion is the
    detriment from *not* paying. If you don't have the "Security Seal of
    Approval," then (tsk, tsk) you're just not concerned about security.

    Center for Internet Security:
    <http://www.zdnet.com/zdnn/stories/news/0,4586,2667644,00.html>
    <http://www.cisecurity.org/>

    Underwriters Laboratory history:
    <http://www.bergen.com/biz/safe2219970921o1.htm>
    <http://www.ul.com/about/otm/otmv2n4/fire.html>

    Early discussions of a cyber-UL:
    <http://www.l0pht.com/cyberul.html>

    Complexity and security:
    <http://www.counterpane.com/crypto-gram-0003.html#SoftwareComplexityandSecur
    ity>

    A version of this article appeared on ZDNet:
    <http://www.zdnet.com/zdnn/stories/comment/0,5859,2669708,00.html>

    ** *** ***** ******* *********** *************

                 Crypto-Gram Reprints

    Publicity attacks:
    <http://www.counterpane.com/crypto-gram-0001.html#KeyFindingAttacksandPublic
    ityAttacks>

    Block and stream ciphers:
    <http://www.counterpane.com/crypto-gram-0001.html#BlockandStreamCiphers>

    ** *** ***** ******* *********** *************

                        News

    Timing attacks on Web browsers. The basic idea is that by timing how long
    a browser takes to download a page, you can learn whether the page is
    stored in the browser's cache...and therefore whether or not the person
    visited that Web site recently.
    <http://www.sciencedaily.com/releases/2000/12/001208074325.htm>

    The White House released an "International Crime Threat Assessment." The
    report discusses organized crime's use of computer and network attacks.
    <http://www.whitehouse.gov/WH/EOP/NSC/html/documents/pub45270/pub45270chap1.
    html>

    Only 25% of people who have break-ins report them. People are more worried
    about malicious code than break-ins, but information theft is the most
    damaging. Spending on security is predicted to more than triple in four years.
    <http://www.thestandard.com/article/display/0,1151,20500,00.html>

    Personal firewalls have security holes. Is anyone surprised that
    commercial software fails real-world security tests?
    <http://www.internetnews.com/intra-news/article/0,,7_529661,00.html>

    Clever steganography application: turn a message into innocuous spam:
    <http://www.spammimic.com/>

    Here's a product that until now has only been available to intelligence
    services. It's a special spray that allows someone to examined the
    contents of sealed opaque envelopes without opening them. When sprayed on
    the envelope, it renders envelopes temporarily transparent, enabling you to
    view the contents within. The company claims that it will only market the
    chemical to law enforcement, but you know how things get around.
    <http://www.mistraldetection.com/seethrough.htm>
    <http://www.newscientist.com/news/news.jsp?id=ns226930>
    If you can't wait, though, there's an electronic component cooling spray
    you can get at Radio Shack that does the same thing.

    Last month I complained that Microsoft is prohibiting services like BugTraq
    from reposting its security advisories. Now Stake, a company I expected
    better from, is doing the same thing.
    <http://cgi.zdnet.com/slink?70609:8469234>
    <http://www.theregister.co.uk/content/6/15533.html>
    BugTraq fights back:
    <http://www.theregister.co.uk/content/4/15491.html>

    Good analysis of the European CyberCrime Treaty. Short summary: it's still
    horrible.
    <http://www.securityfocus.com/commentary/124>

    Interesting interview on (among other topics) encryption with Eben Moglen,
    general counsel of the Free Software Foundation:
    <http://www.immaterial.net/page.php3?id=44>
    <http://www.immaterial.net/page.php3?id=45>

    Nasty story of what an insider can do to your network:
    <http://www.businessweek.com/bwdaily/dnflash/dec2000/nf20001213_253.htm>

    Clever things to do with Internet bugs:
    <http://www.theregister.co.uk/content/6/15423.html>

    Last month I discussed a New Yorker story about someone who pretended to be
    an employee for a few weeks. The company in question is Luminant, which
    wasn't pleased with the goings on:
    <http://www.thestandard.com/article/display/0,1151,20534,00.html>
    And here's an apology from the magazine for making up some of the details:
    <http://www.cnn.com/2000/US/12/05/newyorker.apology.ap/>
    Looks like the guy social engineered the New Yorker's editors and readers
    (including me), as well as the folks at Luminant.

    However, I have another story about a teen pretending to be a doctor at a
    DC-area hospital:
    <http://www.washingtonpost.com/wp-dyn/articles/A13455-2000Dec15.html>

    And a very strange story about a group impersonating the World Trade
    Organization:
    <http://www.nytimes.com/2001/01/07/weekinreview/07WORD.html?pagewanted=all>

    Along a similar line, a non-computer story about social engineering and
    industrial espionage:
    <http://www.nytimes.com/library/magazine/home/20001203mag-penenberg.html>

    Ireland is rushing into electronic voting:
    <http://www.ireland.com/newspaper/ireland/2000/1218/hom18.htm>

    MIT and CalTech announce a voting technology initiative:
    <http://www.wired.com/news/politics/0,1283,40674,00.html>

    Hacker tool that does a man-in-the-middle attack against SSL and HTTPS
    (among other things):
    <http://www.securityportal.com/cover/coverstory20001218.html>
    <http://www.monkey.org/~dugsong/dsniff/>
    A rebuttal:
    <http://sysadmin.oreilly.com/news/silverman_1200.html>
    And a follow-up by the original article's author:
    <http://www.securityportal.com/seifried/sslssh-followup20001222.html>

    Good information on various security resources on the WWW:
    <http://www.infosecuritymag.com/dec00/heiser.htm>
    The Counterpane Labs Web site is mentioned in the article.

    An article about the FBI's current hypocritical pretense of protecting
    "national security" and "privacy" by increasing its wiretapping abilities,
    using laws that were written to prevent hostile foreign domination of
    critical national infrastructure.
    <http://www.totaltele.com/view.asp?ArticleID=35057&pub=tt&categoryid=0>

    The Center for Strategic and International Studies has released a report:
    "Cyber Threats and Information Security: Meeting the 21st Century Challenge."
    <http://www.csis.org/homeland/reports/cyberthreatsandinfosec.pdf>
    In the report, the authors speculate that the Microsoft break-in, if source
    code was modified, could have grave security implications. The news story
    below has a funny Microsoft reaction. A Microsoft spokesman said: "The
    CSIS quote sensationalizes the incident and misstates the facts in a number
    of important ways. Most important, Microsoft has repeatedly stated that
    after tracking the intruders and investigating their activities, there is
    no evidence and no basis to believe that they had any access at all to
    Windows or Office source code." Yes, we know that Microsoft has repeatedly
    stated that. We also know that Microsoft is not telling the truth about
    the incident. The report expresses concern about what may have happened
    when the Microsoft network was broken into, not what Microsoft *claims* to
    have happened.
    <http://computerworld.com/cwi/story/0,1199,NAV65-663_STO55656_NLTs,00.html>

    The NSA has finally declassified "NACSIM 5000: TEMPEST Fundamentals" and
    "NSTISS 7000: TEMPEST Countermeasures for Facilities." They're old
    documents, and redacted, but still interesting to read.
    <http://cryptome.org/nacsim-5000.htm>
    <http://cryptome.org/nstissi-7000.htm>
    <http://www.eskimo.com/~joelm/tempest.html>

    This really isn't a review of _Secrets and Lies_, but it is a good article
    that discusses some of its conclusions.
    <http://www.webreview.com/pi/2000/12_29_00.shtml>

    Excellent ActiveX security document from CERT:
    <http://www.cert.org/reports/activeX_report.pdf>

    Weird story about an abandoned NSA facility:
    <http://www.sunspot.net/content/cover/story?section=cover&pagename=story&sto
    ryid=1150520223288>

    Good article on Unicode and how it can be used to evade Intrusion Detection
    System products:
    <http://www.securityfocus.com/frames/?focus=ids&content=/focus/ids/articles/
    utf8.html>

    The FBI tries to get industry to tell it about security incidents:
    <http://washingtonpost.com/wp-dyn/articles/A25955-2001Jan5.html>

    New security threats:
    <http://cgi.zdnet.com/slink?74956:8469234>

    Read the new federal guidelines for search and seizure of computer
    equipment: the recently updated Computer Crime and Intellectual Property
    Section of the Department of Justice manual. There are lots of invasive
    searches discussed here -- car searches, work place searches, no-knock
    searches, secret searches, border searches -- all of whose guidelines do
    little to protect personal privacy. The page is 500+KB, but it's fun to
    search it for keywords like "palm," "pager," or "trip-wire."
    <http://www.cybercrime.gov/searchmanual.htm>
    <http://www.wired.com/news/politics/0,1283,41133,00.html>

    Now it seems that Egghead.com is claiming the hackers who broke in didn't
    get millions of credit card numbers like they previously thought. As I say
    in this article, that doesn't matter at this point. The damage was done
    the moment anyone thought his or her credit card number was compromised;
    the reality is much less relevant.
    <http://news.cnet.com/news/0-1007-201-4421335-0.html?tag=st.ne.1002.thed.sf>

    ** *** ***** ******* *********** *************

           Counterpane Internet Security News

    Password Safe has won best password protection freeware (admittedly, a
    pretty narrow category) from Personal Firewall Guide:
    <http://www.firewallguide.com/freeware.htm>

    ** *** ***** ******* *********** *************

                  Crypto-Gram News

    Crypto-Gram has been nominated for an "Information Security Excellence
    Award" by Information Security Magazine, in the "On-Line Security Resource"
    category. If you are a subscriber -- it's a free subscription -- you can
    vote. You will need a copy of your magazine's mailing label. Voting is
    open until 19 January.
    <http://www.cyclonecafe3.com/isawards/>

    The biometrics article from the August 98 Crypto-Gram has been republished
    on the TechTV Web site:
    <http://www.techtv.com/cybercrime/privacy/story/0,23008,3301301,00.html>

    ** *** ***** ******* *********** *************

      Solution in Search of a Problem: SafeMessage

    SafeMessage's security model is encrypted communications that is not
    e-mail. E-mail is risky, because the encrypted messages can get stored on
    servers along the way, can get backed up on disks, can leave
    footprints. The security model is someone so paranoid that even that is
    too risky. Think of it as kind of a secure instant messaging.

    There are lot of details about how the product actually works, and whether
    those are the best choices. But that's not the point here. I can't figure
    out the business model here. Surely there can't be a sustainable market of
    people this paranoid. There's barely a sustainable market of people
    willing to use encrypted e-mail.

    <http://www.safemessage.com>

    ** *** ***** ******* *********** *************

               A Social Engineering Example

    The Industry Standard published an example of social engineering in an
    article on Stake's vulnerability assessment service:

    "We pretended to be employees of the (b-to-b) company. That allowed us to
    wreak havoc, because we had 10 accounts to play with. I could order a
    piece of heavy equipment, like a backhoe, and have it financed instantly
    online and have it shipped to Chile."

    Here's the attack: Someone calls the company's Help Desk and pretends to
    be an employee. He has a known userID, and convinces the Help Desk person
    to reset his password. He then dials in (or VPNs in, or whatever) to the
    network using the reset password, and orders a tractor shipped to Chile.

    This is almost impossible to catch automatically. There's not a company
    out there that tracks which IP addresses are "valid" for their remote sales
    force; those people need to dial in from random ISPs that assign addresses
    from a pool. Even if the company recorded all successful logins and their
    originating addresses or phone numbers, it's nearly impossible to track
    what's allowed and what isn't.

    Even for the large number of telecommuters using DSL/cable modem VPNs to
    get into their corporate networks, the vast majority of companies do not
    restrict VPN connections to specific addresses. It's just too hard to manage.

    You improve things immensely -- assuming you're using a VPN -- by requiring
    client side certificates on the PC or laptop making the connection, and by
    using a one-time password system. You also improve things by convincing
    your Help Desk staff to not reset passwords based on phone calls, but
    that's hardly enforceable. The best idea I've heard is to train Help Desk
    employees not to give out reset passwords over the phone, but instead to
    leave it on their voicemail. This makes a lot of sense to me.

    The story:
    <http://www.thestandard.com/article/display/0,1151,20472,00.html?nl=nr>

    ** *** ***** ******* *********** *************

           The Doghouse: Gianus Technologies

    Gianus claims that their dual boot system is more secure than an encrypted
    file system, just because they are hiding their partition. The hype on
    their Web site is beyond decency.

    <http://www.gianus.com>

    ** *** ***** ******* *********** *************

                  NIST Crypto Update

    On January 5, 2001, NIST announced a Draft FIPS for HMAC (Keyed-Hash
    Message Authentication Code) that is a generalization of HMAC as specified
    in Internet RFC 2104 and ANSI X9.71. A 90-day public comment period ends
    April 5, 2001.
    <http://www.nist.gov/hmac>

    On January 2, 2001, NIST posted a white paper that discusses plans for
    developing standards and recommendations for public key-based key
    management. This will be a two-part process, involving the development of
    1) a scheme definition document, and 2) a key management
    guideline. <http://www.nist.gov/kms>

    NIST will release the draft FIPS for the AES for public review "in the very
    near future." Final approvals for the release of this document are
    pending. When an announcement is made, information on the draft and for
    providing public comments will be available at the AES Web site.
    <http://www.nist.gov/aes>

    ** *** ***** ******* *********** *************

            Code Signing in Microsoft Windows

    There's a report that the new version of Microsoft Windows, code named
    "Whistler," will include code signing as a security feature. The idea is
    to protect users from Internet-borne viruses and Trojan horses. It is
    unclear how much protection there really will be, and the side effects are
    significant.

    Exactly how the system works is unknown (it's an application of
    Authenticode), but the general idea is that code -- software programs,
    plug-ins, whatever -- will come with a digital signature attached. The
    operating system will check the digital signature and could allow only --
    presumably this will be optional -- signed code to execute. (Note the word
    "could"; this is an option you can turn off.)

    The Internet allows viruses to spread faster than we've ever seen before,
    and clearly something has to be done. Assuming that this is implemented
    correctly, it could help somewhat. But will this security feature be
    turned on by default, or turned off by default? This is important; most
    home users don't turn security features on. And Microsoft has a history of
    insecure default configurations.

    User interface is vital. Will unsigned code be ignored, or will the user
    get a dialog box on the order of: "This code is unsigned. Do you really
    want it to run?" Most users are incapable of making intelligent security
    decisions, and are likely to let the unsigned code run anyway. "What's the
    problem, Ron? It's just a Christmas card from Sue. It can't possibly do
    anything bad." Code signing can't protect you if you can't figure out whom
    to trust.

    The easiest way to defeat this security feature is to disable, or corrupt,
    the signature verification function on the computer. There are lots of
    ways to do this: change the public key, modify the comparison so that all
    unsigned code is trusted, etc. This is not hard to do, if you can get a
    malicious program to run on the victim's machine. But if the victim has
    the code signing feature turned on, then presumably you can't do that. So
    it works.

    At least, it works until someone figures out how to get his Trojan
    signed. This brings us to some very important questions about the
    system. What does it mean when a piece of code is signed? Is the idea
    that all signed code will be verified as not being malicious, or simply
    that signed code will be tied to the identity of the author? In the first
    case, you can be sure that anything signed is okay. In the latter case,
    all you can be sure of is that you know who to blame when things go
    wrong. Remember, digital signatures provide accountability, not protection.

    How is code signed? Do software companies get the blanket ability to sign
    code, or is each piece of code individually submitted? If it is the
    former, defeating it can be as easy as breaking into a software company's
    network and slipping the malicious code into the signing process. Not
    easy, but there are a lot of software companies out there; even if only 1%
    of them have sloppy security, that's a lot of targets.

    Who is in charge of signing code? If it is Microsoft, can they use this as
    a way of influencing software vendors? Steve Bellovin painted an
    interesting scenario: "Remember the Instant Messenger war between
    Microsoft and AOL? Now, suppose that the tables were reversed, that
    Microsoft had a service that it didn't want AOL to access. Could they
    revoke AOL's certificate? Would that be legal?" Do we really want
    Microsoft to be the final arbiter on who can and cannot be a Windows
    developer? There are other questions: Would small developers be able to
    cheaply get their code signed? What about shareware and public-domain
    programs? Sometimes it's hard to tell the difference between a hacker who
    wrote a cool utility and one who has written a new piece of malware.

    And what about script files and macros? While this feature could help
    defend against executable viruses like ILOVEYOU from spreading, it wouldn't
    stop macro viruses like Melissa. Think about it. Melissa is embedded in a
    data file, so it can't be signed like a piece of software is. The whole
    point of macros is that users can easily create them. If Microsoft adds a
    feature whereby the creator of the data file can sign it, that won't help
    either since Melissa sent copies of itself to people already in the
    computer's address book. The point is that there is a big difference
    between trusting a person and trusting a person's computer, and this
    difference can fell many a system.

    Code signing in Microsoft Windows is not new. There are two systems in
    Windows 2000. Something called a "trusted application" is signed by the
    software publisher, allowing users to verify that it has not been tampered
    with. (Anyone with a valid VeriSign signature key can sign their own
    code.) But Windows doesn't warn users if the signature does not verify;
    users have to manually check, and there's no automatic rejection of
    unsigned applications. Another security option allows users to block
    unsigned drivers from being installed in Windows. Microsoft controls the
    signing process for this system. The new security feature is an extension
    of this driver signing, so presumably Microsoft will control the signing
    process here as well.

    This is probably a good idea, although it won't do much to improve Windows
    security overall. It's just too easy to sign bad code or to subvert signed
    code. Most ActiveX exploits, for example, don't involve explicitly evil
    code; they subvert vendor-supplied pre-installed signed code. And my guess
    is that most people will either turn it off or learn to automatically click
    "run it anyway." Preventing computers from executing every piece of code
    that comes across the Internet is probably a good thing; preventing them
    from executing *any* piece of code that comes from the Internet is not.

    <http://cgi.zdnet.com/slink?66540:8469234>
    <http://www.zdnet.com/intweek/stories/news/0,4164,2657517,00.html>

    ** *** ***** ******* *********** *************

                      PGP Broken

    Well, not really. No one has broken the cryptographic algorithms that
    protect PGP traffic. No one has found a software flaw in the PGP program,
    allowing someone to read PGP-encrypted traffic. What someone did was to
    install a keyboard sniffer on a computer. That someone was then able to
    eavesdrop on every keystroke the user made: his PGP passphrase, the
    plaintext of messages he typed, everything.

    The victim is an alleged mobster, Nicodemo S. Scarfo, who was using PGP to
    encrypt his e-mail messages. The attacker is the FBI, who ran a black-bag
    operation against Scarfo and installed the keyboard sniffer. But the
    principles surrounding this case could have profound effects on all of us.

    There are lots of constitutional issues here. The FBI did obtain a
    warrant, but it is unclear if the warrant allowed this sort of
    surveillance. Scarfo's attorney certainly doesn't think so, and many civil
    rights groups agree. Lots of people are watching this case, which may
    force the courts to sort out some of these complicated issues.

    My interest is more in the technical issues. The story graphically
    illustrates an important lesson of computer and network security: it's only
    as secure as the weakest link. PGP provides just one piece of an e-mail
    security solution. It protects messages in transit from the sender to the
    receiver. It protects against eavesdropping and impersonation attacks that
    happen during transit, in the network. PGP does not protect either
    endpoint. Keyboard sniffers can capture plaintext and passphrases. Trojan
    horses and viruses can send signed PGP traffic in the computer user's
    name. A clever attacker can even find printed copies of PGP-encrypted
    e-mail in the trash. Last year I cowrote a paper that described a
    social-engineering attack that could trick someone into decrypting his own
    PGP mail for an eavesdropper.

    I worry that many cryptographers -- I have been as guilty as everyone else
    -- have lulled people into a false sense of security. We toss about
    phrases like "2048-bit RSA" and "trillions of years to break," and we
    believe them. Instead of building a defensive wall, we're planting a huge
    stake in the ground and hoping the attacker will only take the path that
    runs into the stake. We can argue about whether the stake should be a mile
    tall or a mile and a half tall, but the reality is that a smart attacker
    will simply go around the stake.

    To be sure, cryptography is a good stake. It blocks the narrow gap where
    the attacker could easily pass through, protecting against non-invasive
    attacks. Attackers can still "go around" the stake, but by doing things
    such as breaking into Scarfo's home and installing the keyboard
    sniffer. Many attackers are not motivated enough -- or even capable of
    doing so.

    There is another lesson we can learn from the story: in order to do its
    job, the police do not need any escrow techniques for cryptographic keys,
    nor laws to force people to reveal their passphrases or keys on
    demand. The lack of such things makes mass surveillance much more
    difficult, but effective law enforcement is clearly possible.

    A final comment in the Philadelphia Enquirer story is quite
    telling: "Manno [Scarfo's attorney] would not discuss what his client was
    storing on the encrypted program but said Scarfo was using software known
    as PGP. 'It stands for Pretty Good Privacy,' the lawyer said with a
    chuckle." That chuckle might raise the hackles of your average cypherpunk,
    but you have to admit he's right.

    News reports:
    <http://inq.philly.com/content/inquirer/2000/12/04/front_page/JMOB04.htm>
    <http://www.wirednews.com/news/politics/0,1283,40541,00.html>
    <http://www.theregister.co.uk/content/4/15268.html>
    <http://www.usatoday.com/life/cyber/tech/cti881.htm>
    <http://slashdot.org/yro/00/12/06/0255234.shtml>

    The FBI application to the court is at:
    <http://www.epic.org/crypto/breakin/application.pdf>

    The resulting court order is at:
    <http://www.epic.org/crypto/breakin/order.pdf>

    My PGP attack paper:
    <http://www.counterpane.com/chotext.html>

    ** *** ***** ******* *********** *************

                 Comments from Readers

    From: Nicolas.Granercri.u-psud.fr
    Subject: Voting

    Here in France (a technologically advanced country about 1/4 the population
    of the USA), we use paper ballots put into a transparent sealed box.
    Ballots are counted immediately after the vote by volunteers supervised by
    representatives of each candidate.

    This century-old system seems to be equal or superior to any mechanized
    voting system I've heard of along each of your five dimensions. In
    particular, it scales well as the number of available (human) ballot
    counters is proportional to the number of voters. The time required to get
    the first, unchecked results is practically constant for all elections:
    local, regional or national. The delay for definitive, officially
    announced results grows logarithmically with the number of voters as
    partial counts are transmitted up a hierarchical structure, with additions
    and verifications at each node.

    In a typical French presidential election, the media announce their first
    poll-based estimated results as soon as the voting booths close (they are
    not allowed to do it before). Estimates based on actual counting are
    published about two hours later, "official" preliminary results on the next
    morning, and final results after a week. I seriously doubt that any
    mechanized voting system would significantly reduce these figures. Nor
    would it offer any advantage in case of a particularly tight election
    requiring a second counting.

    Voting machines were tested, a few decades ago, in some regions of France
    with a high fraud rate. The goal was to reduce fraud, not increase
    speed. As far as I know, these machines did not show any superiority of
    any kind over paper ballots, and are no longer used anywhere in the country.

    You write: "in the rush to improve the first four attributes, accuracy has
    been sacrificed." Not only that, but it remains to be shown that any of
    the first four attributes were actually improved.

    From: Louis Bertrand <louisbertrandtech.on.ca>
    Subject: Voting

    There is no improvement in the democratic process by counting the votes
    ever faster, only playing to the media's horse race mentality. All this
    technology aims to solve a non-existent problem.

    Consider Canada's 100% manual system: pencils and hand-counted paper
    ballots. The polling stations are run by political appointees, but the
    catch is that appointees who work together must be from at least two
    different political parties. People simply put their differences aside,
    get some coffee and pizza, and count ballots all evening.

    Canada's latest national election was counted in less than twelve hours
    after the polling stations closed, as was Ontario's round of municipal
    elections a few weeks before. Recounts? No problem. The ballots are
    available but there's fewer people to count them, so it takes about a
    week. That's still better than five weeks.

    From: Daniel Balparda de Carvalho <danielatan.com.br>
    Subject: Voting

    Here in Brazil, voting is a duty. You *must* vote. Many citizens are also
    required to help in the elections. I have been for many elections called
    to help. Something like six years ago we had plain normal paper elections.
    Since then the system has been substituted by an electronic one. In our
    last elections (last October) we had an 100% electronic system. It worked
    perfectly and the results of the election were known in the same day. The
    system has been very very successful and I think we can be proud of it. If
    you don't mind me saying, the gross errors in the US elections have become
    quite a joke in Brazil.

    How does it work? The machine is a tamperproof modified PC that the police
    delivers at the voting site. It has a display, a keypad with the numbers
    and three buttons, a mini printer, a 3.5 floppy drive and a remote module.

    Before voting starts the machine prints a slip of paper showing its initial
    "internal state"; that is, the initial number of votes for all candidates.
    This is just to show that everyone has zero votes to start with. After
    this a small ballot box is attached to the machine. Every voter can see in
    the display the photograph of his candidate before confirming the vote so
    that misvotes are minimal. For every vote, the machine records the vote in
    its internal disk and drops a slip of paper into the ballot box. All the
    process of voting can be commanded by a small "remote control" that the
    machine has. Of course the controller can't see the vote, but he can see
    the status of the machine and he is the one that authorizes a valid voter
    so that he can use the machine. At the end of the election the ballot box
    is sealed, and the machine records the results on a 3.5 floppy that is also
    sealed. Then the machine prints several copies of the results for that
    machine. All of these are se
    nt to the processing facilities. If the floppy is OK then it's all that is
    needed. If the floppy fails you have the printed results, and if that also
    fails you can manually count the votes in the ballot box. It is
    interesting to note that one copy of the machine's results is placed in the
    voting place so that voters can come and see the partial result of their
    section.

    I have twice worked in an electronic election with these machines and I can
    say (as a person highly involved with security processes) that it is very
    well designed. I can't think of any obvious way to defraud the system. I
    have heard of no grave problem with this system and I am reasonably
    confident that it is a good system.

    From: philipal.net (Phil Howard)
    Subject: Voting

    One idea is to go back to the traditionally hand marked paper ballot, but
    add an on-the-spot scanner to read it. The scanner will check for
    inconsistencies like voting twice in a one-vote office. It can also report
    how many offices recorded no vote at all. A more sophisticated scanner can
    measure the level of reading for each box marked and give an assessment of
    the accuracy of that read, and reject a ballot with marginal markings. The
    voter can read the screen and confirm that their votes are read properly,
    or see what mistakes are made, much like a digital system with data at 0
    volts and 1 volt would reject levels between 0.3 volts and 0.7 volts as
    potentially ambiguous. The "error correction" would be to "resend"
    (re-mark the ballot or make a new one).

    The scanner/computer would serve ONLY to test the ballots for accuracy of
    voting, AND (when a button is pressed to indicate acceptance) record the
    vote in the first round of counting. If this component fails, voting can
    still go on, with voters (and polling place workers assisting) checking
    their own ballots, and early totals being unavailable.

    One thing we need to do in all this not only make a system WE know can be
    very accurate and incorruptible, but also make a system that actually
    appears to be accurate and probably incorruptible to the largest number of
    people.

    From: "C.P. Crossno" <ccrossnoswbell.net>
    Subject: Voting

    Use lottery terminals. In general, when you make a whole lot of things
    they tend to work well and cost less. There are probably at least 50 times
    as many lottery ticket machines as there are voting machines and they work
    very well. Using the same technology as the lottery ticket machine, most
    of the dilemmas we have faced during the past few weeks could be avoided.

    In Texas, the lottery cards have five columns and each column has 54
    numbers. A total of 270 choices are available using just these five
    columns. To eliminate the need of a hand recount, the voter must mark
    three separate numbers for each candidate. A vote will be registered if
    two out of three of the numbers are marked (maybe one out of three in Palm
    Beach County). Each ballot will permit the selection of up to 90
    candidates or issues, each with a triple redundancy.

    Another benefit would be a fixed numbered set of ballots using very large
    numbers with random gaps for identification that would detect illegally
    printed ballots.

    The lottery ticket machines (modified for voting) could even print a
    receipt showing the voter how his votes were registered.

    From: Mark Seecof, <marksjural.com>
    Subject: Digital Signatures

    Respectfully, Ben Wright is wrong in his December Crypto-Gram letter. Part
    of the E-Sign law (Section 102(a)(2)(A)(ii)) forbids states to enforce
    technical standards for electronic signatures. This may be read as
    promoting technical "competition" (e.g., states can't require electronic
    sigs to use a specific vendor's implementation of RSA) but will have the
    effect of legitimizing completely worthless (e.g., checkbox on Web form)
    so-called e-signatures.

    When you go to state court to deny some alleged signature and your experts
    testify that the technical basis of the alleged signature makes it
    impossible to authenticate, your opponent will whap you with the E-Sign law
    -- the state court is expressly forbidden to enforce any technical
    standard, so you must defend your case on other, fuzzier grounds.

    See: <http://www.ecommerce.gov/ecomnews/ElectronicSignatures_s761.pdf>

    From: "Bluefish (P.Magnusson)" <11agmx.net>
    Subject: Retaliation

    > And the question of retaliation: should you strike back
    > against hackers if the police can't do anything?
    > <http://computerworld.com/cwi/story/0,1199,NAV65-663_STO53869_NLTs,00.html>

    The story features Ira Winkler, "president of security consulting firm
    Internet Security Advisors Group in Severna Park, MD" who has a few
    interesting quotes. For example: "There's nothing wrong with doing a
    Traceroute [a tracking program] back to the IP address, so long as you
    alert the administrator...."

    Ira seems to not be aware of the fact that traceroutes are perfectly normal
    tools, used commonly to track network faults. Why on earth would anyone
    even consider telling someone they were about to use it? It would be
    incredibly stupid to even try to log usage of traceroute.

    Also: "When you detect an attack, dump all logs to read-only tape so you
    can prove that the data hasn't been tampered with."

    Where do I get this Mission Impossible stuff that I can write to, but is
    read only, and at the same time verifies that what is written hasn't been
    tampered with? Seems like Ira has gone shopping in the same store where
    Mulder bought "copy protected" floppies for an X-Files movie.

    From: "Penafiel, Cathy" <Cathy.Penafielcsoconline.com>
    Subject: Marcus Ranum's essay on the Window of Exposure

    In my experience working on a large government contract, it is very
    difficult to get patches/tools into operational computer systems. By
    operational systems, I mean a collection of computing resources, hardware
    and software, which are dedicated to perform a mission. Our systems have
    real-time, near real-time, and/or rigorous production
    schedules. Collectively, our various facilities process thousands of
    megabytes of spacecraft and science telemetry on a daily basis.

    In these environments, there is great reluctance on the part of
    administrators, developers, operations, and the government to perturb the
    operational systems. Any changes are rolled out with the greatest of
    caution, and for good reasons too. We have had instances where vendor
    patches have taken out critical mission capabilities which were not
    discovered until after the systems were delivered to operations. Although
    it was possible to recover before a spacecraft was put into safehold and
    science data lost, the resulting scramble was an unnecessarily
    gut-wrenching experience for all and resulted in a black mark for the
    contract from the customer.

    As you so often point out in your essays and commentaries, there is no such
    thing as "perfect" security, either from a technical or an organizational
    perspective. Instead, we in the security business, either as engineers,
    consultants, or network/system administrators, are left to balance the
    various risk factors imposed by operating systems, networks, tools,
    applications, users, configuration management processes, etc. Judgment,
    experience, and an ability to articulate the tradeoffs/risks to the
    responsible manager (whether that manager be a civil servant or a CEO) are
    equally important in maintaining secure systems.

    The window of exposure is a useful concept, difficult to meaningfully
    quantify. In general, organizations *should* run their operations so that
    the window of exposure is minimized, but it depends on what your
    organization's risk aversion is. Here, our customer is more averse to
    risks to operational spacecraft and science data production than to dangers
    posed by unknown marauders over the hill. In the real world of missions
    and systems, there is no silver bullet, as Mr. Ranum implies in his letter.

    ** *** ***** ******* *********** *************

    CRYPTO-GRAM is a free monthly newsletter providing summaries, analyses,
    insights, and commentaries on computer security and cryptography.

    To subscribe, visit <http://www.counterpane.com/crypto-gram.html> or send a
    blank message to crypto-gram-subscribechaparraltree.com. To unsubscribe,
    visit <http://www.counterpane.com/unsubform.html>. Back issues are
    available on <http://www.counterpane.com>.

    Please feel free to forward CRYPTO-GRAM to colleagues and friends who will
    find it valuable. Permission is granted to reprint CRYPTO-GRAM, as long as
    it is reprinted in its entirety.

    CRYPTO-GRAM is written by Bruce Schneier. Schneier is founder and CTO of
    Counterpane Internet Security Inc., the author of "Applied Cryptography,"
    and an inventor of the Blowfish, Twofish, and Yarrow algorithms. He served
    on the board of the International Association for Cryptologic Research,
    EPIC, and VTW. He is a frequent writer and lecturer on computer security
    and cryptography.

    Counterpane Internet Security, Inc. is a venture-funded company bringing
    innovative managed security solutions to the enterprise.

    <http://www.counterpane.com/>

    Copyright (c) 2001 by Counterpane Internet Security, Inc.


     
    From: R. A. Hettinga (rahshipwright.com)
    Date: Mon Jan 15 2001 - 22:03:21 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    --- begin forwarded text

    Date: Mon, 15 Jan 2001 16:48:12 -0800
    To: mac-cryptovmeng.com
    From: Vinnie Moscaritolo <vinnievmeng.com>
    Subject: Fwd: PKI-x.509-IPSec-Smartcards?
    Sender: <mac-cryptovmeng.com>

    please respond directly..

    >Date: Mon, 15 Jan 2001 20:43:36 -0400
    >From: Larry White <lwhitepelicaneng.com>
    >Subject: PKI-x.509-IPSec-Smartcards?
    >To: vinnieapple.com
    >
    >Sorry to bother you directly, but I saw your email on the announce page of
    >the mac crypto conference. Could you point me to any resources on the
    >following?
    >
    >I have a client who is going to be implementing x.509 (Entrust), VPN (IPSec)
    >and Smartcards to store the authorisation info.
    >
    >I can mostly see my through implementing this on MacOS9 (I think - hope?),
    >but I am wondering how OSX will change it.
    >
    >TIA,
    >
    >--
    >Larry White, P.Eng.
    >Pelican Engineering
    >lwhitepelicaneng.ca

    -- 
    Vinnie Moscaritolo KF6WPJ ITCB-IMSH
    http://www.vmeng.com/vinnie/
    PGP: 3F903472C3AF622D5D918D9BD8B100090B3EF042
    -------------------------------------------------------
    

    WARNING: POLITICALLY INCORRECT AREA All P.C. Personnel entering these premises will encounter gravely offensive behavior and opinions. (SEC4623. Ministry of political incorrection security act of 1995) RAMPANT INSENSITIVITY AUTHORIZED

    --- end forwarded text

    -- ----------------- R. A. Hettinga <mailto: rahibuc.com> The Internet Bearer Underwriting Corporation <http://www.ibuc.com/> 44 Farquhar Street, Boston, MA 02131 USA "... however it may deserve respect for its usefulness and antiquity, [predicting the end of the world] has not been found agreeable to experience." -- Edward Gibbon, 'Decline and Fall of the Roman Empire'


     
    From: Hayz (hayzmts.net)
    Date: Tue Jan 16 2001 - 10:48:33 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    --::Clip from Bruce Schneier's last newsletter::--

    No one has broken the cryptographic algorithms that
    protect PGP traffic. No one has found a software flaw in the PGP program,
    allowing someone to read PGP-encrypted traffic. What someone did was to
    install a keyboard sniffer on a computer. That someone was then able to
    eavesdrop on every keystroke the user made: his PGP passphrase, the
    plaintext of messages he typed, everything.

    --::End of Clip::--

    I've understood this is possible for quite a while now.. I'm sure many of us
    have...
    I'd like to share some thoughts I've been tossing around in my head for a
    long time.

    I'm a software developer. Lets say I create some code that uses API calls
    to hook into
    the keystrokes a user is typing... I log it to a file, and I've now
    completed my sniffer..
    From the other side of things, How do I know I'm not being "sniffed" ?

    This is my question: Does anyone have any ideas on getting another
    application to detect keyboard hooks? I think this would be very valuable
    to the crypto community. :-)

    Send forth your ideas and I shall implement them! :-) Bwahaha.

    Cryptik Hayz


     
    From: David Honig (honigsprynet.com)
    Date: Tue Jan 16 2001 - 10:20:45 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    At 08:48 AM 1/16/01 -0800, Hayz wrote:
    >
    >I'm a software developer. Lets say I create some code that uses API calls
    >to hook into
    >the keystrokes a user is typing... I log it to a file, and I've now
    >completed my sniffer..
    >From the other side of things, How do I know I'm not being "sniffed" ?
    >
    >This is my question: Does anyone have any ideas on getting another
    >application to detect keyboard hooks? I think this would be very valuable
    >to the crypto community. :-)

    On some OSes you should be able to enumerate these on a running system.
    Problem is, the tool you use to report them might be compromised, the
    sniffer could be elsewhere in the OS. But worth trying, especially
    if you had a copy of the tools the TLAs use.

    Other approaches include using a trusted PDA + keyboard as input devices
    and trusting the PC for only transport.


     
    From: Werner Koch (wkgnupg.org)
    Date: Tue Jan 16 2001 - 12:33:44 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    On Tue, 16 Jan 2001, Hayz wrote:

    > From the other side of things, How do I know I'm not being "sniffed" ?

    Use software you have written yourself and hardware assembled from TTL
    chips, move into a well shielded room at a lonely island without any
    cables to the outside :-)

    As a programmer it should be easy to find a bug in the keyboard but
    don't forget to replace Emacs by a screwdriver. Seriously, I think
    the most practical way to sniff on a keyboard is by putting a bug
    into it.

    Under X you get minor sniffing protection by grabbing the keyboard
    (XGrabServer).

      Werner
      

    -- 
    Werner Koch                                              <wkgnupg.org>
    GNU Privacy Guard                                (http://www.gnupg.org)
    Free Software Foundation Europe              (http://www.fsfeurope.org)
               [Please see X-* mail header for OpenPGP key info]
    


     
    From: Hayz (hayzmts.net)
    Date: Tue Jan 16 2001 - 15:56:24 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    A hardware bug?

    > As a programmer it should be easy to find a bug in the keyboard but
    > don't forget to replace Emacs by a screwdriver. Seriously, I think
    > the most practical way to sniff on a keyboard is by putting a bug
    > into it.


     
    From: staymaccessdata.com
    Date: Tue Jan 16 2001 - 14:21:46 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    How about a first faltering step: Does anyone know how to enumerate the
    system-wide hooks under Win32?

    -- 
    Mike Stay
    Programmer / Crypto guy
    AccessData Corp.
    staymaccessdata.com
    


     
    From: mean-greenhushmail.com
    Date: Tue Jan 16 2001 - 14:28:17 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Another alternative would be to CRC your disks, or important portions thereof,
     prior to each shutdown and write the result to a diskette. When the system
    is booted and before its used a write-protected diskette with aCRC checker
    is run and compared against the value stored on the first diskette.

    At Tue, 16 Jan 2001 08:20:45 -0800, David Honig <honigsprynet.com> wrote:

    >
    >At 08:48 AM 1/16/01 -0800, Hayz wrote:
    >>
    >>I'm a software developer. Lets say I create some code that uses API
    >calls
    >>to hook into
    >>the keystrokes a user is typing... I log it to a file, and I've now
    >>completed my sniffer..
    >>From the other side of things, How do I know I'm not being "sniffed"
    >?
    >>
    >>This is my question: Does anyone have any ideas on getting another
    >>application to detect keyboard hooks? I think this would be very valuable
    >>to the crypto community. :-)
    >
    >On some OSes you should be able to enumerate these on a running system.
    >Problem is, the tool you use to report them might be compromised, the
    >sniffer could be elsewhere in the OS. But worth trying, especially
    >if you had a copy of the tools the TLAs use.
    >
    >Other approaches include using a trusted PDA + keyboard as input devices
    >and trusting the PC for only transport.
    >
    Free, encrypted, secure Web-based email at www.hushmail.com

    IMPORTANT NOTICE: If you are not using HushMail, this message could have been read easily by the many people who have access to your open personal email messages.
    Get your FREE, totally secure email address at http://www.hushmail.com.


     
    From: Hayz (hayzmts.net)
    Date: Tue Jan 16 2001 - 16:42:53 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    That's not a bad idea... I would implement it, except that if anyone knows
    about the software's existence, it could be easily tampered with. The
    binary could be altered to make CRC non-matches pass the CRC test
    anyway...If the software was small enough to fit on the floppy, that might
    work well.... it would have to run after windows shut down (if you want to
    protect the registry) and before it boots up.. . which might be more of a
    pain in the ass than what it's worth. Not to mention I never turn the
    system off. ;-)

    It might work to just take a snap-shot of the vital system files before you
    leave, and check them before you start your work.. but that wouldn't really
    stop anyone from adding new software and logging your keystrokes. ;-)

    All-in-all, people don't use crypto as it is. I'm not convinced they'd go
    too far out of their way. If the FBI can change the data on some guy's
    harddrive, they can probably switch the floppies on him too.

    ----- Original Message -----
    From: <mean-greenhushmail.com>
    To: "David Honig" <honigsprynet.com>; "Hayz" <hayzmts.net>;
    <coderpunkstoad.com>
    Sent: Tuesday, January 16, 2001 12:28 PM
    Subject: Re: Keystroke Sniffer Detection.

    > Another alternative would be to CRC your disks, or important portions
    thereof,
    > prior to each shutdown and write the result to a diskette. When the
    system
    > is booted and before its used a write-protected diskette with aCRC checker
    > is run and compared against the value stored on the first diskette.
    >
    > At Tue, 16 Jan 2001 08:20:45 -0800, David Honig <honigsprynet.com> wrote:
    >
    > >
    > >At 08:48 AM 1/16/01 -0800, Hayz wrote:
    > >>
    > >>I'm a software developer. Lets say I create some code that uses API
    > >calls
    > >>to hook into
    > >>the keystrokes a user is typing... I log it to a file, and I've now
    > >>completed my sniffer..
    > >>From the other side of things, How do I know I'm not being "sniffed"
    > >?
    > >>
    > >>This is my question: Does anyone have any ideas on getting another
    > >>application to detect keyboard hooks? I think this would be very
    valuable
    > >>to the crypto community. :-)
    > >
    > >On some OSes you should be able to enumerate these on a running system.
    > >Problem is, the tool you use to report them might be compromised, the
    > >sniffer could be elsewhere in the OS. But worth trying, especially
    > >if you had a copy of the tools the TLAs use.
    > >
    > >Other approaches include using a trusted PDA + keyboard as input devices
    > >and trusting the PC for only transport.
    > >
    > Free, encrypted, secure Web-based email at www.hushmail.com


     
    From: No Spam (trialpierb.com)
    Date: Tue Jan 16 2001 - 14:52:35 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    Hayz writes:
    >This is my question: Does anyone have any ideas on getting another
    >application to detect keyboard hooks? I think this would be very valuable
    >to the crypto community. :-)

      I think more efforts have been geared towards making sniffing irrelevant
    rather than trying to defeat it. (At least for us low-budget folks who
    can't
    simply say "Here's your vetted machine, with a trusted O/S. You're not
    allowed to install any other software or connect it to anything other than
    that approved power socket, or take it out of this vault.")

    If you can require that an attack be specific to your software, you've
    won the battle against most of the script kiddies and viral type
    threats, anyway.

      Thoughts: Tie multiple I/O devices together, so sniffing only one is
    useless.

    1) When the user is entering a password, put up a scrambled list of
    characters on the screen. Ask the user to type their password, except
    using the character one to the right in the list of each actual password
    character.

    2) Interactive screen+mouse or keyboard input of 'passwords' where
    the interaction is not simply visible on the screen. Primitive example:
    "Please click the mouse when the display shows the next character
    in your password (the display will continue to cycle)"

    3) If you're not worried about the gentlemen in sunglasses in that
    van across the street, even just putting up a keyboard display on
    the monitor and asking the user to point and click through their
    password would probably be good protection against basic sniffing.

    More complicated graphical schemes might offer better protection
    if you can figure out a way to explain to your CEO that he's got
    to play a game resembling 'Mr. Potato Head' in order to log in
    to his PC...


     
    From: Hayz (hayzmts.net)
    Date: Tue Jan 16 2001 - 18:23:07 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    > 1) When the user is entering a password, put up a scrambled list of
    > characters on the screen. Ask the user to type their password, except
    > using the character one to the right in the list of each actual password
    > character.

    That's a cryptogram, I break those for fun. :-)

    > 3) If you're not worried about the gentlemen in sunglasses in that
    > van across the street, even just putting up a keyboard display on
    > the monitor and asking the user to point and click through their
    > password would probably be good protection against basic sniffing.

    ...If. :-)

    > More complicated graphical schemes might offer better protection
    > if you can figure out a way to explain to your CEO that he's got
    > to play a game resembling 'Mr. Potato Head' in order to log in
    > to his PC...

    hahahaha


     
    From: Riad S. Wahby (rswMIT.EDU)
    Date: Tue Jan 16 2001 - 17:46:05 CST

  • Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

    This went to cypherpunks a while ago. Apparently we don't need such
    an application---one already exists, and it comes right from Microsoft.

    ----- Forwarded message from John Young <jyapipeline.com> -----

    X-Authentication-Warning: ak47.algebra.com: majordom set sender to owner-cypherpunksAlgebra.COM using -f
    X-Relay-IP: 216.34.245.2
    X-Sender: jyapop.pipeline.com
    X-Mailer: QUALCOMM Windows Eudora Pro Version 4.0
    Date: Tue, 19 Dec 2000 11:13:52 -0500
    To: cypherpunkscyberpass.net
    From: John Young <jyapipeline.com>
    Old-Subject: Re: keyboard loggers.
    In-Reply-To: <3.0.5.32.20001218232322.009dbbf0idiom.com>
    X-MIME-Autoconverted: from quoted-printable to 8bit by ak47.algebra.com id eBJGIFw02028
    Subject: Re: keyboard loggers.
    Precedence: bulk
    X-Mailing-List: cypherpunks