On the Design of Perceptual MPEG-Video Encryption Algorithms

In this paper, some existing perceptual encryption algorithms of MPEG videos are reviewed and some problems, especially security defects of two recently proposed MPEG-video perceptual encryption schemes, are pointed out. Then, a simpler and more effective design is suggested, which selectively encrypts fixed-length codewords (FLC) in MPEG-video bitstreams under the control of three perceptibility factors. The proposed design is actually an encryption configuration that can work with any stream cipher or block cipher. Compared with the previously-proposed schemes, the new design provides more useful features, such as strict size-preservation, on-the-fly encryption and multiple perceptibility, which make it possible to support more applications with different requirements. In addition, four different measures are suggested to provide better security against known/chosen-plaintext attacks.Comment: 10 pages, 5 figures, IEEEtran.cl

Review on Lightweight Cryptography Techniques and Steganography Techniques for IOT Environment

In the modern world, technology has connected to our day-to-day life in different forms. The Internet of Things (IoT) has become an innovative criterion for mass implementations and a part of daily life. However, this rapid growth leads the huge traffic and security problems. There are several challenges arise while deploying IoT. The most common challenges are privacy and security during data transmission. To address these issues, various lightweight cryptography and steganography techniques were introduced. These techniques are helpful in securing the data over the IoT. The hybrid of cryptography and steganography mechanisms provides enhanced security to confidential messages. Any messages can be secured by cryptography or by embedding the messages into any media files, including text, audio, image, and video, using steganography. Hence, this article has provided a detailed review of efficient, lightweight security solutions based on cryptography and steganography and their function over IoT applications. The objective of the paper is to study and analyze various Light weight cryptography techniques and Steganography techniques for IoT. A few works of literature were reviewed in addition to their merits and limitations. Furthermore, the common problems in the reviewed techniques are explained in the discussion section with their parametric comparison. Finally, the future scope to improve IoT security solutions based on lightweight cryptography and steganography is mentioned in the conclusion part

Framework for privacy-aware content distribution in peer-to- peer networks with copyright protection

The use of peer-to-peer (P2P) networks for multimedia distribution has spread out globally in recent years. This mass popularity is primarily driven by the efficient distribution of content, also giving rise to piracy and copyright infringement as well as privacy concerns. An end user (buyer) of a P2P content distribution system does not want to reveal his/her identity during a transaction with a content owner (merchant), whereas the merchant does not want the buyer to further redistribute the content illegally. Therefore, there is a strong need for content distribution mechanisms over P2P networks that do not pose security and privacy threats to copyright holders and end users, respectively. However, the current systems being developed to provide copyright and privacy protection to merchants and end users employ cryptographic mechanisms, which incur high computational and communication costs, making these systems impractical for the distribution of big files, such as music albums or movies.El uso de soluciones de igual a igual (peer-to-peer, P2P) para la distribución multimedia se ha extendido mundialmente en los últimos años. La amplia popularidad de este paradigma se debe, principalmente, a la distribución eficiente de los contenidos, pero también da lugar a la piratería, a la violación del copyright y a problemas de privacidad. Un usuario final (comprador) de un sistema de distribución de contenidos P2P no quiere revelar su identidad durante una transacción con un propietario de contenidos (comerciante), mientras que el comerciante no quiere que el comprador pueda redistribuir ilegalmente el contenido más adelante. Por lo tanto, existe una fuerte necesidad de mecanismos de distribución de contenidos por medio de redes P2P que no supongan un riesgo de seguridad y privacidad a los titulares de derechos y los usuarios finales, respectivamente. Sin embargo, los sistemas actuales que se desarrollan con el propósito de proteger el copyright y la privacidad de los comerciantes y los usuarios finales emplean mecanismos de cifrado que implican unas cargas computacionales y de comunicaciones muy elevadas que convierten a estos sistemas en poco prácticos para distribuir archivos de gran tamaño, tales como álbumes de música o películas.L'ús de solucions d'igual a igual (peer-to-peer, P2P) per a la distribució multimèdia s'ha estès mundialment els darrers anys. L'àmplia popularitat d'aquest paradigma es deu, principalment, a la distribució eficient dels continguts, però també dóna lloc a la pirateria, a la violació del copyright i a problemes de privadesa. Un usuari final (comprador) d'un sistema de distribució de continguts P2P no vol revelar la seva identitat durant una transacció amb un propietari de continguts (comerciant), mentre que el comerciant no vol que el comprador pugui redistribuir il·legalment el contingut més endavant. Per tant, hi ha una gran necessitat de mecanismes de distribució de continguts per mitjà de xarxes P2P que no comportin un risc de seguretat i privadesa als titulars de drets i els usuaris finals, respectivament. Tanmateix, els sistemes actuals que es desenvolupen amb el propòsit de protegir el copyright i la privadesa dels comerciants i els usuaris finals fan servir mecanismes d'encriptació que impliquen unes càrregues computacionals i de comunicacions molt elevades que fan aquests sistemes poc pràctics per a distribuir arxius de grans dimensions, com ara àlbums de música o pel·lícules

