On hiding information form an oracle
Journal of Computer and System Sciences
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM - Special 25th Anniversary Issue
Accelerating Key Establishment Protocols for Mobile Communication
ACISP '99 Proceedings of the 4th Australasian Conference on Information Security and Privacy
Security and Performance of Server-Aided RSA Computation Protocols
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Fast Server-Aided RSA Signatures Secure Against Active Attacks
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
The Béguin-Quisquater Server-Aided RSA Protocol from Crypto '95 is not Secure
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
On the Insecurity of a Server-Aided RSA Protocol
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Secure Server-Aided Signature Generation
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Fully homomorphic encryption using ideal lattices
Proceedings of the forty-first annual ACM symposium on Theory of computing
Securely outsourcing linear algebra computations
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Provably secure server-aided verification signatures
Computers & Mathematics with Applications
Server-Aided verification: theory and practice
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Security analysis of a server-aided RSA key generation protocol
ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
Secure outsourcing of sequence comparisons
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
A new key exchange protocol based on MQV assuming public computations
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Cryptanalysis of server-aided RSA key generation protocols at MADNES 2005
ATC'07 Proceedings of the 4th international conference on Autonomic and Trusted Computing
New methods of secure outsourcing of scientific computations
The Journal of Supercomputing
| Hi-index | 0.00 |
On Crypto '88, Matsumoto, Kato, and Imai presented protocols to speed up secret computations with insecure auxiliary devices. The two most important protocols enable a smart card to compute the secret RSA operation faster with the help of a server that is not necessarily trusted by the card holder. It was stated that if RSA is secure, the protocols could only be broken by exhaustive scarch in certain spacts. Our main attacks show that much smaller search spaces suffice. These attacks are passive and therefore undetectable. It was already known that one of the protocols is vulnerable to active attacks. We show that this holds for the other protocol, too. More importantly, we show that our attack may still work if the smart card checks the correctness of the result; this was previously believed to be can easy measure excluding all active attacks. Finally, we discuss attach on related protocols.