Paper 2025/704

Lattice-Based Proxy Re-Encryption: Reconstruction Attacks and HRA-Secure Constructions

Haotian Yin, School of Advanced Technology, Xi'an Jiaotong-Liverpool University, Suzhou, 215123, China
Jie Zhang, School of Advanced Technology, Xi'an Jiaotong-Liverpool University, Suzhou, 215123, China
Yuji Dong, School of Internet of Things, Xi'an Jiaotong-Liverpool University, Suzhou, 215400, China
Dominik Wojtczak, Department of Computer Science, University of Liverpool, Liverpool, L69 3BX, UK
Eng Gee Lim, School of Advanced Technology, Xi'an Jiaotong-Liverpool University, Suzhou, 215123, China
Abstract

Proxy re-encryption (PRE) allows a proxy to transform a ciphertext under one user's public key into a ciphertext under another user's public key without learning the message. Honest re-encryption attack (HRA) security requires message indistinguishability even when an adversary observes many honestly generated re-encryptions. Reusing a re-encryption key can create correlations that are invisible in a single response. We show how these correlations permit functional reconstruction in the schemes of Susilo et al.\ (ESORICS~2021) and Fan--Liu (ACNS~2019) under persistent key reuse, with additional noise and modulus conditions for Fan--Liu. Building on pads fixed for each source ciphertext, we then construct public-key, unidirectional PRE for any fixed constant number of hops under Gaussian search-LWE (with uniform secrets and discrete Gaussian errors) and PRF security. The construction first achieves HRA security when delegations between honest users follow a fixed order. A generic key-separation compiler removes this order by giving each user an independent key pair at each depth: two pairs for one hop and $t+1$ for $t$ hops. Users may delegate along cycles while all key dependencies remain acyclic. Security holds in a stateful HRA model with static corruption, and both the noise widths and ciphertext modulus are polynomial.

Note: Update definitions and proofs; add a new construction

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
Keywords
Proxy re-encryptionHRA securityLearning with errorsComputational padding
Contact author(s)
haotian yin23 @ student xjtlu edu cn
History
2026-11-10: last of 6 revisions
2025-04-18: received
See all versions
Short URL
https://ia.cr/2025/704
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2025/704,
      author = {Haotian Yin and Jie Zhang and Yuji Dong and Dominik Wojtczak and Eng Gee Lim},
      title = {Lattice-Based Proxy Re-Encryption: Reconstruction Attacks and {HRA}-Secure Constructions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/704},
      year = {2025},
      url = {https://eprint.iacr.org/2025/704}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.