Paper 2013/256
On the Lossiness of the Rabin Trapdoor Function
Yannick Seurin
Abstract
Lossy trapdoor functions, introduced by Peikert and Waters (STOC~'08), are functions that can be generated in two indistinguishable ways: either the function is injective, and there is a trapdoor to invert it, or the function is lossy, meaning that the size of its range is strictly smaller than the size of its domain. Kakvi and Kiltz (EUROCRYPT 2012) proved that the Full Domain Hash signature scheme based on a lossy trapdoor function has a \emph{tight} security reduction from the lossiness of the trapdoor function. Since Kiltz, O'Neill, and Smith (CRYPTO 2010) showed that the RSA trapdoor function is lossy under the
Note: An abridged version of this paper appears in the proceedings of PKC 2014. This is the full version.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- A major revision of an IACR publication in PKC 2014
- DOI
- 10.1007/978-3-642-54631-0_22
- Keywords
- Rabin trapdoor functionlossy trapdoor functionPhi-Hiding assumptionprovable securityRabin-Williams signaturesmeta-reduction
- Contact author(s)
- yannick seurin @ m4x org
- History
- 2014-04-15: last of 2 revisions
- 2013-05-08: received
- See all versions
- Short URL
- https://ia.cr/2013/256
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2013/256, author = {Yannick Seurin}, title = {On the Lossiness of the Rabin Trapdoor Function}, howpublished = {Cryptology {ePrint} Archive, Paper 2013/256}, year = {2013}, doi = {10.1007/978-3-642-54631-0_22}, url = {https://eprint.iacr.org/2013/256} }