How to Delegate a Lattice Basis.

David M. Cash, Dennis Hofheinz, Eike Kiltz

Published Jan 1, 2009• 55 citations

Abstract

We present a technique, which we call basis delegation, that allows one to use a short basis of a given lattice to derive a new short basis of a related lattice in a secure way. And since short bases for lattices essentially function like cryptographic trapdoors, basis delegation turns out to be a very powerful primitive. As the main application of our technique, we show how to construct hierarchical identity-based encryption (HIBE) that is secure, without random oracles, under the assumption that certain standard lattice problems are hard in the worst case. This construction and its variants constitute the first HIBE schemes from lattices, as well as the first lattice-based constructions of stateless signatures and identity-based encryption without random oracles. 1

Related papers

Broadcast Encryption Scheme from Lattice

Jin Wang, Bo Sun, Xin Li

Motivated by the lattice basis delegation technique due to [8, 22, 9], we propose a broadcast encryption scheme based on the hard worst-case lattice problems. The proposed scheme is secure in the random oracle model. To the best of the authors' knowledge, our construction constitute the first broadcast encryption schemes from lattices.

International Conference on E-Business and E-GovernmentMay 11, 20120 citations

Trapdoors for hard lattices and new cryptographic constructions

Craig Gentry, Chris Peikert, Vinod Vaikuntanathan

We show how to construct a variety of "trapdoor" cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the shortest nonzero vector to within certain polynomial factors). Our contributions include a new notion of trapdoor function with preimage sampling, simple and efficient "hash-and-sign" digital signature schemes, and identity-based encryption. A core technical component of our constructions is an efficient algorithm that, given a basis of an arbitrary lattice, samples lattice points from a discrete Gaussian probability distribution whose standard deviation is essentially the length of the longest Gram-Schmidt vector of the basis. A crucial security property is that the output distribution of the algorithm is oblivious to the particular geometry of the given basis.

ACM Symposium on Theory of Computing (STOC)May 17, 20082,498 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

Hierarchical ID-Based Blind Signature from Lattices

Liang Chen, Yongquan Cui, Xueming Tang +2 more

Blind signature offer the protection for sender's privacy and become an important primitive for electronic commerce. In this paper, we present a technique of matrix-vector-blinding for lattice-based blind signature. Building on this result, we propose two hierarchical ID-based blind signature schemes from lattice with and without random oracle, which are secure against quantum attacks. We apply the latest technique of "lattice basis delegation in fixed dimension" from ABB10's[1] scheme to our constructions which contribute to shorter public key and signature. Both of our blind signature schemes are proven to hold the properties of perfect blindness and one-more unforgeableability. Our hierarchical ID-based blind signature schemes are communicationally efficient and needs only one round data exchanges between the signer and the user, and with a shorter public key and signature in comparison with similar schemes[2, 3]. We prove that our scheme is secure assuming that the short integer solution (SIS) problem is hard.

International Conference on Computational Intelligence and Security (CIS)Dec 1, 20114 citations

Identity-based Signatures from Lattices: Simpler, Faster, Shorter

Miaomiao Tian, Liusheng Huang

Identity-based signature is an important technique for light-weight authentication. Recently, many efforts have been made to construct identity-based signatures over lattice assumptions since they would remain secure in future quantum age. In this paper we present a new identity-based signature scheme from lattice problems. This scheme is more efficient than other lattice-based identity-based signature schemes in terms of both computation and communication complexities. We prove its security in the random oracle model under short integer solution assumption that is as hard as approximating several worst-case lattice problems. We also extend the scheme to an identity-based message recovery signature scheme that has better performance.

Fundamenta InformaticaeJun 13, 201615 citations

Efficient Ring Signature Scheme Without Random Oracle from Lattices

Wen Gao, Yupu Hu, Baocang Wang +2 more

Among post-quantum alternatives, latticebased cryptography is the most promising one, due to its simple operations, reduction from aver-age-case to worstcase hardness, and supporting of rich functionalities. Ring signature enables a user to sign anonymously on behalf of an adaptively chosen group, and has multiple applications in anonymous e-voting, anonymous authentication, whistle blowing etc. However, most lattice-based ring signature schemes were constructed in the random oracle model from lattice basis delegation and they suffer large verification key sizes as a common disadvantage. This work proposes an efficient ring signature scheme from lattice basis delegation without random oracle based on the extended split-SIS problem, whose security is approximately as hard as the worst-case SIVP problem. Our scheme is proved to be anonymous and existentially unforgeable under latticebased assumptions. Finally, the verification key size is significantly reduced to a small constant, instead of increasing linearly with the number of ring members.

Chinese Journal of ElectronicsMar 1, 20196 citations