A secret sharing scheme using matrices

Authors:
Candelaria Hernández-Goya;Pino Caballero-Gil;Carlos Bruno-Castañeda
Affiliations:
Dept. Statistics, Operations Research and Computing, Universidad de La Laguna, La Laguna, Tenerife, Spain;Dept. Statistics, Operations Research and Computing, Universidad de La Laguna, La Laguna, Tenerife, Spain;Dept. Statistics, Operations Research and Computing, Universidad de La Laguna, La Laguna, Tenerife, Spain
Venue:
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Year:
2003

Citing 9
Cited 0

Average case complete problems

SIAM Journal on Computing
Generalized linear threshold scheme

Proceedings of CRYPTO 84 on Advances in cryptology
Matrix multiplication via arithmetic progressions

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Random instances of a graph coloring problem are hard

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Average case intractability of matrix and diophantine problems (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the theory of average case complexity

Journal of Computer and System Sciences
How to share a secret

Communications of the ACM
Generalized Secret Sharing and Monotone Functions

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Matrix decomposition problem is complete for the average case

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work includes the description of a new multiparty protocol devoted to the sharing of secrets whose main application is key distribution. The particularity of this scheme consists of its basis on a problem classified as DistNP - Complete under the average-case analysis, the so called Distributional Matrix Representability Problem. One of the most critical questions in Cryptography is referred to the misunderstanding equivalence between using a difficult problem as basis of a cryptographic application and its security. Problems belonging to NP according to the worst-case analysis are frequently used in Cryptography but when random generated instances are used, then many times there are fast an efficient algorithms to solve them. So, using the search version of the Distributional Matrix Representability problem we guarantee the security of the proposed scheme.