A secret sharing scheme with a short share realizing the (t,n) threshold and the adversary structure

DOI10.1016/J.CAMWA.2011.12.067zbMATH Open1252.94118OpenAlexW2031137116MaRDI QIDQ692299FDOQ692299

Dawei Zhao, Yi-Xian Yang, Haipeng Peng, Cong Wang

Publication date: 4 December 2012

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2011.12.067

Recommendations

• An efficient \((t,n)\) threshold multi-secret sharing scheme
• A New (k,n)-Threshold Secret Sharing Scheme and Its Extension
• A scheme for threshold multi-secret sharing
• Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters
• A \((t,n)\) multi-secret sharing scheme
• A \((t, n)\) threshold secret sharing system with efficient identification of cheaters
• Analysis on a dynamic \( (t,n)\) threshold multi-secret sharing scheme
• A verifiable threshold multi-secret sharing scheme
• Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters

zbMATH Keywords

thresholdsecret sharingadversary structureshort share

Mathematics Subject Classification ID

Applications of game theory (91A80) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• How to share a secret
• Title not available (Why is that?)
• An efficient construction of perfect secret sharing schemes for graph-based structures

Cited In (2)

• A novel secret sharing scheme based on minimal linear codes
• An Ideal and Perfect (t, n) Multi-secret Sharing Scheme Based on Finite Geometry

This page was built for publication: A secret sharing scheme with a short share realizing the \((t,n)\) threshold and the adversary structure

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