Ramp secret sharing with cheater identification in presence of rushing cheaters

DOI10.1515/GCC-2019-2006MaRDI QIDQ2178751zbMATH OpenOpenAlexWikidataFDO

Authors Jyotirmoy Pramanik, Avishek Adhikari

Publication date 11 May 2020

Published in Groups - Complexity - Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/gcc-2019-2006

zbMATH Keywords

secret sharingrampcheater identificationrushing cheater

Mathematics Subject Classification ID

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

Recommendations

• Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
• On cheater identifiable secret sharing schemes secure against rushing adversary
• Cheater Identifiable Secret Sharing Schemes via Multi-Receiver Authentication
• Almost optimum \(t\)-cheater identifiable secret sharing schemes
• scientific article; zbMATH DE number 1390062

Cites work

• scientific article; zbMATH DE number 1303147 (Why is no real title available?)
• scientific article; zbMATH DE number 1030973 (Why is no real title available?)
• scientific article; zbMATH DE number 1394319 (Why is no real title available?)
• A perfect threshold secret sharing scheme to identify cheaters
• Almost optimum \(t\)-cheater identifiable secret sharing schemes
• Basic modern algebra with applications
• Cheater Identifiable Secret Sharing Schemes via Multi-Receiver Authentication
• Cheating detectable threshold scheme against most powerful cheaters for long secrets
• Computationally secure robust multi-secret sharing for general access structure
• Detection and identification of cheaters in \((t,n)\) secret sharing scheme
• Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
• Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters
• Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
• Essentially Optimal Robust Secret Sharing with Maximal Corruptions
• Hierarchical Secret Sharing Schemes Secure Against Rushing Adversary: Cheater Identification and Robustness
• How to share a secret
• How to share a secret with cheaters
• Optimum Secret Sharing Scheme Secure against Cheating
• Secret sharing schemes with detection of cheaters for a general access structure
• Unconditionally-secure robust secret sharing with compact shares

Cited in

(2)

• On cheater identifiable secret sharing schemes secure against rushing adversary
• Hierarchical Secret Sharing Schemes Secure Against Rushing Adversary: Cheater Identification and Robustness

This page was built for publication: Ramp secret sharing with cheater identification in presence of rushing cheaters

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