Adaptive Chosen-Ciphertext Security of Distributed Broadcast Encryption

• URL: http://arxiv.org/abs/2506.10338v1
• Date: Thu, 12 Jun 2025 04:27:14 GMT
• Title: Adaptive Chosen-Ciphertext Security of Distributed Broadcast Encryption
• Abstract summary: Distributed broadcast encryption (DBE) is a specific kind of broadcast encryption (BE) where users independently generate their own public and private keys.<n>We propose an efficient DBE scheme in bilinear groups and prove adaptive chosen-ciphertext attack (CCA) security for the first time.<n>Our proposed DBE scheme is efficient because it requires constant size ciphertexts, constant size private keys, and linear size public keys.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Distributed broadcast encryption (DBE) is a specific kind of broadcast encryption (BE) where users independently generate their own public and private keys, and a sender can efficiently create a ciphertext for a subset of users by using the public keys of the subset users. Previously proposed DBE schemes have been proven in the adaptive chosen-plaintext attack (CPA) security model and have the disadvantage of requiring linear number of pairing operations when verifying the public key of a user. In this paper, we propose an efficient DBE scheme in bilinear groups and prove adaptive chosen-ciphertext attack (CCA) security for the first time. To do this, we first propose a semi-static CCA secure DBE scheme and prove the security under the $q$-Type assumption. Then, by modifying the generic transformation of Gentry and Waters that converts a semi-static CPA secure DBE scheme into an adaptive CPA secure DBE scheme to be applied to CCA secure DBE schemes, we propose an adaptive CCA secure DBE scheme and prove its adaptive CCA security. Our proposed DBE scheme is efficient because it requires constant size ciphertexts, constant size private keys, and linear size public keys, and the public key verification requires only a constant number of pairing operations and efficient group membership checks.

Related papers

• Large Universe Subset Predicate Encryption with IND-CCA Security (with Constant-size Ciphertext and Keys) [0.0]
  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.
  arXiv  Detail & Related papers  (2026-09-14T10:02:27Z)
• 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)
• Selective Safety Steering via Value-Filtered Decoding [54.87935112120107]
  Large language models (LLMs) are trained to align with human values, but their generations may still violate safety constraints.<n>Existing decoding-time steering methods often intervene unnecessarily, modifying generations that would have been safe under the base model.<n>We propose a new test-time steering method designed to reduce such unnecessary interventions while improving the safety of unsafe responses.
  arXiv  Detail & Related papers  (2026-05-14T12:13:08Z)
• 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)
• Send the Key in Cleartext: Halving Key Consumption while Preserving Unconditional Security in QKD Authentication [59.664950447941386]
  Quantum Key Distribution (QKD) protocols require Information-Theoretically Secure (ITS) authentication of the classical channel to preserve the unconditional security of the distilled key.<n>Since QKD requires mutual authentication, two independent one-time keys are typically consumed per round, imposing a non-trivial overhead on the net secure key rate.<n>We present a novel ITS authentication scheme based on $varepsilon$-Almost Strongly Universal$ ($varepsilon$-ASU$)
  arXiv  Detail & Related papers  (2026-03-26T14:36:05Z)
• Post-Quantum Secure Aggregation via Code-Based Homomorphic Encryption [19.264286608481296]
  We present a code-based alternative for secure aggregation based on key- and message-additive homomorphic encryption.<n>Our construction employs a committee-based decryptor realized via secret sharing.<n>We evaluate performance and identify regimes in which our approach outperforms information-theoretically secure aggregation protocols.
  arXiv  Detail & Related papers  (2026-01-19T13:14:01Z)
• Information-Theoretic Decentralized Secure Aggregation with Collusion Resilience [98.31540557973179]
  We study the problem of decentralized secure aggregation (DSA) from an information-theoretic perspective.<n>We characterize the optimal rate region, which specifies the minimum achievable communication and secret key rates for DSA.<n>Our results establish the fundamental performance limits of DSA, providing insights for the design of provably secure and communication-efficient protocols.
  arXiv  Detail & Related papers  (2025-08-01T12:51:37Z)
• Secure Multi-Key Homomorphic Encryption with Application to Privacy-Preserving Federated Learning [10.862166653863571]
  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)
• Adaptively Secure Distributed Broadcast Encryption with Linear-Size Public Parameters [0.0]
  Distributed broadcast encryption (DBE) is a variant of broadcast encryption (BE) that can efficiently transmit a message to a subset of users.<n>We propose a DBE scheme with constant size ciphertexts, constant size private keys, and linear size public parameters.
  arXiv  Detail & Related papers  (2025-05-23T06:35:08Z)
• An Efficient Private GPT Never Autoregressively Decodes [24.87628616730347]
  generative pre-trained transformer (GPT) has raised privacy concerns for both clients and servers.<n>This study proposes a public decoding and secure verification approach that utilizes public GPT models.<n> Experiments demonstrate a $2.1times sim 6.0times$ speedup compared to standard decoding across three pairs of public-private models.
  arXiv  Detail & Related papers  (2025-05-21T08:28:56Z)
• Cryptanalysis via Machine Learning Based Information Theoretic Metrics [58.96805474751668]
  We propose two novel applications of machine learning (ML) algorithms to perform cryptanalysis on any cryptosystem.<n>These algorithms can be readily applied in an audit setting to evaluate the robustness of a cryptosystem.<n>We show that our classification model correctly identifies the encryption schemes that are not IND-CPA secure, such as DES, RSA, and AES ECB, with high accuracy.
  arXiv  Detail & Related papers  (2025-01-25T04:53:36Z)
• Secure Composition of Quantum Key Distribution and Symmetric Key Encryption [3.6678562499684517]
  Quantum key distribution (QKD) allows Alice and Bob to share a secret key over an insecure channel with proven information-theoretic security against an adversary whose strategy is bounded only by the laws of physics.<n>We consider the problem of using the QKD established key with a secure symmetric key-based encryption algorithm and use an approach based on hybrid encryption to provide a proof of security for the composition.
  arXiv  Detail & Related papers  (2025-01-14T20:58:02Z)
• Enc2DB: A Hybrid and Adaptive Encrypted Query Processing Framework [47.11111145443189]
  We introduce Enc2DB, a novel secure database system following a hybrid strategy on and openGauss. We present a micro-benchmarking test and self-adaptive mode switch strategy that can choose the best execution path (cryptography or TEE) to answer a given query. We also design and implement a ciphertext index compatible with native cost model and querys to accelerate query processing.
  arXiv  Detail & Related papers  (2024-04-10T08:11:12Z)
• 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)
• Public Key Encryption with Secure Key Leasing [24.410596031297242]
  We introduce the notion of public key encryption with secure key leasing (PKE-SKL) Our notion is similar in spirit to the notion of secure software leasing (SSL) introduced by Ananth and La Placa (Eurocrypt 2021) In more detail, our adversary is not restricted to use an honest evaluation algorithm to run pirated software.
  arXiv  Detail & Related papers  (2023-02-22T21:37:57Z)
• Improved, Deterministic Smoothing for L1 Certified Robustness [119.86676998327864]
  We propose a non-additive and deterministic smoothing method, Deterministic Smoothing with Splitting Noise (DSSN) In contrast to uniform additive smoothing, the SSN certification does not require the random noise components used to be independent. This is the first work to provide deterministic "randomized smoothing" for a norm-based adversarial threat model.
  arXiv  Detail & Related papers  (2021-03-17T21:49:53Z)
• Certifiably Robust Variational Autoencoders [74.28099923969754]
  We introduce an approach for training Variational Autoencoders (VAEs) that are certifiably robust to adversarial attack. We derive actionable bounds on the minimal size of an input perturbation required to change a VAE's reconstruction. We show how these parameters can be controlled, thereby providing a mechanism to ensure a VAE will attain a desired level of robustness.
  arXiv  Detail & Related papers  (2021-02-15T13:56:54Z)

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.