Abstract
In the generalized group-oriented cryptosystem, the sender can send a conditional message to a group of users such that only the specified sets of users in this group can cooperate to decrypt this message. In this paper, we will use an ElGamal cryptosystem and an elliptic curve ElGamal cryptosystem to achieve the purposes of generalization and group-orientation, respectively. Both of our schemes are more efficient than Tsai et al.'s scheme in terms of sender's computational complexity.
Original language | English |
---|---|
Pages (from-to) | 111-120 |
Number of pages | 10 |
Journal | Informatica |
Volume | 14 |
Issue number | 1 |
Publication status | Published - 2003 Jan 1 |
All Science Journal Classification (ASJC) codes
- Information Systems
- Applied Mathematics