Ramp secret sharing with cheater identification in presence of rushing cheaters
From MaRDI portal
Publication:2178751
DOI10.1515/GCC-2019-2006zbMATH Open1455.94218OpenAlexW2980856508WikidataQ127013093 ScholiaQ127013093MaRDI QIDQ2178751FDOQ2178751
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
Cites Work
- How to share a secret
- How to share a secret with cheaters
- Title not available (Why is that?)
- Title not available (Why is that?)
- A perfect threshold secret sharing scheme to identify cheaters
- Basic Modern Algebra with Applications
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Detection and identification of cheaters in \((t,n)\) secret sharing scheme
- Optimum Secret Sharing Scheme Secure against Cheating
- Secret sharing schemes with detection of cheaters for a general access structure
- Essentially Optimal Robust Secret Sharing with Maximal Corruptions
- Unconditionally-Secure Robust Secret Sharing with Compact Shares
- Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
- Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters
- Almost Optimum t-Cheater Identifiable Secret Sharing Schemes
- Cheater Identifiable Secret Sharing Schemes via Multi-Receiver Authentication
- Title not available (Why is that?)
- Cheating detectable threshold scheme against most powerful cheaters for long secrets
- Computationally Secure Robust Multi-secret Sharing for General Access Structure
- Hierarchical Secret Sharing Schemes Secure Against Rushing Adversary: Cheater Identification and Robustness
Cited In (1)
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)
