On the Lossiness of the Rabin Trapdoor Function [chapter]

Yannick Seurin
2014 Lecture Notes in Computer Science  
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. Kiltz, O'Neill, and Smith (CRYPTO 2010) showed that the RSA trapdoor function is lossy under the Φ-Hiding assumption of Cachin, Micali, and Stadler (EUROCRYPT '99) and used this
more » ... sult to provide a security proof for the RSA-OAEP encryption scheme in the standard model. More recently, Kakvi and Kiltz (EUROCRYPT 2012) used the lossiness of RSA to show that the RSA Full Domain Hash signature scheme has a tight security reduction from the Φ-Hiding assumption. In this work, we consider the Rabin trapdoor function, i.e. modular squaring over Z * N . We show that when adequately restricting its domain (either to the set QR N of quadratic residues, or to (JN ) + , 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 ≡ 3 mod 4, and the lossy mode corresponding to what we call pseudo-Blum integers N = pq with p, q ≡ 1 mod 4. This lossiness result holds under a natural extension of the Φ-Hiding assumption to the case e = 2 that we call the 2-Φ/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-Φ/4-Hiding assumption, therefore answering one of the main questions left open by Bernstein (EUROCRYPT 2008) in his work on Rabin-Williams signatures.
doi:10.1007/978-3-642-54631-0_22 fatcat:xy3p6ofeorbldo6z2dlup42lgq