Algorithms for detecting cheaters in threshold schemes

MaRDI QIDQ5442511zbMATH OpenFDO

Authors Sheng Zhang, D. R. Stinson

Publication date 22 February 2008

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Information Security and Cryptology - ICISC 2003
• A (t, n) threshold secret sharing system with efficient identification of cheaters
• Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters
• The Detection of Cheaters in Thershold Schemes
• How to avoid the cheaters succeeding in the key sharing scheme

Cited in

(3)

• How and how much to invest for fighting cheaters: from an ODE to a cellular automata model
• Information Security and Cryptology - ICISC 2003
• Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures

This page was built for publication: Algorithms for detecting cheaters in threshold schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5442511)