Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups

@inproceedings{Freeman2009ConvertingPC,
  title={Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups},
  author={David Mandell Freeman},
  booktitle={IACR Cryptology ePrint Archive},
  year={2009}
}
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we show how to use prime-order elliptic curve groups to construct bilinear groups with the same properties. In particular, we define a generalized version of the subgroup decision problem and give explicit constructions of bilinear groups in which the generalized subgroup decision assumption follows from the decision… CONTINUE READING
Highly Influential
This paper has highly influenced 25 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 254 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 155 extracted citations

254 Citations

02040'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 254 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 35 references

Subgroup membership problems and public key cryptosystems

  • K. Gjøsteen
  • Ph.D. dissertation, Norwegian University of…
  • 2004
Highly Influential
4 Excerpts

Personal communication

  • M. Scott
  • 2009
2 Excerpts

Similar Papers

Loading similar papers…