Optimal Asymmetric Encryption-How to Encrypt with RSA
Citations
3,562 citations
2,190 citations
1,962 citations
1,089 citations
1,057 citations
References
14,659 citations
5,313 citations
"Optimal Asymmetric Encryption-How t..." refers background or methods in this paper
...(For example, they can be derived from the compression function of the Secure Hash Algorithm [18] following the methods described in [2])....
[...]
...An e cient scheme proven in [2] to achieve both non-malleability and chosen-ciphertext security under the ideal-hash model is...
[...]
...In this regard we are following the paradigm of [2] who argue that even though results which assume an ideal hash function do not provide provable security with respect to the standard model of computation, assuming an ideal hash function and doing proofs with respect to it provides much greater assurance bene t than purely ad....
[...]
...Our choice to only use half the bits of SHA has to do with a general \de ciency" in the use of SHA-like hash functions to instantiate random oracles; see [2] for a discussion....
[...]
...In [2] we suggested the scheme E BR(x) = f(r) k G(r) x :...
[...]
3,514 citations
"Optimal Asymmetric Encryption-How t..." refers background in this paper
...(Other hash algorithms such as MD5 [23] would do as well)....
[...]
3,150 citations