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

• URL: http://arxiv.org/abs/2609.15312v1
• Date: Mon, 14 Sep 2026 10:02:27 GMT
• Title: Large Universe Subset Predicate Encryption with IND-CCA Security (with Constant-size Ciphertext and Keys)
• Abstract summary: We propose the first large-universe CCA-secure subset predicate encryption with constant-size ciphertext and secret keys.<n>We transform our extremely efficient SPE into the first CCA-secure subgroup WIBE, WKD-IBE, etc.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Pushing Forward Multi-Secret-Key Homomorphic Encryption for Private Average Aggregation [45.381652768314375]
  Homomorphic Encryption naturally fits the client--aggregator communication pattern of Federated Learning.<n>We propose lightweight multi-secret-key protocols for private average aggregation based on RLWE-based Homomorphic Encryption.<n>Our results show that the proposed approach substantially reduces ciphertext expansion and online cost, while preserving practical homomorphic aggregation performance.
  arXiv  Detail & Related papers  (2026-09-01T23:21:48Z)
• Anamorphic Encryption with CCA Security: A Standard Model Construction [32.95661036494699]
  Anamorphic encryption serves as a vital tool for covert communication, maintaining secrecy even during post-compromise scenarios.<n>We formalize the Anamorphic Key Encapsulation Mechanism (AKEM), encompassing both Public-Key (PKAKEM) and Symmetric-Key (SKAKEM) variants.<n>We provide a rigorous formal proof in the standard model, demonstrating resilience against a "dictator" who controls the decapsulation key.
  arXiv  Detail & Related papers  (2026-04-09T03:49:41Z)
• Post-Quantum Cryptography from Quantum Stabilizer Decoding [40.84312119358882]
  Post-quantum cryptography currently rests on a small number of hardness assumptions.<n>We argue that decoding random quantum stabilizer codes is an excellent candidate.<n>We prove that the average-case hardness of quantum stabilizer decoding implies the core primitives of classical Cryptomania.
  arXiv  Detail & Related papers  (2026-03-19T16:35:31Z)
• Computational Quantum Anamorphic Encryption and Quantum Anamorphic Secret-Sharing [0.0]
  The concept of anamorphic encryption, first formally introduced by Persiano et al., enables embedding covert messages within ciphertexts.<n>We present a quantum analogue of the classical anamorphic encryption definition based on public-key encryption.<n>We extend the work of akan et al. on computational quantum secret-sharing to computational quantum anamorphic secret-sharing.
  arXiv  Detail & Related papers  (2025-11-22T05:39:54Z)
• Post-Quantum Security of Block Cipher Constructions [9.212575508264774]
  We set the foundations for a theory of post-quantum security for block ciphers and associated constructions.<n>We provide the first post-quantum security proofs for the key-length extension scheme FX, the tweakable block ciphers LRW and XEX, and most block cipher encryption and authentication modes.
  arXiv  Detail & Related papers  (2025-10-09T18:33:05Z)
• Secure Multi-Key Homomorphic Encryption with Application to Privacy-Preserving Federated Learning [18.399679909318394]
  We identify a critical security vulnerability in the CDKS scheme when applied to multiparty secure computation tasks.<n>We propose a new scheme, SMHE, which incorporates a novel masking mechanism into the multi-key BFV and CKKS frameworks.<n>We implement a PPFL application using SMHE and demonstrate it provides significantly improved security with only a modest overhead in runtime evaluation.
  arXiv  Detail & Related papers  (2025-06-25T03:28:25Z)
• Cryptanalysis on Lightweight Verifiable Homomorphic Encryption [8.478323897416617]
  Verifiable Homomorphic Encryption (VHE) is a cryptographic technique that integrates Homomorphic Encryption (HE) with Verifiable Computation (VC)<n>It serves as a crucial technology for ensuring both privacy and integrity in outsourced computation.<n>This paper presents efficient attacks that exploit the homomorphic properties of encryption schemes.
  arXiv  Detail & Related papers  (2025-02-18T08:13:10Z)
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information [53.85237314348328]
  We introduce for non-uniform messages a novel hybrid universal network coding cryptosystem (NU-HUNCC) We show that NU-HUNCC is information-theoretic individually secured against an eavesdropper with access to any subset of the links.
  arXiv  Detail & Related papers  (2024-02-13T12:12:39Z)
• SOCI^+: An Enhanced Toolkit for Secure OutsourcedComputation on Integers [50.608828039206365]
  We propose SOCI+ which significantly improves the performance of SOCI. SOCI+ employs a novel (2, 2)-threshold Paillier cryptosystem with fast encryption and decryption as its cryptographic primitive. Compared with SOCI, our experimental evaluation shows that SOCI+ is up to 5.4 times more efficient in computation and 40% less in communication overhead.
  arXiv  Detail & Related papers  (2023-09-27T05:19:32Z)
• GPT-4 Is Too Smart To Be Safe: Stealthy Chat with LLMs via Cipher [85.18213923151717]
  Experimental results show certain ciphers succeed almost 100% of the time to bypass the safety alignment of GPT-4 in several safety domains. We propose a novel SelfCipher that uses only role play and several demonstrations in natural language to evoke this capability.
  arXiv  Detail & Related papers  (2023-08-12T04:05:57Z)
• Publicly-Verifiable Deletion via Target-Collapsing Functions [81.13800728941818]
  We show that targetcollapsing enables publiclyverifiable deletion (PVD) We build on this framework to obtain a variety of primitives supporting publiclyverifiable deletion from weak cryptographic assumptions.
  arXiv  Detail & Related papers  (2023-03-15T15:00:20Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• Recovering AES Keys with a Deep Cold Boot Attack [91.22679787578438]
  Cold boot attacks inspect the corrupted random access memory soon after the power has been shut down. In this work, we combine a novel cryptographic variant of a deep error correcting code technique with a modified SAT solver scheme to apply the attack on AES keys. Our results show that our methods outperform the state of the art attack methods by a very large margin.
  arXiv  Detail & Related papers  (2021-06-09T07:57:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.