Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters

DOI10.1007/978-3-540-73458-1_11MaRDI QIDQ3608911zbMATH OpenOpenAlexFDO

Authors Toshinori Araki

Publication date 6 March 2009

Published in Information Security and Privacy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73458-1_11

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Optimum Secret Sharing Scheme Secure against Cheating
• scientific article; zbMATH DE number 1030973
• Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
• Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
• Optimum Secret Sharing Scheme Secure against Cheating

Cited in

(24)

• Detection and identification of cheaters in \((t,n)\) secret sharing scheme
• Ramp secret sharing with cheater identification in presence of rushing cheaters
• Secret sharing using near-MDS codes
• Cheating detectable threshold scheme against most powerful cheaters for long secrets
• On the Share Efficiency of Robust Secret Sharing and Secret Sharing with Cheating Detection
• Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
• Efficient cheater identification method for threshold schemes
• A shadow-exchanged protocol of cheating prevention for the (t,n) threshold scheme
• A (t, n) threshold secret sharing system with efficient identification of cheaters
• Flaws in Some Secret Sharing Schemes Against Cheating
• Research of (t,n) secret sharing scheme against active cheating
• The Detection of Cheaters in Thershold Schemes
• scientific article; zbMATH DE number 1030973 (Why is no real title available?)
• scientific article; zbMATH DE number 1950617 (Why is no real title available?)
• scientific article; zbMATH DE number 1980983 (Why is no real title available?)
• Cheating-tolerant and threshold-based secure information exchange among propinquity of adversaries
• Comments on Harn-Lin's cheating detection scheme
• Algorithms for detecting cheaters in threshold schemes
• (t,n) threshold multiple secret sharing scheme on ellipse curve
• Optimum Secret Sharing Scheme Secure against Cheating
• Information Security and Cryptology - ICISC 2003
• scientific article; zbMATH DE number 5180844 (Why is no real title available?)
• Leakage Resilient Cheating Detectable Secret Sharing Schemes
• A secret sharing scheme with a short share realizing the \((t,n)\) threshold and the adversary structure

This page was built for publication: Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters

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