Improved Zero-Knowledge Identification with Improved Zero-Knowledge Identification with Lattices

Autor(es)

Cayrel, Pierre-Louis ; Lindner, Richard ; Rueckert, Markus ; Silva, Rosemberg ; Heng, SH ; Kurosawa, K

• Tipo de documento: Artigo Científico
• Fonte: Lecture Notes in Computer Science; v. 6402, p. 3-pg., 2010-01-01.

Resumo

Zero-knowledge identification schemes solve the problem of authenticating one party to another via an insecure channel without disclosing any additional information that might be used by an impersonator. In this paper we propose a scheme whose security relies on the existence of a commitment scheme and on the hardness of worst-case lattice problems. We adapt a code-based identification scheme devised by Cayrel and Veron, which constitutes an improvement of Stern's construction. Our solution sports analogous improvements over the lattice adaption of Stern's scheme which Kawachi et al. presented at ASIACRYPT 2008. Specifically, due to a smaller cheating probability close to 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, offers 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. (AU)

• Processo FAPESP: 08/07949-8 - Aplicação de Códigos Corretores de Erros e Reticulados à Criptografia de Chave Pública
• Beneficiário: Rosemberg André da Silva
• Modalidade de apoio: Bolsas no Brasil - Doutorado