TU Darmstadt / ULB / TUbiblio

A Lattice-Based Threshold Ring Signature Scheme

Cayrel, Pierre-Louis ; Lindner, Richard ; Rückert, Markus ; Silva, Rosemberg (2010)
A Lattice-Based Threshold Ring Signature Scheme.
Puebla, Mexico (August 8-11, 2010)
Konferenzveröffentlichung, Bibliographie

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
Art des Eintrags: Bibliographie
Titel: A Lattice-Based Threshold Ring Signature Scheme
Sprache: Englisch
Publikationsjahr: August 2010
Ort: Berlin
Verlag: Springer
(Heft-)Nummer: 6212
Buchtitel: The first international conference on cryptology and information security, LatinCrypt 2010
Reihe: Lecture notes in computer science
Band einer Reihe: 6212
Veranstaltungsort: Puebla, Mexico
Veranstaltungsdatum: August 8-11, 2010
Zugehörige Links:
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

Freie Schlagworte: Secure Data
ID-Nummer: TUD-CS-2010-0141
Fachbereich(e)/-gebiet(e): 20 Fachbereich Informatik
20 Fachbereich Informatik > Theoretische Informatik - Kryptographie und Computeralgebra
LOEWE
LOEWE > LOEWE-Zentren
LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
Hinterlegungsdatum: 30 Dez 2016 20:23
Letzte Änderung: 24 Feb 2022 08:02
PPN:
Zugehörige Links:
Export:
Suche nach Titel in: TUfind oder in Google
Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen