A Robust Identification Scheme Which Reduces the Trustworthiness of Center
Choon‐Sik Park · Journal of Electrical Engineering and Information Science · 1996
The Fiat-Shamir and Fiat-Shamir-like identification schemes assume the existence of trusted center which can access to a great deal of secret information and can conspire with the special users who want to know another user's secret information. in this paper, we propose a robust identification scheme without a highly reliable trusted center. The proposed scheme reduces the trustworthiness of the trusted center while preserving the efficiency of the scheme. This scheme is based on the difficulty of extracting the L-th roots mod N and the discrete logarithm problem in a subgroup of Z_R. The user's secret information need not to be exposed even to the trusted center. Therefore the scheme does not need the highly reliable trusted center and easily updates user's secret keys.