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

Oblivious data hiding : a practical approach

This dissertation presents an in-depth study of oblivious data hiding with the emphasis on quantization based schemes. Three main issues are specifically addressed: 1. Theoretical and practical aspects of embedder-detector design. 2. Performance evaluation, and analysis of performance vs. complexity tradeoffs. 3. Some application specific implementations. A communications framework based on channel adaptive encoding and channel independent decoding is proposed and interpreted in terms of oblivious data hiding problem. The duality between the suggested encoding-decoding scheme and practical embedding-detection schemes are examined. With this perspective, a formal treatment of the processing employed in quantization based hiding methods is presented. In accordance with these results, the key aspects of embedder-detector design problem for practical methods are laid out, and various embedding-detection schemes are compared in terms of probability of error, normalized correlation, and hiding rate performance merits assuming AWGN attack scenarios and using mean squared error distortion measure. The performance-complexity tradeoffs available for large and small embedding signal size (availability of high bandwidth and limitation of low bandwidth) cases are examined and some novel insights are offered. A new codeword generation scheme is proposed to enhance the performance of low-bandwidth applications. Embeddingdetection schemes are devised for watermarking application of data hiding, where robustness against the attacks is the main concern rather than the hiding rate or payload. In particular, cropping-resampling and lossy compression types of noninvertible attacks are considered in this dissertation work

Digital video watermarking techniques for secure multimedia creation and delivery.

Chan Pik-Wah.Thesis (M.Phil.)--Chinese University of Hong Kong, 2004.Includes bibliographical references (leaves 111-130).Abstracts in English and Chinese.Abstract --- p.iAcknowledgement --- p.ivChapter 1 --- Introduction --- p.1Chapter 1.1 --- Background --- p.1Chapter 1.2 --- Research Objective --- p.3Chapter 1.3 --- Contributions --- p.4Chapter 1.4 --- The Structure of this Thesis --- p.6Chapter 2 --- Literature Review --- p.7Chapter 2.1 --- Security in Multimedia Communications --- p.8Chapter 2.2 --- Cryptography --- p.11Chapter 2.3 --- Digital Watermarking --- p.14Chapter 2.4 --- Essential Ingredients for Video Watermarking --- p.16Chapter 2.4.1 --- Fidelity --- p.16Chapter 2.4.2 --- Robustness --- p.17Chapter 2.4.3 --- Use of Keys --- p.19Chapter 2.4.4 --- Blind Detection --- p.20Chapter 2.4.5 --- Capacity and Speed --- p.20Chapter 2.4.6 --- Statistical Imperceptibility --- p.21Chapter 2.4.7 --- Low Error Probability --- p.21Chapter 2.4.8 --- Real-time Detector Complexity --- p.21Chapter 2.5 --- Review on Video Watermarking Techniques --- p.22Chapter 2.5.1 --- Video Watermarking --- p.25Chapter 2.5.2 --- Spatial Domain Watermarks --- p.26Chapter 2.5.3 --- Frequency Domain Watermarks --- p.30Chapter 2.5.4 --- Watermarks Based on MPEG Coding Struc- tures --- p.35Chapter 2.6 --- Comparison between Different Watermarking Schemes --- p.38Chapter 3 --- Novel Watermarking Schemes --- p.42Chapter 3.1 --- A Scene-based Video Watermarking Scheme --- p.42Chapter 3.1.1 --- Watermark Preprocess --- p.44Chapter 3.1.2 --- Video Preprocess --- p.46Chapter 3.1.3 --- Watermark Embedding --- p.48Chapter 3.1.4 --- Watermark Detection --- p.50Chapter 3.2 --- Theoretical Analysis --- p.52Chapter 3.2.1 --- Performance --- p.52Chapter 3.2.2 --- Capacity --- p.56Chapter 3.3 --- A Hybrid Watermarking Scheme --- p.60Chapter 3.3.1 --- Visual-audio Hybrid Watermarking --- p.61Chapter 3.3.2 --- Hybrid Approach with Different Water- marking Schemes --- p.69Chapter 3.4 --- A Genetic Algorithm-based Video Watermarking Scheme --- p.73Chapter 3.4.1 --- Watermarking Scheme --- p.75Chapter 3.4.2 --- Problem Modelling --- p.76Chapter 3.4.3 --- Chromosome Encoding --- p.79Chapter 3.4.4 --- Genetic Operators --- p.80Chapter 4 --- Experimental Results --- p.85Chapter 4.1 --- Test on Robustness --- p.85Chapter 4.1.1 --- Experiment with Frame Dropping --- p.87Chapter 4.1.2 --- Experiment with Frame Averaging and Sta- tistical Analysis --- p.89Chapter 4.1.3 --- Experiment with Lossy Compression --- p.90Chapter 4.1.4 --- Test of Robustness with StirMark 4.0 --- p.92Chapter 4.1.5 --- Overall Comparison --- p.98Chapter 4.2 --- Test on Fidelity --- p.100Chapter 4.2.1 --- Parameter(s) Setting --- p.101Chapter 4.2.2 --- Evaluate with PSNR --- p.101Chapter 4.2.3 --- Evaluate with MAD --- p.102Chapter 4.3 --- Other Features of the Scheme --- p.105Chapter 4.4 --- Conclusion --- p.106Chapter 5 --- Conclusion --- p.108Bibliography --- p.11

Modeling and Simulation in Engineering

The general aim of this book is to present selected chapters of the following types: chapters with more focus on modeling with some necessary simulation details and chapters with less focus on modeling but with more simulation details. This book contains eleven chapters divided into two sections: Modeling in Continuum Mechanics and Modeling in Electronics and Engineering. We hope our book entitled "Modeling and Simulation in Engineering - Selected Problems" will serve as a useful reference to students, scientists, and engineers

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

Unmasking Clever Hans Predictors and Assessing What Machines Really Learn

Current learning machines have successfully solved hard application problems, reaching high accuracy and displaying seemingly "intelligent" behavior. Here we apply recent techniques for explaining decisions of state-of-the-art learning machines and analyze various tasks from computer vision and arcade games. This showcases a spectrum of problem-solving behaviors ranging from naive and short-sighted, to well-informed and strategic. We observe that standard performance evaluation metrics can be oblivious to distinguishing these diverse problem solving behaviors. Furthermore, we propose our semi-automated Spectral Relevance Analysis that provides a practically effective way of characterizing and validating the behavior of nonlinear learning machines. This helps to assess whether a learned model indeed delivers reliably for the problem that it was conceived for. Furthermore, our work intends to add a voice of caution to the ongoing excitement about machine intelligence and pledges to evaluate and judge some of these recent successes in a more nuanced manner.Comment: Accepted for publication in Nature Communication

Cyber Security

This open access book constitutes the refereed proceedings of the 17th International Annual Conference on Cyber Security, CNCERT 2021, held in Beijing, China, in AJuly 2021. The 14 papers presented were carefully reviewed and selected from 51 submissions. The papers are organized according to the following topical sections: ​data security; privacy protection; anomaly detection; traffic analysis; social network security; vulnerability detection; text classification