We introduce a broad lattice manipulation technique for expressive cryptography, and use it to realize functional encryption for access structures from post-quantum hardness assumptions. Speci cally, we build an e cient key-policy attribute-based encryption scheme, and prove its security in the selective sense from learning-with-errors intractability in the standard model. This is a longer vers...

Cyclic lattices are sublattices of ZN that are preserved under the rotational shift operator. Cyclic lattices were introduced by D. Micciancio in [16] and their properties were studied in the recent years by several authors due to their importance in cryptography. In particular, Peikert and Rosen [19] showed that on cyclic lattices in prime dimensions, the shortest independent vectors problem S...

We describe new arithmetic coding techniques and side-channel blinding countermeasures for lattice-based cryptography. Using these techniques we develop a practical, compact, and more quantum-resistant variant of the BLISS Ring-LWE Signature Scheme. We first show how the BLISS hash-based random oracle can be modified to be more secure against quantum preimage attacks while optimising signature ...

Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...

In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind  digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...

In 1976, Diffie and Hellman introduced the revolutionary concept of public-key cryptography, also known as asymmetric cryptography. Today, asymmetric cryptography is routinely used to secure the Internet. The most famous and most widely used asymmetric cryptosystem is RSA, invented by Rivest, Shamir and Adleman. Surprisingly, there are very few alternatives known, and most of them are also base...

Lattices are regular arrangements of points in n-dimensional space, whose study appeared in the 19th century in both number theory and crystallography. Since the appearance of the celebrated Lenstra-Lenstra-Lovv asz lattice basis reduction algorithm twenty years ago, lattices have had surprising applications in cryptology. Until recently, the applications of lattices to cryptology were only neg...

Introduced in 1996 and greatly developed over the last few years, Lattice-based cryptography offers a whole set of primitives with nice features, including provable security and asymptotic efficiency. Going from “asymptotic” to “real-world” efficiency seems important as the set of available primitives increases in size and functionality. In this present paper, we explore the improvements that c...

Cryptosystems based on the hardness of lattice problems have recently acquired much importance due to their average-case to worst-case equivalence, their conjectured resistance to quantum cryptanalysis, their ease of implementation and increasing practicality, and, lately, their promising potential as a platform for constructing advanced functionalities. In this work, we construct “Fuzzy” Ident...