| 摘要 |
Cocks scheme is an efficient identity-based encryption scheme whose semantic security relies on a standard assumption. In particular, it does not use bilinear maps (a.k.a pairings). Unlike most pairing-based schemes, Cocks scheme is not anonymous. The present embodiments provide methods for anonymizing Cocks ciphertexts. Previous 5 attempts in this direction resulted in longer ciphertexts or were quite impractical. The methods according to the present principles are computationally inexpensive and do not increase the size of the ciphertexts. |
