Detection and identification of cheaters in \((t,n)\) secret sharing scheme

DOI10.1007/s10623-008-9265-8zbMath1237.94109OpenAlexW2062046804MaRDI QIDQ1009167

Lein Harn, Changlu Lin

Publication date: 31 March 2009

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

Full work available at URL: https://doi.org/10.1007/s10623-008-9265-8

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (8)

Cheating-Tolerant and Threshold-Based Secure Information Exchange Among Propinquity of Adversaries ⋮ Ramp secret sharing with cheater identification in presence of rushing cheaters ⋮ Cheating identifiable secret sharing scheme using symmetric bivariate polynomial ⋮ UNCONDITIONALLY SECURE FAIR (t-n)-SECRET SHARING SCHEME ⋮ Comments on Harn-Lin's cheating detection scheme ⋮ Unnamed Item ⋮ Generalized Secret Sharing Schemes Using N$$^\mu $$MDS Codes ⋮ Dynamic threshold secret reconstruction and its application to the threshold cryptography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to share a secret with cheaters
• Shared secret reconstruction
• A perfect threshold secret sharing scheme to identify cheaters
• How to share a secret
• Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters
• The Detection of Cheaters in Thershold Schemes
• Dynamic Threshold and Cheater Resistance for Shamir Secret Sharing Scheme
• Optimum Secret Sharing Scheme Secure against Cheating

This page was built for publication: Detection and identification of cheaters in \((t,n)\) secret sharing scheme