Comments on Harn-Lin's cheating detection scheme

DOI10.1007/S10623-010-9416-6zbMATH Open1215.94075OpenAlexW2037195660MaRDI QIDQ540475FDOQ540475

Authors: Hossein Ghodosi 

Publication date: 3 June 2011

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

Full work available at URL: https://doi.org/10.1007/s10623-010-9416-6

Recommendations

• The Detection of Cheaters in Thershold Schemes
• Efficient cheater identification method for threshold schemes
• scientific article; zbMATH DE number 1390062
• Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters
• A \((t, n)\) threshold secret sharing system with efficient identification of cheaters

zbMATH Keywords

cheaters identificationcheating detectionthreshold secret sharing schemes

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Introduction to algorithms
• How to share a secret
• How to share a secret with cheaters
• Detection and identification of cheaters in \((t,n)\) secret sharing scheme
• Title not available (Why is that?)

Cited In (1)

• Cheating identifiable secret sharing scheme using symmetric bivariate polynomial

This page was built for publication: Comments on Harn-Lin's cheating detection scheme

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