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.
Author supplied keywords
Cite
CITATION STYLE
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.
