Complex Domain Approach for Reversible Data Hiding and Homomorphic Encryption: General Framework and Application to Dispersed Data

• URL: http://arxiv.org/abs/2510.03770v1
• Date: Sat, 04 Oct 2025 10:39:48 GMT
• Title: Complex Domain Approach for Reversible Data Hiding and Homomorphic Encryption: General Framework and Application to Dispersed Data
• Abstract summary: This paper introduces Hiding in the Imaginary Domain with Data Encryption (H[i]dden), a novel framework based on complex number arithmetic for simultaneous information embedding and encryption.<n>The paper further introduces two protocols: H[i]dden-EG, for joint reversible data hiding and encryption, and H[i]dden-AggP, for privacy-preserving aggregation of watermarked data, based on partially homomorphic encryption.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Ensuring the trustworthiness of data from distributed and resource-constrained environments, such as Wireless Sensor Networks or IoT devices, is critical. Existing Reversible Data Hiding (RDH) methods for scalar data suffer from low embedding capacity and poor intrinsic mixing between host data and watermark. This paper introduces Hiding in the Imaginary Domain with Data Encryption (H[i]dden), a novel framework based on complex number arithmetic for simultaneous information embedding and encryption. The H[i]dden framework offers perfect reversibility, in-principle unlimited watermark size, and intrinsic data-watermark mixing. The paper further introduces two protocols: H[i]dden-EG, for joint reversible data hiding and encryption, and H[i]dden-AggP, for privacy-preserving aggregation of watermarked data, based on partially homomorphic encryption. These protocols provide efficient and resilient solutions for data integrity, provenance and confidentiality, serving as a foundation for new schemes based on the algebraic properties of the complex domain.

Related papers

• GoldenRetriever: Non-Interactive Homomorphic Encrypted Retrieval for Privacy-Preserving RAG [20.647970767787225]
  We propose a non-interactive encrypted retrieval framework for RAG based on threshold selection.<n>Instead of performing expensive top-$k$ ranking under encryption, our approach selects documents whose similarity scores exceed a predefined threshold.<n>Results highlight threshold-based selection as a practical foundation for scalable and secure RAG systems.
  arXiv  Detail & Related papers  (2026-07-31T04:44:24Z)
• How to Watermark the RLWE Homomorphic Ciphertexts [1.342943588774946]
  homomorphic encryption (HE) schemes based on the Ring Learning with Errors problem have rapidly developed.<n>Most existing HE schemes focus primarily on the feasibility and efficiency of homomorphic computation.<n>We propose a watermarking technique for RLWE ciphertexts.
  arXiv  Detail & Related papers  (2026-07-28T02:53:30Z)
• On the Feasibility of Hybrid Homomorphic Encryption for Intelligent Transportation Systems [3.5862178110496115]
  Homomorphic encryption (HE) enables computation directly on encrypted messages.<n> practical HE schemes incur substantial ciphertext expansion and communication overhead.<n>We develop theoretical models of representative ITS applications that integrate HHE to protect sensitive vehicular data.
  arXiv  Detail & Related papers  (2026-02-02T19:34:51Z)
• Multiparty Authorization for Secure Data Storage in Cloud Environments using Improved Attribute-Based Encryption [0.0]
  Attribute-Based Encryption (ABE) is one of the potential security and access control techniques for secure data storage and authorization.<n>The proposed work divides into two objectives: (i) provide access to authorized users and (ii) secure data storage in a cloud environment.<n>The security and performance analysis results demonstrate that the proposed scheme is more robust and secure.
  arXiv  Detail & Related papers  (2025-12-29T05:41:08Z)
• Leave No TRACE: Black-box Detection of Copyrighted Dataset Usage in Large Language Models via Watermarking [51.74368870268278]
  We propose TRACE, a framework for fully black-box detection of copyrighted dataset usage in large language models.<n>textttTRACE rewrites datasets with distortion-free watermarks guided by a private key.<n>Across diverse datasets and model families, TRACE consistently achieves significant detections.
  arXiv  Detail & Related papers  (2025-10-03T12:53:02Z)
• Perfectly-Private Analog Secure Aggregation in Federated Learning [51.61616734974475]
  In federated learning, multiple parties train models locally and share their parameters with a central server, which aggregates them to update a global model.<n>In this paper, a novel secure parameter aggregation method is proposed that employs the torus rather than a finite field.
  arXiv  Detail & Related papers  (2025-09-10T15:22:40Z)
