In today’s internet world where nothing is secure, since the communication by transmitting of digital products over the open network occur very frequently the security of information is very important. Everyday so many techniques are evolving to make message and image secure with high rate of security. Some of the encryption techniques used selective part of an image for encryption and some oth...

The primitive of deniable encryption was first introduced by Canetti et al. (CRYPTO, 1997). Deniable encryption is a regular public key encryption scheme with the added feature that after running the protocol honestly and transmitting a message m, both Sender and Receiver may produce random coins showing that the transmitted ciphertext was an encryption of any message m′ in the message space. D...

With the development of chaos theory, many image encryption algorithmshave been designed using the properties associated withthechaotic map. The chaotic map shows high sensitivity to initial conditions and the sequence generated using chaotic map are unpredictable making it a good choice for performing encryption operation. But, without proper encryption algorithm design, encryption scheme desi...

This paper presents an efficient authenticated encryption construction based on a universal hash function and block cipher. Encryption is achieved via counter-mode while authentication uses the Wegman-Carter paradigm. A single block-cipher key is used for both operations. The construction is instantiated using the hash functions of UMAC and VMAC, resulting in authenticated encryption with peak ...

This paper focus on the different kinds of symmetric key encryption techniques those exist in present world for securing data communication. It also frames all the techniques related to variety of encryption like image encryption, information encryption, double encryption. It aims to explain the performance parameters that are used in encryption processes and analyzing on their security issues....

Golle et al recently introduced universal re-encryption, defining it as re-encryption by a player who does not know the key used for the original encryption, but which still allows an intended player to recover the plaintext. Universal re-encryption is potentially useful as part of many information-hiding techniques, as it allows any player to make ciphertext unidentifiable without knowing the ...

In this paper a method for Partial RDF Encryption (PRE) is proposed in which sensitive data in an RDF-graph is encrypted for a set of recipients while all non-sensitive data remain publicly readable. The result is an RDF-compliant self-describing graph containing encrypted data, encryption metadata, and plaintext data. For the representation of encrypted data and encryption metadata, the XML-En...