Server-aided RSA key generation against collusion attack

Authors:
Yun Chen;Reihaneh Safavi-Naini;Joonsang Baek;Xin Chen
Affiliations:
Chengdu University of Information Technology, PR China;University of Wollongong, Australia;University of Wollongong, Australia;Zhenzhou University of Light Industry, PR China
Venue:
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
Year:
2005

Citing 3
Cited 2

A course in computational algebraic number theory

A course in computational algebraic number theory
Efficient generation of shared RSA keys

Journal of the ACM (JACM)
Public-key cryptosystems based on cubic finite field extensions

IEEE Transactions on Information Theory

Security analysis of a server-aided RSA key generation protocol

ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
Cryptanalysis of server-aided RSA key generation protocols at MADNES 2005

ATC'07 Proceedings of the 4th international conference on Autonomic and Trusted Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to generate RSA keys on low-power hand-held devices, server-aided RSA key generation protocols [2] were proposed. One drawback of these protocols, however, is that they cannot prevent a “collusion attack” in which two key generation servers communicate with each other to get useful information about the user's private key. In this paper, we present two new server-aided RSA key generation protocols secure against such an attack. In addition to this, we adopt a fast primality test in our protocols, which is locally run on a hand-held device. In the concluding section a weakness of the proposed protocol is discussed.