Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
From MaRDI portal
Publication:2953805
DOI10.1007/978-3-319-49175-2_1zbMath1407.94166OpenAlexW2400515275MaRDI QIDQ2953805
Avishek Adhikari, Satoshi Obana, Kouichi Sakurai, Partha Sarathi Roy, Rui Xu, Kirill Morozov
Publication date: 6 January 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-49175-2_1
Reed-Solomon codesecret sharingcheating detectionuniversal hashcheater identificationrushing cheaters
Related Items (3)
Ramp secret sharing with cheater identification in presence of rushing cheaters ⋮ Hierarchical Secret Sharing Schemes Secure Against Rushing Adversary: Cheater Identification and Robustness ⋮ Quantum verifiable protocol for secure modulo zero-sum randomness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to share a secret with cheaters
- New hash functions and their use in authentication and set equality
- 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
- Identifying Cheaters without an Honest Majority
- Almost Optimum t-Cheater Identifiable Secret Sharing Schemes
- How to share a secret
- On Cheater Identifiable Secret Sharing Schemes Secure against Rushing Adversary
- Flaws in Some Secret Sharing Schemes Against Cheating
- Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters
- Cheater Identifiable Secret Sharing Schemes via Multi-Receiver Authentication
- Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
- Optimum Secret Sharing Scheme Secure against Cheating
- Brief announcement
This page was built for publication: Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
