We present a direct construction for an identification scheme provably secure 
against concurrent attacks under the assumptions on the worst-case hardness of hard 
lattice problems such as the gap version of the Shortest Vector Problem.
We also construct an ad hoc anonymous identification scheme based on the lattice 
problems by modifying this direct construction.