• Dataset Protection via Watermarked Canaries in Retrieval-Augmented LLMs [67.0310240737424]
  We introduce a novel approach to safeguard the ownership of text datasets and effectively detect unauthorized use by the RA-LLMs.<n>Our approach preserves the original data completely unchanged while protecting it by inserting specifically designed canary documents into the IP dataset.<n>During the detection process, unauthorized usage is identified by querying the canary documents and analyzing the responses of RA-LLMs.
  arXiv  Detail & Related papers  (2025-02-15T04:56:45Z)
• RIOT-based smart metering system for privacy-preserving data aggregation using watermarking and encryption [0.0]
  This study proposes a privacy-preserving data aggregation protocol that uses reversible watermarking and AES cryptography.<n>There are two versions of the protocol: one for low-frequency smart meters that uses LSB-shifting-based reversible watermarking (RLS) and another for high-frequency smart meters that uses difference expansion-based reversible watermarking (RDE)
  arXiv  Detail & Related papers  (2025-01-10T18:37:20Z)
• Hades: Homomorphic Augmented Decryption for Efficient Symbol-comparison -- A Database's Perspective [1.3824176915623292]
  This paper introduces HADES, a novel cryptographic framework that enables efficient and secure comparisons on encrypted data.<n>Based on the Ring Learning with Errors (RLWE) problem, HADES provides CPA-security and incorporates perturbation-aware encryption to mitigate frequency-analysis attacks.
  arXiv  Detail & Related papers  (2024-12-28T02:47:14Z)
• Adaptive and Robust Watermark for Generative Tabular Data [9.275547262985917]
  We propose a flexible and robust watermarking mechanism for generative tabular data.<n>We show theoretically and empirically that the watermarked datasets have negligible impact on the data quality and downstream utility.
  arXiv  Detail & Related papers  (2024-09-23T04:37:30Z)
• DREW : Towards Robust Data Provenance by Leveraging Error-Controlled Watermarking [58.37644304554906]
  We propose Data Retrieval with Error-corrected codes and Watermarking (DREW) DREW randomly clusters the reference dataset and injects unique error-controlled watermark keys into each cluster. After locating the relevant cluster, embedding vector similarity retrieval is performed within the cluster to find the most accurate matches.
  arXiv  Detail & Related papers  (2024-06-05T01:19:44Z)
• Decentralised, Scalable and Privacy-Preserving Synthetic Data Generation [8.982917734231165]
  We build a novel system that allows the contributors of real data to autonomously participate in differentially private synthetic data generation. Our solution is based on three building blocks namely: Solid (Social Linked Data), MPC (Secure Multi-Party Computation) and Trusted Execution Environments (TEEs) We show how these three technologies can be effectively used to address various challenges in responsible and trustworthy synthetic data generation.
  arXiv  Detail & Related papers  (2023-10-30T22:27:32Z)
• A Resilient and Accessible Distribution-Preserving Watermark for Large Language Models [65.40460716619772]
  Our research focuses on the importance of a textbfDistribution-textbfPreserving (DiP) watermark. Contrary to the current strategies, our proposed DiPmark simultaneously preserves the original token distribution during watermarking. It is detectable without access to the language model API and prompts (accessible), and is provably robust to moderate changes of tokens.
  arXiv  Detail & Related papers  (2023-10-11T17:57:35Z)
• Dataset Condensation with Latent Space Knowledge Factorization and Sharing [73.31614936678571]
  We introduce a novel approach for solving dataset condensation problem by exploiting the regularity in a given dataset. Instead of condensing the dataset directly in the original input space, we assume a generative process of the dataset with a set of learnable codes. We experimentally show that our method achieves new state-of-the-art records by significant margins on various benchmark datasets.
  arXiv  Detail & Related papers  (2022-08-21T18:14:08Z)
• Reinforcement Learning on Encrypted Data [58.39270571778521]
  We present a preliminary, experimental study of how a DQN agent trained on encrypted states performs in environments with discrete and continuous state spaces. Our results highlight that the agent is still capable of learning in small state spaces even in presence of non-deterministic encryption, but performance collapses in more complex environments.
  arXiv  Detail & Related papers  (2021-09-16T21:59:37Z)

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.