Article ID Journal Published Year Pages File Type
427637 Information Processing Letters 2012 5 Pages PDF
Abstract

This paper first investigates the applications of recursive hiding of secret, which was originally proposed for visual cryptography to space efficient secret sharing, and then provides a novel recursive hiding of biometrics-based secret sharing scheme using adversary structure. The proposed scheme may find applications for sharing secrets with excess bits, especially in the scenarios where resources are strictly limited and the requirement of verification is demanding. Existing ways of combiner verification always just rely on exponentiation or only by hiring one-way hash function, which cannot thwart the stolen share attack, spoofing attack or discriminate an imposter who fraudulently obtains the access privileges from the genuine participant. Nonetheless, these problems can be tackled by the unique property of biometrics in our paper. Most importantly, unlike most counterpart schemes, no other random numbers are used to protect the secret pieces, hence, our scheme is simpler and more efficient, and the computation cost is relatively low.

► The proposed scheme may find applications for sharing secrets with excess bits and demanding verification. ► The proposed scheme applies the hash function to secret pieces directly instead of using random numbers to hide them. ► Proposed scheme can resist stolen shares attack and spoofing attack, and provide non-repudiation because of the characteristic of personal biometrics.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, , , ,