In cryptography, a distribution ensemble or probability ensemble is a family of distributions or random variables <math>X = \{X_i\}_{i \in I}</math> where <math>I</math> is a (countable) index set, and each <math>X_i</math> is a random variable, or probability distribution. Often <math>I=\N</math> and it is required that each <math>X_n</math> have a certain property for n sufficiently large.

For example, a uniform ensemble <math>U = \{U_n\}_{n \in \mathbb{N</math> is a distribution ensemble where each <math>U_n</math> is uniformly distributed over strings of length&nbsp;n. In fact, many applications of probability ensembles implicitly assume that the probability spaces for the random variables all coincide in this way, so every probability ensemble is also a stochastic process.

See also

  • Provable security
  • Statistically close
  • Pseudorandom ensemble
  • Computational indistinguishability

References

  • Goldreich, Oded (2001). Foundations of Cryptography: Volume 1, Basic Tools. Cambridge University Press. . Fragments available at the author's web site.