Almost optimum secret sharing with cheating detection

DOI10.1007/978-3-319-24126-5_21MaRDI QIDQ3454636zbMATH OpenOpenAlexFDO

Authors Mahabir P. Jhanwar, Reihaneh Safavi-Naini

Publication date 25 November 2015

Published in Security, Privacy, and Applied Cryptography Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-24126-5_21

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Improvements to almost optimum secret sharing with cheating detection
• On the Share Efficiency of Robust Secret Sharing and Secret Sharing with Cheating Detection
• Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
• Optimum Secret Sharing Scheme Secure against Cheating
• Almost optimum \(t\)-cheater identifiable secret sharing schemes

Cited in

(12)

• Almost optimum secret sharing schemes with cheating detection for random bit strings
• Improvements to almost optimum secret sharing with cheating detection
• scientific article; zbMATH DE number 1612522 (Why is no real title available?)
• Essentially Optimal Robust Secret Sharing with Maximal Corruptions
• On the Share Efficiency of Robust Secret Sharing and Secret Sharing with Cheating Detection
• Optimum Secret Sharing Scheme Secure against Cheating
• Almost optimum \(t\)-cheater identifiable secret sharing schemes
• Cheating detectable secret sharing schemes supporting an arbitrary finite field
• Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
• Leakage Resilient Cheating Detectable Secret Sharing Schemes
• Lower bounds on the share size of leakage resilient cheating detectable secret sharing
• Two cooperative versions of the guessing secrets problem

This page was built for publication: Almost optimum secret sharing with cheating detection

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