Identity-based encryption: Difference between revisions

Revision as of 19:44, 5 December 2005

Revision as of 00:04, 30 March 2006

Line 9:

Another approach to identity-based encryption was proposed by [[Clifford Cocks]] in [[2001]]. The [[Cocks IBE scheme]] is based on well-studied assumptions (the [[quadratic residuosity problem|quadratic residuosity assumption]]) but encrypts messages one bit at a time with a high degree of [[ciphertext expansion]]. Thus it is highly inefficient and impractical for sending all but the shortest messages, such as a session key for use with a [[symmetric cipher]].

One of the major advantages of any identity-based encryption scheme is that if there are only a finite number of users, after all users have been issued with keys the third party's secret can be destroyed. This can take place because this system assumes that, once issued, keys are always valid (as this basic system lacks ana method of [[key revocation]]). The majority of derivatives of this system which have key revocation lose this advantage.

==References==

Line 23:

[[Category:Key management]]

[[ko:신원 기반 암호]]

[[ko:신원 기반 암호]]