Chapter

Advances in Cryptology - ASIACRYPT 2008

Volume 5350 of the series Lecture Notes in Computer Science pp 372-389

Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems

  • Akinori KawachiAffiliated withDepartment of Mathematical and Computing Sciences, Tokyo Institute of Technology
  • , Keisuke TanakaAffiliated withDepartment of Mathematical and Computing Sciences, Tokyo Institute of Technology
  • , Keita XagawaAffiliated withDepartment of Mathematical and Computing Sciences, Tokyo Institute of Technology

Abstract

In this paper, we show that two variants of Stern’s identification scheme [IEEE Transaction on Information Theory ’96] are provably secure against concurrent attack under the assumptions on the worst-case hardness of lattice problems. These assumptions are weaker than those for the previous lattice-based identification schemes of Micciancio and Vadhan [CRYPTO ’03] and of Lyubashevsky [PKC ’08].We also construct efficient ad hoc anonymous identification schemes based on the lattice problems by modifying the variants.

Keywords

Lattice-based cryptography identification schemes concurrent security ad hoc anonymous identification schemes