Proxy re-encryption from lattices

71Citations
Citations of this article
43Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We propose a new unidirectional proxy re-encryption scheme based on the hardness of the LWE problem. Our construction is collusionsafe and does not require any trusted authority for the re-encryption key generation. We extend a recent trapdoor definition for a lattice of Micciancio and Peikert. Our proxy re-encryption scheme is provably CCA-1 secure in the selective model under the LWE assumption. © 2014 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kirshanova, E. (2014). Proxy re-encryption from lattices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8383 LNCS, pp. 77–94). Springer Verlag. https://doi.org/10.1007/978-3-642-54631-0_5

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