Dynamic block encryption with self-authenticating key exchange

One of the greatest challenges facing cryptographers is the mechanism used for key exchange. When secret data is transmitted, the chances are that there may be an attacker who will try to intercept and decrypt the message. Having done so, he/she might just gain advantage over the information obtained, or attempt to tamper with the message, and thus, misguiding the recipient. Both cases are equally fatal and may cause great harm as a consequence. In cryptography, there are two commonly used methods of exchanging secret keys between parties. In the first method, symmetric cryptography, the key is sent in advance, over some secure channel, which only the intended recipient can read. The second method of key sharing is by using a public key exchange method, where each party has a private and public key, a public key is shared and a private key is kept locally. In both cases, keys are exchanged between two parties. In this thesis, we propose a method whereby the risk of exchanging keys is minimised. The key is embedded in the encrypted text using a process that we call `chirp coding', and recovered by the recipient using a process that is based on correlation. The `chirp coding parameters' are exchanged between users by employing a USB flash memory retained by each user. If the keys are compromised they are still not usable because an attacker can only have access to part of the key. Alternatively, the software can be configured to operate in a one time parameter mode, in this mode, the parameters are agreed upon in advance. There is no parameter exchange during file transmission, except, of course, the key embedded in ciphertext. The thesis also introduces a method of encryption which utilises dynamic blocks, where the block size is different for each block. Prime numbers are used to drive two random number generators: a Linear Congruential Generator (LCG) which takes in the seed and initialises the system and a Blum-Blum Shum (BBS) generator which is used to generate random streams to encrypt messages, images or video clips for example. In each case, the key created is text dependent and therefore will change as each message is sent. The scheme presented in this research is composed of five basic modules. The first module is the key generation module, where the key to be generated is message dependent. The second module, encryption module, performs data encryption. The third module, key exchange module, embeds the key into the encrypted text. Once this is done, the message is transmitted and the recipient uses the key extraction module to retrieve the key and finally the decryption module is executed to decrypt the message and authenticate it. In addition, the message may be compressed before encryption and decompressed by the recipient after decryption using standard compression tools

Analysis of outsourcing data to the cloud using autonomous key generation

Cloud computing, a technology that enables users to store and manage their data at a low cost and high availability, has been emerging for the past few decades because of the many services it provides. One of the many services cloud computing provides to its users is data storage. The majority of the users of this service are still concerned to outsource their data due to the integrity and confidentiality issues, as well as performance and cost issues, that come along with it. These issues make it necessary to encrypt data prior to outsourcing it to the cloud. However, encrypting data prior to outsourcing makes searching the data obsolete, lowering the functionality of the cloud. Most existing cloud storage schemes often prioritize security over performance and functionality, or vice versa. In this thesis, the cloud storage service is explored, and the aspects of security, performance, and functionality are analyzed in order to investigate the trade-offs of the service. DSB-SEIS, a scheme with encryption intensity selection, an autonomous key generation algorithm that allows users to control the encryption intensity of their files, as well as other features is developed in order to find a balance between performance, security, and functionality. The features that DSB-SEIS contains are deduplication, assured deletion, and searchable encryption. The effect of encryption intensity selection on encryption, decryption, and key generation is explored, and the performance and security of DSB-SEIS are evaluated. The MapReduce framework is also used to investigate the DSB-SEIS algorithm performance with big data. Analysis demonstrates that the encryption intensity selection algorithm generates a manageable number of encryption keys based on the confidentiality of data while not adding significant overhead on encryption or decryption --Abstract, page iii

TIME AND SPACE COMPLEXITY ANALYSIS OF RSA AND ELGAMAL CRYPTOGRAPHIC ALGORITHMS ON MIXED DATA

