원문정보
초록
영어
Existing speech perceptual hashing authentication algorithms generally encrypt the perceptual hash value to protect the security of the algorithms. But under the principle of Kerckhoffs, the algorithm becomes transparent and fragile. And it can be seen that the secret key may be estimated when the number of times that reuses the secret key reache to a limit through the safety analysis of Shannon unicity distance. To solve these problems, we present a novel security authentication scheme of speech perceptual hashing based on the fuzzy commitment scheme (FCS). Firstly, in sender, the randomly selected BCH code word and the extracted perceptual hash value are sent to the Cmt() function to calculate and the final secure perceptual hash value (h(c),) can be obtained. Secondly, in receiver, the perceptual hash value is calculated again from the received speech information and then the calculated perceptual hash value with the received information (commitment) are sent to the Decmt() function to calculate to get the h(c′). Finally, the h(c) and h(c′) are matched. The experimental results show that the proposed scheme effectively avoids the probability that an attacker obtains the plaintext/ciphertext pairs without affecting the performance of original algorithm, and at the same time it ensures the security of perceptual hashing algorithm.
목차
1. Introduction
2.The Related Theory of Fuzzy Commitment Scheme
3. The Authentication Process of Speech Perceptual Hashing based on FCS
4. The Description of FCS-Based Security Authentication Scheme of Speech Perceptual Hashing
4.1. The FCS-Based Speech Perceptual Ashing Algorithm
4.2. The Performance Analysis and Comparison of Algorithm
4.3. The Security Analysis of the Algorithm
5. Conclusions
References