Recursive hiding of biometrics-based secret sharing scheme using adversary structure

Authors:
Hong Lai;Jinghua Xiao;Lixiang Li;Yixian Yang
Affiliations:
School of Science, Beijing University of Posts and Telecommunications, Beijing 100876, China and Information Security Center, Beijing University of Posts and Telecommunications, Beijing 100876, Ch ...;School of Science, Beijing University of Posts and Telecommunications, Beijing 100876, China;Information Security Center, Beijing University of Posts and Telecommunications, Beijing 100876, China and National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of P ...;Information Security Center, Beijing University of Posts and Telecommunications, Beijing 100876, China and National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of P ...
Venue:
Information Processing Letters
Year:
2012

Citing 13
Cited 0

Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Secret-sharing with a class of ternary codes

Theoretical Computer Science
How to share a secret

Communications of the ACM
Recursive hiding of secrets in visual cryptography

Cryptologia
Enhancing security and privacy in biometrics-based authentication systems

IBM Systems Journal - End-to-end security
Practical secret sharing scheme realizing generalized adversary structure

Journal of Computer Science and Technology
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries

SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
An efficient biometrics-based remote user authentication scheme using smart cards

Journal of Network and Computer Applications
A secret sharing scheme based on (t, n) threshold and adversary structure

International Journal of Information Security
Space efficient secret sharing for implicit data security

Information Sciences: an International Journal
An ideal multi-secret sharing scheme based on MSP

Information Sciences: an International Journal
Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures

Cryptography and Communications
Almost optimum secret sharing schemes secure against cheating for arbitrary secret distribution

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security

Quantified Score

Hi-index	0.89

Visualization

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.