Abstract

Lossy trapdoor functions, introduced by Peikert and Waters STOCi¾?'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 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 $\varPhi$-Hiding assumption of Cachin, Micali, and Stadler EUROCRYPTi¾?'99, this implies that the RSA Full Domain Hash signature scheme has a tight security reduction from the i¾?-Hiding assumption for public exponents e<N1/4. In this work, we consider the Rabin trapdoor function, i.e. modular squaring over i¾?*N. We show that when adequately restricting its domain either to the set ${\mathbb{QR}}_N$ of quadratic residues, or to ${\mathbb J}_N^+$, the set of positive integers 1≤x≤N-1/2 with Jacobi symbol +1 the Rabin trapdoor function is lossy, the injective mode corresponding to Blum integers N=pq with $p,q\equiv 3\bmod 4$, and the lossy mode corresponding to what we call pseudo-Blum integers N=pq with $p,q\equiv 1 \bmod 4$. This lossiness result holds under a natural extension of the i¾?-Hiding assumption to the case e=2 that we call the 2-$\varPhi/4$-Hiding assumption. We then use this result to prove that deterministic variants of Rabin-Williams Full Domain Hash signatures have a tight reduction from the 2-$\varPhi$/4-Hiding assumption. We also show that these schemes are unlikely to have a tight reduction from the factorization problem by extending a previous meta-reduction result by Coron EUROCRYPT 2002, later corrected by Kakvi and Kiltz EUROCRYPT 2012. These two results therefore answer one of the main questions left open by Bernstein EUROCRYPT 2008 in his work on Rabin-Williams signatures.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.