CryptoDB
Almost Tightly-Secure Re-Randomizable and Replayable CCA-secure Public Key Encryption
| Authors: |
|
|---|---|
| Download: | |
| Presentation: | Slides |
| Conference: | PKC 2023 |
| Abstract: | Re-randomizable Replayable CCA-secure public key encryption (Rand-RCCA PKE) schemes guarantee security against chosen-ciphertext attacks while ensuring the useful property of re-randomizable ciphertexts. We introduce the notion of multi-user and multi-ciphertext Rand-RCCA PKE and we give the first construction of such a PKE scheme with an almost tight security reduction to a standard assumption. Our construction is structure preserving and can be instantiated over Type-1 pairing groups. Technically, our work borrows ideas from the state of the art Rand-RCCA PKE scheme of Faonio et al. (ASIACRYPT’19) and the adaptive partitioning technique of Hofheinz (EUROCRYPT’17). Additionally, we show (1) how to turn our scheme into a publicly-verifiable (pv) Rand-RCCA scheme and (2) that plugging our pv-Rand-RCCA PKE scheme into the MixNet protocol of Faonio et al. we can obtain the first almost tightly-secure MixNet protocol. |
BibTeX
@inproceedings{pkc-2023-32752,
title={Almost Tightly-Secure Re-Randomizable and Replayable CCA-secure Public Key Encryption},
publisher={Springer-Verlag},
doi={10.1007/978-3-031-31371-4_10},
author={Antonio Faonio and Dennis Hofheinz and Luigi Russo},
year=2023
}