Cheater identification on a secret sharing scheme using GCD

DOI10.1145/2016567.2016585zbMATH Open1306.94104OpenAlexW2041223547MaRDI QIDQ5175296FDOQ5175296

Authors: Shigenobu Inoue, Hiroshi Kai 

Publication date: 20 February 2015

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2016567.2016585

Recommendations

• Detection and identification of cheaters in \((t,n)\) secret sharing scheme
• scientific article; zbMATH DE number 697808
• Cheater Identifiable Secret Sharing Schemes via Multi-Receiver Authentication
• Detection of cheaters in vector space secret sharing schemes
• A perfect threshold secret sharing scheme to identify cheaters
• On cheater identifiable secret sharing schemes secure against rushing adversary
• Secret sharing schemes with detection of cheaters for a general access structure
• scientific article; zbMATH DE number 1390062
• Cheating detectable secret sharing schemes supporting an arbitrary finite field
• A \((t, n)\) threshold secret sharing system with efficient identification of cheaters

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Authentication, digital signatures and secret sharing (94A62)

Cited In (5)

• Detection and identification of cheaters in \((t,n)\) secret sharing scheme
• Cheater Identifiable Secret Sharing Schemes via Multi-Receiver Authentication
• Cheating identifiable secret sharing scheme using symmetric bivariate polynomial
• How to avoid the cheaters succeeding in the key sharing scheme
• Title not available (Why is that?)

This page was built for publication: Cheater identification on a secret sharing scheme using GCD

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