Cheating detectable threshold scheme against most powerful cheaters for long secrets

DOI10.1007/S10623-012-9756-5MaRDI QIDQ2448093zbMATH OpenOpenAlexFDO

Authors Wakaha Ogata, Hiroshi Eguchi

Publication date 29 April 2014

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-012-9756-5

zbMATH Keywords

cheating detectableoptimum share sizesecret sharingthreshold scheme

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters
• The Detection of Cheaters in Thershold Schemes
• Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
• Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
• Efficient cheater identification method for threshold schemes

Cites work

• Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
• Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters
• Flaws in Some Secret Sharing Schemes Against Cheating
• How to share a secret
• How to share a secret with cheaters
• scientific article; zbMATH DE number 1394319 (Why is no real title available?)
• Optimum Secret Sharing Scheme Secure against Cheating

Cited in

(3)

• Ramp secret sharing with cheater identification in presence of rushing cheaters
• Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
• Efficient cheater identification method for threshold schemes

This page was built for publication: Cheating detectable threshold scheme against most powerful cheaters for long secrets

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