Re: Don't think it'll fly
There are 2 classes of erasure codes: systematic and non-systematic.
For systematic ones (e.g. the common Cauchy-Reed-Solomon), the first n chunks are simply the original object chopped into n pieces. Only the additional ones (e.g. 8 in the example) are actually "parity" and do not consist of the raw original data. So in this case, each drive could in fact see part of the original object.
For non-systematic codes, your describition is accurate.
Of course, all of this becomes moot if the object is encrypted somewhere higher up the stack.