## CryptoDB

### Paper: Revisiting Proxy Re-encryption: Forward Secrecy, Improved Security, and Applications

Authors: David Derler Stephan Krenn Thomas Lorünser Sebastian Ramacher Daniel Slamanig Christoph Striecks DOI: 10.1007/978-3-319-76578-5_8 Search ePrint Search Google PKC 2018 We revisit the notion of proxy re-encryption ($\mathsf {PRE}$PRE), an enhanced public-key encryption primitive envisioned by Blaze et al. (Eurocrypt’98) and formalized by Ateniese et al. (NDSS’05) for delegating decryption rights from a delegator to a delegatee using a semi-trusted proxy. $\mathsf {PRE}$PRE notably allows to craft re-encryption keys in order to equip the proxy with the power of transforming ciphertexts under a delegator’s public key to ciphertexts under a delegatee’s public key, while not learning anything about the underlying plaintexts.We study an attractive cryptographic property for $\mathsf {PRE}$PRE, namely that of forward secrecy. In our forward-secret $\mathsf {PRE}$PRE (fs-$\mathsf {PRE}$PRE) definition, the proxy periodically evolves the re-encryption keys and permanently erases old versions while he delegator’s public key is kept constant. As a consequence, ciphertexts for old periods are no longer re-encryptable and, in particular, cannot be decrypted anymore at the delegatee’s end. Moreover, delegators evolve their secret keys too, and, thus, not even they can decrypt old ciphertexts once their key material from past periods has been deleted. This, as we will discuss, directly has application in short-term data/message-sharing scenarios.Technically, we formalize fs-$\mathsf {PRE}$PRE. Thereby, we identify a subtle but significant gap in the well-established security model for conventional $\mathsf {PRE}$PRE and close it with our formalization (which we dub fs-$\mathsf {PRE} ^+$PRE+). We present the first provably secure and efficient constructions of fs-$\mathsf {PRE}$PRE as well as $\mathsf {PRE}$PRE (implied by the former) satisfying the strong fs-$\mathsf {PRE} ^+$PRE+ and $\mathsf {PRE} ^+$PRE+ notions, respectively. All our constructions are instantiable in the standard model under standard assumptions and our central building block are hierarchical identity-based encryption ($\mathsf {HIBE}$HIBE) schemes that only need to be selectively secure.
##### BibTeX
@inproceedings{pkc-2018-28889,
title={Revisiting Proxy Re-encryption: Forward Secrecy, Improved Security, and Applications},
booktitle={Public-Key Cryptography – PKC 2018},
series={Public-Key Cryptography – PKC 2018},
publisher={Springer},
volume={10769},
pages={219-250},
doi={10.1007/978-3-319-76578-5_8},
author={David Derler and Stephan Krenn and Thomas Lorünser and Sebastian Ramacher and Daniel Slamanig and Christoph Striecks},
year=2018
}