#|
In a typical care house in japan, elders gathers around in a public floor to chat with others. However, what happens if they just do not want to talk and refuse to socialize?
The health of elders weakens every time when they stop trying to get out of bed. Most likely, silver industry in Japan is growing fast and elderly issues are brought up to the surface.
In Japan, where there are not enough space for residents, people tend minimize their living space. For elders, unfortunately, they are sent to a care house where people live together to get a help from a nursery.
Pradnya Khobragade. A short summary of this paper. Instead of using In an audio secret sharing scheme, the shares are created by sound interference, focus is on using two types of flat embedding the secret message into an audio file.
The audio or frequencies beeps : the short beep and the long beep. This the music file which is used to embed the given message is kind of sound is similar to a Morse code signal [8].
Dealer called cover sound. A 2-out-of-2 audio cryptography is a represents m-bit secret binary message as a short-beep long- secret sharing scheme that can be used to hide a digital beep audio signal S. For every bit, dealer tosses a coin message into 2 shares and we can perceive the message by playing these 2 sounds simultaneously. In this paper a new 2, depending on the outcome, the beep is shared in two shares. The proposed Mohammad Ehdaie et al.
They had scheme hides a digital secret message into two audio files. Audio share files are thus created and audio secret is obtained only by playing k shares, simultaneously, each of Keywords this is amplified by a certain coefficient. Actually in this Cryptography, Threshold Scheme scheme they had divided audio file into small intervals referring to the ith interval as Ai. Secret sharing was The threshold scheme is helpful in the management of first introduced by Blakley [2] and Shamir [3] in , cryptographic keys.
The most secure key management scheme independently. In , Naor and Shamir proposed a new k, keeps the key in a single, well secured place but this scheme n threshold visual secret sharing scheme [4], in which visual is highly unreliable since a single misfortune can make the secret is reconstructed back without any computation. If sufficient numbers of shares are sound represent the sound used to hide the data. On the other come together we will get the original key or password.
Desmedt et al. Then to encrypt the plaintext message S, by their 2, 2 ASS scheme using [log2n] different cover sounds. Destructive interference results half, in every time slot Tb, and fixed amplitude A. The changes in the sound volume reveal the secret binary message, in the sense that the high volume segment When adding both the shares particularly by playing different corresponds to 1 and the low volume segment corresponds to sounds from two speakers, we will get the amplitude 2A in 0.
Finally, we are Daniel Socek in proposed a new type of cryptographic able to hear the volume change and recover the secret S. Bits per sample are 16 that indicate16 bits are required for storing sample data for each channel. The value of bits per sample may be 8, 16, 24 or The samples of each channel are consecutively store. If the number of channel is 1 means sound is mono and sample data is continuously store.
This scheme is based on audio distribution among different channel as in this case we are implementing for two channel wave file.
We divide the process in two parts. First part consists of encryption process or the shares construction and other part is the decryption Figure 2: 2-out-of-2 audio cryptography scheme process or the shares reconstruction.
Following is the algorithm for the encryption process and is illustrated in the 3. The proposed scheme is based on audio distribution among different channel.
0コメント