Metraipolis › archive › dc_09793152f45f

Large Universe Subset Predicate Encryption with IND-CCA Security (with Constant-size Ciphertext and Keys) — arXiv:2609.15312

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.15312
License (as archived)
CC0-1.0
Archived
2026-10-15T23:54:05.439Z
SHA-256 of the archived text
4f56ef4487a98ccbc2d533c1499478fb3b03239e1a3b65af2e3a68137c031965
Stable URL of this page
https://metraipolis.com/documento/dc_09793152f45f

How to cite

Large Universe Subset Predicate Encryption with IND-CCA Security (with Constant-size Ciphertext and Keys) — arXiv:2609.15312 — arXiv (en), https://arxiv.org/abs/2609.15312 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_09793152f45f (Metraipolis archive dc_09793152f45f, sha256 4f56ef4487a98ccbc2d533c1499478fb3b03239e1a3b65af2e3a68137c031965)
BibTeX
@misc{dc09793152f45f,
  title = {Large Universe Subset Predicate Encryption with IND-CCA Security (with Constant-size Ciphertext and Keys) — arXiv:2609.15312},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.15312},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_09793152f45f; sha256 4f56ef4487a98ccbc2d533c1499478fb3b03239e1a3b65af2e3a68137c031965},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.15312. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Katz et al. (CANS'17) introduced Subset Predicate Encryption (SPE). This scheme is a generalization of broadcast encryption as it emulates the \emph{subset containment} predicate in the encrypted domain. They proposed two selectively IND-CPA secure SPE constructions in the small universe setting. They also showed some black-box transformations of SPE to well-known primitives like WIBE and ABE to establish the richness of the SPE structure. Chatterjee and Mukherjee (RSA'19) proposed two SPE constructions in the large-universe setting. Their first construction achieved constant-size ciphertexts and secret keys, but it is proven secure in a restricted version of selective security. Although the second construction achieves adaptive security, the ciphertext size depends on the size of the data-attribute set. Furthermore, neither of these two constructions achieves CCA security. In this work, we propose the first large-universe CCA-secure subset predicate encryption with constant-size ciphertext and secret keys. We prove this construction achieves standard selective security under the standard subgroup decision problems. Finally, we transform our extremely efficient SPE into the first CCA-secure WIBE, WKD-IBE, etc., with constant-size ciphertexts and secret keys via black-box transformations.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-15 in cs.CR).
Categorie arXiv: Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2609.15312 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T23:20:42.704Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).