Data lineage is defined as a data life cycle that includes the data's origins and where it moves over time. It describes what happens to data as it goes through diverse processes and also provides visibility into the analytics pipeline which simplifies tracing errors, back to their sources. It also enables replaying specific portions or inputs of the dataflow for step-wise debugging or regenerating lost output. Data Leakage is the unapproved communication of data (or information) from source to an external destination. In this paper, we examine and submit a survey report on generic data lineage framework LIME for data flow across multiple entities that take principal roles (i.e., owner and consumer).The exact security guarantees required by such a data lineage mechanism toward identification of a guilty entity, by identifying and simplifying non-repudiation and honesty assumptions are presented. By using oblivious transfer, robust watermarking, and signature primitive’s development and analyzing the data transfer protocol in a malicious environment between two entities is explained. Finally, we analyze an experimental evaluation to demonstrate the practicality of the protocol and apply the framework to the important data leakage scenarios of data outsourcing and social networks. In this work, we examine a watermarking based scheme to claim the identity of the leaker even if the data passes through multiple agents from data source to data usage centers.

Arithmetic coding is an optimal data compression algorithm. Wit ten and Cleary proposed incorporating security into arithmetic coding. This has been an attractive proposal that could result in less overall processing overhead compared to the traditional method of compres sion followed by encryption. However a number of attacks on arith metic coding encryption systems have been published which demon strate the difliculty of successful combination of the two processes. Re cently Liu/Farrell/Boyd proposed a new scheme which claimed to be resistant against all the known attacks. In this paper we study the se curity of this scheme and show an attack that can recover the plaintext message and whose cost is 2 20 •

Digital rights management allows information owners to control the use and dissemination of electronic documents via a machine-readable licence. Documents are distributed in a protected form such that they may only be used with trusted environments, and only in accordance with terms and conditions stated in the licence. Digital rights management has found uses in protecting copyrighted audio-visual productions, private personal information, and companies' trade secrets and intellectual property. This chapter describes a general model of digital rights management together with the technologies used to implement each component of a digital rights management system, and desribes how digital rights management can be applied to secure the distribution of electronic information in a variety of contexts.

A wireless sensor network (WSN) consists of a large number of small sensor nodes that collect data and send it to a base station, with the help of other nodes. Securing unattended WSNs is a challenging task as networks can be subjected not only to the traditional attacks on wireless networks including eavesdropping and jamming, but also new attacks due to physical insecurity of the nodes. Providing security is particularly challenging because sensor nodes have limited computational resources and so new security mechanisms must be carefully designed. To secure communication between two nodes, a shared cryptographic key between the two nodes must be established. Random key pre-distribution systems provide an efficient approach to key establishment in such networks that guarantee security against passive adversaries. We revisit these systems and show how to design systems with security guarantee against powerful adversaries that can not only eavesdrop the communication but also capture a subset of nodes.

We consider unconditionally secure authentication systems in which a sender communicates a source state to a receiver by encoding it as an authenticated message under a key agreed with the receiver. An authentication code is a triple (S, M,E) where E is a collection of encoding rules, i.e. mappings from the set S of source states into the set M of messages. A probability distribution on E models the key agreement process by which the encoding rule is chosen by the sender and receiver. In the usual model the adversary observes messages transmitted between the sender and the receiver before introducing to the channel a spoofing message, chosen according to some strategy. The adversary is successful if the spoofed message is accepted by the receiver as a valid (authenticated) message. In this paper we consider the extension to the model in which the adversary interacts with the sender and the receiver. In this query model the adversary may send messages to the receiver and observe a response to determine whether or not they are accepted or the adversary may provide the sender with the source state and observe the corresponding authenticated message that the sender transmits. We discuss the nature of an optimal strategy for such an adversary and derive bounds on the probability of deception for an authentication code in this model. This also leads to combinatorial characterisations of optimal authentication codes.

We consider unconditionally secure authentication codes where the adversary has access to a verification oracle that when presented with a message query gives a response of 1 or 0 if the query corresponds to an authenticated message or not, respectively.We define two types of attack, offline and online, and their two corresponding games. We define the advantage of the adversary in each game and obtain a lower bound on the maximum advantage when the adversary plays his optimal strategy. For each game, authentication codes that satisfy the lower bounds with equality are said to provide perfect protection and guarantee the minimum success chance for the attacker in the corresponding game. We prove that an optimal code for the offline attack is also an optimal code for the online attack. In both cases, we prove that perfect protection of order i implies perfect protection of order j for j < i and derive a lower bound on the number of keys for an optimal code. Finally we show that the encoding matrix of codes with perfect protection of order i and minimum number of keys correspond to a Steiner system.

Firewalls are one of the essential components of secure networks. However, configuring firewall rule tables for large networks with complex security requirements is a difficult and error prone task. A method of representing firewall rule table that allows comparison of two tables is developed, and an algorithm that determines if two tables are equivalent is provided. (That is the set of packets that are permitted by the two tables are the same.) How such algorithm can assist system administrators to correctly implement organisational policy is discussed. The proposed approach is implemented and the results of the experiments are shown.

