"forward-secure" zero knowledge protocols Has anything been done on the modification of the zero knowledge condition

where the distinguisher has access to the witness used by the prover and

the random bits used by the algorithm that generated the auxiliary input?

(Or is that, in fact, how the zero knowledge condition is usually defined?)

This seems like it would be important for using ZK protocols as pieces of larger protocols, 

since whether or not an adversary succeeds could depend on that information.
Regarding the prover's witness, the standard zero-knowledge (ZK) definitions already imply that ZK holds even if the distinguisher is given this witness.

I'm not sure what you mean by "the random bits used by the algorithm that generated the auxiliary input". Please clarify.