The widely used algorithmic problems, the quadratic residue
problem and the decision Diffie-Hellman problem, are
characterized as the subgroup membership problem.
Several cryptographic schemes are realized assuming the
hardness of the subgroup membership problem.
We apply the subgroup membership problem to several
information security schemes: a probabilistic encryption,
a bit commitment and a private information retrieval.