2026-07-24T00:01:48Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2127 2024-03-06T11:08:47Z ddc:004 open_access

Lattice-based Blind Signatures Rückert, Markus Blind signatures post-quantum lattices privacy 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Markus Rückert 2009 Is Part Of Dagstuhl Seminar Proceedings, Volume 9221, Algorithms and Number Theory (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.09221.3 urn:nbn:de:0030-drops-21278 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09221.3 eng https://creativecommons.org/licenses/by/4.0/legalcode