TU Darmstadt / ULB / TUbiblio

A Lattice-Based Threshold Ring Signature Scheme

Cayrel, Pierre-Louis and Lindner, Richard and Rückert, Markus and Silva, Rosemberg (2010):
A Lattice-Based Threshold Ring Signature Scheme.
In: The first international conference on cryptology and Information security, LatinCrypt 2010, Springer, In: LNCS, [Conference or Workshop Item]

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

Item Type: Conference or Workshop Item
Erschienen: 2010
Creators: Cayrel, Pierre-Louis and Lindner, Richard and Rückert, Markus and Silva, Rosemberg
Title: A Lattice-Based Threshold Ring Signature Scheme
Language: German
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

Title of Book: The first international conference on cryptology and Information security, LatinCrypt 2010
Series Name: LNCS
Number: 6212
Publisher: Springer
Uncontrolled Keywords: Secure Data
Divisions: LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
20 Department of Computer Science > Theoretical Computer Science - Cryptography and Computer Algebra
LOEWE > LOEWE-Zentren
20 Department of Computer Science
LOEWE
Date Deposited: 30 Dec 2016 20:23
Identification Number: TUD-CS-2010-0141
Related URLs:
Export:
Suche nach Titel in: TUfind oder in Google

Optionen (nur für Redakteure)

View Item View Item