CCA secure multi-recipient KEM from LPN

4Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We propose a novel multiple-recipient key-encapsulation mechanism (mKEM) scheme which takes multiple public keys as input and outputs a single key shared by corresponding recipients. We construct our scheme in the random oracle model based on low-noise LPN assumption which is a post-quantum problem. In the game simulation of security proof, a variant of Extended Knapsack LPN (which can be proved equivalent to standard LPN) is used to handle the decapsulation queries. The property of LPN problem provides randomness reuse property to shorten the length of the ciphertext compared with traditional way.

Cite

CITATION STYLE

APA

Cheng, H., Li, X., Qian, H., & Yan, D. (2018). CCA secure multi-recipient KEM from LPN. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11149 LNCS, pp. 513–529). Springer Verlag. https://doi.org/10.1007/978-3-030-01950-1_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free