Ramp secret sharing with cheater identification in presence of rushing cheaters

DOI10.1515/gcc-2019-2006zbMath1455.94218OpenAlexW2980856508WikidataQ127013093 ScholiaQ127013093MaRDI QIDQ2178751

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Detection and identification of cheaters in \((t,n)\) secret sharing scheme
• How to share a secret with cheaters
• Secret sharing schemes with detection of cheaters for a general access structure
• A perfect threshold secret sharing scheme to identify cheaters
• Cheating detectable threshold scheme against most powerful cheaters for long secrets
• Essentially Optimal Robust Secret Sharing with Maximal Corruptions
• Basic Modern Algebra with Applications
• Unconditionally-Secure Robust Secret Sharing with Compact Shares
• Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
• Almost Optimum t-Cheater Identifiable Secret Sharing Schemes
• How to share a secret
• Computationally Secure Robust Multi-secret Sharing for General Access Structure
• Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters
• Cheater Identifiable Secret Sharing Schemes via Multi-Receiver Authentication
• Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
• Optimum Secret Sharing Scheme Secure against Cheating
• 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