linux-kernel - Re: [PATCH] Make /proc/slabinfo 0400

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite for Android: free password hash cracker in your pocket

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Message-ID: <1299271377.2071.1406.camel@dan>
Date:	Fri, 04 Mar 2011 15:42:57 -0500
From:	Dan Rosenberg <drosenberg@...curity.com>
To:	Matt Mackall <mpm@...enic.com>
Cc:	Pekka Enberg <penberg@...nel.org>,
	Linus Torvalds <torvalds@...ux-foundation.org>,
	Dave Hansen <dave@...ux.vnet.ibm.com>,
	Theodore Tso <tytso@....edu>, cl@...ux-foundation.org,
	linux-mm@...ck.org, linux-kernel@...r.kernel.org,
	Ingo Molnar <mingo@...e.hu>,
	Andrew Morton <akpm@...ux-foundation.org>
Subject: Re: [PATCH] Make /proc/slabinfo 0400

On Fri, 2011-03-04 at 14:31 -0600, Matt Mackall wrote:
> On Fri, 2011-03-04 at 22:02 +0200, Pekka Enberg wrote:
> > On Fri, Mar 4, 2011 at 8:14 PM, Matt Mackall <mpm@...enic.com> wrote:
> > >> Of course, as you say, '/proc/meminfo' still does give you the trigger
> > >> for "oh, now somebody actually allocated a new page". That's totally
> > >> independent of slabinfo, though (and knowing the number of active
> > >> slabs would neither help nor hurt somebody who uses meminfo - you
> > >> might as well allocate new sockets in a loop, and use _only_ meminfo
> > >> to see when that allocated a new page).
> > >
> > > I think lying to the user is much worse than changing the permissions.
> > > The cost of the resulting confusion is WAY higher.
> > 
> > Yeah, maybe. I've attached a proof of concept patch that attempts to
> > randomize object layout in individual slabs. I'm don't completely
> > understand the attack vector so I don't make any claims if the patch
> > helps or not.
> 
> In general, the attack relies on getting an object A (vulnerable to
> overrun) immediately beneath an object B (that can be exploited when
> overrun).
> 
> I'm not sure how much randomization helps, though. Allocate 1000 objects
> of type B, deallocate the 800th, then allocate an object of type A. It's
> almost certainly next to a B.
> 

On second thought, this does pose a problem.  Even if you don't know how
full the most recent slab is or where free vs. used chunks are within
it, if you can guarantee that you filled an entire previous slab with
your objects and then free and reallocate one of them, then you can
still win.

-Dan

> -- 
> Mathematics is the supreme nostalgia of our time.


--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/