Abstract
The paper proposes a dynamic (k,n) threshold key escrow scheme. Based on the difficulty of discrete logarithm problem. This scheme is charge of such characters: (1) every escrow agent's secret can be remained unchanged when the system's secret is renewed. (2) it can add or drop a escrow agent without changing other members' secret key. (3) this is a robust threshold key escrow scheme. It discusses the security, dynamic and robustness of this scheme at the end of this paper.
| Original language | English |
|---|---|
| Pages (from-to) | 154-155 |
| Number of pages | 2 |
| Journal | Jisuanji Gongcheng/Computer Engineering |
| Volume | 31 |
| Issue number | 12 |
| State | Published - 20 Jun 2005 |
| Externally published | Yes |
Keywords
- Discrete logarithm problem
- Dynamic
- Key escrow
- Robustness
- Threshold cryptography