Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
From MaRDI portal
Publication:5459090
DOI10.1007/11935230_24zbMath1172.94623OpenAlexW2172123808MaRDI QIDQ5459090
Toshinori Araki, Satoshi Obana
Publication date: 24 April 2008
Published in: Advances in Cryptology – ASIACRYPT 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11935230_24
Related Items (8)
Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters ⋮ Cheating identifiable secret sharing scheme using symmetric bivariate polynomial ⋮ Disjoint difference families and their applications ⋮ Algebraic manipulation detection codes ⋮ Recursive hiding of biometrics-based secret sharing scheme using adversary structure ⋮ Cheating detectable threshold scheme against most powerful cheaters for long secrets ⋮ Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
This page was built for publication: Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
