Name
Title | ||
|---|---|---|
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems |
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-89255-7_23 | ASIACRYPT |
Keywords | Field | DocType |
anonymous identification scheme,concurrently secure identification,information theory,previous lattice-based identification scheme,worst-case hardness,lattice problems,concurrent attack,lattice problem,ieee transaction,identification scheme,provable security | Information theory,Identification scheme,Lattice (order),Computer science,Theoretical computer science,Lattice problem,Lattice-based cryptography | Conference |
Volume | ISSN | Citations |
5350 | 0302-9743 | 60 |
PageRank | References | Authors |
2.01 | 25 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akinori Kawachi | 1 | 185 | 20.66 |
| Keisuke Tanaka | 2 | 278 | 19.04 |
| Keita Xagawa | 3 | 258 | 20.51 |