License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-21278
URL: http://drops.dagstuhl.de/opus/volltexte/2009/2127/
Rückert, Markus

Lattice-based Blind Signatures

pdf-format:
Dokument 1.pdf (317 KB)

Abstract

Motivated by the need to have secure blind signatures even in the presence of quantum computers, we present two efficient blind signature schemes based on hard worst-case lattice problems. Both schemes are provably secure in the random oracle model and unconditionally blind. The first scheme is based on preimage samplable functions that were introduced at STOC 2008 by Gentry, Peikert, and Vaikuntanathan. The scheme is stateful and runs in 3 moves. The second scheme builds upon the PKC 2008 identification scheme of Lyubashevsky. It is stateless, has 4 moves, and its security is based on the hardness of worst-case problems in ideal lattices.

BibTeX - Entry

@InProceedings{rckert:DSP:2009:2127,
  author =	{Markus R{\"u}ckert},
  title =	{Lattice-based Blind Signatures},
  booktitle =	{Algorithms and Number Theory },
  year =	{2009},
  editor =	{Johannes A. Buchmann and John Cremona and Michael E. Pohst},
  number =	{09221},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2127},
  annote =	{Keywords: Blind signatures, post-quantum, lattices, privacy}
}

Keywords: Blind signatures, post-quantum, lattices, privacy
Seminar: 09221 - Algorithms and Number Theory
Issue date: 2009
Date of publication: 21.08.2009

DROPS-Home | Fulltext Search | Imprint Published by LZI