Showing papers on "PKCS #1 published in 1985"
•
18 Aug 1985
TL;DR: If a ping-pong protocol is secure in general then its implementation using an “ideal RSA” is also secure, and it is shown that the obvious RSA properties, such as “multiplicativity”, do not endanger the security of ping- pong protocols.
Abstract: The Security of the RSA implementation of ping-pong protocols is considered. It is shown that the obvious RSA properties, such as "multiplicativity", do not endanger the security of ping-pong protocols. Namely, if a ping-pong protocol is secure in general then its implementation using an "ideal RSA" is also secure.
21 citations
••
10 citations