Cheating detectable secret sharing schemes supporting an arbitrary finite field

DOI10.1007/978-3-319-09843-2_7MaRDI QIDQ5253629zbMATH OpenOpenAlexFDO

Authors Satoshi Obana, Kazuya Tsuchida

Publication date 27 May 2015

Published in Advances in Information and Computer Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09843-2_7

zbMATH Keywords

cheating detectionfinite fieldsecret sharing

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Almost optimum secret sharing schemes with cheating detection for random bit strings
• Improvements to almost optimum secret sharing with cheating detection
• Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
• Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
• Almost optimum secret sharing with cheating detection

Cited in

(5)

• Almost optimum secret sharing schemes with cheating detection for random bit strings
• A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme
• scientific article; zbMATH DE number 1390062 (Why is no real title available?)
• Cheater identification on a secret sharing scheme using GCD
• Disjoint difference families and their applications

This page was built for publication: Cheating detectable secret sharing schemes supporting an arbitrary finite field

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