TU Darmstadt / ULB / TUbiblio

Improved Zero-knowledge Identification with Lattices

Cayrel, Pierre-Louis and Lindner, Richard and Rückert, Markus and Silva, Rosemberg (2010):
Improved Zero-knowledge Identification with Lattices.
In: The Fourth International Conference on Provable Security (ProvSec 2010), Springer, In: LNCS, [Conference or Workshop Item]

Abstract

Zero-knowledge identification schemes solve the problem of authenticating one party to another via an insecure channel without disclosing any more information. In this paper we propose such a scheme employing a commitment scheme and using the hardness of worst-case lattice problems as basis of security. We adapt a code-based identification scheme devised by Cayrel and Véron which is an improvement of Stern's scheme. Our scheme sports analogous improvements over a lattice adaption of Stern's scheme which Kawachi et al. presented at ASIACRYPT 2008. Specifically, due to a smaller cheating probability of 1/2 and a similar communication cost, any desired level of security will be achieved in fewer rounds. Compared to Lyubashevsky's scheme presented at ASIACRYPT 2009, our proposal, like Kawachi's, oers a much milder security assumption, namely the hardness of SIS for trinary solutions. The same assumption was used for the SWIFFT hash function, which is secure for much smaller parameters than those proposed by Lyubashevsky.

Item Type: Conference or Workshop Item
Erschienen: 2010
Creators: Cayrel, Pierre-Louis and Lindner, Richard and Rückert, Markus and Silva, Rosemberg
Title: Improved Zero-knowledge Identification with Lattices
Language: German
Abstract:

Zero-knowledge identification schemes solve the problem of authenticating one party to another via an insecure channel without disclosing any more information. In this paper we propose such a scheme employing a commitment scheme and using the hardness of worst-case lattice problems as basis of security. We adapt a code-based identification scheme devised by Cayrel and Véron which is an improvement of Stern's scheme. Our scheme sports analogous improvements over a lattice adaption of Stern's scheme which Kawachi et al. presented at ASIACRYPT 2008. Specifically, due to a smaller cheating probability of 1/2 and a similar communication cost, any desired level of security will be achieved in fewer rounds. Compared to Lyubashevsky's scheme presented at ASIACRYPT 2009, our proposal, like Kawachi's, oers a much milder security assumption, namely the hardness of SIS for trinary solutions. The same assumption was used for the SWIFFT hash function, which is secure for much smaller parameters than those proposed by Lyubashevsky.

Title of Book: The Fourth International Conference on Provable Security (ProvSec 2010)
Series Name: LNCS
Number: 6402
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-0140
Related URLs:
Export:
Suche nach Titel in: TUfind oder in Google

Optionen (nur für Redakteure)

View Item View Item