We highlight some uses of lattice reduction in security proofs of nonlattice-based cryptosystems. In particular, we focus on RSA-OAEP, the Rabin partial-domain hash signature scheme, techniques to compress Rabin signatures and ciphertexts, the relationship between the RSA and Paillier problems and Hensel lifting, and the hardness of the most significant bits of a Diffie–Hellman secret.
CITATION STYLE
Gentry, C. (2010). The geometry of provable security: Some proofs of security in which lattices make a surprise appearance. In Information Security and Cryptography (Vol. 10, pp. 391–426). Springer International Publishing. https://doi.org/10.1007/978-3-642-02295-1_12
Mendeley helps you to discover research relevant for your work.