DROPS

Document

Lattice-based Blind Signatures

Authors: Markus Rückert

Published in: Dagstuhl Seminar Proceedings, Volume 9221, Algorithms and Number Theory (2009)

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.

Cite as

Markus Rückert. Lattice-based Blind Signatures. In Algorithms and Number Theory. Dagstuhl Seminar Proceedings, Volume 9221, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{ruckert:DagSemProc.09221.3,
  author =	{R\"{u}ckert, Markus},
  title =	{{Lattice-based Blind Signatures}},
  booktitle =	{Algorithms and Number Theory},
  pages =	{1--17},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9221},
  editor =	{Johannes A. Buchmann and John Cremona and Michael E. Pohst},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09221.3},
  URN =		{urn:nbn:de:0030-drops-21278},
  doi =		{10.4230/DagSemProc.09221.3},
  annote =	{Keywords: Blind signatures, post-quantum, lattices, privacy}
}

Search Results

Documents authored by Rückert, Markus

Lattice-based Blind Signatures

Abstract

Cite as

Thanks for your feedback!

Could not send message