Anzeige
Erschienen in:
2008 | OriginalPaper | Buchkapitel
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
verfasst von : Akinori Kawachi, Keisuke Tanaka, Keita Xagawa
Erschienen in: Advances in Cryptology - ASIACRYPT 2008
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.