Perfectly secure message transmission
Journal of the ACM (JACM)
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
On sharing secrets and Reed-Solomon codes
Communications of the ACM
Communications of the ACM
Efficient Sharing of Many Secrets
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
General Adversaries in Unconditional Multi-party Computation
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Cumulative Arrays and Geometric Secret Sharing Schemes
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Optimum Secret Sharing Scheme Secure against Cheating
SIAM Journal on Discrete Mathematics
Robust computational secret sharing and a unified account of classical secret-sharing goals
Proceedings of the 14th ACM conference on Computer and communications security
Verifiable secret sharing and achieving simultaneity in the presence of faults
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Secure multi-party computation made simple
Discrete Applied Mathematics - Special issue: Coding and cryptography
General secure multi-party computation from any linear secret-sharing scheme
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Towards optimal and efficient perfectly secure message transmission
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Efficient fuzzy matching and intersection on private datasets
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Almost optimum secret sharing schemes secure against cheating for arbitrary secret distribution
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On codes, matroids and secure multi-party computation from linear secret sharing schemes
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Algebraic geometric secret sharing schemes and secure multi-party computations over small fields
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Recursive hiding of biometrics-based secret sharing scheme using adversary structure
Information Processing Letters
A simple combinatorial treatment of constructions and threshold gaps of ramp schemes
Cryptography and Communications
| Hi-index | 0.00 |
An error decodable secret-sharing scheme is a secret-sharing scheme with the additional property that the secret can be recovered from the set of all shares, even after a coalition of participants corrupts the shares they possess. In this paper, schemes that can tolerate corruption by sets of participants belonging to a monotone coalition structure are considered. This coalition structure may be unrelated to the authorised sets of the secret-sharing scheme. This is generalisation of both a related notion studied in the context of multiparty computation, and the well-known error-correction properties of threshold schemes based on Reed-Solomon codes. Necessary and sufficient conditions for the existence of such schemes are deduced, and methods for reducing the storage requirements of a technique of Kurosawa for constructing error-decodable secret-sharing schemes with efficient decoding algorithms are demonstrated. In addition, the connection between one-round perfectly secure message transmission (PSMT) schemes with general adversary structures and secret-sharing schemes is explored. We prove a theorem that explicitly shows the relation between these structures. In particular, an error decodable secret-sharing scheme yields a one-round PSMT, but the converse does not hold. Furthermore, we are able to show that some well-known results concerning one-round PSMT follow from known results on secret-sharing schemes. These connections are exploited to investigate factors affecting the performance of one-round PSMT schemes such as the number of channels required, the communication overhead, and the efficiency of message recovery.