We study authentication codes (A-codes) when the enemy has access to the content of the intercepted cryptogram. This is similar to plaintext attack in secrecy systems. Enemy's success is defined in two ways. The first is as in Simmons' model. We will also consider chosen-content attacks in which the success is by constructing a fraudulent cryptogram with a given content. We will obtain information theoretic bounds, define perfect protection and obtain lower bounds on the number of encoding rules for codes with perfect protection against chosen-content impersonation and chosen-content plaintext substitution. We characterize these A-codes when the number of encoding rules is minimum. We give methods of making an A-code resistant against plaintext and chosen-context plaintext attack.

Seppanen, Makela and Keskinarkaus (SMK) have proposed a high-capacity steganographic technique to conceal information within a colour image. The technique is significant because of the high volume of data that is embedded into pixels but it results in a high level of noise and so the quality of the resulting image is not acceptable. A new type of coding structure is proposed, which maintains a high capacity but lowers the level of noise. Secondly, an adaptive algorithm is used to identify pixel values that have a high capacity to distortion ratio. Also the maximum size of the coding structures is limited to improve the capacity/distortion tradeoff. For the tested images, an average capacity of nearly 6 bits/pixel was achieved with a peak signal to noise ratio of 40 dB.

This is a proposal on the construction of a Message Authentication Code (MAC) based on Latin Squares. The design is inspired by Wegman-Carter construction which takes advantage of provable security. The MAC is described and its security is examined. It is also compared with other MACs and its advantages are shown.

Several security issues arise, due to the design of the mobile IP and its deployment in conjunction with other network protocols. Most of the work on the security of mobile IP has focused on authentication of the control packet and the confidentiality of the content in the protocol, and there are not many proposals in the area of location privacy. In this paper, we propose a method to provide location privacy for mobile IP users. We present two protocols that use an overlay network approach, and designed particularly for mobile IP. We employ universal re-encryption and extend it to n-out-of-n universal re-encryption to achieve our goal. In contrast to other overlay network approaches, where at least n public key encryption are required, our scheme requires only 2 public key encryption operations. Therefore, it is applicable to mobile IP systems, where in most cases the mobile nodes are small devices and have computational limitation.

Unconditionally secure authentication codes provide information theoretic security against an adversary who observes authenticated messages and then wants to construct a fraudulent message that is acceptable by the receiver. The attack model for these codes has recently been strengthened and adaptive adversaries with oracle access have been introduced. In this paper we give an analysis of this new model and derive information theoretic bounds on the success probability and key size of the codes. Our analysis treats two games that an adversary can play: an offline attack in which the adversary is allowed to query a verification oracle and then to construct the spoofing query; and an on-line attack in which the adversary interacts with the verification oracle and wins as soon as he constructs an acceptable message. We describe the best strategy of the adversary in each case

In ACM conference on electronic commerce (EC’03), Han et al. [Identity-based confirmer signatures from pairings over elliptic curves, in: Proceedings of ACM Conference on Electronic Commerce Citation 2003, San Diego, CA, USA, June 09–12, 2003, pp. 262–263] proposed an ID-based confirmer signature scheme using pairings (the scheme is in fact an ID-based undeniable signature scheme). In this paper, we show that this signature scheme is not secure and the signer can deny any signature, even if it is a valid signature, and any one can forge a valid confirmer signature of a signer with identity ID on an arbitrary message and confirm this signature to the verifier.

This paper presents an attack on Anderson and Lomas's proposed password-based authenticated key exchange protocol that uses collisionful hash functions. The weaknesses of the protocol when an old session key is compromised are studied and alternative solutions are given.

In this paper we prove two general characterization theorems for A-codes, that provide r-fold security, in terms of well-known combinatorial structures (t-designs and orthogonal arrays). We use Delsarte's linear programming method to find new bounds on the number of encoding rules for Cartesian A-codes with 1-fold and 2-folds security and show that in the latter case the bound is achieved by A-codes obtained from the dual of two well-studied error correcting codes: an MDS code and the extended Hamming code.

An authentication system with shared generation of authenticatorsis a system in which construction of an authentic codeword requirescollaboration of an authorised group of transmitters. We proposethree systems for threshold generation of authenticators thatprovide unconditional security and in two cases protection extendsover multiple message transmissions. We describe the constructionsand prove their security properties.

We investigate irrational numbers as a source of pseudorandom bits, We suggest two secure pseudorandom bit generators based on transcendental numbers. These two classes of transcendentals are applied to construct novel encryption algorithms. Properties of the encryption algorithms are studied and preliminary cryptanalysis is given.

This paper presents an attack on Gong's proposed collisionful hash function. The weaknesses of his method are studied and possible solutions are given. Some secure methods that require additional assumptions are also suggested.

We propose two new classes of hash functions which are motivated by Maximum Rank Distance (MRD) codes. We analise the security of these schemes. The system setup phase is computationally expensive for general field extensions. To overcome this limitation we derive an algebraic solution which avoids computations in special extension fields in the intended operational range of the hash functions.