Skip to main content
SpringerLink
Log in

A Secret Sharing Scheme Using Matrices

  • Conference paper
  • First Online:
Computational Science and Its Applications — ICCSA 2003 (ICCSA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2669))

Included in the following conference series:

  • 1463 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Karp, R.: The Probabilistic Analysis of Some Combinatorial Search Algorithms. Academic Press, NY (1976) Referencia cruzada de artículo Levin Venkatesan.

    Google Scholar 

  2. 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

    Google Scholar 

  3. Levin, L.: Average Case Complete Problems. SIAM Journal on Computing (1986) 285–286

    Google Scholar 

  4. Venkatesan, R., Levin, L.: Random Instances of a Graph Colouring Problem are Hard. In: ACM Symposium on Theory of Computing. (1988) 217–222

    Google Scholar 

  5. 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

    Google Scholar 

  6. 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

    Google Scholar 

  7. Markov, A.: Theory of algorithms. (1954)

    Google Scholar 

  8. Markov, A.: On the problem of representability of matrices. Z. Math. Logik Grundlagen Math (1958) 157–168

    Google Scholar 

  9. 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

    Article  MATH  MathSciNet  Google Scholar 

  10. Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. In: Proceedings IEEE Globecom’ 87. (1987) 99–102

    Google Scholar 

  11. Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In Goldwasser, S., ed.: Crypto’ 88, Berlin, Springer-Verlag (1989) 27–36LNCS Vol. 403.

    Google Scholar 

  12. Shamir, A.: How to share a secret? Communications of the ACM 22 (1979) 612–613

    Article  MATH  MathSciNet  Google Scholar 

  13. Blakely, G.R.: Safeguarding cryptographic keys. In: Proceeding of the National Computer Conference. Volume 48., AFIPS Conference Proceedings (1979) 313–317

    Google Scholar 

  14. 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.

    Google Scholar 

  15. Freivalds, R.: Fast probabilistic algorithms. In Becvár, J., ed.: Proc. LNCS Vol. 74., Olomouc, Czechoslovakia, Springer (1979) 57–69

    Google Scholar 

  16. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progresions. In: Proc. Nineteenth Annual ACM Symposium on Theory of Computing, New York (1987) 1–6

    Google Scholar 

  17. Karnin, G., Hellman: On secret sharing systems. IEEE Transactions on Information Theory IT-29 (1983) 35–41

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Statistics, Operations Research and Computing Universidad de La Laguna, 38271, La Laguna, Tenerife, Spain

    Candelaria Hernández-Goya, Pino Caballero-Gil & Carlos Bruno-Castañeda

Authors
  1. Candelaria Hernández-Goya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pino Caballero-Gil
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Carlos Bruno-Castañeda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Army High Performance Computing Research Center, USA University of Minessota Department of Computer Science and Engineering, MN, 55455, USA

    Vipin Kumar

  2. Department of Computer Science, University of Calgary, Calgary, AB, T2N1N4, Canada

    Marina L. Gavrilova

  3. Heuchera Technologies Inc., 122 9251-8Yonge Street, Richmond Hill, ON, Canada, L4C 9T3

    Chih Jeng Kenneth Tan

  4. School of Computer Science, The Queen’s University of Belfast, Belfast, BT7 1NN, Northern Ireland UK

    Chih Jeng Kenneth Tan

  5. Département d’informatique et de recherche opérationelle Montréal, Université de Montréal, Québec, H3C 3J7, Canada

    Pierre L’Ecuyer

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation