Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations

@inproceedings{Herold2014PolynomialSA,
  title={Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations},
  author={Gottfried Herold and Julia Hesse and Dennis Hofheinz and Carla R{\`a}fols and Andy Rupp},
  booktitle={CRYPTO},
  year={2014}
}
At Eurocrypt 2010, Freeman presented a framework to convert cryptosystems based on compositeorder groups into ones that use prime-order groups. Such a transformation is interesting not only from a conceptual point of view, but also since for relevant parameters, operations in prime-order groups are faster than composite-order operations by an order of magnitude. Since Freeman’s work, several other works have shown improvements, but also lower bounds on the e ciency of such conversions. In this… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

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

Equivalences and Black-Box Separations of Matrix Diffie-Hellman Problems

IACR Cryptology ePrint Archive • 2017
View 3 Excerpts
Highly Influenced

FAME: Fast Attribute-based Message Encryption

ACM Conference on Computer and Communications Security • 2017
View 1 Excerpt

Similar Papers

Loading similar papers…