eprint.iacr.orgpaperChosen Ciphertext and Trapdoor Secure Public Key Authenticated Encryption with Keyword Search
Mori and Emura give a generic transformation, a variant of the CHK transformation, that upgrades a public-key authenticated encryption with keyword search (PAEKS) scheme to one secure against chosen-ciphertext and trapdoor attacks (CCTA). It works because the PAEKS receiver names the sender when generating a trapdoor, so keywords can serve as tags. Applied to Li-Boyen generic PAEKS instantiations, it yields the first fully CCTA-secure PAEKS schemes from pairings and from lattices. Verification keys embedded in ciphertexts and trapdoors also let sender-receiver matching use hash tables, so search cost no longer depends on the number of senders.
TL;DR Generic CHK-style transformation making PAEKS secure against chosen-ciphertext and trapdoor attacks, giving the first fully CCTA-secure pairing- and lattice-based schemes with faster search.
Organisations named here
- Abdalla-Bellare-Neven construction
- CCTA
- CHK transformation
- keyword-guessing attack
- Li-Boyen generic construction
- trapdoor leakage
Technologies named here
- Public-key encryption with keyword search
- Public-key authenticated encryption with keyword search
- CHK transformation
- Abdalla, Bellare, and Neven generic construction
- Li and Boyen generic construction of PAEKS
Techniques named here
- Chosen-ciphertext and trapdoor attacks on PAEKS
Related in other
eprint.iacr.orgpaperRerandomizable Garbling for Arithmetic Circuits
aseemshrey.inarticle