Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Akavia, A., Goldwasser, S., Safra, S.: Proving hard-core predicates using list decoding. In: 44th Annual Symposium on Foundations of Computer Science, pp. 146 –159. IEEE Computer Society Press (October 2003)
2. Alexi, W., Chor, B., Goldreich, O., Schnorr, C.: RSA and Rabin functions: Certain parts are as hard as the whole. SIAM Journal on Computing 17(2), 194–209 (1988)
3. Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Ashby, V. (ed.) ACM CCS 1993: 1st Conference on Computer and Communications Security, pp. 62–73. ACM Press (November 1993)
4. Lecture Notes in Computer Science;D. Bleichenbacher,1998
5. Lecture Notes in Computer Science;M. Blum,1985
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Toward RSA-OAEP Without Random Oracles;Lecture Notes in Computer Science;2020
2. On the Security of RSA-PSS in the Wild;Proceedings of the 5th ACM Workshop on Security Standardisation Research Workshop - SSR'19;2019
3. On the Security of the PKCS#1 v1.5 Signature Scheme;Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security;2018-01-15
4. Instantiability of RSA-OAEP Under Chosen-Plaintext Attack;Journal of Cryptology;2016-09-19