Cayrel, Pierre-Louis ; Lindner, Richard ; Rückert, Markus ; Silva, Rosemberg (2010)
A Lattice-Based Threshold Ring Signature Scheme.
Puebla, Mexico (08.08.2010-11.08.2010)
Conference or Workshop Item, Bibliographie
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 ; Lindner, Richard ; Rückert, Markus ; Silva, Rosemberg |
| Type of entry: | Bibliographie |
| Title: | A Lattice-Based Threshold Ring Signature Scheme |
| Language: | English |
| Date: | August 2010 |
| Place of Publication: | Berlin |
| Publisher: | Springer |
| Issue Number: | 6212 |
| Book Title: | The first international conference on cryptology and information security, LatinCrypt 2010 |
| Series: | Lecture notes in computer science |
| Series Volume: | 6212 |
| Event Location: | Puebla, Mexico |
| Event Dates: | 08.08.2010-11.08.2010 |
| Corresponding Links: | |
| 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 |
| Uncontrolled Keywords: | Secure Data |
| Identification Number: | TUD-CS-2010-0141 |
| Divisions: | 20 Department of Computer Science 20 Department of Computer Science > Theoretical Computer Science - Cryptography and Computer Algebra LOEWE LOEWE > LOEWE-Zentren LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt |
| Date Deposited: | 30 Dec 2016 20:23 |
| Last Modified: | 24 Feb 2022 08:02 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Send an inquiry |
Options (only for editors)
 |
Show editorial Details |
Drucken
Impressum