Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters

DOI10.1007/978-3-319-49175-2_1MaRDI QIDQ2953805zbMATH OpenOpenAlexFDO

Authors Avishek Adhikari, Kirill E. Morozov, Satoshi Obana, Partha Sarathi Roy, Kouichi Sakurai, Rui Xu

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

zbMATH Keywords

cheater identificationcheating detectionReed-Solomon coderushing cheaterssecret sharinguniversal hash

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters
• An efficient (t,n) threshold multi-secret sharing scheme
• A (t, n) threshold secret sharing system with efficient identification of cheaters
• On cheater identifiable secret sharing schemes secure against rushing adversary
• A scheme for threshold multi-secret sharing
• Robust secret sharing with almost optimal share size and security against rushing adversaries
• Hierarchical Secret Sharing Schemes Secure Against Rushing Adversary: Cheater Identification and Robustness
• A verifiable threshold multi-secret sharing scheme
• An efficient threshold multi-group-secret sharing scheme
• Towards optimal robust secret sharing with security against a rushing adversary

Cites work

• A perfect threshold secret sharing scheme to identify cheaters
• Almost optimum \(t\)-cheater identifiable secret sharing schemes
• Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
• Brief announcement: Optimal amortized secret sharing with cheater identification
• Cheater Identifiable Secret Sharing Schemes via Multi-Receiver Authentication
• Cheating detectable threshold scheme against most powerful cheaters for long secrets
• Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters
• Flaws in Some Secret Sharing Schemes Against Cheating
• How to share a secret
• How to share a secret with cheaters
• scientific article; zbMATH DE number 1583793 (Why is no real title available?)
• scientific article; zbMATH DE number 1030973 (Why is no real title available?)
• scientific article; zbMATH DE number 1842509 (Why is no real title available?)
• Identifying cheaters without an honest majority
• New hash functions and their use in authentication and set equality
• On cheater identifiable secret sharing schemes secure against rushing adversary
• Optimum Secret Sharing Scheme Secure against Cheating
• Secret sharing schemes with detection of cheaters for a general access structure

Cited in

(14)

• Evolving secret sharing: dynamic thresholds and robustness
• Quantum verifiable protocol for secure modulo zero-sum randomness
• Ramp secret sharing with cheater identification in presence of rushing cheaters
• Cheating detectable threshold scheme against most powerful cheaters for long secrets
• scientific article; zbMATH DE number 1588486 (Why is no real title available?)
• Almost optimum \(t\)-cheater identifiable secret sharing schemes
• Efficient cheater identification method for threshold schemes
• On cheater identifiable secret sharing schemes secure against rushing adversary
• An LWE-based verifiable threshold secret sharing scheme
• Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters
• Cheating detectable secret sharing schemes supporting an arbitrary finite field
• Hierarchical Secret Sharing Schemes Secure Against Rushing Adversary: Cheater Identification and Robustness
• A dynamic secret sharing scheme with cheater detection
• A secret sharing scheme with a short share realizing the \((t,n)\) threshold and the adversary structure

This page was built for publication: Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters

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