Quantum data hiding in the presence of noise

When classical or quantum information is broadcast to separate receivers, there exist codes that encrypt the encoded data such that the receivers cannot recover it when performing local operations and classical communication, but they can decode reliably if they bring their systems together and perform a collective measurement. This phenomenon is known as quantum data hiding and hitherto has been studied under the assumption that noise does not affect the encoded systems. With the aim of applying the quantum data hiding effect in practical scenarios, here we define the data-hiding capacity for hiding classical information using a quantum channel. Using this notion, we establish a regularized upper bound on the data hiding capacity of any quantum broadcast channel, and we prove that coherent-state encodings have a strong limitation on their data hiding rates. We then prove a lower bound on the data hiding capacity of channels that map the maximally mixed state to the maximally mixed state (we call these channels "mictodiactic"---they can be seen as a generalization of unital channels when the input and output spaces are not necessarily isomorphic) and argue how to extend this bound to generic channels and to more than two receivers.Comment: 12 pages, accepted for publication in IEEE Transactions on Information Theor

Quantum Data Hiding

We expand on our work on Quantum Data Hiding -- hiding classical data among parties who are restricted to performing only local quantum operations and classical communication (LOCC). We review our scheme that hides one bit between two parties using Bell states, and we derive upper and lower bounds on the secrecy of the hiding scheme. We provide an explicit bound showing that multiple bits can be hidden bitwise with our scheme. We give a preparation of the hiding states as an efficient quantum computation that uses at most one ebit of entanglement. A candidate data hiding scheme that does not use entanglement is presented. We show how our scheme for quantum data hiding can be used in a conditionally secure quantum bit commitment scheme.Comment: 19 pages, IEEE style, 8 figures, submitted to IEEE Transactions on Information Theor

Load Hiding of Household's Power Demand

With the development and introduction of smart metering, the energy information for costumers will change from infrequent manual meter readings to fine-grained energy consumption data. On the one hand these fine-grained measurements will lead to an improvement in costumers' energy habits, but on the other hand the fined-grained data produces information about a household and also households' inhabitants, which are the basis for many future privacy issues. To ensure household privacy and smart meter information owned by the household inhabitants, load hiding techniques were introduced to obfuscate the load demand visible at the household energy meter. In this work, a state-of-the-art battery-based load hiding (BLH) technique, which uses a controllable battery to disguise the power consumption and a novel load hiding technique called load-based load hiding (LLH) are presented. An LLH system uses an controllable household appliance to obfuscate the household's power demand. We evaluate and compare both load hiding techniques on real household data and show that both techniques can strengthen household privacy but only LLH can increase appliance level privacy

Steganographically Encoded Data

Steganography is the art of hiding information in ways that prevent its detection. Though steganography is an ancient craft, the onset of computer technology has given it new life. Computer-based steganographic techniques introduce changes to digital covers to embed information foreign to the native covers. Such information may be communicated in the form of text, binary files, or provide additional information about the cover and its owner such as digital watermarks or fingerprints. This paper explains steganography, provides a brief history and describes how steganography is applied in hiding information in images.Steganography, information hiding, digital image, digital watermarking

Anonymity and Information Hiding in Multiagent Systems

We provide a framework for reasoning about information-hiding requirements in multiagent systems and for reasoning about anonymity in particular. Our framework employs the modal logic of knowledge within the context of the runs and systems framework, much in the spirit of our earlier work on secrecy [Halpern and O'Neill 2002]. We give several definitions of anonymity with respect to agents, actions, and observers in multiagent systems, and we relate our definitions of anonymity to other definitions of information hiding, such as secrecy. We also give probabilistic definitions of anonymity that are able to quantify an observer s uncertainty about the state of the system. Finally, we relate our definitions of anonymity to other formalizations of anonymity and information hiding, including definitions of anonymity in the process algebra CSP and definitions of information hiding using function views.Comment: Replacement. 36 pages. Full version of CSFW '03 paper, submitted to JCS. Made substantial changes to Section 6; added references throughou

Design of information hiding algorithm for multi-link network transmission channel

Traditional channel information hiding algorithms based on m-sequence for multi-link network transmission, which apply m-sequence to channel coding information hiding system, do not analyze the upper limit of hiding capacity of multi-link network transmission channel system, and do not consider the hidden danger of overlapping secret information when embedding secret information is too large. It has the defects of low efficiency, poor accuracy and large storage cost. This paper designs an information hiding algorithm for multi-link network transmission channel based on secondary positioning, it uses RS code M public key cryptosystem to pre-process secret information and improve the security of information; calculates the upper limit of hiding capacity of multi-link network transmission channel system through information hiding capacity analysis model, and determines whether the hiding capacity exceeds the secret information. Secondary location and cyclic shift mechanism are introduced to improve the randomness of location selection and avoid overlapping of secret information. The experimental results show that the proposed algorithm has a great advantage in memory cost. When the channel SNR is 0 dB and 8 dB, the normalization coefficients are 0.87 and 1.04, respectively. This shows that the algorithm has a high accuracy in extracting secret information. The average time spent on hiding information is 2.04 s, indicating that the algorithm has high information hiding rate and storage efficiency

Reversible Data Hiding Methods : A Survey

This paper presents a survey of various reversible data hiding methods. Data hiding is the process of hiding information in a cover media . Most commonly used media for data hiding is image. But during the hiding and extraction of data there are chances for the distortion of image. Reversible data hiding methods are used to solve this problem