Re: [TLS] About encrypting SNI

On Thu, Apr 17, 2014 at 12:59 PM, Brian Sniffen <bsniffen@akamai.com> wrote:
>
> I hesitate to ask, but: is it plausible to re-open the proof-of-work
> conversation, so a server under load can, in the initial opportunistic
> encryption phase, push back to a client and ask for a puzzle to be
> solved?

I don't think it's implausible (though I'm not completely sold yet).

One concern I would have is whether we understand the problem well
enough to actually specify this. I'm not an expert in this area, but weren't
there a bunch of concerns about designing puzzles that were effective
without being prohibitively expensive for mobile devices? How would
we design a new kind of puzzle (As opposed to messing with the puzzle
work factor) and then roll it out?

-Ekr

 > I wonder if there's a way to test a large number of private keys at
> > once.  If so, then the cost drops to O(log N).  Off the top of my
> > head, I can't think of a cryptosystem with that property.
>
> I certainly don't expect to find any *pair* of cryptosystems with that
> property, and continue to maintain that in 3 years we won't find two big
> organizations willing to use exactly the same crypto.
>
> -Brian
>
> --
> Brian Sniffen
> Information Security
> Akamai Technologies
>
> _______________________________________________
> TLS mailing list
> TLS@ietf.org
> https://www.ietf.org/mailman/listinfo/tls
>