Sciweavers

Share
IACR
2016

Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters

5 years 6 months ago
Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
In this paper, we present two new adaptively secure identity-based encryption (IBE) schemes from lattices. The size of the public parameters, ciphertexts, and private keys are ˜O(n2 κ1/d ), ˜O(n), and ˜O(n) respectively. Here, n is the security parameter, κ is the length of the identity, and d ∈ N is a flexible constant that can be set arbitrary (but will affect the reduction cost). Ignoring the poly-logarithmic factors hidden in the asymptotic notation, our schemes achieve the best efficiency among existing adaptively secure IBE schemes from lattices. In more detail, our first scheme is anonymous, but proven secure under the LWE assumption with approximation factor nω(1) . Our second scheme is not anonymous, but proven adaptively secure assuming the LWE assumption for all polynomial approximation factors. As a side result, based on a similar idea, we construct an attribute-based encryption scheme for branching programs that simultaneously satisfies the following propertie...
Shota Yamada
Added 03 Apr 2016
Updated 03 Apr 2016
Type Journal
Year 2016
Where IACR
Authors Shota Yamada
Comments (0)
books