Advertisement

Provably Secure Key-Updating Schemes in Identity-Based Systems

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 473)

Abstract

In this paper, we present Key-Updating Schemes in identity-based (identification or signature) systems, and consider the security of the schemes. We propose two kinds of key-updating schemes, i.e., one is sequential type and the other is parallel type, and show that both schemes are equivalent to each other in a polynomial time sense, i.e., there exists a deterministic polynomial time algorithm that transforms the sequential key-updating scheme to the parallel one, and vice versa. We also show that even if any polynomially many entities conspire to find a secret-key of any other entities, both key-updating schemes are provably secure against polynomially many times key-updating if decrypting RSA is hard.

Keywords

Polynomial Time Fixed Polynomial Polynomial Time Algorithm Secret Information Probabilistic Polynomial Time Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [AH]
    Adleman, L.M. and Huang, M.D.A., “Recognizing Primes in Random Polynomial Time,” Proc. of 19th Annual ACM Symposium on Theory of Computing, pp.462–469 (May, 1987).Google Scholar
  2. [AL]
    Angluin, D. and Lichtenstein, D., “Provable Security of Cryptosystems: a Survey,” Technical Report TR-288, Yale University (October, 1983).Google Scholar
  3. [FFS]
    Feige, U., Fiat, A., and Shamir, A., “Zero Knowledge Proofs of Identity,” Journal of Cryptology, Vol.1, No.1, pp.74–94 (1988).MathSciNetGoogle Scholar
  4. [FS]
    Fiat, A. and Shamir, A., “How to Prove Yourself: Practical Solutions to Identification and Signature Problems,” in Advances in Cryptology — Crypto’86, Lecture Notes in Computer Science 263, Springer-Verlag, Berlin, pp.186–194 (1987).Google Scholar
  5. [FT]
    Fujioka, A. and Tsujii, S., “An ID-Based Identification System with Simple Key-Updating,” Technical Report of IEICE, ISEC89-25 (November, 1989).Google Scholar
  6. [GQ]
    Guillou, L.C. and Quisquater, J.J., “A Practical Zero-Knowledge Protocol Fitted to Security Microprocessors Minimizing both Transmission and Memory,” in Advances in Cryptology — Eurocrypt’88, Lecture Notes in Computer Science 330, Springer-Verlag, Berlin, pp.123–128 (1988).Google Scholar
  7. [HW]
    Hardy, G.H. and Wright, E.M., An Introduction to the Theory of Numbers, Oxford University Press, 5th Edition (1979).Google Scholar
  8. [IST]
    Itoh, T., Shinozaki, S., and Tsujii, S., “Secure Key-Updating Schemes in Identification Protocols,” manuscript (March, 1990).Google Scholar
  9. [Kr]
    Kranakis, E., Primality and Cryptography, Wiley-Teubner Series in Computer Science, John Wiley & Sons, Chishester (1986).zbMATHGoogle Scholar
  10. [OO]
    Ohta, K. and Okamoto, T., “A Modification of the Fiat-Shamir Scheme,” in Advances in Cryptology — Crypto’88, Lecture Notes in Computer Science 403, Springer-Verlag, Berlin, pp.232–243 (1989).Google Scholar
  11. [Ra]
    Rabin, M.O., “Probabilistic Algorithm for Primality Testing,” Journal of Number Theory, Vol.12, pp.128–138 (1980).MathSciNetzbMATHCrossRefGoogle Scholar
  12. [RSA]
    Rivest, R.L., Shamir, A., and Adleman, L.M., “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Communication of the ACM, Vol.21, No.2, pp.120–126 (February, 1978).MathSciNetzbMATHCrossRefGoogle Scholar
  13. [SI]
    Shizuya, H. and Itoh, T., “A Group-Theoretic Interface to Random Self-Reducibility,” to appear in The Transactions of the IEICE, Vol.E 73, No.7 (July, 1990).Google Scholar
  14. [SS]
    Solovay, R. and Strassen, V., “A Fast Monte Calro Test for Primality,” SIAM Journal on Computing, Vol.6, No.1, pp.84–85 (March, 1977).MathSciNetzbMATHCrossRefGoogle Scholar
  15. [TW]
    Tompa, M. and Woll, H., “Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information,” Proc. of 28th Annual IEEE Symposium on Foundations of Computer Science, pp.472–482 (October, 1987).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  1. 1.Department of Electrical and Electronic Engineering, Faculty of EngineeringTokyo Institute of TechnologyTokyoJapan
  2. 2.Department of Information Processing, The Graduate School at NagatsutaTokyo Institute of TechnologyYokohamaJapan

Personalised recommendations