Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption

@article{Rosen2008EfficientLT,
  title={Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption},
  author={Alon Rosen and Gil Segev},
  journal={IACR Cryptology ePrint Archive},
  year={2008},
  volume={2008},
  pages={134}
}
Lossy trapdoor functions (Peikert and Waters, STOC ’08) are an intriguing and powerful cryptographic primitive. Their main applications are simple and black-box constructions of chosen-ciphertext secure encryption, as well as collision-resistant hash functions and oblivious transfer. An appealing property of lossy trapdoor functions is the ability to realize them from a variety of number-theoretic assumptions, such as the hardness of the decisional Diffie-Hellman problem, and the worst-case… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS

Similar Papers

Loading similar papers…