21 research outputs found
Medical image encryption techniques: a technical survey and potential challenges
Among the most sensitive and important data in telemedicine systems are medical images. It is necessary to use a robust encryption method that is resistant to cryptographic assaults while transferring medical images over the internet. Confidentiality is the most crucial of the three security goals for protecting information systems, along with availability, integrity, and compliance. Encryption and watermarking of medical images address problems with confidentiality and integrity in telemedicine applications. The need to prioritize security issues in telemedicine applications makes the choice of a trustworthy and efficient strategy or framework all the more crucial. The paper examines various security issues and cutting-edge methods to secure medical images for use with telemedicine systems
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
Entropy in Image Analysis II
Image analysis is a fundamental task for any application where extracting information from images is required. The analysis requires highly sophisticated numerical and analytical methods, particularly for those applications in medicine, security, and other fields where the results of the processing consist of data of vital importance. This fact is evident from all the articles composing the Special Issue "Entropy in Image Analysis II", in which the authors used widely tested methods to verify their results. In the process of reading the present volume, the reader will appreciate the richness of their methods and applications, in particular for medical imaging and image security, and a remarkable cross-fertilization among the proposed research areas
Lightweight image encryption algorithms: design and evaluation
Doctor of PhilosophyDepartment of Computer ScienceArslan MunirIn an era dominated by increasing use of multimedia data such as images and videos, ensuring the security and confidentiality of images with real-time encryption is of greatest importance. Traditional encryption algorithms are secure, widely used, and recommended, yet they are not suitable nor computationally efficient for encrypting multimedia data due to the large size and high redundancy inherent in multimedia data. Thus, specialized algorithms for multimedia data encryption are needed. This dissertation explores lightweight image encryption algorithms, specifically designed to address time and resource constraints of realtime image encryption while maintaining the confidentiality and integrity of the multimedia data.
The dissertation classifies image encryption based on the techniques used into seven different approaches and analyzes the strengths and weaknesses of each approach. It subsequently introduces and evaluates three novel algorithms designed to encrypt images with low complexity, high efficiency, and reliable security. These algorithms rely on a combination of permutation, substitution, and pseudorandom keystreams to ensure the security of the encrypted images. The first algorithm is based on chaotic systems. The algorithm is implemented using logistic map, permutations, AES S-box, and a plaintext related SHA-2 hash. The second algorithm is based on Trivium cipher. the algorithm is implemented to work on multi-rounds of encryption using pixel-based row and column permutations, and bit-level substitution. For the third algorithm, the Ascon algorithm selected by the National Institute of Standards and Technology (NIST) to standardize lightweight cryptography applications is evaluated for image encryption.
To evaluate the proposed algorithms, a comprehensive set of security, quality, and efficiency valuation metrics is utilized to assess the proposed algorithms and compare them to contemporary image encryption algorithms
Entropy in Image Analysis III
Image analysis can be applied to rich and assorted scenarios; therefore, the aim of this recent research field is not only to mimic the human vision system. Image analysis is the main methods that computers are using today, and there is body of knowledge that they will be able to manage in a totally unsupervised manner in future, thanks to their artificial intelligence. The articles published in the book clearly show such a future
Entropy in Dynamic Systems
In order to measure and quantify the complex behavior of real-world systems, either novel mathematical approaches or modifications of classical ones are required to precisely predict, monitor, and control complicated chaotic and stochastic processes. Though the term of entropy comes from Greek and emphasizes its analogy to energy, today, it has wandered to different branches of pure and applied sciences and is understood in a rather rough way, with emphasis placed on the transition from regular to chaotic states, stochastic and deterministic disorder, and uniform and non-uniform distribution or decay of diversity. This collection of papers addresses the notion of entropy in a very broad sense. The presented manuscripts follow from different branches of mathematical/physical sciences, natural/social sciences, and engineering-oriented sciences with emphasis placed on the complexity of dynamical systems. Topics like timing chaos and spatiotemporal chaos, bifurcation, synchronization and anti-synchronization, stability, lumped mass and continuous mechanical systems modeling, novel nonlinear phenomena, and resonances are discussed
Data Hiding and Its Applications
Data hiding techniques have been widely used to provide copyright protection, data integrity, covert communication, non-repudiation, and authentication, among other applications. In the context of the increased dissemination and distribution of multimedia content over the internet, data hiding methods, such as digital watermarking and steganography, are becoming increasingly relevant in providing multimedia security. The goal of this book is to focus on the improvement of data hiding algorithms and their different applications (both traditional and emerging), bringing together researchers and practitioners from different research fields, including data hiding, signal processing, cryptography, and information theory, among others
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