Documentation

VCVio.CryptoFoundations.HardnessAssumptions.HardHomogeneousSpace

Hard Homogeneous Spaces #

This file builds up the definition of security experiments for hard homogeneous spaces. We represent these spaces as an AddTorsor G P, i.e. a group G acting freely and transitively (equivalently bijectively) on the underlying set of points P.

If the AddTorsor is the action of exponention on a finite field these reduce to classical discrete log based assumptions.

Equations
    Instances For

      Adversary tries to determine a vector between the two points. Generalization of discrete log problem where the vector is the exponent.

      Equations
        Instances For
          Equations
            Instances For

              Adversary tries to determine a point completing a parallelogram in point space. Analogue of the Diffie-Hellman problem.

              Equations
                Instances For
                  Equations
                    Instances For

                      Adversary tries to tell if a set of points form a parallelogram in point space. Analogue of the decisional Diffie-Hellman problem.

                      Equations
                        Instances For