  A distributed storage system (DSS) needs to be efficiently accessible and
repairable. Recently, considerable effort has been made towards the latter,
while the former is usually not considered, since a trivial solution exists in
the form of systematic encoding. However, this is not a viable option when
considering storage that has to be secure against eavesdroppers. This work
investigates the problem of efficient access to data stored on an DSS under
such security constraints. Further, we establish methods to balance the access
load, i.e., ensure that each node is accessed equally often. We establish the
capacity for the alphabet independent case and give an explicit code
construction. For the alphabet-dependent case we give existence results based
on a random coding argument.
