Title: IBE and function-private IBE under linear assumptions with shorter ciphertexts and private keys, and extensions
Authors: Kaoru Kurosawa; Le Trieu Phong
Addresses: Ibaraki University, 4-12-1 Nakanarusawa, Hitachi, Ibaraki 316-8511, Japan ' National Institute of Information and Communications Technology (NICT), 4-2-1, Nukui-Kitamachi, Koganei, Tokyo 184-8795, Japan
Abstract: Many identity-based encryption schemes under the k-LIN assumption contain 2k + 1 group elements in the ciphertext overhead and private keys. In this paper, we push the limit further by constructing an IBE scheme under the k-LIN assumption with 2k group elements in the ciphertext overhead and private keys. The schemes have variants with shorter public parameters under the k-SCasc assumption, which is a close assumption to k-LIN. Furthermore, via additional refinements, we also put efforts in reducing the public parameter size of our schemes, under either k-LIN or k-SCasc. While we mainly consider securities in the standard model for our schemes, we also show how to make relatively more efficient schemes secure in the random oracle model. Our technique additionally expands to the scheme of Boneh et al. (CRYPTO 2013) to yield more efficient function-private IBE under the 2-LIN (aka, DLIN) assumption. Overall, the shortened size in ciphertexts and private keys inherently leads to fewer exponentiations and pairings in encryption and decryption, and hence yields schemes with better computational efficiency.
Keywords: identity-based encryption; k-LIN assumption; k-SCasc assumption; function privacy; standard model; random oracle model.
International Journal of Applied Cryptography, 2017 Vol.3 No.3, pp.210 - 224
Available online: 22 Aug 2017 *Full-text access for editors Access for subscribers Purchase this article Comment on this article