Witness Indistinguishability for Any Single-Round Argument with Applications to Access Control

Consider an access policy for some resource which only allows access to users of the system who own a certain set of attributes. Specifically, we consider the case where such an access structure is defined by some monotone function \\(f:\\{0,1\\}^N\\rightarrow \\{0,1\\}\\), belonging to some class of function \\(F\\) (e.g. conjunctions, space bounded computation), where N is the number of possible attributes.