[cap-talk] solve CSRF by making references unforgeable, not unshareable
sam at samason.me.uk
Tue Apr 7 10:41:19 EDT 2009
On Thu, Apr 02, 2009 at 04:08:36PM +0100, Sam Mason wrote:
> On Thu, Apr 02, 2009 at 02:23:57AM +0100, David-Sarah Hopwood wrote:
> > Sam Mason wrote:
> > > surely that's why it's the "asymptotic complexity" and not
> > > worst case analysis.
> > I think you're confusing "asymptotic" with "average-case".
> Indeed I was!
No I wasn't; I was thinking of amortised time. Different again, and I'm
not sure why I couldn't remember the name the first time around.
More information about the cap-talk