Content deleted Content added
m →Correctness constraint: \mathrm{} |
Anton.bersh (talk | contribs) →Identity-based encryption algorithms: Remove link to deleted article |
||
Line 39:
* Boneh–Boyen (BB-IBE).<ref>{{cite journal|last1=Boneh|first1=Dan|last2=Boyen|first2=X|title=Efficient selective-ID secure identity based encryption without random oracles|journal=LNCS|year=2004|volume=3027|series=Advances in Cryptography - EUROCRYPT 2004|pages=223–238|publisher=Springer-Verlag|doi=10.1007/978-3-540-24676-3_14|isbn=978-3-540-21935-4|doi-access=free}}</ref>
All these algorithms have [[Provable security|security proofs]].
== Advantages ==
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 a method of [[key revocation]]). The majority of derivatives of this system which have key revocation lose this advantage.
| |||