<abstract xmlns="http://www.w3.org/1999/xhtml"><p> We introduce a new cryptographic protocol based on the wellknown LearningWith Errors (LWE) problem: a group key transfer protocol which achieves anonymity of the members against each others. This issue is almost absent in the key transfer protocols from the literature but we argue it is a practical property. We motivate our construction by a practical need. We use two essential cryptographic primitives built from LWE: LWE Diffie-Hellman key exchange derived from Regev’s work [Regev, O.: On lattices, learning with errors, random linear codes, and cryptography, in: Proc. of the 37th Annual ACM Symposium on Theory of Computing-STOC ’05 (H. N. Gabow and R. Fagin, eds.), Baltimore, MD, USA, 2005, ACM, New York, 2005, pp. 84-93] and a public key cryptosystem secure under the LWE hardness. We provide a security definition for anonymous key transfer protocol and we achieve anonymity against IND-CPA adversaries.</p></abstract>

We introduce a new cryptographic protocol based on the wellknown LearningWith Errors (LWE) problem: a group key transfer protocol which achieves anonymity of the members against each others. This issue is almost absent in the key transfer protocols from the literature but we argue it is a practical property. We motivate our construction by a practical need. We use two essential cryptographic primitives built from LWE: LWE Diffie-Hellman key exchange derived from Regev’s work [Regev, O.: On lattices, learning with errors, random linear codes, and cryptography, in: Proc. of the 37th Annual ACM Symposium on Theory of Computing-STOC ’05 (H. N. Gabow and R. Fagin, eds.), Baltimore, MD, USA, 2005, ACM, New York, 2005, pp. 84-93] and a public key cryptosystem secure under the LWE hardness. We provide a security definition for anonymous key transfer protocol and we achieve anonymity against IND-CPA adversaries.

An Lwe-Based Key Transfer Protocol with Anonymity

Department of Computer Science, Faculty of Mathematics and Computer Science, University of Bucharest, Academiei Street no. 14, sector 1, Bucharest, ROMANIA

Tatra Mountains Mathematical Publications

{"article-title":"An Lwe-Based Key Transfer Protocol with Anonymity"}

We introduce a new cryptographic protocol based on the wellknown LearningWith Errors (LWE) problem: a group key transfer protocol which achieves anonymity of...

An Lwe-Based Key Transfer Protocol with Anonymity

Publié en ligne: 01 févr. 2013

Pages: 119 - 135

DOI: https://doi.org/10.2478/v10127-012-0042-8

Mots clés
LWE, lattice-based cryptography, anonymity

This content is open access.

An Lwe-Based Key Transfer Protocol with Anonymity

Publié en ligne: 01 févr. 2013

Pages: 119 - 135

DOI: https://doi.org/10.2478/v10127-012-0042-8

Mots clésLWE, lattice-based cryptography, anonymity

This content is open access.

Mots clés
LWE, lattice-based cryptography, anonymity