Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters
From MaRDI portal
Publication:3608911
DOI10.1007/978-3-540-73458-1_11zbMATH Open1213.94148OpenAlexW1596090937MaRDI QIDQ3608911FDOQ3608911
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
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 (22)
- Algorithms for detecting cheaters in threshold schemes
- The Detection of Cheaters in Thershold Schemes
- A secret sharing scheme with a short share realizing the \((t,n)\) threshold and the adversary structure
- Cheating-tolerant and threshold-based secure information exchange among propinquity of adversaries
- Comments on Harn-Lin's cheating detection scheme
- Secret sharing using near-MDS codes
- Detection and identification of cheaters in \((t,n)\) secret sharing scheme
- Flaws in Some Secret Sharing Schemes Against Cheating
- \((t,n)\) threshold multiple secret sharing scheme on ellipse curve
- A \((t, n)\) threshold secret sharing system with efficient identification of cheaters
- Optimum Secret Sharing Scheme Secure against Cheating
- A shadow-exchanged protocol of cheating prevention for the \((t,n)\) threshold scheme
- Leakage Resilient Cheating Detectable Secret Sharing Schemes
- Research of \((t,n)\) secret sharing scheme against active cheating
- Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
- Title not available (Why is that?)
- Ramp secret sharing with cheater identification in presence of rushing cheaters
- Title not available (Why is that?)
- Cheating detectable threshold scheme against most powerful cheaters for long secrets
- Information Security and Cryptology - ICISC 2003
- Title not available (Why is that?)
- On the Share Efficiency of Robust Secret Sharing and Secret Sharing with Cheating Detection
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)