An LWE-based key transfer protocol with anonymity

Rok, strany: 2012, 119 - 135

We introduce a new cryptographic protocol based on the well-known Learning With Errors (LWE) problem: a group key transfer protocol which achieves \textit{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.: \textit{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.

ISO 690:

Georgescu, A. 2012. An LWE-based key transfer protocol with anonymity. In Tatra Mountains Mathematical Publications, vol. 53, no.3, pp. 119-135. 1210-3195.

APA:

Georgescu, A. (2012). An LWE-based key transfer protocol with anonymity. Tatra Mountains Mathematical Publications, 53(3), 119-135. 1210-3195.