Recursive hiding of biometrics-based secret sharing scheme using adversary structure
From MaRDI portal
Publication:456087
DOI10.1016/J.IPL.2012.06.006zbMath1250.94057OpenAlexW2071914424WikidataQ57631874 ScholiaQ57631874MaRDI QIDQ456087
Lixiang Li, Hong Lai, Jinghua Xiao, Yi-Xian Yang
Publication date: 23 October 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.06.006
Cites Work
- An ideal multi-secret sharing scheme based on MSP
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
- An efficient multi-use multi-secret sharing scheme based on hash function
- Secret-sharing with a class of ternary codes
- Recursive constructions for perfect secret sharing schemes
- Player simulation and general adversary structures in perfect multiparty computation
- How to share a secret
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
- Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
This page was built for publication: Recursive hiding of biometrics-based secret sharing scheme using adversary structure