Cheating detectable threshold scheme against most powerful cheaters for long secrets

DOI10.1007/s10623-012-9756-5zbMath1288.94091OpenAlexW1999517361MaRDI QIDQ2448093

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

secret sharingthreshold schemecheating detectableoptimum share size

Mathematics Subject Classification ID

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

Related Items (2)

Ramp secret sharing with cheater identification in presence of rushing cheaters ⋮ Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters

Cites Work

• Unnamed Item
• How to share a secret with cheaters
• How to share a secret
• Flaws in Some Secret Sharing Schemes Against Cheating
• Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters
• Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
• Optimum Secret Sharing Scheme Secure against Cheating

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