Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Computation Hardness Assumptions? #97

Open
samkumar opened this issue Oct 6, 2018 · 0 comments
Open

Computation Hardness Assumptions? #97

samkumar opened this issue Oct 6, 2018 · 0 comments

Comments

@samkumar
Copy link

samkumar commented Oct 6, 2018

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.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@samkumar