The complexity study of algorithms, especially computationally intensive ones is of great significance in the field of complexity. Cryptographic algorithms are considered to be computationally intensive because they utilize a substantial number of computational resources, such as CPU memory and processing time. Cryptographic algorithms provide a solution to the security of data transmission whereby ensuring integrity, confidentiality and authentication of any form of data. However, there are still challenges of which cryptographic algorithms are suitable in terms of computation speed and memory usage. Whereas, a good number of research efforts have been put into experimenting on the complexities of the cryptographic algorithm on text, image and audio data, little has been done on video data. In this study, the time and space complexity of RSA and ElGamal cryptographic algorithms on mixed data was carried out. RSA and ElGamal cryptographic algorithms was implemented using C-sharp (C#) programming language to encrypt and decrypt text, image, audio and video dataset. In achieving the objectives of the study, both the implemented algorithms (RSA and ElGamal) are depicted using pseudocodes and flowcharts, while some of the datasets used were sourced from various online repositories. The time complexities of each dataset was obtained using the CPU internal clock while the space usage for each operations on each of the dataset was obtained using the computer internal memory. Tables and graphs was used to carry out the comparative analysis of both algorithms. The time and space complexity of RSA and ElGamal algorithms were experimented on text, image, audio and video dataset. The experimental results revealed that RSA outperformed ElGamal in terms of computational time during encryption of all categories of data. ElGamal outperformed RSA in terms of computational time during decryption of all categories of data. ElGamal algorithm outperformed RSA in terms of memory usage during encryption of all categories of data while both algorithms used relatively the same amount of space during decryption of all categories of data used. Based on the comparative analysis of the time and space complexity on both RSA and ElGamal algorithms, it was discovered that RSA is a better algorithm when it comes to time complexity, that is, RSA can be said to be a time-efficient algorithm. ElGamal algorithm performed better than RSA in the memory usage aspect, therefore the ElGamal algorithm is said to be a memory-efficient algorithm. Therefore, this study hereby recommend that other measurement metrics may be used to compare both algorithms in future works

Asymmetric reversible parametric sequences approach to design a multi-key secure multimedia proxy: theory, design and implementation.

Yeung Siu Fung.Thesis (M.Phil.)--Chinese University of Hong Kong, 2003.Includes bibliographical references (leaves 52-53).Abstracts in English and Chinese.Abstract --- p.iiAcknowledgement --- p.vChapter 1 --- Introduction --- p.1Chapter 2 --- Multi-Key Encryption Theory --- p.7Chapter 2.1 --- Reversible Parametric Sequence --- p.7Chapter 2.2 --- Implementation of ARPSf --- p.11Chapter 3 --- Multimedia Proxy: Architectures and Protocols --- p.16Chapter 3.1 --- Operations to Request and Cache Data from the Server --- p.16Chapter 3.2 --- Operations to Request Cached Data from the Multimedia Proxy --- p.18Chapter 3.3 --- Encryption Configuration Parameters (ECP) --- p.19Chapter 4 --- Extension to multi-level proxy --- p.24Chapter 5 --- Secure Multimedia Library (SML) --- p.27Chapter 5.1 --- Proxy Pre-fetches and Caches Data --- p.27Chapter 5.2 --- Client Requests Cached Data From the Proxy --- p.29Chapter 6 --- Implementation Results --- p.31Chapter 7 --- Related Work --- p.40Chapter 8 --- Conclusion --- p.42Chapter A --- Function Prototypes of Secure Multimedia Library (SML) --- p.44Chapter A.1 --- CONNECTION AND AUTHENTICATION --- p.44Chapter A.1.1 --- Create SML Session --- p.44Chapter A.1.2 --- Public Key Manipulation --- p.44Chapter A.1.3 --- Authentication --- p.45Chapter A.1.4 --- Connect and Accept --- p.46Chapter A.1.5 --- Close Connection --- p.47Chapter A.2 --- SECURE DATA TRANSMISSION --- p.47Chapter A.2.1 --- Asymmetric Reversible Parametric Sequence and En- cryption Configuration Parameters --- p.47Chapter A.2.2 --- Bulk Data Encryption and Decryption --- p.48Chapter A.2.3 --- Entire Data Encryption and Decryption --- p.49Chapter A.3 --- Secure Proxy Architecture --- p.49Chapter A.3.1 --- Proxy-Server Connection --- p.49Chapter A.3.2 --- ARPS and ECP --- p.49Chapter A.3.3 --- Initial Sever Encryption --- p.50Chapter A.3.4 --- Proxy Re-Encryption --- p.51Chapter A.3.5 --- Client Decryption --- p.51Bibliography --- p.5