In this paper, we formulate the concept of policy-based cryptography which makes it possible to perform policy enforcement in large-scale open environments like the Internet, with respect to the data minimization principle according to which only strictly necessary information should be collected for a given purpose. We use existing cryptographic primitives based on bilinear pairings over elliptic curves to develop concrete policy-based encryption and signature schemes which allow performing relatively efficient encryption and signature operations with respect to policies formalized as monotonic logical formulae. we illustrate the properties of our policy-based cryptographic schemes through the description of three application scenarios.