Key-private proxy re-encryption under LWE

Aono, Yoshinori, Boyen, Xavier, Phong, Le Trieu, & Wang, Lihua (2013) Key-private proxy re-encryption under LWE. Lecture Notes in Computer Science : Progress in Cryptology – INDOCRYPT 2013, 8250, pp. 1-18.

View at publisher


Proxy re-encryption (PRE) is a highly useful cryptographic primitive whereby Alice and Bob can endow a proxy with the capacity to change ciphertext recipients from Alice to Bob, without the proxy itself being able to decrypt, thereby providing delegation of decryption authority. Key-private PRE (KP-PRE) specifies an additional level of confidentiality, requiring pseudo-random proxy keys that leak no information on the identity of the delegators and delegatees.

In this paper, we propose a CPA-secure PK-PRE scheme in the standard model (which we then transform into a CCA-secure scheme in the random oracle model). Both schemes enjoy highly desirable properties such as uni-directionality and multi-hop delegation.

Unlike (the few) prior constructions of PRE and KP-PRE that typically rely on bilinear maps under ad hoc assumptions, security of our construction is based on the hardness of the standard Learning-With-Errors (LWE) problem, itself reducible from worst-case lattice hard problems that are conjectured immune to quantum cryptanalysis, or “post-quantum”.

Of independent interest, we further examine the practical hardness of the LWE assumption, using Kannan’s exhaustive search algorithm coupling with pruning techniques. This leads to state-of-the-art parameters not only for our scheme, but also for a number of other primitives based on LWE published the literature.

Impact and interest:

3 citations in Scopus
Search Google Scholar™

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

ID Code: 68721
Item Type: Journal Article
Refereed: Yes
Additional Information: Proceedings of the 14th International Conference on Cryptology in India, Mumbai, India, December 7-10, 2013.
Keywords: Proxy re-encryption, Learning with errors, Key privacy, Chosen ciphertext security, LWE practical hardness
DOI: 10.1007/978-3-319-03515-4_1
ISSN: 0302-9743
Divisions: Current > Schools > School of Electrical Engineering & Computer Science
Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: Copyright 2013 Springer
Deposited On: 19 Mar 2014 01:24
Last Modified: 19 Mar 2014 23:11

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page