TU Darmstadt / ULB / TUbiblio

A Lattice-Based Threshold Ring Signature Scheme

Cayrel, Pierre-Louis ; Lindner, Richard ; Rückert, Markus ; Silva, Rosemberg :
A Lattice-Based Threshold Ring Signature Scheme.
In: LNCS (6212). Springer
[ Konferenzveröffentlichung] , (2010)

Kurzbeschreibung (Abstract)

In this article, we propose a new lattice-based threshold ring signature scheme, modifying Aguilar's code-based solution to use the short integer solution (SIS) problem as security assumption, instead of the syndrome decoding (SD) problem. By applying the CLRS identification scheme, we are also able to have a performance gain as result of the reduction in the soundness error to 1/2 per round. Such gain is also maintained through the application of the Fiat-Shamir heuristics to derive signatures from our identification scheme. From security perspective we also have improvements, because our scheme exhibits a worst-case to average-case reduction typical of lattice-based cryptosystems. This gives us confidence that a random choice of parameters results in a system that is hard to break, in average

Typ des Eintrags: Konferenzveröffentlichung
Erschienen: 2010
Autor(en): Cayrel, Pierre-Louis ; Lindner, Richard ; Rückert, Markus ; Silva, Rosemberg
Titel: A Lattice-Based Threshold Ring Signature Scheme
Sprache: Deutsch
Kurzbeschreibung (Abstract):

In this article, we propose a new lattice-based threshold ring signature scheme, modifying Aguilar's code-based solution to use the short integer solution (SIS) problem as security assumption, instead of the syndrome decoding (SD) problem. By applying the CLRS identification scheme, we are also able to have a performance gain as result of the reduction in the soundness error to 1/2 per round. Such gain is also maintained through the application of the Fiat-Shamir heuristics to derive signatures from our identification scheme. From security perspective we also have improvements, because our scheme exhibits a worst-case to average-case reduction typical of lattice-based cryptosystems. This gives us confidence that a random choice of parameters results in a system that is hard to break, in average

Buchtitel: The first international conference on cryptology and Information security, LatinCrypt 2010
Reihe: LNCS
(Heft-)Nummer: 6212
Verlag: Springer
Freie Schlagworte: Secure Data
Fachbereich(e)/-gebiet(e): LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
20 Fachbereich Informatik > Theoretische Informatik - Kryptographie und Computeralgebra
LOEWE > LOEWE-Zentren
20 Fachbereich Informatik
LOEWE
Hinterlegungsdatum: 30 Dez 2016 20:23
ID-Nummer: TUD-CS-2010-0141
Verwandte URLs:
Export:

Optionen (nur für Redakteure)

Eintrag anzeigen Eintrag anzeigen