Optimum Secret Sharing Scheme Secure against Cheating
From MaRDI portal
Publication:5470818
DOI10.1137/S0895480100378689zbMath1119.94011OpenAlexW2041864238MaRDI QIDQ5470818
Wakaha Ogata, Kaoru Kurosawa, Douglas R. Stinson
Publication date: 1 June 2006
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480100378689
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Authentication, digital signatures and secret sharing (94A62)
Related Items (10)
Cheating-immune secret sharing schemes from codes and cumulative arrays ⋮ Ramp secret sharing with cheater identification in presence of rushing cheaters ⋮ Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters ⋮ Cheating identifiable secret sharing scheme using symmetric bivariate polynomial ⋮ Disjoint difference families and their applications ⋮ 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 ⋮ On the equivalence of authentication codes and robust (2, 2)-threshold schemes ⋮ Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families ⋮ Detection and identification of cheaters in \((t,n)\) secret sharing scheme
This page was built for publication: Optimum Secret Sharing Scheme Secure against Cheating
