earticle

논문검색

An efficient ID-based Beta Cryptosystem

초록

영어

In 1984, Shamir [1] introduced the concept of an identity-based cryptosystem. In this system, each user needs to visit a public key generation (PKG) and identify himself before joining a communication network. Once a user is accepted, the PKG will provide him with a secret key. In this way, if a user wants to communicate with others, he only needs to know the “identity” of his communication partner and the public key of the PKG. There is no public file required in this system. However, Shamir did not succeed in constructing an identity based cryptosystem, but only in constructing an identity-based signature scheme. Meshram and Meshram [5] have proposed an identity-based beta cryptosystem, security under the generalized discrete logarithm problem with distinct discrete exponents in the multiplicative group of finite fields and integer factorization problem. In this paper, we propose some modification in identity-based beta cryptosystem based on generalized discrete logarithm problem with distinct discrete exponents in the multiplicative group of finite fields and integer factorization problem and we consider the security against a conspiracy of some entities in the proposed system and show the possibility of establishing a more secure system.

목차

Abstract
 1. Introduction
 2. Modified Identity-based Cryptosystem
  2.1. Preparation for the Center and Each Entity
 3. Protocol of the Proposed Cryptosystem
 4. Security Analysis and Discussions
  4.1. Conspiracy of Some Users
  4.2 Each Users Secret Key:
 5. Enhancement of Security and Processing Cost
 6. Identity-based Key Distribution System
  6.1. Protocol for Key Distribution
 7. Conclusion
 References

저자정보

  • Chandrashekhar Meshram Department of Mathematics RTM Nagpur University, Nagpur, India

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.