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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Karp, R.: The Probabilistic Analysis of Some Combinatorial Search Algorithms. Academic Press, NY (1976) Referencia cruzada de artículo Levin Venkatesan.
Wang, J.: Average-Case Intractable NP Problems. In Du, D., Ko, K., eds.: Advances in Languages, Algorithms and Complexity. Kluwer Academic Publishers (1997) 313–378
Levin, L.: Average Case Complete Problems. SIAM Journal on Computing (1986) 285–286
Venkatesan, R., Levin, L.: Random Instances of a Graph Colouring Problem are Hard. In: ACM Symposium on Theory of Computing. (1988) 217–222
Gurevich, Y.: Matrix decomposition problem is complete for the average case. In: Proc. 31stAnnual Symposium on Foundations of Computer Science, IEEE Computer Society Press (1990) 802–811
Venkatesan, R., Rajagopalan, S.: Average case intractability of diphantine and matrix problem. In: Proc. Of the 24th Annual Symposium on Theory of Computing, ACM Press (1992) 632–642
Markov, A.: Theory of algorithms. (1954)
Markov, A.: On the problem of representability of matrices. Z. Math. Logik Grundlagen Math (1958) 157–168
Ben-David, S., Chor, B., Goldreich, O., Luby, M.: On the Theory of Average Case Complexity. Journal of Computer and System Sciences 44 (1992) 193–219
Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. In: Proceedings IEEE Globecom’ 87. (1987) 99–102
Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In Goldwasser, S., ed.: Crypto’ 88, Berlin, Springer-Verlag (1989) 27–36LNCS Vol. 403.
Shamir, A.: How to share a secret? Communications of the ACM 22 (1979) 612–613
Blakely, G.R.: Safeguarding cryptographic keys. In: Proceeding of the National Computer Conference. Volume 48., AFIPS Conference Proceedings (1979) 313–317
Kothari, S.C.: Generalized linear threshold scheme. In Blakley, G.R., Chaum, D., eds.: Proceedings of Crypto’ 84, Berlin, Springer-Verlag (1985) 231–241 LNCS Vol. 196.
Freivalds, R.: Fast probabilistic algorithms. In Becvár, J., ed.: Proc. LNCS Vol. 74., Olomouc, Czechoslovakia, Springer (1979) 57–69
Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progresions. In: Proc. Nineteenth Annual ACM Symposium on Theory of Computing, New York (1987) 1–6
Karnin, G., Hellman: On secret sharing systems. IEEE Transactions on Information Theory IT-29 (1983) 35–41
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hernández-Goya, C., Caballero-Gil, P., Bruno-Castañeda, C. (2003). A Secret Sharing Scheme Using Matrices. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44842-X_10
Download citation
DOI: https://doi.org/10.1007/3-540-44842-X_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40156-8
Online ISBN: 978-3-540-44842-6
eBook Packages: Springer Book Archive