[<prev] [next>] [<thread-prev] [day] [month] [year] [list]
Message-ID: <20190402203817.GO23599@brightrain.aerifal.cx>
Date: Tue, 2 Apr 2019 16:38:17 -0400
From: Rich Felker <dalias@...c.org>
To: musl@...ts.openwall.com
Subject: Re: Changes for upstream?
On Tue, Apr 02, 2019 at 08:24:15PM +0000, Jewell Seay wrote:
> > > - Randomizing library locations in memory (while keeping the ordering
> > > of module _init and _fini calls stable).
> >
> > I'm confused why this would be in musl and not just by the kernel's normal
> > ASLR. On 32-bit you really can't randomize positions because the address
> > space is just too small, but on 64-bit, doing strong mmap ASLR in the kernel
> > would get you this for free. Do you have a different/better method in mind
> > that could be achieved in the dynamic linker but not in the kernel?
> >
>
> We have already modified the kernel under ARM to have a wider ASLR
> range, however this does not improve the Linux design where
> libraries are loaded in-order in memory by the dynamic loader. A
As I understand it, some of the hardened kernel mods randomize the
relative location of all mmaps, not just the initial mmap base. This
seems like a better approach than doing it specifically in the dynamic
linker, since malloc and other users of mmap would also benefit from
the additional randomness. But as noted, you need a huge address space
for that to work well.
> single address leak of a library location allows easy address
> calculation to any other library for rop gadgets. Although the
> 32-bit address space is small, shuffling the order the libraries are
> located in memory results in more complex leaks being required to
> obtain needed library addresses for exploitation.
>
> It is more specific to our system as any normal system can just load
> a library to a random location while we are attempting to minimize
> cache hits so there is a desire on our side to group them together
> just in different orders.
If you really want to shuffle just libraries, and not mmap in general,
I think it should be done by either wrapping mmap where ldso calls it
from map_library, or shuffling a whole batch of newly-loaded libraries
with mremap after success of the load has been committed. Compared to
randomizing order, both of the above two approaches avoid adding
complexity to existing program logic and avoid introduction of other
possibly-observable side effects (you mentioned ctor order, but there
could be symbol priority order, etc. too).
> > > - Return memory to the kernel within free().
> >
> > This is already done via MADV_DONTNEED. Using MADV_FREE has been
> > suggested recently and would probably be a good idea; it looks like it could
> > be swapped in without any complex work. There are also a few past threads
> > where I discussed a desire to return not just the dirty page pressure, but the
> > commit charge, to the kernel when there are huge free chunks. There are
> > tradeoffs involved, and with the current allocator slated to be replaced, I
> > didn't really want to spend a lot of effort considering how they'd fit in with it.
> >
>
> What allocator do you plan to go to or are there plans to have one
> created from scratch?
The plan is something new from scratch. Almost everything out there
now trades massive amounts of fragmentation and overall memory usage,
and negative imppact on hardening, for dubious performance gains. I've
recently had some new ideas about solving some of the problems I
didn't know how to solve before, so I'm planning to start a new thread
on this topic soon, probably shortly after 1.1.22 release.
> > > The other question we have is that it does not appear that there is
> > > any standard way in musl to have certain functionality turned on or
> > > off. If any of these changes are desired to be optional then is there
> > > an accepted method for enabling or disabling the feature?
> >
> > It's intentional that we don't have functionality switches, but of course due
> > to CFLAGS various degrees of hardeing are already possible (stack protector,
> > stack clash check, etc., even UBSan) so it's conceivable that we could add
> > things that require conditionals at the source level. Any such things should
> > not affect the exposed interfaces or the observable behavior of programs
> > with well-defined behavior. But ideally good hardening measures are
> > sufficiently inexpensive that making them optional is not needed. The main
> > cost, which should always be minimized, is the source-level complexity, and
> > that's same or worse when they're optional.
>
> If I am understanding correctly, any useful hardening measures
> should just expect to be on and not an optional compilation flag.
I don't think that needs to be an absolute hard rule, but it's a good
goal to have in mind. Making something switchable should be a last
resort, not the default course of action.
Rich
Powered by blists - more mailing lists
Confused about mailing lists and their use?
Read about mailing lists on Wikipedia
and check out these
guidelines on proper formatting of your messages.
