2009/01/01 by Markus Rückert, Rückert, Markus
Computer Science · #Blind signatures #Complexity and Algorithms in Graphs #Cryptography and Data Security #Privacy-Preserving Technologies in Data #lattices #post-quantum #privacy
paper · doi:10.4230/dagsemproc.09221.3
openalex publication_date 2009/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.