Compressive Audio Blakley Secret Sharing Using Transform Coding

The increased use of computer and internet had been associated with the wide use of multimedia data. The need for protecting these data has risen dramatically. To prevent the confidential information from being tampered with, one needs to apply some cryptographic techniques. Most of cryptographic methods have one similar weak point which is the data is centralized. To overcome this problem secret sharing was introduced. In this book compressive audio secret sharing based on transform coding and hyper-planes representation have been introduced. The introduced compressive secret sharing scheme consists of three stages. In the first stage, an appropriate transform (Discrete Cosine Transform, Wavelet, or Combined transform) have been applied to de-correlate the audio samples. The second stage is feeding the output (i.e., compressed audio data) to the diffusion scheme; which is applied to remove any statistical redundancy or bits significant attribute that may exist in the compression stream. The third stage is the (k, n) threshold secret sharing scheme, where n is the number of generated shares and k is the minimum required shares for revealing.

Autorentext

Zainab Talib Al-ars: Born in 1984, both B.Sc. (2006) and M.Sc. (2014) Degrees in Computer Science were obtained from University of Baghdad (Iraq). She is currently an Assistant Lecturer at College of Science, University of Baghdad. Research interests: Audio Compression, Cryptography, Multimedia Processing.