Skip to content

Computation Hardness Assumptions? #97

Description

@samkumar

I am thinking about using this implementation to implement an encryption scheme. Is the Bilinear Diffie-Hellman assumption believed to hold for this pairing? What about stronger assumptions (e.g., Strong Diffie-Hellman, Bilinear Diffie-Hellman Exponent, etc.)?

If you additionally know any papers/other sources discussing this, that would be very useful.

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions