A Realization Scheme for the Identity-Based Cryptosystem
At the Crypto’84, Shamir has presented a new concept of the identity-based cryptosystem, but no idea is presented on the realization scheme. In this paper a new realization scheme of the modified identity-based cryptosystem has been proposed. The basic idea of the scheme is based on the discrete logarithm problem and the difficulty of factoring a large integer composed of two large primes. The scheme seems to be very secure if all members of the system keep their secret keys safe, but if a constant number of users conspire, the center secret will be disclosed, Then it has a close relation to the well-known “threshold scheme”. To cope with the conspiracy, the basic system is extended to get a new scheme of which “threshold” becomes higher. Detail considerations on the scheme are also given.
- A. Shamir, “Identity-based cryptosystems and signature schemes,” Proceedings of CRYPTO’ 84, Lecture Notes in Computer Science 196, Springer Verlarg, 1985.Google Scholar
- A. Shamir, “How to share a secret,” Comm. ACM, vol.22, No.11, Nov. 1979.Google Scholar
- R.J. McEliece and D.V. Sarwate, “On sharing secrets and Reed-Solomon codes,” Comm. ACM, vol.24, No.9, Sept. 1981.Google Scholar
- Data Encryption Standard. Federal Information Processing Standards (IFIPS) Publication No. 46, National Bureau of Standards, January 1977.Google Scholar
- S. Miyaguchi, “Criteria for the strength of encipherment and standardization for cryptographic techniques,” Proceedings of the 1986 Symposium on Cryptography and Information Security, Feb. 1986.Google Scholar