Security and performance of server-aided RSA computation protocols
From MaRDI portal
Recommendations
- An active attack on protocols for server-aided RSA signature computation
- On the security of server-aided RSA protocols
- scientific article; zbMATH DE number 2081056
- Some active attacks on fast server-aided secret computation protocols for modular exponentiation
- Fast server-aided RSA signatures secure against active attacks
Cited in
(15)- Cryptanalytic results on `Dual CRT' and `Common Prime' RSA
- Speeding up exponentiation using an untrusted computational resource
- An active attack on protocols for server-aided RSA signature computation
- Secure and efficient two-factor authentication protocol using RSA signature for multi-server environments
- On the security of server-aided RSA protocols
- The Béguin-Quisquater server-aided RSA protocol from Crypto '95 is not secure
- On verifiable implicit asking protocols for RSA computation
- Fast server-aided RSA signatures secure against active attacks
- scientific article; zbMATH DE number 1950629 (Why is no real title available?)
- A new construction of the server-aided verification signature scheme
- scientific article; zbMATH DE number 2081056 (Why is no real title available?)
- scientific article; zbMATH DE number 2158222 (Why is no real title available?)
- Some active attacks on fast server-aided secret computation protocols for modular exponentiation
- Server-Aided Verification Signatures: Definitions and New Constructions
- Provably secure server-aided verification signatures
This page was built for publication: Security and performance of server-aided RSA computation protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4343424)
