8.03讨论会

Trapdoors for Hard Lattices and New Cryptographic Constructions

论文报告人：DCC师兄

ABSTRCAT-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 ofpreimage sampleablefunctions, 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.

POINT :

New Smoothing Parameter Bound

新的平滑参数边界

Gram-Schmidt minimum

Preimage sampleable (trapdoor) functions.

Signature schemes.

hash-and-sign

A Group Signature Scheme from Lattice Assumptions

论文报告人：TGG

ABSTRCAT-Group signature schemes allow users to sign messages on behalf of a group while maintaining anonymity(within that group) with respect to an observer, yet (2) ensuring traceability of a signer (by the group manager) when needed. In this work we give the first construction of a group signature scheme based on lattices (more precisely, the learning with errors assumption), in the random oracle model. Toward our goal, we construct a new algorithm for sampling a random super lattice of a given modular lattice together with a short basis, that may be of independent interest.

POINT:

group signatures are required to satisfy two seemingly contradictory requirements: given some legitimate group signature σ, the group manager should be able to determine which member of the group issued σ (traceability), but no one other than the group manager should be able to determine any information about the signer (anonymity)

Gaussian Error Distributions

GPV Signature Scheme 

Sampling a Random Superlattice with a Short Basis

Efficient NIWI Proofs for Lattice Problems