Lecture notes in computer science

Efficient Lattice HIBE in the Standard Model with Shorter Public Parameters

Kunwar Singh, Chandrasekharan Pandu Rangan, A. K. Banerjee

Published Jan 1, 2014• 8 citations

Publisher

DOI: 10.1007/978-3-642-55032-4_56

Related papers

Adaptively Secure Efficient Lattice (H)IBE in Standard Model with Short Public Parameters

Kunwar Singh, C. Pandurangan, A. K. Banerjee

Lecture notes in computer scienceJan 1, 201223 citations

Efficient Lattice (H)IBE in the Standard Model

Shweta Agrawal, Dan Boneh, Xavier Boyen

Lecture notes in computer scienceJan 1, 20101,018 citations

Efficient hierarchical identity based encryption scheme in the standard model over lattices

Fenghe Wang, Chunxiao Wang, Zhenhua Liu

Using lattice basis delegation in a fixed dimension, we propose an efficient lattice-based hierarchical identity based encryption (HIBE) scheme in the standard model whose public key size is only ( dm 2 + mn ) log q bits and whose message-ciphertext expansion factor is only log q , where d is the maximum hierarchical depth and ( n , m , q ) are public parameters. In our construction, a novel public key assignment rule is used to averagely assign one random and public matrix to two identity bits, which implies that d random public matrices are enough to build the proposed HIBE scheme in the standard model, compared with the case in which 2 d such public matrices are needed in the scheme proposed at Crypto 2010 whose public key size is (2 dm 2 + mn + m ) log q . To reduce the message-ciphertext expansion factor of the proposed scheme to log q , the encryption algorithm of this scheme is built based on Gentry’s encryption scheme, by which m 2 bits of plaintext are encrypted into m 2 log q bits of ciphertext by a one time encryption operation. Hence, the presented scheme has some advantages with respect to not only the public key size but also the message-ciphertext expansion factor. Based on the hardness of the learning with errors problem, we demonstrate that the scheme is secure under selective identity and chosen plaintext attacks.

Frontiers of Information Technology & Electronic EngineeringAug 1, 20165 citations

Adaptively Secure Efficient (H)IBE over Ideal Lattice with Short Parameters

Yuan Zhang, Yuan Liu, Yurong Guo +2 more

Identity-based encryption (IBE), and its hierarchical extension (HIBE), are interesting cryptographic primitives that aim at the implicit authentication on the users' public keys by using users' identities directly. During the past several decades, numerous elegant pairing-based (H)IBE schemes were proposed. However, most pairing-related security assumptions suffer from known quantum algorithmic attacks. Therefore, the construction of lattice-based (H)IBE became one of the hot directions in recent years. In the setting of most existing lattice-based (H)IBE schemes, each bit of a user's identity is always associated with a parameter matrix. This always leads to drastic but unfavorable increases in the sizes of the system public parameters. To overcome this issue, we propose a flexible trade-off mechanism between the size of the public parameters and the involved computational cost using the blocking technique. More specifically, we divide an identity into l' segments and associate each segment with a matrix, while increasing the lattice modulo slightly for maintaining the same security level. As a result, for the setting of 160-bit identities, we show that the size of the public parameters can be reduced by almost 89.7% (resp. 93.8%) while increasing the computational cost by merely 5.2% (resp. 12.25%) when l' is a set of 16 (resp. 8). Finally, our IBE scheme is extended to an HIBE scheme, and both of them are proved to achieve the indistinguishability of ciphertexts against adaptively chosen identity and chosen plaintext attack (IND-ID-CPA) in the standard model, assuming that the well-known ring learning with error (RLWE) problem over the involved ideal lattices is intractable, even in the post-quantum era.

EntropyNov 2, 20204 citations

Improved Short Lattice Signatures in the Standard Model

Léo Ducas, Daniele Micciancio

Lecture notes in computer scienceJan 1, 2014122 citations

HIBE Scheme Based on Programmable Hash Function on Lattices

YE Qing, WANG Mingming, TANG Yongli, QIN Panke, WANG Yongjun

To address the computational complexity of trapdoor generation of Hierarchical Identity-Based Encryption(HIBE) scheme on lattices under the standard mode,this paper proposes a HIBE scheme based on programmable hash function.First,the trapdoor is generated by MP12 trapdoor function.Then,the master public key,the master private key and the ciphertext are obtained by programmable hash function.Experimental results show that compared with the HIBE scheme with fixed dimension under the standard mode,the computational complexity of trapdoor generation of this method is significantly diminished,and the length of the main public key is reduced to O(logbn),which can satisfy the INDr-aID-CPA security.

Jan 1, 20200 citations