×

Circular and KDM security for identity-based encryption. (English) Zbl 1294.94030

Fischlin, Marc (ed.) et al., Public key cryptography – PKC 2012. 15th international conference on practice and theory in public key cryptography, Darmstadt, Germany, May 21–23, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30056-1/pbk). Lecture Notes in Computer Science 7293, 334-352 (2012).
Summary: We initiate the study of security for key-dependent messages (KDM), sometimes also known as “circular” or “clique” security, in the setting of identity-based encryption (IBE). Circular/KDM security requires that ciphertexts preserve secrecy even when they encrypt messages that may depend on the secret keys, and arises in natural usage scenarios for IBE.
We construct an IBE system that is circular secure for affine functions of users’ secret keys, based on the learning with errors (LWE) problem (and hence on worst-case lattice problems). The scheme is secure in the standard model, under a natural extension of a selectiveidentity attack. Our three main technical contributions are (1) showing the circular/KDM-security of a “dual”-style LWE public-key cryptosystem, (2) proving the hardness of a version of the “extended LWE” problem due to A. O’Neill et al. [Advances in cryptology – CRYPTO 2011, Lect. Notes Comput. Sci. 6841, 525–542 (2011; Zbl 1290.94113)], and (3) building an IBE scheme around the dual-style system using a novel lattice-based “all-but-d” trapdoor function.
For the entire collection see [Zbl 1241.94004].

MSC:

94A60 Cryptography

Citations:

Zbl 1290.94113
Full Text: DOI